%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV185+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 : n020.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:48 EDT 2022 % Result : Theorem 2.00s 0.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV185+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n020.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 : Thu Jun 16 04:48:34 EDT 2022 % 0.12/0.33 % CPUTime : % 2.00/0.60 % SZS status Theorem % 2.00/0.60 % SZS output begin IncompleteProof % 2.00/0.60 cnf(c0, axiom, % 2.00/0.60 init = a_select2(rhoold_init,X0) | ~leq(X0,n4) | ~leq(n0,X0) | ~gt(loopcounter,n1)). % 2.00/0.60 cnf(c1, plain, % 2.00/0.60 init = a_select2(rhoold_init,X0) | ~leq(X0,n4) | ~leq(n0,X0) | ~gt(loopcounter,n1), % 2.00/0.60 inference(start, [], [c0])). % 2.00/0.60 % 2.00/0.60 cnf(c2, axiom, % 2.00/0.60 init != a_select2(rhoold_init,sK41)). % 2.00/0.60 cnf(a0, assumption, % 2.00/0.60 a_select2(rhoold_init,sK41) = a_select2(rhoold_init,X0)). % 2.00/0.60 cnf(a1, assumption, % 2.00/0.60 init = X1). % 2.00/0.60 cnf(c3, plain, % 2.00/0.60 ~leq(X0,n4) | ~leq(n0,X0) | ~gt(loopcounter,n1), % 2.00/0.60 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.00/0.60 cnf(c4, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.00/0.60 cnf(c5, plain, % 2.00/0.60 init != X1, % 2.00/0.60 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.00/0.60 % 2.00/0.60 cnf(a2, assumption, % 2.00/0.60 init = X1). % 2.00/0.60 cnf(c6, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(reflexivity, [assumptions([a2])], [c5])). % 2.00/0.60 % 2.00/0.60 cnf(c7, axiom, % 2.00/0.60 leq(sK41,n4)). % 2.00/0.60 cnf(a3, assumption, % 2.00/0.60 X0 = sK41). % 2.00/0.60 cnf(a4, assumption, % 2.00/0.60 n4 = n4). % 2.00/0.60 cnf(c8, plain, % 2.00/0.60 ~leq(n0,X0) | ~gt(loopcounter,n1), % 2.00/0.60 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c7])). % 2.00/0.60 cnf(c9, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c7])). % 2.00/0.60 % 2.00/0.60 cnf(c10, axiom, % 2.00/0.60 leq(n0,sK41)). % 2.00/0.60 cnf(a5, assumption, % 2.00/0.60 n0 = n0). % 2.00/0.60 cnf(a6, assumption, % 2.00/0.60 X0 = sK41). % 2.00/0.60 cnf(c11, plain, % 2.00/0.60 ~gt(loopcounter,n1), % 2.00/0.60 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c10])). % 2.00/0.60 cnf(c12, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c10])). % 2.00/0.60 % 2.00/0.60 cnf(c13, axiom, % 2.00/0.60 gt(loopcounter,n1)). % 2.00/0.60 cnf(a7, assumption, % 2.00/0.60 loopcounter = loopcounter). % 2.00/0.60 cnf(a8, assumption, % 2.00/0.60 n1 = n1). % 2.00/0.60 cnf(c14, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 2.00/0.60 cnf(c15, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 2.00/0.60 % 2.00/0.60 cnf(c16, plain, % 2.00/0.60 $false, % 2.00/0.60 inference(constraint_solving, [ % 2.00/0.60 bind(X0, sK41), % 2.00/0.60 bind(X1, init) % 2.00/0.60 ], % 2.00/0.60 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 2.00/0.60 % 2.00/0.60 % SZS output end IncompleteProof %------------------------------------------------------------------------------