TSTP Solution File: SWV033+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV033+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n025.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 : 300s
% DateTime : Tue Apr 30 20:45:49 EDT 2024
% Result : Theorem 0.10s 0.50s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWV033+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.25 % Computer : n025.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Tue Apr 30 01:03:26 EDT 2024
% 0.07/0.25 % CPUTime :
% 0.07/0.26 % Drodi V3.6.0
% 0.10/0.50 % Refutation found
% 0.10/0.50 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.50 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.50 fof(f3,axiom,(
% 0.10/0.50 (! [X] : ~ gt(X,X) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f4,axiom,(
% 0.10/0.50 (! [X] : leq(X,X) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f5,axiom,(
% 0.10/0.50 (! [X,Y,Z] :( ( leq(X,Y)& leq(Y,Z) )=> leq(X,Z) ) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f8,axiom,(
% 0.10/0.50 (! [X,Y] :( gt(Y,X)=> leq(X,Y) ) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f9,axiom,(
% 0.10/0.50 (! [X,Y] :( ( leq(X,Y)& X != Y )=> gt(Y,X) ) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f10,axiom,(
% 0.10/0.50 (! [X,Y] :( leq(X,pred(Y))<=> gt(Y,X) ) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f11,axiom,(
% 0.10/0.50 (! [X] : gt(succ(X),X) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f13,axiom,(
% 0.10/0.50 (! [X,Y] :( leq(X,Y)<=> gt(succ(Y),X) ) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f28,axiom,(
% 0.10/0.50 succ(tptp_minus_1) = n0 ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f30,axiom,(
% 0.10/0.50 (! [X] : plus(n1,X) = succ(X) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f33,axiom,(
% 0.10/0.50 (! [X] : plus(X,n3) = succ(succ(succ(X))) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f39,axiom,(
% 0.10/0.50 (! [X] : minus(X,n1) = pred(X) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f40,axiom,(
% 0.10/0.50 (! [X] : pred(succ(X)) = X )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f41,axiom,(
% 0.10/0.50 (! [X] : succ(pred(X)) = X )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f48,axiom,(
% 0.10/0.50 (! [X,U,VAL] : a_select2(tptp_update2(X,U,VAL),U) = VAL )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f49,axiom,(
% 0.10/0.50 (! [I,U,X,VAL,VAL2] :( ( I != U& a_select2(X,U) = VAL )=> a_select2(tptp_update2(X,I,VAL2),U) = VAL ) )),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f53,conjecture,(
% 0.10/0.50 ( ( init = init& leq(n0,pv1376)& leq(pv1376,n3)& (! [A] :( ( leq(n0,A)& leq(A,n2) )=> (! [B] :( ( leq(n0,B)& leq(B,n3) )=> a_select3(simplex7_init,B,A) = init ) )))& (! [C] :( ( leq(n0,C)& leq(C,minus(pv1376,n1)) )=> a_select2(s_values7_init,C) = init ) ))=> ( init = init& (! [D] :( ( leq(n0,D)& leq(D,n2) )=> (! [E] :( ( leq(n0,E)& leq(E,n3) )=> a_select3(simplex7_init,E,D) = init ) )))& (! [F] :( ( leq(n0,F)& leq(F,minus(plus(n1,pv1376),n1)) )=> a_select2(tptp_update2(s_values7_init,pv1376,init),F) = init ) )) ) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f54,negated_conjecture,(
% 0.10/0.50 ~(( ( init = init& leq(n0,pv1376)& leq(pv1376,n3)& (! [A] :( ( leq(n0,A)& leq(A,n2) )=> (! [B] :( ( leq(n0,B)& leq(B,n3) )=> a_select3(simplex7_init,B,A) = init ) )))& (! [C] :( ( leq(n0,C)& leq(C,minus(pv1376,n1)) )=> a_select2(s_values7_init,C) = init ) ))=> ( init = init& (! [D] :( ( leq(n0,D)& leq(D,n2) )=> (! [E] :( ( leq(n0,E)& leq(E,n3) )=> a_select3(simplex7_init,E,D) = init ) )))& (! [F] :( ( leq(n0,F)& leq(F,minus(plus(n1,pv1376),n1)) )=> a_select2(tptp_update2(s_values7_init,pv1376,init),F) = init ) )) ) )),
% 0.10/0.50 inference(negated_conjecture,[status(cth)],[f53])).
% 0.10/0.50 fof(f56,axiom,(
% 0.10/0.50 gt(n4,tptp_minus_1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f58,axiom,(
% 0.10/0.50 gt(n0,tptp_minus_1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f59,axiom,(
% 0.10/0.50 gt(n1,tptp_minus_1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f60,axiom,(
% 0.10/0.50 gt(n2,tptp_minus_1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f61,axiom,(
% 0.10/0.50 gt(n3,tptp_minus_1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f62,axiom,(
% 0.10/0.50 gt(n4,n0) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f63,axiom,(
% 0.10/0.50 gt(n5,n0) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f67,axiom,(
% 0.10/0.50 gt(n4,n1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f69,axiom,(
% 0.10/0.50 gt(n2,n1) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f71,axiom,(
% 0.10/0.50 gt(n4,n2) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f73,axiom,(
% 0.10/0.50 gt(n3,n2) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f74,axiom,(
% 0.10/0.50 gt(n4,n3) ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f84,axiom,(
% 0.10/0.50 succ(n0) = n1 ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f85,axiom,(
% 0.10/0.50 succ(succ(n0)) = n2 ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f86,axiom,(
% 0.10/0.50 succ(succ(succ(n0))) = n3 ),
% 0.10/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.50 fof(f91,plain,(
% 0.10/0.50 ![X0]: (~gt(X0,X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f3])).
% 0.10/0.50 fof(f92,plain,(
% 0.10/0.50 ![X0]: (leq(X0,X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.50 fof(f93,plain,(
% 0.10/0.50 ![X,Y,Z]: ((~leq(X,Y)|~leq(Y,Z))|leq(X,Z))),
% 0.10/0.50 inference(pre_NNF_transformation,[status(esa)],[f5])).
% 0.10/0.50 fof(f94,plain,(
% 0.10/0.50 ![X,Z]: ((![Y]: (~leq(X,Y)|~leq(Y,Z)))|leq(X,Z))),
% 0.10/0.50 inference(miniscoping,[status(esa)],[f93])).
% 0.10/0.50 fof(f95,plain,(
% 0.10/0.50 ![X0,X1,X2]: (~leq(X0,X1)|~leq(X1,X2)|leq(X0,X2))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f94])).
% 0.10/0.50 fof(f104,plain,(
% 0.10/0.50 ![X,Y]: (~gt(Y,X)|leq(X,Y))),
% 0.10/0.50 inference(pre_NNF_transformation,[status(esa)],[f8])).
% 0.10/0.50 fof(f105,plain,(
% 0.10/0.50 ![X0,X1]: (~gt(X0,X1)|leq(X1,X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f104])).
% 0.10/0.50 fof(f106,plain,(
% 0.10/0.50 ![X,Y]: ((~leq(X,Y)|X=Y)|gt(Y,X))),
% 0.10/0.50 inference(pre_NNF_transformation,[status(esa)],[f9])).
% 0.10/0.50 fof(f107,plain,(
% 0.10/0.50 ![X0,X1]: (~leq(X0,X1)|X0=X1|gt(X1,X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f106])).
% 0.10/0.50 fof(f108,plain,(
% 0.10/0.50 ![X,Y]: ((~leq(X,pred(Y))|gt(Y,X))&(leq(X,pred(Y))|~gt(Y,X)))),
% 0.10/0.50 inference(NNF_transformation,[status(esa)],[f10])).
% 0.10/0.50 fof(f109,plain,(
% 0.10/0.50 (![X,Y]: (~leq(X,pred(Y))|gt(Y,X)))&(![X,Y]: (leq(X,pred(Y))|~gt(Y,X)))),
% 0.10/0.50 inference(miniscoping,[status(esa)],[f108])).
% 0.10/0.50 fof(f111,plain,(
% 0.10/0.50 ![X0,X1]: (leq(X0,pred(X1))|~gt(X1,X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f109])).
% 0.10/0.50 fof(f112,plain,(
% 0.10/0.50 ![X0]: (gt(succ(X0),X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.50 fof(f115,plain,(
% 0.10/0.50 ![X,Y]: ((~leq(X,Y)|gt(succ(Y),X))&(leq(X,Y)|~gt(succ(Y),X)))),
% 0.10/0.50 inference(NNF_transformation,[status(esa)],[f13])).
% 0.10/0.50 fof(f116,plain,(
% 0.10/0.50 (![X,Y]: (~leq(X,Y)|gt(succ(Y),X)))&(![X,Y]: (leq(X,Y)|~gt(succ(Y),X)))),
% 0.10/0.50 inference(miniscoping,[status(esa)],[f115])).
% 0.10/0.50 fof(f117,plain,(
% 0.10/0.50 ![X0,X1]: (~leq(X0,X1)|gt(succ(X1),X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f116])).
% 0.10/0.50 fof(f199,plain,(
% 0.10/0.50 succ(tptp_minus_1)=n0),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f28])).
% 0.10/0.50 fof(f201,plain,(
% 0.10/0.50 ![X0]: (plus(n1,X0)=succ(X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f30])).
% 0.10/0.50 fof(f204,plain,(
% 0.10/0.50 ![X0]: (plus(X0,n3)=succ(succ(succ(X0))))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f33])).
% 0.10/0.50 fof(f210,plain,(
% 0.10/0.50 ![X0]: (minus(X0,n1)=pred(X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f39])).
% 0.10/0.50 fof(f211,plain,(
% 0.10/0.50 ![X0]: (pred(succ(X0))=X0)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f40])).
% 0.10/0.50 fof(f212,plain,(
% 0.10/0.50 ![X0]: (succ(pred(X0))=X0)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f41])).
% 0.10/0.50 fof(f233,plain,(
% 0.10/0.50 ![X0,X1,X2]: (a_select2(tptp_update2(X0,X1,X2),X1)=X2)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f48])).
% 0.10/0.50 fof(f234,plain,(
% 0.10/0.50 ![I,U,X,VAL,VAL2]: ((I=U|~a_select2(X,U)=VAL)|a_select2(tptp_update2(X,I,VAL2),U)=VAL)),
% 0.10/0.50 inference(pre_NNF_transformation,[status(esa)],[f49])).
% 0.10/0.50 fof(f235,plain,(
% 0.10/0.50 ![I,U,X,VAL]: ((I=U|~a_select2(X,U)=VAL)|(![VAL2]: a_select2(tptp_update2(X,I,VAL2),U)=VAL))),
% 0.10/0.50 inference(miniscoping,[status(esa)],[f234])).
% 0.10/0.50 fof(f236,plain,(
% 0.10/0.50 ![X0,X1,X2,X3,X4]: (X0=X1|~a_select2(X2,X1)=X3|a_select2(tptp_update2(X2,X0,X4),X1)=X3)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f235])).
% 0.10/0.50 fof(f244,plain,(
% 0.10/0.50 (((((init=init&leq(n0,pv1376))&leq(pv1376,n3))&(![A]: ((~leq(n0,A)|~leq(A,n2))|(![B]: ((~leq(n0,B)|~leq(B,n3))|a_select3(simplex7_init,B,A)=init)))))&(![C]: ((~leq(n0,C)|~leq(C,minus(pv1376,n1)))|a_select2(s_values7_init,C)=init)))&((~init=init|(?[D]: ((leq(n0,D)&leq(D,n2))&(?[E]: ((leq(n0,E)&leq(E,n3))&~a_select3(simplex7_init,E,D)=init)))))|(?[F]: ((leq(n0,F)&leq(F,minus(plus(n1,pv1376),n1)))&~a_select2(tptp_update2(s_values7_init,pv1376,init),F)=init))))),
% 0.10/0.50 inference(pre_NNF_transformation,[status(esa)],[f54])).
% 0.10/0.50 fof(f245,plain,(
% 0.10/0.50 ![D]: (pd0_3(D)=>((leq(n0,D)&leq(D,n2))&(?[E]: ((leq(n0,E)&leq(E,n3))&~a_select3(simplex7_init,E,D)=init))))),
% 0.10/0.50 introduced(predicate_definition,[f244])).
% 0.10/0.50 fof(f246,plain,(
% 0.10/0.50 ((((init=init&leq(n0,pv1376))&leq(pv1376,n3))&(![A]: ((~leq(n0,A)|~leq(A,n2))|(![B]: ((~leq(n0,B)|~leq(B,n3))|a_select3(simplex7_init,B,A)=init)))))&(![C]: ((~leq(n0,C)|~leq(C,minus(pv1376,n1)))|a_select2(s_values7_init,C)=init)))&((~init=init|(?[D]: pd0_3(D)))|(?[F]: ((leq(n0,F)&leq(F,minus(plus(n1,pv1376),n1)))&~a_select2(tptp_update2(s_values7_init,pv1376,init),F)=init)))),
% 0.10/0.50 inference(formula_renaming,[status(thm)],[f244,f245])).
% 0.10/0.50 fof(f247,plain,(
% 0.10/0.50 ((((init=init&leq(n0,pv1376))&leq(pv1376,n3))&(![A]: ((~leq(n0,A)|~leq(A,n2))|(![B]: ((~leq(n0,B)|~leq(B,n3))|a_select3(simplex7_init,B,A)=init)))))&(![C]: ((~leq(n0,C)|~leq(C,minus(pv1376,n1)))|a_select2(s_values7_init,C)=init)))&((~init=init|pd0_3(sk0_23))|((leq(n0,sk0_24)&leq(sk0_24,minus(plus(n1,pv1376),n1)))&~a_select2(tptp_update2(s_values7_init,pv1376,init),sk0_24)=init))),
% 0.10/0.50 inference(skolemization,[status(esa)],[f246])).
% 0.10/0.50 fof(f249,plain,(
% 0.10/0.50 leq(n0,pv1376)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f247])).
% 0.10/0.50 fof(f251,plain,(
% 0.10/0.50 ![X0,X1]: (~leq(n0,X0)|~leq(X0,n2)|~leq(n0,X1)|~leq(X1,n3)|a_select3(simplex7_init,X1,X0)=init)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f247])).
% 0.10/0.50 fof(f252,plain,(
% 0.10/0.50 ![X0]: (~leq(n0,X0)|~leq(X0,minus(pv1376,n1))|a_select2(s_values7_init,X0)=init)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f247])).
% 0.10/0.50 fof(f253,plain,(
% 0.10/0.50 ~init=init|pd0_3(sk0_23)|leq(n0,sk0_24)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f247])).
% 0.10/0.50 fof(f254,plain,(
% 0.10/0.50 ~init=init|pd0_3(sk0_23)|leq(sk0_24,minus(plus(n1,pv1376),n1))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f247])).
% 0.10/0.50 fof(f255,plain,(
% 0.10/0.50 ~init=init|pd0_3(sk0_23)|~a_select2(tptp_update2(s_values7_init,pv1376,init),sk0_24)=init),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f247])).
% 0.10/0.50 fof(f257,plain,(
% 0.10/0.50 gt(n4,tptp_minus_1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f56])).
% 0.10/0.50 fof(f259,plain,(
% 0.10/0.50 gt(n0,tptp_minus_1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f58])).
% 0.10/0.50 fof(f260,plain,(
% 0.10/0.50 gt(n1,tptp_minus_1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f59])).
% 0.10/0.50 fof(f261,plain,(
% 0.10/0.50 gt(n2,tptp_minus_1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f60])).
% 0.10/0.50 fof(f262,plain,(
% 0.10/0.50 gt(n3,tptp_minus_1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f61])).
% 0.10/0.50 fof(f263,plain,(
% 0.10/0.50 gt(n4,n0)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f62])).
% 0.10/0.50 fof(f264,plain,(
% 0.10/0.50 gt(n5,n0)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f63])).
% 0.10/0.50 fof(f268,plain,(
% 0.10/0.50 gt(n4,n1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f67])).
% 0.10/0.50 fof(f270,plain,(
% 0.10/0.50 gt(n2,n1)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f69])).
% 0.10/0.50 fof(f272,plain,(
% 0.10/0.50 gt(n4,n2)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f71])).
% 0.10/0.50 fof(f274,plain,(
% 0.10/0.50 gt(n3,n2)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f73])).
% 0.10/0.50 fof(f275,plain,(
% 0.10/0.50 gt(n4,n3)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f74])).
% 0.10/0.50 fof(f291,plain,(
% 0.10/0.50 succ(n0)=n1),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f84])).
% 0.10/0.50 fof(f292,plain,(
% 0.10/0.50 succ(succ(n0))=n2),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f85])).
% 0.10/0.50 fof(f293,plain,(
% 0.10/0.50 succ(succ(succ(n0)))=n3),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f86])).
% 0.10/0.50 fof(f315,plain,(
% 0.10/0.50 ![D]: (~pd0_3(D)|((leq(n0,D)&leq(D,n2))&(?[E]: ((leq(n0,E)&leq(E,n3))&~a_select3(simplex7_init,E,D)=init))))),
% 0.10/0.50 inference(pre_NNF_transformation,[status(esa)],[f245])).
% 0.10/0.50 fof(f316,plain,(
% 0.10/0.50 ![D]: (~pd0_3(D)|((leq(n0,D)&leq(D,n2))&((leq(n0,sk0_29(D))&leq(sk0_29(D),n3))&~a_select3(simplex7_init,sk0_29(D),D)=init)))),
% 0.10/0.50 inference(skolemization,[status(esa)],[f315])).
% 0.10/0.50 fof(f317,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|leq(n0,X0))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f316])).
% 0.10/0.50 fof(f318,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|leq(X0,n2))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f316])).
% 0.10/0.50 fof(f319,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|leq(n0,sk0_29(X0)))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f316])).
% 0.10/0.50 fof(f320,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|leq(sk0_29(X0),n3))),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f316])).
% 0.10/0.50 fof(f321,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|~a_select3(simplex7_init,sk0_29(X0),X0)=init)),
% 0.10/0.50 inference(cnf_transformation,[status(esa)],[f316])).
% 0.10/0.50 fof(f328,plain,(
% 0.10/0.50 spl0_0 <=> init=init),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f330,plain,(
% 0.10/0.50 ~init=init|spl0_0),
% 0.10/0.50 inference(component_clause,[status(thm)],[f328])).
% 0.10/0.50 fof(f331,plain,(
% 0.10/0.50 spl0_1 <=> pd0_3(sk0_23)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f332,plain,(
% 0.10/0.50 pd0_3(sk0_23)|~spl0_1),
% 0.10/0.50 inference(component_clause,[status(thm)],[f331])).
% 0.10/0.50 fof(f334,plain,(
% 0.10/0.50 spl0_2 <=> leq(n0,sk0_24)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f337,plain,(
% 0.10/0.50 ~spl0_0|spl0_1|spl0_2),
% 0.10/0.50 inference(split_clause,[status(thm)],[f253,f328,f331,f334])).
% 0.10/0.50 fof(f338,plain,(
% 0.10/0.50 spl0_3 <=> leq(sk0_24,minus(plus(n1,pv1376),n1))),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f339,plain,(
% 0.10/0.50 leq(sk0_24,minus(plus(n1,pv1376),n1))|~spl0_3),
% 0.10/0.50 inference(component_clause,[status(thm)],[f338])).
% 0.10/0.50 fof(f341,plain,(
% 0.10/0.50 ~spl0_0|spl0_1|spl0_3),
% 0.10/0.50 inference(split_clause,[status(thm)],[f254,f328,f331,f338])).
% 0.10/0.50 fof(f342,plain,(
% 0.10/0.50 spl0_4 <=> a_select2(tptp_update2(s_values7_init,pv1376,init),sk0_24)=init),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f344,plain,(
% 0.10/0.50 ~a_select2(tptp_update2(s_values7_init,pv1376,init),sk0_24)=init|spl0_4),
% 0.10/0.50 inference(component_clause,[status(thm)],[f342])).
% 0.10/0.50 fof(f345,plain,(
% 0.10/0.50 ~spl0_0|spl0_1|~spl0_4),
% 0.10/0.50 inference(split_clause,[status(thm)],[f255,f328,f331,f342])).
% 0.10/0.50 fof(f363,plain,(
% 0.10/0.50 ![X0,X1,X2,X3]: (X0=X1|a_select2(tptp_update2(X2,X0,X3),X1)=a_select2(X2,X1))),
% 0.10/0.50 inference(destructive_equality_resolution,[status(esa)],[f236])).
% 0.10/0.50 fof(f364,plain,(
% 0.10/0.50 ![X0]: (~leq(n0,X0)|~leq(X0,pred(pv1376))|a_select2(s_values7_init,X0)=init)),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f210,f252])).
% 0.10/0.50 fof(f373,plain,(
% 0.10/0.50 succ(n1)=n2),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f291,f292])).
% 0.10/0.50 fof(f374,plain,(
% 0.10/0.50 plus(n0,n3)=n3),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f204,f293])).
% 0.10/0.50 fof(f375,plain,(
% 0.10/0.50 $false|spl0_0),
% 0.10/0.50 inference(trivial_equality_resolution,[status(esa)],[f330])).
% 0.10/0.50 fof(f376,plain,(
% 0.10/0.50 spl0_0),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f375])).
% 0.10/0.50 fof(f379,plain,(
% 0.10/0.50 ![X0]: (~leq(X0,n0)|leq(X0,pv1376))),
% 0.10/0.50 inference(resolution,[status(thm)],[f95,f249])).
% 0.10/0.50 fof(f385,plain,(
% 0.10/0.50 pred(n0)=tptp_minus_1),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f199,f211])).
% 0.10/0.50 fof(f386,plain,(
% 0.10/0.50 pred(n2)=n1),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f373,f211])).
% 0.10/0.50 fof(f387,plain,(
% 0.10/0.50 pred(n1)=n0),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f291,f211])).
% 0.10/0.50 fof(f388,plain,(
% 0.10/0.50 ![X0]: (gt(X0,pred(X0)))),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f212,f112])).
% 0.10/0.50 fof(f416,plain,(
% 0.10/0.50 spl0_7 <=> leq(n0,n0)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f418,plain,(
% 0.10/0.50 ~leq(n0,n0)|spl0_7),
% 0.10/0.50 inference(component_clause,[status(thm)],[f416])).
% 0.10/0.50 fof(f498,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|~leq(n0,X0)|~leq(X0,n2)|~leq(n0,sk0_29(X0))|~leq(sk0_29(X0),n3))),
% 0.10/0.50 inference(resolution,[status(thm)],[f321,f251])).
% 0.10/0.50 fof(f499,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|~leq(X0,n2)|~leq(n0,sk0_29(X0))|~leq(sk0_29(X0),n3))),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f498,f317])).
% 0.10/0.50 fof(f519,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|~leq(n0,sk0_29(X0))|~leq(sk0_29(X0),n3))),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f499,f318])).
% 0.10/0.50 fof(f565,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|~leq(n0,sk0_29(X0))|~pd0_3(X0))),
% 0.10/0.50 inference(resolution,[status(thm)],[f519,f320])).
% 0.10/0.50 fof(f566,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0)|~leq(n0,sk0_29(X0)))),
% 0.10/0.50 inference(duplicate_literals_removal,[status(esa)],[f565])).
% 0.10/0.50 fof(f567,plain,(
% 0.10/0.50 ![X0]: (~pd0_3(X0))),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f566,f319])).
% 0.10/0.50 fof(f568,plain,(
% 0.10/0.50 $false|~spl0_1),
% 0.10/0.50 inference(backward_subsumption_resolution,[status(thm)],[f332,f567])).
% 0.10/0.50 fof(f569,plain,(
% 0.10/0.50 ~spl0_1),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f568])).
% 0.10/0.50 fof(f570,plain,(
% 0.10/0.50 leq(sk0_24,pred(plus(n1,pv1376)))|~spl0_3),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f210,f339])).
% 0.10/0.50 fof(f571,plain,(
% 0.10/0.50 leq(sk0_24,pred(succ(pv1376)))|~spl0_3),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f201,f570])).
% 0.10/0.50 fof(f572,plain,(
% 0.10/0.50 leq(sk0_24,pv1376)|~spl0_3),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f211,f571])).
% 0.10/0.50 fof(f610,plain,(
% 0.10/0.50 plus(n0,n3)=succ(succ(n1))),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f291,f204])).
% 0.10/0.50 fof(f611,plain,(
% 0.10/0.50 n3=succ(succ(n1))),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f374,f610])).
% 0.10/0.50 fof(f612,plain,(
% 0.10/0.50 n3=succ(n2)),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f373,f611])).
% 0.10/0.50 fof(f653,plain,(
% 0.10/0.50 pred(n3)=n2),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f612,f211])).
% 0.10/0.50 fof(f691,plain,(
% 0.10/0.50 leq(tptp_minus_1,n0)),
% 0.10/0.50 inference(resolution,[status(thm)],[f105,f259])).
% 0.10/0.50 fof(f709,plain,(
% 0.10/0.50 leq(n1,n2)),
% 0.10/0.50 inference(resolution,[status(thm)],[f105,f270])).
% 0.10/0.50 fof(f712,plain,(
% 0.10/0.50 ![X0]: (leq(pred(X0),X0))),
% 0.10/0.50 inference(resolution,[status(thm)],[f105,f388])).
% 0.10/0.50 fof(f756,plain,(
% 0.10/0.50 spl0_25 <=> ~leq(pred(X0),X0)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f757,plain,(
% 0.10/0.50 ![X0]: (~leq(pred(X0),X0)|~spl0_25)),
% 0.10/0.50 inference(component_clause,[status(thm)],[f756])).
% 0.10/0.50 fof(f764,plain,(
% 0.10/0.50 $false|~spl0_25),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f757,f712])).
% 0.10/0.50 fof(f765,plain,(
% 0.10/0.50 ~spl0_25),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f764])).
% 0.10/0.50 fof(f790,plain,(
% 0.10/0.50 spl0_27 <=> a_select2(s_values7_init,sk0_24)=init),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f792,plain,(
% 0.10/0.50 ~a_select2(s_values7_init,sk0_24)=init|spl0_27),
% 0.10/0.50 inference(component_clause,[status(thm)],[f790])).
% 0.10/0.50 fof(f793,plain,(
% 0.10/0.50 spl0_28 <=> pv1376=sk0_24),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f794,plain,(
% 0.10/0.50 pv1376=sk0_24|~spl0_28),
% 0.10/0.50 inference(component_clause,[status(thm)],[f793])).
% 0.10/0.50 fof(f796,plain,(
% 0.10/0.50 ~a_select2(s_values7_init,sk0_24)=init|pv1376=sk0_24|spl0_4),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f363,f344])).
% 0.10/0.50 fof(f797,plain,(
% 0.10/0.50 ~spl0_27|spl0_28|spl0_4),
% 0.10/0.50 inference(split_clause,[status(thm)],[f796,f790,f793,f342])).
% 0.10/0.50 fof(f801,plain,(
% 0.10/0.50 spl0_30 <=> n1=n0),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f802,plain,(
% 0.10/0.50 n1=n0|~spl0_30),
% 0.10/0.50 inference(component_clause,[status(thm)],[f801])).
% 0.10/0.50 fof(f845,plain,(
% 0.10/0.50 $false|spl0_7),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f418,f92])).
% 0.10/0.50 fof(f846,plain,(
% 0.10/0.50 spl0_7),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f845])).
% 0.10/0.50 fof(f857,plain,(
% 0.10/0.50 spl0_40 <=> leq(n1,n1)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f859,plain,(
% 0.10/0.50 ~leq(n1,n1)|spl0_40),
% 0.10/0.50 inference(component_clause,[status(thm)],[f857])).
% 0.10/0.50 fof(f899,plain,(
% 0.10/0.50 $false|spl0_40),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f859,f92])).
% 0.10/0.50 fof(f900,plain,(
% 0.10/0.50 spl0_40),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f899])).
% 0.10/0.50 fof(f917,plain,(
% 0.10/0.50 pred(n0)=n0|~spl0_30),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f802,f387])).
% 0.10/0.50 fof(f918,plain,(
% 0.10/0.50 tptp_minus_1=n0|~spl0_30),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f385,f917])).
% 0.10/0.50 fof(f921,plain,(
% 0.10/0.50 gt(n0,tptp_minus_1)|~spl0_30),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f802,f260])).
% 0.10/0.50 fof(f922,plain,(
% 0.10/0.50 gt(n0,n0)|~spl0_30),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f918,f921])).
% 0.10/0.50 fof(f923,plain,(
% 0.10/0.50 $false|~spl0_30),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f922,f91])).
% 0.10/0.50 fof(f924,plain,(
% 0.10/0.50 ~spl0_30),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f923])).
% 0.10/0.50 fof(f981,plain,(
% 0.10/0.50 spl0_51 <=> n4=n0),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f982,plain,(
% 0.10/0.50 n4=n0|~spl0_51),
% 0.10/0.50 inference(component_clause,[status(thm)],[f981])).
% 0.10/0.50 fof(f984,plain,(
% 0.10/0.50 spl0_52 <=> n4=n1),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f985,plain,(
% 0.10/0.50 n4=n1|~spl0_52),
% 0.10/0.50 inference(component_clause,[status(thm)],[f984])).
% 0.10/0.50 fof(f1003,plain,(
% 0.10/0.50 spl0_55 <=> n5=n0),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1004,plain,(
% 0.10/0.50 n5=n0|~spl0_55),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1003])).
% 0.10/0.50 fof(f1026,plain,(
% 0.10/0.50 spl0_60 <=> n3=n4),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1027,plain,(
% 0.10/0.50 n3=n4|~spl0_60),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1026])).
% 0.10/0.50 fof(f1052,plain,(
% 0.10/0.50 spl0_66 <=> n2=n4),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1053,plain,(
% 0.10/0.50 n2=n4|~spl0_66),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1052])).
% 0.10/0.50 fof(f1060,plain,(
% 0.10/0.50 spl0_68 <=> n2=n3),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1061,plain,(
% 0.10/0.50 n2=n3|~spl0_68),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1060])).
% 0.10/0.50 fof(f1076,plain,(
% 0.10/0.50 spl0_72 <=> gt(pv1376,sk0_24)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1079,plain,(
% 0.10/0.50 sk0_24=pv1376|gt(pv1376,sk0_24)|~spl0_3),
% 0.10/0.50 inference(resolution,[status(thm)],[f107,f572])).
% 0.10/0.50 fof(f1080,plain,(
% 0.10/0.50 spl0_28|spl0_72|~spl0_3),
% 0.10/0.50 inference(split_clause,[status(thm)],[f1079,f793,f1076,f338])).
% 0.10/0.50 fof(f1178,plain,(
% 0.10/0.50 gt(n0,n0)|~spl0_51),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f982,f263])).
% 0.10/0.50 fof(f1179,plain,(
% 0.10/0.50 $false|~spl0_51),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1178,f91])).
% 0.10/0.50 fof(f1180,plain,(
% 0.10/0.50 ~spl0_51),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1179])).
% 0.10/0.50 fof(f1226,plain,(
% 0.10/0.50 gt(n0,n0)|~spl0_55),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1004,f264])).
% 0.10/0.50 fof(f1227,plain,(
% 0.10/0.50 $false|~spl0_55),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1226,f91])).
% 0.10/0.50 fof(f1228,plain,(
% 0.10/0.50 ~spl0_55),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1227])).
% 0.10/0.50 fof(f1255,plain,(
% 0.10/0.50 gt(n3,n3)|~spl0_60),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1027,f275])).
% 0.10/0.50 fof(f1256,plain,(
% 0.10/0.50 $false|~spl0_60),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1255,f91])).
% 0.10/0.50 fof(f1257,plain,(
% 0.10/0.50 ~spl0_60),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1256])).
% 0.10/0.50 fof(f1349,plain,(
% 0.10/0.50 gt(n2,n2)|~spl0_66),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1053,f272])).
% 0.10/0.50 fof(f1350,plain,(
% 0.10/0.50 $false|~spl0_66),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1349,f91])).
% 0.10/0.50 fof(f1351,plain,(
% 0.10/0.50 ~spl0_66),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1350])).
% 0.10/0.50 fof(f1394,plain,(
% 0.10/0.50 ~a_select2(tptp_update2(s_values7_init,pv1376,init),pv1376)=init|~spl0_28|spl0_4),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f794,f344])).
% 0.10/0.50 fof(f1395,plain,(
% 0.10/0.50 ~init=init|~spl0_28|spl0_4),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f233,f1394])).
% 0.10/0.50 fof(f1396,plain,(
% 0.10/0.50 $false|~spl0_28|spl0_4),
% 0.10/0.50 inference(trivial_equality_resolution,[status(esa)],[f1395])).
% 0.10/0.50 fof(f1397,plain,(
% 0.10/0.50 ~spl0_28|spl0_4),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1396])).
% 0.10/0.50 fof(f1449,plain,(
% 0.10/0.50 ![X0]: (~leq(n0,X0)|a_select2(s_values7_init,X0)=init|~gt(pv1376,X0))),
% 0.10/0.50 inference(resolution,[status(thm)],[f364,f111])).
% 0.10/0.50 fof(f1479,plain,(
% 0.10/0.50 spl0_84 <=> leq(succ(n0),n1)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1481,plain,(
% 0.10/0.50 ~leq(succ(n0),n1)|spl0_84),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1479])).
% 0.10/0.50 fof(f1502,plain,(
% 0.10/0.50 ~leq(n1,n1)|spl0_84),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f291,f1481])).
% 0.10/0.50 fof(f1503,plain,(
% 0.10/0.50 $false|spl0_84),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1502,f92])).
% 0.10/0.50 fof(f1504,plain,(
% 0.10/0.50 spl0_84),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1503])).
% 0.10/0.50 fof(f1569,plain,(
% 0.10/0.50 gt(n1,n1)|~spl0_52),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f985,f268])).
% 0.10/0.50 fof(f1570,plain,(
% 0.10/0.50 $false|~spl0_52),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1569,f91])).
% 0.10/0.50 fof(f1571,plain,(
% 0.10/0.50 ~spl0_52),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1570])).
% 0.10/0.50 fof(f1589,plain,(
% 0.10/0.50 spl0_93 <=> tptp_minus_1=n3),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1590,plain,(
% 0.10/0.50 tptp_minus_1=n3|~spl0_93),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1589])).
% 0.10/0.50 fof(f1600,plain,(
% 0.10/0.50 gt(tptp_minus_1,tptp_minus_1)|~spl0_93),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1590,f262])).
% 0.10/0.50 fof(f1601,plain,(
% 0.10/0.50 $false|~spl0_93),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1600,f91])).
% 0.10/0.50 fof(f1602,plain,(
% 0.10/0.50 ~spl0_93),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1601])).
% 0.10/0.50 fof(f1616,plain,(
% 0.10/0.50 ![X0]: (~leq(succ(X0),X0))),
% 0.10/0.50 inference(resolution,[status(thm)],[f117,f91])).
% 0.10/0.50 fof(f1685,plain,(
% 0.10/0.50 leq(tptp_minus_1,pv1376)),
% 0.10/0.50 inference(resolution,[status(thm)],[f379,f691])).
% 0.10/0.50 fof(f1745,plain,(
% 0.10/0.50 spl0_96 <=> leq(n2,n2)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1747,plain,(
% 0.10/0.50 ~leq(n2,n2)|spl0_96),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1745])).
% 0.10/0.50 fof(f1766,plain,(
% 0.10/0.50 spl0_101 <=> leq(n1,n2)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1768,plain,(
% 0.10/0.50 ~leq(n1,n2)|spl0_101),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1766])).
% 0.10/0.50 fof(f1772,plain,(
% 0.10/0.50 spl0_102 <=> leq(succ(n0),n2)),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1774,plain,(
% 0.10/0.50 ~leq(succ(n0),n2)|spl0_102),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1772])).
% 0.10/0.50 fof(f1783,plain,(
% 0.10/0.50 $false|spl0_96),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1747,f92])).
% 0.10/0.50 fof(f1784,plain,(
% 0.10/0.50 spl0_96),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1783])).
% 0.10/0.50 fof(f1785,plain,(
% 0.10/0.50 ~leq(n1,n2)|spl0_102),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f291,f1774])).
% 0.10/0.50 fof(f1786,plain,(
% 0.10/0.50 $false|spl0_102),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1785,f709])).
% 0.10/0.50 fof(f1787,plain,(
% 0.10/0.50 spl0_102),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1786])).
% 0.10/0.50 fof(f1788,plain,(
% 0.10/0.50 $false|spl0_101),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1768,f709])).
% 0.10/0.50 fof(f1789,plain,(
% 0.10/0.50 spl0_101),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1788])).
% 0.10/0.50 fof(f1854,plain,(
% 0.10/0.50 pred(n2)=n2|~spl0_68),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1061,f653])).
% 0.10/0.50 fof(f1855,plain,(
% 0.10/0.50 n1=n2|~spl0_68),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f386,f1854])).
% 0.10/0.50 fof(f1862,plain,(
% 0.10/0.50 gt(n2,n2)|~spl0_68),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1061,f274])).
% 0.10/0.50 fof(f1863,plain,(
% 0.10/0.50 gt(n1,n2)|~spl0_68),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f1855,f1862])).
% 0.10/0.50 fof(f1864,plain,(
% 0.10/0.50 gt(n1,n1)|~spl0_68),
% 0.10/0.50 inference(forward_demodulation,[status(thm)],[f1855,f1863])).
% 0.10/0.50 fof(f1865,plain,(
% 0.10/0.50 $false|~spl0_68),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f1864,f91])).
% 0.10/0.50 fof(f1866,plain,(
% 0.10/0.50 ~spl0_68),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f1865])).
% 0.10/0.50 fof(f1992,plain,(
% 0.10/0.50 spl0_106 <=> tptp_minus_1=n1),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f1993,plain,(
% 0.10/0.50 tptp_minus_1=n1|~spl0_106),
% 0.10/0.50 inference(component_clause,[status(thm)],[f1992])).
% 0.10/0.50 fof(f2003,plain,(
% 0.10/0.50 gt(tptp_minus_1,tptp_minus_1)|~spl0_106),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f1993,f260])).
% 0.10/0.50 fof(f2004,plain,(
% 0.10/0.50 $false|~spl0_106),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f2003,f91])).
% 0.10/0.50 fof(f2005,plain,(
% 0.10/0.50 ~spl0_106),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f2004])).
% 0.10/0.50 fof(f2022,plain,(
% 0.10/0.50 spl0_108 <=> tptp_minus_1=n4),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f2023,plain,(
% 0.10/0.50 tptp_minus_1=n4|~spl0_108),
% 0.10/0.50 inference(component_clause,[status(thm)],[f2022])).
% 0.10/0.50 fof(f2033,plain,(
% 0.10/0.50 gt(tptp_minus_1,tptp_minus_1)|~spl0_108),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f2023,f257])).
% 0.10/0.50 fof(f2034,plain,(
% 0.10/0.50 $false|~spl0_108),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f2033,f91])).
% 0.10/0.50 fof(f2035,plain,(
% 0.10/0.50 ~spl0_108),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f2034])).
% 0.10/0.50 fof(f2040,plain,(
% 0.10/0.50 ![X0]: (~leq(X0,pred(X0)))),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f212,f1616])).
% 0.10/0.50 fof(f2051,plain,(
% 0.10/0.50 spl0_110 <=> tptp_minus_1=n2),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f2052,plain,(
% 0.10/0.50 tptp_minus_1=n2|~spl0_110),
% 0.10/0.50 inference(component_clause,[status(thm)],[f2051])).
% 0.10/0.50 fof(f2062,plain,(
% 0.10/0.50 gt(tptp_minus_1,tptp_minus_1)|~spl0_110),
% 0.10/0.50 inference(backward_demodulation,[status(thm)],[f2052,f261])).
% 0.10/0.50 fof(f2063,plain,(
% 0.10/0.50 $false|~spl0_110),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f2062,f91])).
% 0.10/0.50 fof(f2064,plain,(
% 0.10/0.50 ~spl0_110),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f2063])).
% 0.10/0.50 fof(f2400,plain,(
% 0.10/0.50 spl0_120 <=> pred(tptp_minus_1)=pv1376),
% 0.10/0.50 introduced(split_symbol_definition)).
% 0.10/0.50 fof(f2401,plain,(
% 0.10/0.50 pred(tptp_minus_1)=pv1376|~spl0_120),
% 0.10/0.50 inference(component_clause,[status(thm)],[f2400])).
% 0.10/0.50 fof(f2775,plain,(
% 0.10/0.50 ~leq(tptp_minus_1,pv1376)|~spl0_120),
% 0.10/0.50 inference(paramodulation,[status(thm)],[f2401,f2040])).
% 0.10/0.50 fof(f2776,plain,(
% 0.10/0.50 $false|~spl0_120),
% 0.10/0.50 inference(forward_subsumption_resolution,[status(thm)],[f2775,f1685])).
% 0.10/0.50 fof(f2777,plain,(
% 0.10/0.50 ~spl0_120),
% 0.10/0.50 inference(contradiction_clause,[status(thm)],[f2776])).
% 0.10/0.52 fof(f2850,plain,(
% 0.10/0.52 ~leq(n0,sk0_24)|~gt(pv1376,sk0_24)|spl0_27),
% 0.10/0.52 inference(resolution,[status(thm)],[f792,f1449])).
% 0.10/0.52 fof(f2851,plain,(
% 0.10/0.52 ~spl0_2|~spl0_72|spl0_27),
% 0.10/0.52 inference(split_clause,[status(thm)],[f2850,f334,f1076,f790])).
% 0.10/0.52 fof(f2852,plain,(
% 0.10/0.52 $false),
% 0.10/0.52 inference(sat_refutation,[status(thm)],[f337,f341,f345,f376,f569,f765,f797,f846,f900,f924,f1080,f1180,f1228,f1257,f1351,f1397,f1504,f1571,f1602,f1784,f1787,f1789,f1866,f2005,f2035,f2064,f2777,f2851])).
% 0.10/0.52 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.52 % Elapsed time: 0.259416 seconds
% 0.10/0.52 % CPU time: 1.946120 seconds
% 0.10/0.52 % Total memory used: 86.797 MB
% 0.10/0.52 % Net memory used: 85.129 MB
%------------------------------------------------------------------------------