%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV175+1 : TPTP v8.1.0. Bugfixed 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 : n003.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 : Wed Jul 20 19:45:46 EDT 2022 % Result : Theorem 12.81s 2.14s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SWV175+1 : TPTP v8.1.0. Bugfixed 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.16/0.37 % Computer : n003.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 600 % 0.16/0.37 % DateTime : Wed Jun 15 11:39:26 EDT 2022 % 0.16/0.37 % CPUTime : % 12.81/2.14 % SZS status Theorem % 12.81/2.14 % SZS output begin IncompleteProof % 12.81/2.14 cnf(c0, axiom, % 12.81/2.14 init = a_select3(q_init,X0,X1) | ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,n135299) | ~leq(n0,X0)). % 12.81/2.14 cnf(c1, plain, % 12.81/2.14 init = a_select3(q_init,X0,X1) | ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,n135299) | ~leq(n0,X0), % 12.81/2.14 inference(start, [], [c0])). % 12.81/2.14 % 12.81/2.14 cnf(c2, axiom, % 12.81/2.14 init != a_select3(q_init,pv30,pv28)). % 12.81/2.14 cnf(a0, assumption, % 12.81/2.14 a_select3(q_init,pv30,pv28) = a_select3(q_init,X0,X1)). % 12.81/2.14 cnf(a1, assumption, % 12.81/2.14 init = X2). % 12.81/2.14 cnf(c3, plain, % 12.81/2.14 ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,n135299) | ~leq(n0,X0), % 12.81/2.14 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 12.81/2.14 cnf(c4, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 12.81/2.14 cnf(c5, plain, % 12.81/2.14 init != X2, % 12.81/2.14 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 12.81/2.14 % 12.81/2.14 cnf(a2, assumption, % 12.81/2.14 init = X2). % 12.81/2.14 cnf(c6, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(reflexivity, [assumptions([a2])], [c5])). % 12.81/2.14 % 12.81/2.14 cnf(c7, axiom, % 12.81/2.14 leq(pv28,n4)). % 12.81/2.14 cnf(a3, assumption, % 12.81/2.14 X1 = pv28). % 12.81/2.14 cnf(a4, assumption, % 12.81/2.14 n4 = n4). % 12.81/2.14 cnf(c8, plain, % 12.81/2.14 ~leq(n0,X1) | ~leq(X0,n135299) | ~leq(n0,X0), % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c7])). % 12.81/2.14 cnf(c9, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c7])). % 12.81/2.14 % 12.81/2.14 cnf(c10, axiom, % 12.81/2.14 leq(n0,pv28)). % 12.81/2.14 cnf(a5, assumption, % 12.81/2.14 n0 = n0). % 12.81/2.14 cnf(a6, assumption, % 12.81/2.14 X1 = pv28). % 12.81/2.14 cnf(c11, plain, % 12.81/2.14 ~leq(X0,n135299) | ~leq(n0,X0), % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c10])). % 12.81/2.14 cnf(c12, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c10])). % 12.81/2.14 % 12.81/2.14 cnf(c13, axiom, % 12.81/2.14 leq(pv30,n135299)). % 12.81/2.14 cnf(a7, assumption, % 12.81/2.14 X0 = pv30). % 12.81/2.14 cnf(a8, assumption, % 12.81/2.14 n135299 = n135299). % 12.81/2.14 cnf(c14, plain, % 12.81/2.14 ~leq(n0,X0), % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 12.81/2.14 cnf(c15, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 12.81/2.14 % 12.81/2.14 cnf(c16, axiom, % 12.81/2.14 leq(n0,pv30)). % 12.81/2.14 cnf(a9, assumption, % 12.81/2.14 n0 = n0). % 12.81/2.14 cnf(a10, assumption, % 12.81/2.14 X0 = pv30). % 12.81/2.14 cnf(c17, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c16])). % 12.81/2.14 cnf(c18, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c16])). % 12.81/2.14 % 12.81/2.14 cnf(c19, plain, % 12.81/2.14 $false, % 12.81/2.14 inference(constraint_solving, [ % 12.81/2.14 bind(X0, pv30), % 12.81/2.14 bind(X1, pv28), % 12.81/2.14 bind(X2, init) % 12.81/2.14 ], % 12.81/2.14 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 12.81/2.14 % 12.81/2.14 % SZS output end IncompleteProof %------------------------------------------------------------------------------