%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV142+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 : n021.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:40 EDT 2022 % Result : Theorem 1.46s 0.75s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n021.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jun 14 14:19:58 EDT 2022 % 0.14/0.36 % CPUTime : % 1.46/0.75 % SZS status Theorem % 1.46/0.75 % SZS output begin IncompleteProof % 1.46/0.75 cnf(c0, axiom, % 1.46/0.75 leq(s_best7,n3) | ~gt(loopcounter,n0)). % 1.46/0.75 cnf(c1, plain, % 1.46/0.75 leq(s_best7,n3) | ~gt(loopcounter,n0), % 1.46/0.75 inference(start, [], [c0])). % 1.46/0.75 % 1.46/0.75 cnf(c2, axiom, % 1.46/0.75 ~leq(s_best7,n3)). % 1.46/0.75 cnf(a0, assumption, % 1.46/0.75 s_best7 = s_best7). % 1.46/0.75 cnf(a1, assumption, % 1.46/0.75 n3 = n3). % 1.46/0.75 cnf(c3, plain, % 1.46/0.75 ~gt(loopcounter,n0), % 1.46/0.75 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.46/0.75 cnf(c4, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.46/0.75 % 1.46/0.75 cnf(c5, axiom, % 1.46/0.75 gt(X0,X1) | ~leq(plus(X1,n1),X0)). % 1.46/0.75 cnf(a2, assumption, % 1.46/0.75 loopcounter = X0). % 1.46/0.75 cnf(a3, assumption, % 1.46/0.75 n0 = X1). % 1.46/0.75 cnf(c6, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 1.46/0.75 cnf(c7, plain, % 1.46/0.75 ~leq(plus(X1,n1),X0), % 1.46/0.75 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 1.46/0.75 % 1.46/0.75 cnf(c8, axiom, % 1.46/0.75 n1 = plus(n0,n1)). % 1.46/0.75 cnf(a4, assumption, % 1.46/0.75 plus(X1,n1) = plus(n0,n1)). % 1.46/0.75 cnf(c9, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(strict_function_extension, [assumptions([a4])], [c7, c8])). % 1.46/0.75 cnf(c10, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(strict_function_extension, [assumptions([a4])], [c7, c8])). % 1.46/0.75 cnf(c11, plain, % 1.46/0.75 X2 != n1 | ~leq(X2,X0), % 1.46/0.75 inference(strict_function_extension, [assumptions([a4])], [c7, c8])). % 1.46/0.75 % 1.46/0.75 cnf(a5, assumption, % 1.46/0.75 X2 = n1). % 1.46/0.75 cnf(c12, plain, % 1.46/0.75 ~leq(X2,X0), % 1.46/0.75 inference(reflexivity, [assumptions([a5])], [c11])). % 1.46/0.75 % 1.46/0.75 cnf(c13, axiom, % 1.46/0.75 leq(n1,loopcounter)). % 1.46/0.75 cnf(a6, assumption, % 1.46/0.75 X2 = n1). % 1.46/0.75 cnf(a7, assumption, % 1.46/0.75 X0 = loopcounter). % 1.46/0.75 cnf(c14, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])). % 1.46/0.75 cnf(c15, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])). % 1.46/0.75 % 1.46/0.75 cnf(c16, plain, % 1.46/0.75 $false, % 1.46/0.75 inference(constraint_solving, [ % 1.46/0.75 bind(X0, loopcounter), % 1.46/0.75 bind(X1, n0), % 1.46/0.75 bind(X2, n1) % 1.46/0.75 ], % 1.46/0.75 [a0, a1, a2, a3, a4, a5, a6, a7])). % 1.46/0.75 % 1.46/0.75 % SZS output end IncompleteProof %------------------------------------------------------------------------------