%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV073+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 : n032.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:28 EDT 2022 % Result : Theorem 0.16s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.10 % Problem : SWV073+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.08/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 600 % 0.10/0.29 % DateTime : Wed Jun 15 23:11:29 EDT 2022 % 0.10/0.30 % CPUTime : % 0.16/0.34 % SZS status Theorem % 0.16/0.34 % SZS output begin IncompleteProof % 0.16/0.34 cnf(c0, axiom, % 0.16/0.34 leq(pv31,minus(n5,n1))). % 0.16/0.34 cnf(c1, plain, % 0.16/0.34 leq(pv31,minus(n5,n1)), % 0.16/0.34 inference(start, [], [c0])). % 0.16/0.34 % 0.16/0.34 cnf(c2, axiom, % 0.16/0.34 ~leq(pv35,minus(n135300,n1)) | ~leq(pv31,minus(n5,n1)) | ~leq(n0,pv35) | ~leq(n0,pv31)). % 0.16/0.34 cnf(a0, assumption, % 0.16/0.34 pv31 = pv31). % 0.16/0.34 cnf(a1, assumption, % 0.16/0.34 minus(n5,n1) = minus(n5,n1)). % 0.16/0.34 cnf(c3, plain, % 0.16/0.34 $false, % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.16/0.34 cnf(c4, plain, % 0.16/0.34 ~leq(pv35,minus(n135300,n1)) | ~leq(n0,pv35) | ~leq(n0,pv31), % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.16/0.34 % 0.16/0.34 cnf(c5, axiom, % 0.16/0.34 leq(pv35,minus(n135300,n1))). % 0.16/0.34 cnf(a2, assumption, % 0.16/0.34 pv35 = pv35). % 0.16/0.34 cnf(a3, assumption, % 0.16/0.34 minus(n135300,n1) = minus(n135300,n1)). % 0.16/0.34 cnf(c6, plain, % 0.16/0.34 ~leq(n0,pv35) | ~leq(n0,pv31), % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.16/0.34 cnf(c7, plain, % 0.16/0.34 $false, % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.16/0.34 % 0.16/0.34 cnf(c8, axiom, % 0.16/0.34 leq(n0,pv35)). % 0.16/0.34 cnf(a4, assumption, % 0.16/0.34 n0 = n0). % 0.16/0.34 cnf(a5, assumption, % 0.16/0.34 pv35 = pv35). % 0.16/0.34 cnf(c9, plain, % 0.16/0.34 ~leq(n0,pv31), % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.16/0.34 cnf(c10, plain, % 0.16/0.34 $false, % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.16/0.34 % 0.16/0.34 cnf(c11, axiom, % 0.16/0.34 leq(n0,pv31)). % 0.16/0.34 cnf(a6, assumption, % 0.16/0.34 n0 = n0). % 0.16/0.34 cnf(a7, assumption, % 0.16/0.34 pv31 = pv31). % 0.16/0.34 cnf(c12, plain, % 0.16/0.34 $false, % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.16/0.34 cnf(c13, plain, % 0.16/0.34 $false, % 0.16/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.16/0.34 % 0.16/0.34 cnf(c14, plain, % 0.16/0.34 $false, % 0.16/0.34 inference(constraint_solving, [ % 0.16/0.34 % 0.16/0.34 ], % 0.16/0.34 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.16/0.34 % 0.16/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------