TSTP Solution File: SWV055+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV055+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 08:18:19 EST 2010
% Result : Theorem 2.36s
% Output : Solution 2.36s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP6389/SWV055+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6389/SWV055+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6389/SWV055+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 6485
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(4, axiom,![X1]:((leq(n0,X1)&leq(X1,n0))=>X1=n0),file('/tmp/SRASS.s.p', finite_domain_0)).
% fof(18, axiom,succ(succ(succ(succ(succ(n0)))))=n5,file('/tmp/SRASS.s.p', successor_5)).
% fof(20, axiom,succ(n0)=n1,file('/tmp/SRASS.s.p', successor_1)).
% fof(21, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(35, axiom,![X1]:![X2]:(gt(X2,X1)=>leq(X1,X2)),file('/tmp/SRASS.s.p', leq_gt1)).
% fof(40, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(51, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(52, axiom,gt(n0,tptp_minus_1),file('/tmp/SRASS.s.p', gt_0_tptp_minus_1)).
% fof(55, axiom,succ(succ(n0))=n2,file('/tmp/SRASS.s.p', successor_2)).
% fof(56, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(57, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(60, axiom,succ(succ(succ(succ(n0))))=n4,file('/tmp/SRASS.s.p', successor_4)).
% fof(61, axiom,succ(succ(succ(n0)))=n3,file('/tmp/SRASS.s.p', successor_3)).
% fof(62, axiom,![X1]:pred(succ(X1))=X1,file('/tmp/SRASS.s.p', pred_succ)).
% fof(69, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(80, axiom,![X1]:plus(X1,n2)=succ(succ(X1)),file('/tmp/SRASS.s.p', succ_plus_2_r)).
% fof(82, axiom,![X1]:plus(X1,n3)=succ(succ(succ(X1))),file('/tmp/SRASS.s.p', succ_plus_3_r)).
% fof(84, axiom,![X1]:plus(X1,n4)=succ(succ(succ(succ(X1)))),file('/tmp/SRASS.s.p', succ_plus_4_r)).
% fof(85, axiom,![X1]:plus(n4,X1)=succ(succ(succ(succ(X1)))),file('/tmp/SRASS.s.p', succ_plus_4_l)).
% fof(92, conjecture,(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X8]:![X12]:((leq(n0,X8)&leq(X8,minus(pv10,n1)))=>sum(n0,minus(n5,n1),a_select3(q,X8,X12))=n1))=>(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X18]:![X25]:((leq(n0,X18)&leq(X18,minus(n0,n1)))=>a_select3(q,pv10,X18)=divide(sqrt(times(minus(a_select3(center,X18,n0),a_select2(x,pv10)),minus(a_select3(center,X18,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X25,n0),a_select2(x,pv10)),minus(a_select3(center,X25,n0),a_select2(x,pv10))))))))&![X26]:![X27]:((leq(n0,X26)&leq(X26,minus(pv10,n1)))=>sum(n0,minus(n5,n1),a_select3(q,X26,X27))=n1))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0037)).
% fof(93, negated_conjecture,~((((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X8]:![X12]:((leq(n0,X8)&leq(X8,minus(pv10,n1)))=>sum(n0,minus(n5,n1),a_select3(q,X8,X12))=n1))=>(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X18]:![X25]:((leq(n0,X18)&leq(X18,minus(n0,n1)))=>a_select3(q,pv10,X18)=divide(sqrt(times(minus(a_select3(center,X18,n0),a_select2(x,pv10)),minus(a_select3(center,X18,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X25,n0),a_select2(x,pv10)),minus(a_select3(center,X25,n0),a_select2(x,pv10))))))))&![X26]:![X27]:((leq(n0,X26)&leq(X26,minus(pv10,n1)))=>sum(n0,minus(n5,n1),a_select3(q,X26,X27))=n1)))),inference(assume_negation,[status(cth)],[92])).
% fof(94, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[40,theory(equality)])).
% fof(99, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(100, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[99])).
% cnf(101,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[100])).
% fof(105, plain,![X1]:((~(leq(n0,X1))|~(leq(X1,n0)))|X1=n0),inference(fof_nnf,[status(thm)],[4])).
% fof(106, plain,![X2]:((~(leq(n0,X2))|~(leq(X2,n0)))|X2=n0),inference(variable_rename,[status(thm)],[105])).
% cnf(107,plain,(X1=n0|~leq(X1,n0)|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[106])).
% cnf(224,plain,(succ(succ(succ(succ(succ(n0)))))=n5),inference(split_conjunct,[status(thm)],[18])).
% cnf(226,plain,(succ(n0)=n1),inference(split_conjunct,[status(thm)],[20])).
% fof(227, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[21])).
% cnf(228,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[227])).
% fof(277, plain,![X1]:![X2]:(~(gt(X2,X1))|leq(X1,X2)),inference(fof_nnf,[status(thm)],[35])).
% fof(278, plain,![X3]:![X4]:(~(gt(X4,X3))|leq(X3,X4)),inference(variable_rename,[status(thm)],[277])).
% cnf(279,plain,(leq(X1,X2)|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[278])).
% fof(291, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[94])).
% cnf(292,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[291])).
% cnf(323,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[51])).
% cnf(324,plain,(gt(n0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(327,plain,(succ(succ(n0))=n2),inference(split_conjunct,[status(thm)],[55])).
% fof(328, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[56])).
% cnf(329,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[328])).
% fof(330, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[57])).
% cnf(331,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[330])).
% cnf(336,plain,(succ(succ(succ(succ(n0))))=n4),inference(split_conjunct,[status(thm)],[60])).
% cnf(337,plain,(succ(succ(succ(n0)))=n3),inference(split_conjunct,[status(thm)],[61])).
% fof(338, plain,![X2]:pred(succ(X2))=X2,inference(variable_rename,[status(thm)],[62])).
% cnf(339,plain,(pred(succ(X1))=X1),inference(split_conjunct,[status(thm)],[338])).
% fof(347, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[69])).
% fof(348, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[347])).
% cnf(350,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[348])).
% fof(367, plain,![X2]:plus(X2,n2)=succ(succ(X2)),inference(variable_rename,[status(thm)],[80])).
% cnf(368,plain,(plus(X1,n2)=succ(succ(X1))),inference(split_conjunct,[status(thm)],[367])).
% fof(371, plain,![X2]:plus(X2,n3)=succ(succ(succ(X2))),inference(variable_rename,[status(thm)],[82])).
% cnf(372,plain,(plus(X1,n3)=succ(succ(succ(X1)))),inference(split_conjunct,[status(thm)],[371])).
% fof(375, plain,![X2]:plus(X2,n4)=succ(succ(succ(succ(X2)))),inference(variable_rename,[status(thm)],[84])).
% cnf(376,plain,(plus(X1,n4)=succ(succ(succ(succ(X1))))),inference(split_conjunct,[status(thm)],[375])).
% fof(377, plain,![X2]:plus(n4,X2)=succ(succ(succ(succ(X2)))),inference(variable_rename,[status(thm)],[85])).
% cnf(378,plain,(plus(n4,X1)=succ(succ(succ(succ(X1))))),inference(split_conjunct,[status(thm)],[377])).
% fof(388, negated_conjecture,(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X8]:![X12]:((~(leq(n0,X8))|~(leq(X8,minus(pv10,n1))))|sum(n0,minus(n5,n1),a_select3(q,X8,X12))=n1))&(((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|?[X18]:?[X25]:((leq(n0,X18)&leq(X18,minus(n0,n1)))&~(a_select3(q,pv10,X18)=divide(sqrt(times(minus(a_select3(center,X18,n0),a_select2(x,pv10)),minus(a_select3(center,X18,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X25,n0),a_select2(x,pv10)),minus(a_select3(center,X25,n0),a_select2(x,pv10)))))))))|?[X26]:?[X27]:((leq(n0,X26)&leq(X26,minus(pv10,n1)))&~(sum(n0,minus(n5,n1),a_select3(q,X26,X27))=n1)))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X28]:![X29]:((~(leq(n0,X28))|~(leq(X28,minus(pv10,n1))))|sum(n0,minus(n5,n1),a_select3(q,X28,X29))=n1))&(((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|?[X30]:?[X31]:((leq(n0,X30)&leq(X30,minus(n0,n1)))&~(a_select3(q,pv10,X30)=divide(sqrt(times(minus(a_select3(center,X30,n0),a_select2(x,pv10)),minus(a_select3(center,X30,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X31,n0),a_select2(x,pv10)),minus(a_select3(center,X31,n0),a_select2(x,pv10)))))))))|?[X32]:?[X33]:((leq(n0,X32)&leq(X32,minus(pv10,n1)))&~(sum(n0,minus(n5,n1),a_select3(q,X32,X33))=n1)))),inference(variable_rename,[status(thm)],[388])).
% fof(390, negated_conjecture,(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&![X28]:![X29]:((~(leq(n0,X28))|~(leq(X28,minus(pv10,n1))))|sum(n0,minus(n5,n1),a_select3(q,X28,X29))=n1))&(((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|((leq(n0,esk24_0)&leq(esk24_0,minus(n0,n1)))&~(a_select3(q,pv10,esk24_0)=divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)))))))))|((leq(n0,esk26_0)&leq(esk26_0,minus(pv10,n1)))&~(sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))=n1)))),inference(skolemize,[status(esa)],[389])).
% fof(391, negated_conjecture,![X28]:![X29]:((((~(leq(n0,X28))|~(leq(X28,minus(pv10,n1))))|sum(n0,minus(n5,n1),a_select3(q,X28,X29))=n1)&(leq(n0,pv10)&leq(pv10,minus(n135300,n1))))&(((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|((leq(n0,esk24_0)&leq(esk24_0,minus(n0,n1)))&~(a_select3(q,pv10,esk24_0)=divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)))))))))|((leq(n0,esk26_0)&leq(esk26_0,minus(pv10,n1)))&~(sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))=n1)))),inference(shift_quantors,[status(thm)],[390])).
% fof(392, negated_conjecture,![X28]:![X29]:((((~(leq(n0,X28))|~(leq(X28,minus(pv10,n1))))|sum(n0,minus(n5,n1),a_select3(q,X28,X29))=n1)&(leq(n0,pv10)&leq(pv10,minus(n135300,n1))))&(((((leq(n0,esk26_0)|(leq(n0,esk24_0)|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))&(leq(esk26_0,minus(pv10,n1))|(leq(n0,esk24_0)|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1)))))))&(~(sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))=n1)|(leq(n0,esk24_0)|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1)))))))&(((leq(n0,esk26_0)|(leq(esk24_0,minus(n0,n1))|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))&(leq(esk26_0,minus(pv10,n1))|(leq(esk24_0,minus(n0,n1))|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1)))))))&(~(sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))=n1)|(leq(esk24_0,minus(n0,n1))|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))))&(((leq(n0,esk26_0)|(~(a_select3(q,pv10,esk24_0)=divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)))))))|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))&(leq(esk26_0,minus(pv10,n1))|(~(a_select3(q,pv10,esk24_0)=divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)))))))|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1)))))))&(~(sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))=n1)|(~(a_select3(q,pv10,esk24_0)=divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)))))))|(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))))),inference(distribute,[status(thm)],[391])).
% cnf(396,negated_conjecture,(leq(esk24_0,minus(n0,n1))|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1),inference(split_conjunct,[status(thm)],[392])).
% cnf(397,negated_conjecture,(leq(esk24_0,minus(n0,n1))|leq(esk26_0,minus(pv10,n1))|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)),inference(split_conjunct,[status(thm)],[392])).
% cnf(398,negated_conjecture,(leq(esk24_0,minus(n0,n1))|leq(n0,esk26_0)|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)),inference(split_conjunct,[status(thm)],[392])).
% cnf(399,negated_conjecture,(leq(n0,esk24_0)|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1),inference(split_conjunct,[status(thm)],[392])).
% cnf(400,negated_conjecture,(leq(n0,esk24_0)|leq(esk26_0,minus(pv10,n1))|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)),inference(split_conjunct,[status(thm)],[392])).
% cnf(401,negated_conjecture,(leq(n0,esk24_0)|leq(n0,esk26_0)|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)),inference(split_conjunct,[status(thm)],[392])).
% cnf(402,negated_conjecture,(leq(pv10,minus(n135300,n1))),inference(split_conjunct,[status(thm)],[392])).
% cnf(403,negated_conjecture,(leq(n0,pv10)),inference(split_conjunct,[status(thm)],[392])).
% cnf(404,negated_conjecture,(sum(n0,minus(n5,n1),a_select3(q,X1,X2))=n1|~leq(X1,minus(pv10,n1))|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[392])).
% cnf(435,plain,(minus(succ(X1),n1)=X1),inference(rw,[status(thm)],[339,228,theory(equality)]),['unfolding']).
% cnf(438,plain,(plus(n0,n1)=n1),inference(rw,[status(thm)],[226,329,theory(equality)]),['unfolding']).
% cnf(439,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[323,329,theory(equality)]),['unfolding']).
% cnf(441,plain,(minus(plus(X1,n1),n1)=X1),inference(rw,[status(thm)],[435,329,theory(equality)]),['unfolding']).
% cnf(442,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[331,329,theory(equality)]),['unfolding']).
% cnf(443,plain,(plus(plus(n0,n1),n1)=n2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[327,329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(445,plain,(plus(X1,n2)=plus(plus(X1,n1),n1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[368,329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(447,plain,(plus(plus(plus(n0,n1),n1),n1)=n3),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[337,329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(448,plain,(plus(plus(plus(X1,n1),n1),n1)=plus(X1,n3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[372,329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(450,plain,(plus(plus(plus(plus(n0,n1),n1),n1),n1)=n4),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[336,329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(451,plain,(plus(plus(plus(plus(X1,n1),n1),n1),n1)=plus(X1,n4)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[376,329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(452,plain,(plus(plus(plus(plus(X1,n1),n1),n1),n1)=plus(n4,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[378,329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(453,plain,(plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1)=n5),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[224,329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),329,theory(equality)]),['unfolding']).
% cnf(459,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[350,329,theory(equality)]),['unfolding']).
% cnf(463,negated_conjecture,(leq(n0,esk24_0)|leq(n0,esk26_0)|$false|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[401,403,theory(equality)])).
% cnf(464,negated_conjecture,(leq(n0,esk24_0)|leq(n0,esk26_0)|$false|$false),inference(rw,[status(thm)],[463,402,theory(equality)])).
% cnf(465,negated_conjecture,(leq(n0,esk24_0)|leq(n0,esk26_0)),inference(cn,[status(thm)],[464,theory(equality)])).
% cnf(467,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[439,442,theory(equality)])).
% cnf(468,plain,(plus(n1,n1)=n2),inference(rw,[status(thm)],[443,438,theory(equality)])).
% cnf(469,negated_conjecture,(leq(n0,esk24_0)|leq(esk26_0,minus(pv10,n1))|$false|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[400,403,theory(equality)])).
% cnf(470,negated_conjecture,(leq(n0,esk24_0)|leq(esk26_0,minus(pv10,n1))|$false|$false),inference(rw,[status(thm)],[469,402,theory(equality)])).
% cnf(471,negated_conjecture,(leq(n0,esk24_0)|leq(esk26_0,minus(pv10,n1))),inference(cn,[status(thm)],[470,theory(equality)])).
% cnf(472,negated_conjecture,(leq(n0,esk26_0)|leq(esk24_0,minus(n0,n1))|$false|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[398,403,theory(equality)])).
% cnf(473,negated_conjecture,(leq(n0,esk26_0)|leq(esk24_0,minus(n0,n1))|$false|$false),inference(rw,[status(thm)],[472,402,theory(equality)])).
% cnf(474,negated_conjecture,(leq(n0,esk26_0)|leq(esk24_0,minus(n0,n1))),inference(cn,[status(thm)],[473,theory(equality)])).
% cnf(475,negated_conjecture,(leq(esk24_0,minus(n0,n1))|leq(esk26_0,minus(pv10,n1))|$false|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[397,403,theory(equality)])).
% cnf(476,negated_conjecture,(leq(esk24_0,minus(n0,n1))|leq(esk26_0,minus(pv10,n1))|$false|$false),inference(rw,[status(thm)],[475,402,theory(equality)])).
% cnf(477,negated_conjecture,(leq(esk24_0,minus(n0,n1))|leq(esk26_0,minus(pv10,n1))),inference(cn,[status(thm)],[476,theory(equality)])).
% cnf(478,plain,(plus(n1,n2)=n3),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[447,438,theory(equality)]),468,theory(equality)]),442,theory(equality)])).
% cnf(479,plain,(plus(n1,plus(X1,n1))=plus(X1,n2)),inference(rw,[status(thm)],[445,442,theory(equality)])).
% cnf(481,negated_conjecture,(leq(n0,esk24_0)|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1|$false|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[399,403,theory(equality)])).
% cnf(482,negated_conjecture,(leq(n0,esk24_0)|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1|$false|$false),inference(rw,[status(thm)],[481,402,theory(equality)])).
% cnf(483,negated_conjecture,(leq(n0,esk24_0)|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1),inference(cn,[status(thm)],[482,theory(equality)])).
% cnf(484,negated_conjecture,(leq(esk24_0,minus(n0,n1))|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1|$false|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[396,403,theory(equality)])).
% cnf(485,negated_conjecture,(leq(esk24_0,minus(n0,n1))|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1|$false|$false),inference(rw,[status(thm)],[484,402,theory(equality)])).
% cnf(486,negated_conjecture,(leq(esk24_0,minus(n0,n1))|sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0))!=n1),inference(cn,[status(thm)],[485,theory(equality)])).
% cnf(487,plain,(plus(n1,n3)=n4),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[450,438,theory(equality)]),468,theory(equality)]),442,theory(equality)]),478,theory(equality)]),442,theory(equality)])).
% cnf(488,plain,(plus(n1,plus(X1,n2))=plus(X1,n3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[448,442,theory(equality)]),479,theory(equality)]),442,theory(equality)])).
% cnf(490,plain,(plus(n1,n4)=n5),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[453,438,theory(equality)]),468,theory(equality)]),442,theory(equality)]),478,theory(equality)]),442,theory(equality)]),487,theory(equality)]),442,theory(equality)])).
% cnf(491,plain,(plus(n1,plus(X1,n3))=plus(X1,n4)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[451,442,theory(equality)]),479,theory(equality)]),442,theory(equality)]),488,theory(equality)]),442,theory(equality)])).
% cnf(492,plain,(plus(X1,n4)=plus(n4,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[452,442,theory(equality)]),479,theory(equality)]),442,theory(equality)]),488,theory(equality)]),442,theory(equality)]),491,theory(equality)])).
% cnf(539,plain,(leq(tptp_minus_1,n0)),inference(spm,[status(thm)],[279,324,theory(equality)])).
% cnf(544,plain,(minus(plus(n1,X1),n1)=X1),inference(spm,[status(thm)],[441,442,theory(equality)])).
% cnf(595,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[292,459,theory(equality)])).
% cnf(707,plain,(minus(plus(n1,n4),n1)=n4),inference(spm,[status(thm)],[441,492,theory(equality)])).
% cnf(718,plain,(minus(n5,n1)=n4),inference(rw,[status(thm)],[707,490,theory(equality)])).
% cnf(5827,plain,(~leq(plus(n1,X1),X1)),inference(spm,[status(thm)],[595,442,theory(equality)])).
% cnf(7236,plain,(~leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[5827,467,theory(equality)])).
% cnf(10632,plain,(leq(X1,n0)|~leq(X1,tptp_minus_1)),inference(spm,[status(thm)],[101,539,theory(equality)])).
% cnf(10987,negated_conjecture,(leq(esk24_0,minus(n0,n1))|sum(n0,n4,a_select3(q,esk26_0,esk27_0))!=n1),inference(rw,[status(thm)],[486,718,theory(equality)])).
% cnf(10988,negated_conjecture,(leq(n0,esk24_0)|sum(n0,n4,a_select3(q,esk26_0,esk27_0))!=n1),inference(rw,[status(thm)],[483,718,theory(equality)])).
% cnf(10989,negated_conjecture,(sum(n0,n4,a_select3(q,X1,X2))=n1|~leq(X1,minus(pv10,n1))|~leq(n0,X1)),inference(rw,[status(thm)],[404,718,theory(equality)])).
% cnf(11299,negated_conjecture,(leq(n0,esk24_0)|~leq(esk26_0,minus(pv10,n1))|~leq(n0,esk26_0)),inference(spm,[status(thm)],[10988,10989,theory(equality)])).
% cnf(11575,plain,(minus(n0,n1)=tptp_minus_1),inference(spm,[status(thm)],[544,467,theory(equality)])).
% cnf(11589,negated_conjecture,(leq(esk24_0,tptp_minus_1)|sum(n0,n4,a_select3(q,esk26_0,esk27_0))!=n1),inference(rw,[status(thm)],[10987,11575,theory(equality)])).
% cnf(11590,negated_conjecture,(leq(esk24_0,tptp_minus_1)|leq(esk26_0,minus(pv10,n1))),inference(rw,[status(thm)],[477,11575,theory(equality)])).
% cnf(11591,negated_conjecture,(leq(esk24_0,tptp_minus_1)|leq(n0,esk26_0)),inference(rw,[status(thm)],[474,11575,theory(equality)])).
% cnf(11846,negated_conjecture,(leq(esk24_0,tptp_minus_1)|~leq(esk26_0,minus(pv10,n1))|~leq(n0,esk26_0)),inference(spm,[status(thm)],[11589,10989,theory(equality)])).
% cnf(20230,negated_conjecture,(leq(n0,esk24_0)|~leq(esk26_0,minus(pv10,n1))),inference(csr,[status(thm)],[11299,465])).
% cnf(20231,negated_conjecture,(leq(n0,esk24_0)),inference(csr,[status(thm)],[20230,471])).
% cnf(25803,negated_conjecture,(leq(esk24_0,tptp_minus_1)|~leq(esk26_0,minus(pv10,n1))),inference(csr,[status(thm)],[11846,11591])).
% cnf(25804,negated_conjecture,(leq(esk24_0,tptp_minus_1)),inference(csr,[status(thm)],[25803,11590])).
% cnf(25893,negated_conjecture,(leq(esk24_0,n0)),inference(spm,[status(thm)],[10632,25804,theory(equality)])).
% cnf(27464,negated_conjecture,(n0=esk24_0|~leq(n0,esk24_0)),inference(spm,[status(thm)],[107,25893,theory(equality)])).
% cnf(27625,negated_conjecture,(n0=esk24_0|$false),inference(rw,[status(thm)],[27464,20231,theory(equality)])).
% cnf(27626,negated_conjecture,(n0=esk24_0),inference(cn,[status(thm)],[27625,theory(equality)])).
% cnf(27643,negated_conjecture,(leq(n0,tptp_minus_1)),inference(rw,[status(thm)],[25804,27626,theory(equality)])).
% cnf(27644,negated_conjecture,($false),inference(sr,[status(thm)],[27643,7236,theory(equality)])).
% cnf(27645,negated_conjecture,($false),27644,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1212
% # ...of these trivial : 23
% # ...subsumed : 438
% # ...remaining for further processing: 751
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 69
% # Generated clauses : 17022
% # ...of the previous two non-trivial : 16469
% # Contextual simplify-reflections : 16
% # Paramodulations : 17009
% # Factorizations : 4
% # Equation resolutions : 9
% # Current number of processed clauses: 456
% # Positive orientable unit clauses: 133
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 80
% # Non-unit-clauses : 238
% # Current number of unprocessed clauses: 11725
% # ...number of literals in the above : 70187
% # Clause-clause subsumption calls (NU) : 6691
% # Rec. Clause-clause subsumption calls : 2676
% # Unit Clause-clause subsumption calls : 462
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 46
% # Indexed BW rewrite successes : 42
% # Backwards rewriting index: 450 leaves, 1.18+/-1.144 terms/leaf
% # Paramod-from index: 195 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-into index: 345 leaves, 1.10+/-0.520 terms/leaf
% # -------------------------------------------------
% # User time : 0.777 s
% # System time : 0.025 s
% # Total time : 0.802 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.31 CPU 1.39 WC
% FINAL PrfWatch: 1.31 CPU 1.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP6389/SWV055+1.tptp
%
%------------------------------------------------------------------------------