MinimalCutSetFn |
appearance as argument number 1 |
No TPTP formula. May not be expressible in strict first order. | chinese_format.kif 2380-2381 | |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6083-6085 | |
No TPTP formula. May not be expressible in strict first order. | japanese_format.kif 1059-1060 | |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6079-6079 | The number 1 argument of minimal cut set is an instance of graph |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6078-6078 | Minimal cut set is an instance of unary function |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6080-6080 | The values returned by minimal cut set are subclasses of graph path |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6081-6081 | Minimal cut set is internally related to cut set |
appearance as argument number 2 |
No TPTP formula. May not be expressible in strict first order. | chinese_format.kif 779-779 | |
No TPTP formula. May not be expressible in strict first order. | english_format.kif 779-779 | |
No TPTP formula. May not be expressible in strict first order. | french_format.kif 469-469 | |
No TPTP formula. May not be expressible in strict first order. | relations-it.txt 189-189 | |
No TPTP formula. May not be expressible in strict first order. | japanese_format.kif 2173-2173 | |
No TPTP formula. May not be expressible in strict first order. | portuguese_format.kif 421-421 | |
No TPTP formula. May not be expressible in strict first order. | relations-de.txt 1009-1009 | |
No TPTP formula. May not be expressible in strict first order. | relations-hindi.txt 227-227 | |
No TPTP formula. May not be expressible in strict first order. | relations-ro.kif 491-491 | |
No TPTP formula. May not be expressible in strict first order. | relations-sv.txt 539-539 | |
No TPTP formula. May not be expressible in strict first order. | chinese_format.kif 780-780 | |
No TPTP formula. May not be expressible in strict first order. | domainEnglishFormat.kif 37865-37865 | |
No TPTP formula. May not be expressible in strict first order. | domainEnglishFormat.kif 37864-37864 | |
No TPTP formula. May not be expressible in strict first order. | domainEnglishFormat.kif 37863-37863 |
antecedent |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6091-6097 |
|
consequent |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6087-6089 |
statement |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6099-6106 | There don't exist a graph path and another graph path such that the graph path is an instance of the set of paths that partition a graph into two separate graphs and the other graph path is an instance of the set of minimal paths that partition the graph into two separate graphs and the length of the graph path is a positive integer and the length of the other graph path is another positive integer and the positive integer is less than the other positive integer |