%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU154+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 : n016.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:34 EDT 2022 % Result : Theorem 5.93s 1.19s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SEU154+2 : TPTP v8.1.0. Released v3.3.0. % 0.08/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.37 % Computer : n016.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 600 % 0.15/0.37 % DateTime : Mon Jun 20 03:49:24 EDT 2022 % 0.15/0.37 % CPUTime : % 5.93/1.19 % SZS status Theorem % 5.93/1.19 % SZS output begin IncompleteProof % 5.93/1.19 cnf(c0, axiom, % 5.93/1.19 ~disjoint(unordered_pair(sK18,sK18),sK19)). % 5.93/1.19 cnf(c1, plain, % 5.93/1.19 ~disjoint(unordered_pair(sK18,sK18),sK19), % 5.93/1.19 inference(start, [], [c0])). % 5.93/1.19 % 5.93/1.19 cnf(c2, axiom, % 5.93/1.19 in(sK23(X0,X1),X0) | disjoint(X0,X1)). % 5.93/1.19 cnf(a0, assumption, % 5.93/1.19 unordered_pair(sK18,sK18) = X0). % 5.93/1.19 cnf(a1, assumption, % 5.93/1.19 sK19 = X1). % 5.93/1.19 cnf(c3, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.93/1.19 cnf(c4, plain, % 5.93/1.19 in(sK23(X0,X1),X0), % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.93/1.19 % 5.93/1.19 cnf(c5, axiom, % 5.93/1.19 X2 = X3 | ~in(X3,X4) | ~sP0(X2,X4)). % 5.93/1.19 cnf(a2, assumption, % 5.93/1.19 sK23(X0,X1) = X3). % 5.93/1.19 cnf(a3, assumption, % 5.93/1.19 X0 = X4). % 5.93/1.19 cnf(c6, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 5.93/1.19 cnf(c7, plain, % 5.93/1.19 X2 = X3 | ~sP0(X2,X4), % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 5.93/1.19 % 5.93/1.19 cnf(c8, axiom, % 5.93/1.19 in(sK23(X5,X6),X6) | disjoint(X5,X6)). % 5.93/1.19 cnf(a4, assumption, % 5.93/1.19 sK23(X5,X6) = X3). % 5.93/1.19 cnf(c9, plain, % 5.93/1.19 ~sP0(X2,X4), % 5.93/1.19 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])). % 5.93/1.19 cnf(c10, plain, % 5.93/1.19 disjoint(X5,X6), % 5.93/1.19 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])). % 5.93/1.19 cnf(c11, plain, % 5.93/1.19 in(X2,X6), % 5.93/1.19 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])). % 5.93/1.19 % 5.93/1.19 cnf(c12, axiom, % 5.93/1.19 ~in(sK18,sK19)). % 5.93/1.19 cnf(a5, assumption, % 5.93/1.19 X2 = sK18). % 5.93/1.19 cnf(a6, assumption, % 5.93/1.19 X6 = sK19). % 5.93/1.19 cnf(c13, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])). % 5.93/1.19 cnf(c14, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])). % 5.93/1.19 % 5.93/1.19 cnf(c15, plain, % 5.93/1.19 ~disjoint(unordered_pair(sK18,sK18),sK19)). % 5.93/1.19 cnf(a7, assumption, % 5.93/1.19 X5 = unordered_pair(sK18,sK18)). % 5.93/1.19 cnf(a8, assumption, % 5.93/1.19 X6 = sK19). % 5.93/1.19 cnf(c16, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(predicate_reduction, [assumptions([a7, a8])], [c10, c15])). % 5.93/1.19 % 5.93/1.19 cnf(c17, axiom, % 5.93/1.19 sP0(X7,unordered_pair(X7,X7))). % 5.93/1.19 cnf(a9, assumption, % 5.93/1.19 X2 = X7). % 5.93/1.19 cnf(a10, assumption, % 5.93/1.19 X4 = unordered_pair(X7,X7)). % 5.93/1.19 cnf(c18, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a9, a10])], [c9, c17])). % 5.93/1.19 cnf(c19, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(strict_predicate_extension, [assumptions([a9, a10])], [c9, c17])). % 5.93/1.19 % 5.93/1.19 cnf(c20, plain, % 5.93/1.19 $false, % 5.93/1.19 inference(constraint_solving, [ % 5.93/1.19 bind(X0, unordered_pair(sK18,sK18)), % 5.93/1.19 bind(X1, sK19), % 5.93/1.19 bind(X2, sK18), % 5.93/1.19 bind(X3, sK23(X0,X1)), % 5.93/1.19 bind(X4, unordered_pair(sK18,sK18)), % 5.93/1.19 bind(X5, unordered_pair(sK18,sK18)), % 5.93/1.19 bind(X6, sK19), % 5.93/1.19 bind(X7, sK18) % 5.93/1.19 ], % 5.93/1.19 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 5.93/1.19 % 5.93/1.19 % SZS output end IncompleteProof %------------------------------------------------------------------------------