%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV075+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 : n008.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.21s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SWV075+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n008.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:40:37 EDT 2022 % 0.13/0.35 % CPUTime : % 0.21/0.42 % SZS status Theorem % 0.21/0.42 % SZS output begin IncompleteProof % 0.21/0.42 cnf(c0, axiom, % 0.21/0.42 leq(pv31,minus(n5,n1))). % 0.21/0.42 cnf(c1, plain, % 0.21/0.42 leq(pv31,minus(n5,n1)), % 0.21/0.42 inference(start, [], [c0])). % 0.21/0.42 % 0.21/0.42 cnf(c2, axiom, % 0.21/0.42 ~leq(pv37,minus(n135300,n1)) | ~leq(pv31,minus(n5,n1)) | ~leq(n0,pv37) | ~leq(n0,pv31)). % 0.21/0.42 cnf(a0, assumption, % 0.21/0.42 pv31 = pv31). % 0.21/0.42 cnf(a1, assumption, % 0.21/0.42 minus(n5,n1) = minus(n5,n1)). % 0.21/0.42 cnf(c3, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.42 cnf(c4, plain, % 0.21/0.42 ~leq(pv37,minus(n135300,n1)) | ~leq(n0,pv37) | ~leq(n0,pv31), % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.42 % 0.21/0.42 cnf(c5, axiom, % 0.21/0.42 leq(pv37,minus(n135300,n1))). % 0.21/0.42 cnf(a2, assumption, % 0.21/0.42 pv37 = pv37). % 0.21/0.42 cnf(a3, assumption, % 0.21/0.42 minus(n135300,n1) = minus(n135300,n1)). % 0.21/0.42 cnf(c6, plain, % 0.21/0.42 ~leq(n0,pv37) | ~leq(n0,pv31), % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.42 cnf(c7, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.42 % 0.21/0.42 cnf(c8, axiom, % 0.21/0.42 leq(n0,pv37)). % 0.21/0.42 cnf(a4, assumption, % 0.21/0.42 n0 = n0). % 0.21/0.42 cnf(a5, assumption, % 0.21/0.42 pv37 = pv37). % 0.21/0.42 cnf(c9, plain, % 0.21/0.42 ~leq(n0,pv31), % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.21/0.42 cnf(c10, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.21/0.42 % 0.21/0.42 cnf(c11, axiom, % 0.21/0.42 leq(n0,pv31)). % 0.21/0.42 cnf(a6, assumption, % 0.21/0.42 n0 = n0). % 0.21/0.42 cnf(a7, assumption, % 0.21/0.42 pv31 = pv31). % 0.21/0.42 cnf(c12, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.21/0.42 cnf(c13, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.21/0.42 % 0.21/0.42 cnf(c14, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(constraint_solving, [ % 0.21/0.42 % 0.21/0.42 ], % 0.21/0.42 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.21/0.42 % 0.21/0.42 % SZS output end IncompleteProof %------------------------------------------------------------------------------