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