%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n012.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Mon Jul 18 11:32:35 EDT 2022 % Result : Theorem 0.18s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.32 % Computer : n012.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Wed Jul 6 00:22:45 EDT 2022 % 0.11/0.32 % CPUTime : % 0.18/0.43 % SZS status Theorem % 0.18/0.43 % SZS output begin IncompleteProof % 0.18/0.43 cnf(c0, axiom, % 0.18/0.43 ordinal(sK13)). % 0.18/0.43 cnf(c1, plain, % 0.18/0.43 ordinal(sK13), % 0.18/0.43 inference(start, [], [c0])). % 0.18/0.43 % 0.18/0.43 cnf(c2, axiom, % 0.18/0.43 ordinal_subset(X0,X1) | ordinal_subset(X1,X0) | ~ordinal(X0) | ~ordinal(X1)). % 0.18/0.43 cnf(a0, assumption, % 0.18/0.43 sK13 = X0). % 0.18/0.43 cnf(c3, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.18/0.43 cnf(c4, plain, % 0.18/0.43 ordinal_subset(X0,X1) | ordinal_subset(X1,X0) | ~ordinal(X1), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.18/0.43 % 0.18/0.43 cnf(c5, axiom, % 0.18/0.43 subset(X2,X3) | ~ordinal_subset(X2,X3) | ~ordinal(X3) | ~ordinal(X2)). % 0.18/0.43 cnf(a1, assumption, % 0.18/0.43 X0 = X2). % 0.18/0.43 cnf(a2, assumption, % 0.18/0.43 X1 = X3). % 0.18/0.43 cnf(c6, plain, % 0.18/0.43 ordinal_subset(X1,X0) | ~ordinal(X1), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.18/0.43 cnf(c7, plain, % 0.18/0.43 subset(X2,X3) | ~ordinal(X3) | ~ordinal(X2), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.18/0.43 % 0.18/0.43 cnf(c8, axiom, % 0.18/0.43 inclusion_comparable(X4,X5) | ~subset(X4,X5)). % 0.18/0.43 cnf(a3, assumption, % 0.18/0.43 X2 = X4). % 0.18/0.43 cnf(a4, assumption, % 0.18/0.43 X3 = X5). % 0.18/0.43 cnf(c9, plain, % 0.18/0.43 ~ordinal(X3) | ~ordinal(X2), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.18/0.43 cnf(c10, plain, % 0.18/0.43 inclusion_comparable(X4,X5), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.18/0.43 % 0.18/0.43 cnf(c11, axiom, % 0.18/0.43 ~inclusion_comparable(sK13,sK14)). % 0.18/0.43 cnf(a5, assumption, % 0.18/0.43 X4 = sK13). % 0.18/0.43 cnf(a6, assumption, % 0.18/0.43 X5 = sK14). % 0.18/0.43 cnf(c12, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.18/0.43 cnf(c13, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.18/0.43 % 0.18/0.43 cnf(c14, axiom, % 0.18/0.43 ordinal(sK14)). % 0.18/0.43 cnf(a7, assumption, % 0.18/0.43 X3 = sK14). % 0.18/0.43 cnf(c15, plain, % 0.18/0.43 ~ordinal(X2), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a7])], [c9, c14])). % 0.18/0.43 cnf(c16, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a7])], [c9, c14])). % 0.18/0.43 % 0.18/0.43 cnf(c17, plain, % 0.18/0.43 ordinal(sK13)). % 0.18/0.43 cnf(a8, assumption, % 0.18/0.43 X2 = sK13). % 0.18/0.43 cnf(c18, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(predicate_reduction, [assumptions([a8])], [c15, c17])). % 0.18/0.43 % 0.18/0.43 cnf(c19, axiom, % 0.18/0.43 subset(X6,X7) | ~ordinal_subset(X6,X7) | ~ordinal(X7) | ~ordinal(X6)). % 0.18/0.43 cnf(a9, assumption, % 0.18/0.43 X1 = X6). % 0.18/0.43 cnf(a10, assumption, % 0.18/0.43 X0 = X7). % 0.18/0.43 cnf(c20, plain, % 0.18/0.43 ~ordinal(X1), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c19])). % 0.18/0.43 cnf(c21, plain, % 0.18/0.43 subset(X6,X7) | ~ordinal(X7) | ~ordinal(X6), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c19])). % 0.18/0.43 % 0.18/0.43 cnf(c22, axiom, % 0.18/0.43 inclusion_comparable(X8,X9) | ~subset(X9,X8)). % 0.18/0.43 cnf(a11, assumption, % 0.18/0.43 X6 = X9). % 0.18/0.43 cnf(a12, assumption, % 0.18/0.43 X7 = X8). % 0.18/0.43 cnf(c23, plain, % 0.18/0.43 ~ordinal(X7) | ~ordinal(X6), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a11, a12])], [c21, c22])). % 0.18/0.43 cnf(c24, plain, % 0.18/0.43 inclusion_comparable(X8,X9), % 0.18/0.43 inference(strict_predicate_extension, [assumptions([a11, a12])], [c21, c22])). % 0.18/0.43 % 0.18/0.43 cnf(c25, plain, % 0.18/0.43 ~inclusion_comparable(X4,X5)). % 0.18/0.43 cnf(a13, assumption, % 0.18/0.43 X8 = X4). % 0.18/0.43 cnf(a14, assumption, % 0.18/0.43 X9 = X5). % 0.18/0.43 cnf(c26, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(predicate_reduction, [assumptions([a13, a14])], [c24, c25])). % 0.18/0.43 % 0.18/0.43 cnf(c27, plain, % 0.18/0.43 ordinal(sK13)). % 0.18/0.43 cnf(a15, assumption, % 0.18/0.43 X7 = sK13). % 0.18/0.43 cnf(c28, plain, % 0.18/0.43 ~ordinal(X6), % 0.18/0.43 inference(predicate_reduction, [assumptions([a15])], [c23, c27])). % 0.18/0.43 % 0.18/0.43 cnf(c29, plain, % 0.18/0.43 ordinal(X3)). % 0.18/0.43 cnf(a16, assumption, % 0.18/0.43 X6 = X3). % 0.18/0.43 cnf(c30, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(predicate_reduction, [assumptions([a16])], [c28, c29])). % 0.18/0.43 % 0.18/0.43 cnf(c31, plain, % 0.18/0.43 ordinal(X3)). % 0.18/0.43 cnf(a17, assumption, % 0.18/0.43 X1 = X3). % 0.18/0.43 cnf(c32, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(predicate_reduction, [assumptions([a17])], [c20, c31])). % 0.18/0.43 % 0.18/0.43 cnf(c33, plain, % 0.18/0.43 $false, % 0.18/0.43 inference(constraint_solving, [ % 0.18/0.43 bind(X0, sK13), % 0.18/0.43 bind(X1, sK14), % 0.18/0.43 bind(X2, sK13), % 0.18/0.43 bind(X3, sK14), % 0.18/0.43 bind(X4, sK13), % 0.18/0.43 bind(X5, sK14), % 0.18/0.43 bind(X6, sK14), % 0.18/0.43 bind(X7, sK13), % 0.18/0.43 bind(X8, sK13), % 0.18/0.43 bind(X9, sK14) % 0.18/0.43 ], % 0.18/0.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.18/0.43 % 0.18/0.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------