%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU151+3 : 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 : n014.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 : Tue Jul 19 11:53:32 EDT 2022 % Result : Theorem 4.74s 0.97s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n014.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 19 22:24:03 EDT 2022 % 0.13/0.34 % CPUTime : % 4.74/0.97 % SZS status Theorem % 4.74/0.97 % SZS output begin IncompleteProof % 4.74/0.97 cnf(c0, axiom, % 4.74/0.97 unordered_pair(sK5,sK6) = unordered_pair(sK7,sK8)). % 4.74/0.97 cnf(c1, plain, % 4.74/0.97 unordered_pair(sK5,sK6) = unordered_pair(sK7,sK8), % 4.74/0.97 inference(start, [], [c0])). % 4.74/0.97 % 4.74/0.97 cnf(c2, axiom, % 4.74/0.97 sP1(X0,X1,unordered_pair(X0,X1))). % 4.74/0.97 cnf(a0, assumption, % 4.74/0.97 unordered_pair(X0,X1) = unordered_pair(sK7,sK8)). % 4.74/0.97 cnf(a1, assumption, % 4.74/0.97 unordered_pair(sK5,sK6) = X2). % 4.74/0.97 cnf(c3, plain, % 4.74/0.97 $false, % 4.74/0.97 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 4.74/0.97 cnf(c4, plain, % 4.74/0.97 $false, % 4.74/0.97 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 4.74/0.97 cnf(c5, plain, % 4.74/0.97 sP1(X0,X1,X2), % 4.74/0.97 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 4.74/0.97 % 4.74/0.97 cnf(c6, axiom, % 4.74/0.97 sP0(X3,X4,X5) | ~in(X3,X6) | ~sP1(X5,X4,X6)). % 4.74/0.97 cnf(a2, assumption, % 4.74/0.97 X0 = X5). % 4.74/0.97 cnf(a3, assumption, % 4.74/0.97 X1 = X4). % 4.74/0.97 cnf(a4, assumption, % 4.74/0.97 X2 = X6). % 4.74/0.97 cnf(c7, plain, % 4.74/0.97 $false, % 4.74/0.97 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])). % 4.74/0.97 cnf(c8, plain, % 4.74/0.97 sP0(X3,X4,X5) | ~in(X3,X6), % 4.74/0.97 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])). % 4.74/0.98 % 4.74/0.98 cnf(c9, axiom, % 4.74/0.98 X7 = X8 | X7 = X9 | ~sP0(X7,X8,X9)). % 4.74/0.98 cnf(a5, assumption, % 4.74/0.98 X3 = X7). % 4.74/0.98 cnf(a6, assumption, % 4.74/0.98 X4 = X8). % 4.74/0.98 cnf(a7, assumption, % 4.74/0.98 X5 = X9). % 4.74/0.98 cnf(c10, plain, % 4.74/0.98 ~in(X3,X6), % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c8, c9])). % 4.74/0.98 cnf(c11, plain, % 4.74/0.98 X7 = X8 | X7 = X9, % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c8, c9])). % 4.74/0.98 % 4.74/0.98 cnf(c12, axiom, % 4.74/0.98 sK5 != sK8). % 4.74/0.98 cnf(a8, assumption, % 4.74/0.98 sK8 = X8). % 4.74/0.98 cnf(c13, plain, % 4.74/0.98 X7 = X9, % 4.74/0.98 inference(strict_subterm_extension, [assumptions([a8])], [c11, c12])). % 4.74/0.98 cnf(c14, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_subterm_extension, [assumptions([a8])], [c11, c12])). % 4.74/0.98 cnf(c15, plain, % 4.74/0.98 sK5 != X7, % 4.74/0.98 inference(strict_subterm_extension, [assumptions([a8])], [c11, c12])). % 4.74/0.98 % 4.74/0.98 cnf(a9, assumption, % 4.74/0.98 sK5 = X7). % 4.74/0.98 cnf(c16, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(reflexivity, [assumptions([a9])], [c15])). % 4.74/0.98 % 4.74/0.98 cnf(c17, axiom, % 4.74/0.98 sK5 != sK7). % 4.74/0.98 cnf(a10, assumption, % 4.74/0.98 sK7 = X9). % 4.74/0.98 cnf(c18, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_subterm_extension, [assumptions([a10])], [c13, c17])). % 4.74/0.98 cnf(c19, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_subterm_extension, [assumptions([a10])], [c13, c17])). % 4.74/0.98 cnf(c20, plain, % 4.74/0.98 sK5 != X7, % 4.74/0.98 inference(strict_subterm_extension, [assumptions([a10])], [c13, c17])). % 4.74/0.98 % 4.74/0.98 cnf(a11, assumption, % 4.74/0.98 sK5 = X7). % 4.74/0.98 cnf(c21, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(reflexivity, [assumptions([a11])], [c20])). % 4.74/0.98 % 4.74/0.98 cnf(c22, axiom, % 4.74/0.98 in(X10,X11) | ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11)). % 4.74/0.98 cnf(a12, assumption, % 4.74/0.98 X3 = X10). % 4.74/0.98 cnf(a13, assumption, % 4.74/0.98 X6 = X11). % 4.74/0.98 cnf(c23, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a12, a13])], [c10, c22])). % 4.74/0.98 cnf(c24, plain, % 4.74/0.98 ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11), % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a12, a13])], [c10, c22])). % 4.74/0.98 % 4.74/0.98 cnf(c25, axiom, % 4.74/0.98 sP0(X14,X15,X14)). % 4.74/0.98 cnf(a14, assumption, % 4.74/0.98 X10 = X14). % 4.74/0.98 cnf(a15, assumption, % 4.74/0.98 X12 = X15). % 4.74/0.98 cnf(a16, assumption, % 4.74/0.98 X13 = X14). % 4.74/0.98 cnf(c26, plain, % 4.74/0.98 ~sP1(X13,X12,X11), % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c24, c25])). % 4.74/0.98 cnf(c27, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c24, c25])). % 4.74/0.98 % 4.74/0.98 cnf(c28, axiom, % 4.74/0.98 sP1(X16,X17,unordered_pair(X16,X17))). % 4.74/0.98 cnf(a17, assumption, % 4.74/0.98 X13 = X16). % 4.74/0.98 cnf(a18, assumption, % 4.74/0.98 X12 = X17). % 4.74/0.98 cnf(a19, assumption, % 4.74/0.98 X11 = unordered_pair(X16,X17)). % 4.74/0.98 cnf(c29, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c26, c28])). % 4.74/0.98 cnf(c30, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c26, c28])). % 4.74/0.98 % 4.74/0.98 cnf(c31, plain, % 4.74/0.98 $false, % 4.74/0.98 inference(constraint_solving, [ % 4.74/0.98 bind(X0, sK7), % 4.74/0.98 bind(X1, sK8), % 4.74/0.98 bind(X2, unordered_pair(sK5,sK6)), % 4.74/0.98 bind(X3, sK5), % 4.74/0.98 bind(X4, sK8), % 4.74/0.98 bind(X5, sK7), % 4.74/0.98 bind(X6, unordered_pair(sK5,sK6)), % 4.74/0.98 bind(X7, sK5), % 4.74/0.98 bind(X8, sK8), % 4.74/0.98 bind(X9, sK7), % 4.74/0.98 bind(X10, sK5), % 4.74/0.98 bind(X11, unordered_pair(sK5,sK6)), % 4.74/0.98 bind(X12, sK6), % 4.74/0.98 bind(X13, sK5), % 4.74/0.98 bind(X14, sK5), % 4.74/0.98 bind(X15, sK6), % 4.74/0.98 bind(X16, sK5), % 4.74/0.98 bind(X17, sK6) % 4.74/0.98 ], % 4.74/0.98 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 4.74/0.98 % 4.74/0.98 % SZS output end IncompleteProof %------------------------------------------------------------------------------