%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV160+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 : n013.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 0.15s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SWV160+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.36 % Computer : n013.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Wed Jun 15 09:39:44 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.41 % SZS status Theorem % 0.15/0.41 % SZS output begin IncompleteProof % 0.15/0.41 cnf(c0, axiom, % 0.15/0.41 leq(sK41,minus(sK41,n1))). % 0.15/0.41 cnf(c1, plain, % 0.15/0.41 leq(sK41,minus(sK41,n1)), % 0.15/0.41 inference(start, [], [c0])). % 0.15/0.41 % 0.15/0.41 cnf(c2, axiom, % 0.15/0.41 gt(X0,X1) | ~leq(X1,minus(X0,n1))). % 0.15/0.41 cnf(a0, assumption, % 0.15/0.41 sK41 = X1). % 0.15/0.41 cnf(a1, assumption, % 0.15/0.41 minus(sK41,n1) = minus(X0,n1)). % 0.15/0.41 cnf(c3, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.41 cnf(c4, plain, % 0.15/0.41 gt(X0,X1), % 0.15/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.41 % 0.15/0.41 cnf(c5, axiom, % 0.15/0.41 ~gt(X2,X2)). % 0.15/0.41 cnf(a2, assumption, % 0.15/0.41 X0 = X2). % 0.15/0.41 cnf(a3, assumption, % 0.15/0.41 X1 = X2). % 0.15/0.41 cnf(c6, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.41 cnf(c7, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.41 % 0.15/0.41 cnf(c8, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(constraint_solving, [ % 0.15/0.41 bind(X0, sK41), % 0.15/0.41 bind(X1, sK41), % 0.15/0.41 bind(X2, sK41) % 0.15/0.41 ], % 0.15/0.41 [a0, a1, a2, a3])). % 0.15/0.41 % 0.15/0.41 % SZS output end IncompleteProof %------------------------------------------------------------------------------