%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU230+2 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n029.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:54:17 EDT 2022 % Result : Theorem 14.33s 2.23s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU230+2 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 20 12:04:30 EDT 2022 % 0.12/0.34 % CPUTime : % 14.33/2.23 % SZS status Theorem % 14.33/2.23 % SZS output begin IncompleteProof % 14.33/2.23 cnf(c0, axiom, % 14.33/2.23 ~in(sK153,set_union2(sK153,unordered_pair(sK153,sK153)))). % 14.33/2.23 cnf(c1, plain, % 14.33/2.23 ~in(sK153,set_union2(sK153,unordered_pair(sK153,sK153))), % 14.33/2.23 inference(start, [], [c0])). % 14.33/2.23 % 14.33/2.23 cnf(c2, axiom, % 14.33/2.23 in(X0,X1) | ~sP33(X2,X0,X3) | ~sP34(X3,X2,X1)). % 14.33/2.23 cnf(a0, assumption, % 14.33/2.23 sK153 = X0). % 14.33/2.23 cnf(a1, assumption, % 14.33/2.23 set_union2(sK153,unordered_pair(sK153,sK153)) = X1). % 14.33/2.23 cnf(c3, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 14.33/2.23 cnf(c4, plain, % 14.33/2.23 ~sP33(X2,X0,X3) | ~sP34(X3,X2,X1), % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 14.33/2.23 % 14.33/2.23 cnf(c5, axiom, % 14.33/2.23 sP33(X4,X5,X6) | ~in(X5,X4)). % 14.33/2.23 cnf(a2, assumption, % 14.33/2.23 X2 = X4). % 14.33/2.23 cnf(a3, assumption, % 14.33/2.23 X0 = X5). % 14.33/2.23 cnf(a4, assumption, % 14.33/2.23 X3 = X6). % 14.33/2.23 cnf(c6, plain, % 14.33/2.23 ~sP34(X3,X2,X1), % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 14.33/2.23 cnf(c7, plain, % 14.33/2.23 ~in(X5,X4), % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 14.33/2.23 % 14.33/2.23 cnf(c8, axiom, % 14.33/2.23 in(X7,X8) | ~sP27(X7,X8)). % 14.33/2.23 cnf(a5, assumption, % 14.33/2.23 X5 = X7). % 14.33/2.23 cnf(a6, assumption, % 14.33/2.23 X4 = X8). % 14.33/2.23 cnf(c9, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 14.33/2.23 cnf(c10, plain, % 14.33/2.23 ~sP27(X7,X8), % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 14.33/2.23 % 14.33/2.23 cnf(c11, axiom, % 14.33/2.23 sP27(X9,unordered_pair(X9,X9))). % 14.33/2.23 cnf(a7, assumption, % 14.33/2.23 X7 = X9). % 14.33/2.23 cnf(a8, assumption, % 14.33/2.23 X8 = unordered_pair(X9,X9)). % 14.33/2.23 cnf(c12, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 14.33/2.23 cnf(c13, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 14.33/2.23 % 14.33/2.23 cnf(c14, axiom, % 14.33/2.23 sP34(X10,X11,set_union2(X10,X11))). % 14.33/2.23 cnf(a9, assumption, % 14.33/2.23 X3 = X10). % 14.33/2.23 cnf(a10, assumption, % 14.33/2.23 X2 = X11). % 14.33/2.23 cnf(a11, assumption, % 14.33/2.23 X1 = set_union2(X10,X11)). % 14.33/2.23 cnf(c15, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c6, c14])). % 14.33/2.23 cnf(c16, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c6, c14])). % 14.33/2.23 % 14.33/2.23 cnf(c17, plain, % 14.33/2.23 $false, % 14.33/2.23 inference(constraint_solving, [ % 14.33/2.23 bind(X0, sK153), % 14.33/2.23 bind(X1, set_union2(sK153,unordered_pair(sK153,sK153))), % 14.33/2.23 bind(X2, unordered_pair(X9,X9)), % 14.33/2.23 bind(X3, sK153), % 14.33/2.23 bind(X4, unordered_pair(X9,X9)), % 14.33/2.23 bind(X5, sK153), % 14.33/2.23 bind(X6, sK153), % 14.33/2.23 bind(X7, sK153), % 14.33/2.23 bind(X8, unordered_pair(X9,X9)), % 14.33/2.23 bind(X9, sK153), % 14.33/2.23 bind(X10, sK153), % 14.33/2.23 bind(X11, unordered_pair(X9,X9)) % 14.33/2.23 ], % 14.33/2.23 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 14.33/2.23 % 14.33/2.23 % SZS output end IncompleteProof %------------------------------------------------------------------------------