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