TSTP Solution File: SWV182+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV182+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 : n019.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:47 EDT 2022
% Result : Theorem 140.73s 18.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV182+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 15:59:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 140.73/18.51 % SZS status Theorem
% 140.73/18.51 % SZS output begin IncompleteProof
% 140.73/18.51 cnf(c0, axiom,
% 140.73/18.51 leq(n0,sK41)).
% 140.73/18.51 cnf(c1, plain,
% 140.73/18.51 leq(n0,sK41),
% 140.73/18.51 inference(start, [], [c0])).
% 140.73/18.51
% 140.73/18.51 cnf(c2, axiom,
% 140.73/18.51 init = a_select2(rho_init,X0) | ~leq(X0,n4) | ~leq(n0,X0) | ~gt(loopcounter,n0)).
% 140.73/18.51 cnf(a0, assumption,
% 140.73/18.51 n0 = n0).
% 140.73/18.51 cnf(a1, assumption,
% 140.73/18.51 sK41 = X0).
% 140.73/18.51 cnf(c3, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 140.73/18.51 cnf(c4, plain,
% 140.73/18.51 init = a_select2(rho_init,X0) | ~leq(X0,n4) | ~gt(loopcounter,n0),
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 140.73/18.51
% 140.73/18.51 cnf(c5, axiom,
% 140.73/18.51 init != a_select2(rho_init,sK41)).
% 140.73/18.51 cnf(a2, assumption,
% 140.73/18.51 a_select2(rho_init,sK41) = a_select2(rho_init,X0)).
% 140.73/18.51 cnf(a3, assumption,
% 140.73/18.51 init = X1).
% 140.73/18.51 cnf(c6, plain,
% 140.73/18.51 ~leq(X0,n4) | ~gt(loopcounter,n0),
% 140.73/18.51 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 140.73/18.51 cnf(c7, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 140.73/18.51 cnf(c8, plain,
% 140.73/18.51 init != X1,
% 140.73/18.51 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 140.73/18.51
% 140.73/18.51 cnf(a4, assumption,
% 140.73/18.51 init = X1).
% 140.73/18.51 cnf(c9, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(reflexivity, [assumptions([a4])], [c8])).
% 140.73/18.51
% 140.73/18.51 cnf(c10, axiom,
% 140.73/18.51 leq(sK41,n4)).
% 140.73/18.51 cnf(a5, assumption,
% 140.73/18.51 X0 = sK41).
% 140.73/18.51 cnf(a6, assumption,
% 140.73/18.51 n4 = n4).
% 140.73/18.51 cnf(c11, plain,
% 140.73/18.51 ~gt(loopcounter,n0),
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 140.73/18.51 cnf(c12, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 140.73/18.51
% 140.73/18.51 cnf(c13, axiom,
% 140.73/18.51 gt(X2,X3) | ~leq(plus(X3,n1),X2)).
% 140.73/18.51 cnf(a7, assumption,
% 140.73/18.51 loopcounter = X2).
% 140.73/18.51 cnf(a8, assumption,
% 140.73/18.51 n0 = X3).
% 140.73/18.51 cnf(c14, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])).
% 140.73/18.51 cnf(c15, plain,
% 140.73/18.51 ~leq(plus(X3,n1),X2),
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])).
% 140.73/18.51
% 140.73/18.51 cnf(c16, axiom,
% 140.73/18.51 n1 = plus(n0,n1)).
% 140.73/18.51 cnf(a9, assumption,
% 140.73/18.51 plus(X3,n1) = plus(n0,n1)).
% 140.73/18.51 cnf(c17, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_function_extension, [assumptions([a9])], [c15, c16])).
% 140.73/18.51 cnf(c18, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_function_extension, [assumptions([a9])], [c15, c16])).
% 140.73/18.51 cnf(c19, plain,
% 140.73/18.51 X4 != n1 | ~leq(X4,X2),
% 140.73/18.51 inference(strict_function_extension, [assumptions([a9])], [c15, c16])).
% 140.73/18.51
% 140.73/18.51 cnf(a10, assumption,
% 140.73/18.51 X4 = n1).
% 140.73/18.51 cnf(c20, plain,
% 140.73/18.51 ~leq(X4,X2),
% 140.73/18.51 inference(reflexivity, [assumptions([a10])], [c19])).
% 140.73/18.51
% 140.73/18.51 cnf(c21, axiom,
% 140.73/18.51 leq(n1,loopcounter)).
% 140.73/18.51 cnf(a11, assumption,
% 140.73/18.51 X4 = n1).
% 140.73/18.51 cnf(a12, assumption,
% 140.73/18.51 X2 = loopcounter).
% 140.73/18.51 cnf(c22, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a11, a12])], [c20, c21])).
% 140.73/18.51 cnf(c23, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(strict_predicate_extension, [assumptions([a11, a12])], [c20, c21])).
% 140.73/18.51
% 140.73/18.51 cnf(c24, plain,
% 140.73/18.51 $false,
% 140.73/18.51 inference(constraint_solving, [
% 140.73/18.51 bind(X0, sK41),
% 140.73/18.51 bind(X1, init),
% 140.73/18.51 bind(X2, loopcounter),
% 140.73/18.51 bind(X3, n0),
% 140.73/18.51 bind(X4, n1)
% 140.73/18.51 ],
% 140.73/18.51 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])).
% 140.73/18.51
% 140.73/18.51 % SZS output end IncompleteProof
%------------------------------------------------------------------------------