%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU149+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 : 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 : Tue Jul 19 11:53:31 EDT 2022 % Result : Theorem 0.11s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU149+3 : 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.33 % Computer : n012.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Mon Jun 20 07:06:07 EDT 2022 % 0.11/0.33 % CPUTime : % 0.11/0.36 % SZS status Theorem % 0.11/0.36 % SZS output begin IncompleteProof % 0.11/0.36 cnf(c0, axiom, % 0.11/0.36 singleton(sK7) = unordered_pair(sK8,sK9)). % 0.11/0.36 cnf(c1, plain, % 0.11/0.36 singleton(sK7) = unordered_pair(sK8,sK9), % 0.11/0.36 inference(start, [], [c0])). % 0.11/0.36 % 0.11/0.36 cnf(c2, axiom, % 0.11/0.36 sP2(X0,X1,unordered_pair(X0,X1))). % 0.11/0.36 cnf(a0, assumption, % 0.11/0.36 unordered_pair(X0,X1) = unordered_pair(sK8,sK9)). % 0.11/0.36 cnf(a1, assumption, % 0.11/0.36 singleton(sK7) = X2). % 0.11/0.36 cnf(c3, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.11/0.36 cnf(c4, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.11/0.36 cnf(c5, plain, % 0.11/0.36 sP2(X0,X1,X2), % 0.11/0.36 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.11/0.36 % 0.11/0.36 cnf(c6, axiom, % 0.11/0.36 in(X3,X4) | ~sP1(X3,X5,X6) | ~sP2(X6,X5,X4)). % 0.11/0.36 cnf(a2, assumption, % 0.11/0.36 X0 = X6). % 0.11/0.36 cnf(a3, assumption, % 0.11/0.36 X1 = X5). % 0.11/0.36 cnf(a4, assumption, % 0.11/0.36 X2 = X4). % 0.11/0.36 cnf(c7, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])). % 0.11/0.36 cnf(c8, plain, % 0.11/0.36 in(X3,X4) | ~sP1(X3,X5,X6), % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])). % 0.11/0.36 % 0.11/0.36 cnf(c9, axiom, % 0.11/0.36 X7 = X8 | ~in(X8,X9) | ~sP0(X7,X9)). % 0.11/0.36 cnf(a5, assumption, % 0.11/0.36 X3 = X8). % 0.11/0.36 cnf(a6, assumption, % 0.11/0.36 X4 = X9). % 0.11/0.36 cnf(c10, plain, % 0.11/0.36 ~sP1(X3,X5,X6), % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])). % 0.11/0.36 cnf(c11, plain, % 0.11/0.36 X7 = X8 | ~sP0(X7,X9), % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])). % 0.11/0.36 % 0.11/0.36 cnf(c12, axiom, % 0.11/0.36 sK7 != sK8). % 0.11/0.36 cnf(a7, assumption, % 0.11/0.36 sK8 = X8). % 0.11/0.36 cnf(c13, plain, % 0.11/0.36 ~sP0(X7,X9), % 0.11/0.36 inference(strict_subterm_extension, [assumptions([a7])], [c11, c12])). % 0.11/0.36 cnf(c14, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_subterm_extension, [assumptions([a7])], [c11, c12])). % 0.11/0.36 cnf(c15, plain, % 0.11/0.36 sK7 != X7, % 0.11/0.36 inference(strict_subterm_extension, [assumptions([a7])], [c11, c12])). % 0.11/0.36 % 0.11/0.36 cnf(a8, assumption, % 0.11/0.36 sK7 = X7). % 0.11/0.36 cnf(c16, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(reflexivity, [assumptions([a8])], [c15])). % 0.11/0.36 % 0.11/0.36 cnf(c17, axiom, % 0.11/0.36 sP0(X10,singleton(X10))). % 0.11/0.36 cnf(a9, assumption, % 0.11/0.36 X7 = X10). % 0.11/0.36 cnf(a10, assumption, % 0.11/0.36 X9 = singleton(X10)). % 0.11/0.36 cnf(c18, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c17])). % 0.11/0.36 cnf(c19, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c17])). % 0.11/0.36 % 0.11/0.36 cnf(c20, axiom, % 0.11/0.36 sP1(X11,X12,X11)). % 0.11/0.36 cnf(a11, assumption, % 0.11/0.36 X3 = X11). % 0.11/0.36 cnf(a12, assumption, % 0.11/0.36 X5 = X12). % 0.11/0.36 cnf(a13, assumption, % 0.11/0.36 X6 = X11). % 0.11/0.36 cnf(c21, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c10, c20])). % 0.11/0.36 cnf(c22, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c10, c20])). % 0.11/0.36 % 0.11/0.36 cnf(c23, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(constraint_solving, [ % 0.11/0.36 bind(X0, sK8), % 0.11/0.36 bind(X1, sK9), % 0.11/0.36 bind(X2, singleton(sK7)), % 0.11/0.36 bind(X3, sK8), % 0.11/0.36 bind(X4, singleton(sK7)), % 0.11/0.36 bind(X5, sK9), % 0.11/0.36 bind(X6, sK8), % 0.11/0.36 bind(X7, sK7), % 0.11/0.36 bind(X8, sK8), % 0.11/0.36 bind(X9, singleton(sK7)), % 0.11/0.36 bind(X10, sK7), % 0.11/0.36 bind(X11, sK8), % 0.11/0.36 bind(X12, sK9) % 0.11/0.36 ], % 0.11/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.11/0.36 % 0.11/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------