%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV159+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:43 EDT 2022 % Result : Theorem 2.16s 0.66s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SWV159+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.35 % Computer : n003.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 16 04:05:41 EDT 2022 % 0.13/0.35 % CPUTime : % 2.16/0.66 % SZS status Theorem % 2.16/0.66 % SZS output begin IncompleteProof % 2.16/0.66 cnf(c0, axiom, % 2.16/0.66 leq(sK41,minus(pv10,n1))). % 2.16/0.66 cnf(c1, plain, % 2.16/0.66 leq(sK41,minus(pv10,n1)), % 2.16/0.66 inference(start, [], [c0])). % 2.16/0.66 % 2.16/0.66 cnf(c2, axiom, % 2.16/0.66 n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) | ~leq(X0,minus(pv10,n1)) | ~leq(n0,X0)). % 2.16/0.66 cnf(a0, assumption, % 2.16/0.66 sK41 = X0). % 2.16/0.66 cnf(a1, assumption, % 2.16/0.66 minus(pv10,n1) = minus(pv10,n1)). % 2.16/0.66 cnf(c3, plain, % 2.16/0.66 $false, % 2.16/0.66 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.16/0.66 cnf(c4, plain, % 2.16/0.66 n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) | ~leq(n0,X0), % 2.16/0.66 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.16/0.66 % 2.16/0.66 cnf(c5, axiom, % 2.16/0.66 n1 != sum(n0,n4,a_select3(q,sK41,tptp_sum_index))). % 2.16/0.66 cnf(a2, assumption, % 2.16/0.66 sum(n0,n4,a_select3(q,sK41,tptp_sum_index)) = sum(n0,n4,a_select3(q,X0,tptp_sum_index))). % 2.16/0.66 cnf(a3, assumption, % 2.16/0.66 n1 = X1). % 2.16/0.66 cnf(c6, plain, % 2.16/0.66 ~leq(n0,X0), % 2.16/0.66 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 2.16/0.66 cnf(c7, plain, % 2.16/0.66 $false, % 2.16/0.66 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 2.16/0.66 cnf(c8, plain, % 2.16/0.66 n1 != X1, % 2.16/0.66 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 2.16/0.66 % 2.16/0.66 cnf(a4, assumption, % 2.16/0.66 n1 = X1). % 2.16/0.66 cnf(c9, plain, % 2.16/0.66 $false, % 2.16/0.66 inference(reflexivity, [assumptions([a4])], [c8])). % 2.16/0.66 % 2.16/0.66 cnf(c10, axiom, % 2.16/0.66 leq(n0,sK41)). % 2.16/0.66 cnf(a5, assumption, % 2.16/0.66 n0 = n0). % 2.16/0.66 cnf(a6, assumption, % 2.16/0.66 X0 = sK41). % 2.16/0.66 cnf(c11, plain, % 2.16/0.66 $false, % 2.16/0.66 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])). % 2.16/0.66 cnf(c12, plain, % 2.16/0.66 $false, % 2.16/0.66 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])). % 2.16/0.66 % 2.16/0.66 cnf(c13, plain, % 2.16/0.66 $false, % 2.16/0.66 inference(constraint_solving, [ % 2.16/0.66 bind(X0, sK41), % 2.16/0.66 bind(X1, n1) % 2.16/0.66 ], % 2.16/0.66 [a0, a1, a2, a3, a4, a5, a6])). % 2.16/0.66 % 2.16/0.66 % SZS output end IncompleteProof %------------------------------------------------------------------------------