%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV174+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 : n009.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 58.39s 7.89s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWV174+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n009.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 15 13:13:23 EDT 2022 % 0.13/0.34 % CPUTime : % 58.39/7.89 % SZS status Theorem % 58.39/7.89 % SZS output begin IncompleteProof % 58.39/7.89 cnf(c0, axiom, % 58.39/7.89 leq(n0,sK42)). % 58.39/7.89 cnf(c1, plain, % 58.39/7.89 leq(n0,sK42), % 58.39/7.89 inference(start, [], [c0])). % 58.39/7.89 % 58.39/7.89 cnf(c2, axiom, % 58.39/7.89 init = a_select3(q_init,X0,X1) | ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,minus(pv10,n1)) | ~leq(n0,X0)). % 58.39/7.89 cnf(a0, assumption, % 58.39/7.89 n0 = n0). % 58.39/7.89 cnf(a1, assumption, % 58.39/7.89 sK42 = X1). % 58.39/7.89 cnf(c3, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 58.39/7.89 cnf(c4, plain, % 58.39/7.89 init = a_select3(q_init,X0,X1) | ~leq(X1,n4) | ~leq(X0,minus(pv10,n1)) | ~leq(n0,X0), % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 58.39/7.89 % 58.39/7.89 cnf(c5, axiom, % 58.39/7.89 init != a_select3(q_init,sK41,sK42)). % 58.39/7.89 cnf(a2, assumption, % 58.39/7.89 a_select3(q_init,sK41,sK42) = a_select3(q_init,X0,X1)). % 58.39/7.89 cnf(a3, assumption, % 58.39/7.89 init = X2). % 58.39/7.89 cnf(c6, plain, % 58.39/7.89 ~leq(X1,n4) | ~leq(X0,minus(pv10,n1)) | ~leq(n0,X0), % 58.39/7.89 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 58.39/7.89 cnf(c7, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 58.39/7.89 cnf(c8, plain, % 58.39/7.89 init != X2, % 58.39/7.89 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 58.39/7.89 % 58.39/7.89 cnf(a4, assumption, % 58.39/7.89 init = X2). % 58.39/7.89 cnf(c9, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(reflexivity, [assumptions([a4])], [c8])). % 58.39/7.89 % 58.39/7.89 cnf(c10, axiom, % 58.39/7.89 leq(sK42,n4)). % 58.39/7.89 cnf(a5, assumption, % 58.39/7.89 X1 = sK42). % 58.39/7.89 cnf(a6, assumption, % 58.39/7.89 n4 = n4). % 58.39/7.89 cnf(c11, plain, % 58.39/7.89 ~leq(X0,minus(pv10,n1)) | ~leq(n0,X0), % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])). % 58.39/7.89 cnf(c12, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])). % 58.39/7.89 % 58.39/7.89 cnf(c13, axiom, % 58.39/7.89 leq(X3,minus(X4,n1)) | ~gt(X4,X3)). % 58.39/7.89 cnf(a7, assumption, % 58.39/7.89 X0 = X3). % 58.39/7.89 cnf(a8, assumption, % 58.39/7.89 minus(pv10,n1) = minus(X4,n1)). % 58.39/7.89 cnf(c14, plain, % 58.39/7.89 ~leq(n0,X0), % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 58.39/7.89 cnf(c15, plain, % 58.39/7.89 ~gt(X4,X3), % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 58.39/7.89 % 58.39/7.89 cnf(c16, axiom, % 58.39/7.89 gt(pv10,sK41)). % 58.39/7.89 cnf(a9, assumption, % 58.39/7.89 X4 = pv10). % 58.39/7.89 cnf(a10, assumption, % 58.39/7.89 X3 = sK41). % 58.39/7.89 cnf(c17, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])). % 58.39/7.89 cnf(c18, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])). % 58.39/7.89 % 58.39/7.89 cnf(c19, axiom, % 58.39/7.89 leq(n0,sK41)). % 58.39/7.89 cnf(a11, assumption, % 58.39/7.89 n0 = n0). % 58.39/7.89 cnf(a12, assumption, % 58.39/7.89 X0 = sK41). % 58.39/7.89 cnf(c20, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a11, a12])], [c14, c19])). % 58.39/7.89 cnf(c21, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(strict_predicate_extension, [assumptions([a11, a12])], [c14, c19])). % 58.39/7.89 % 58.39/7.89 cnf(c22, plain, % 58.39/7.89 $false, % 58.39/7.89 inference(constraint_solving, [ % 58.39/7.89 bind(X0, sK41), % 58.39/7.89 bind(X1, sK42), % 58.39/7.89 bind(X2, init), % 58.39/7.89 bind(X3, sK41), % 58.39/7.89 bind(X4, pv10) % 58.39/7.89 ], % 58.39/7.89 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 58.39/7.89 % 58.39/7.89 % SZS output end IncompleteProof %------------------------------------------------------------------------------