%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC153+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 07:11:20 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP16352/SWC153+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16352/SWC153+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16352/SWC153+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 16448
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.037 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(12, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>((leq(X1,X2)&leq(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax29)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X4=X2)|~(X3=X1))|?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(((ssList(X9)&app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X3)&leq(X6,X5))&(~(leq(X5,X6))|?[X10]:((ssItem(X10)&memberP(X8,X10))&(~(leq(X5,X10))|~(leq(X10,X6)))))))))))|![X11]:(ssItem(X11)=>![X12]:(ssItem(X12)=>![X13]:(ssList(X13)=>![X14]:(ssList(X14)=>![X15]:(ssList(X15)=>((~(app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15)=X1)|~(leq(X12,X11)))|(![X16]:(ssItem(X16)=>(~(memberP(X14,X16))|(leq(X16,X12)&leq(X11,X16))))&leq(X11,X12))))))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X4=X2)|~(X3=X1))|?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(((ssList(X9)&app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X3)&leq(X6,X5))&(~(leq(X5,X6))|?[X10]:((ssItem(X10)&memberP(X8,X10))&(~(leq(X5,X10))|~(leq(X10,X6)))))))))))|![X11]:(ssItem(X11)=>![X12]:(ssItem(X12)=>![X13]:(ssList(X13)=>![X14]:(ssList(X14)=>![X15]:(ssList(X15)=>((~(app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15)=X1)|~(leq(X12,X11)))|(![X16]:(ssItem(X16)=>(~(memberP(X14,X16))|(leq(X16,X12)&leq(X11,X16))))&leq(X11,X12)))))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X4=X2)|~(X3=X1))|?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(((ssList(X9)&app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X3)&leq(X6,X5))&(~(leq(X5,X6))|?[X10]:((ssItem(X10)&memberP(X8,X10))&(~(leq(X5,X10))|~(leq(X10,X6)))))))))))|![X11]:(ssItem(X11)=>![X12]:(ssItem(X12)=>![X13]:(ssList(X13)=>![X14]:(ssList(X14)=>![X15]:(ssList(X15)=>((~(app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15)=X1)|~(leq(X12,X11)))|(![X16]:(ssItem(X16)=>(~(memberP(X14,X16))|(leq(X16,X12)&leq(X11,X16))))&leq(X11,X12)))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(155, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(leq(X1,X2))|~(leq(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(156, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X3]:![X4]:((~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[156])).
% cnf(158,plain,(X1=X2|~ssItem(X1)|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[157])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X4=X2&X3=X1)&![X5]:(~(ssItem(X5))|![X6]:(~(ssItem(X6))|![X7]:(~(ssList(X7))|![X8]:(~(ssList(X8))|![X9]:(((~(ssList(X9))|~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X3))|~(leq(X6,X5)))|(leq(X5,X6)&![X10]:((~(ssItem(X10))|~(memberP(X8,X10)))|(leq(X5,X10)&leq(X10,X6))))))))))&?[X11]:(ssItem(X11)&?[X12]:(ssItem(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&((app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15)=X1&leq(X12,X11))&(?[X16]:(ssItem(X16)&(memberP(X14,X16)&(~(leq(X16,X12))|~(leq(X11,X16)))))|~(leq(X11,X12)))))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(((X20=X18&X19=X17)&![X21]:(~(ssItem(X21))|![X22]:(~(ssItem(X22))|![X23]:(~(ssList(X23))|![X24]:(~(ssList(X24))|![X25]:(((~(ssList(X25))|~(app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25)=X19))|~(leq(X22,X21)))|(leq(X21,X22)&![X26]:((~(ssItem(X26))|~(memberP(X24,X26)))|(leq(X21,X26)&leq(X26,X22))))))))))&?[X27]:(ssItem(X27)&?[X28]:(ssItem(X28)&?[X29]:(ssList(X29)&?[X30]:(ssList(X30)&?[X31]:(ssList(X31)&((app(app(app(app(X29,cons(X27,nil)),X30),cons(X28,nil)),X31)=X17&leq(X28,X27))&(?[X32]:(ssItem(X32)&(memberP(X30,X32)&(~(leq(X32,X28))|~(leq(X27,X32)))))|~(leq(X27,X28)))))))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk51_0=esk49_0&esk50_0=esk48_0)&![X21]:(~(ssItem(X21))|![X22]:(~(ssItem(X22))|![X23]:(~(ssList(X23))|![X24]:(~(ssList(X24))|![X25]:(((~(ssList(X25))|~(app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25)=esk50_0))|~(leq(X22,X21)))|(leq(X21,X22)&![X26]:((~(ssItem(X26))|~(memberP(X24,X26)))|(leq(X21,X26)&leq(X26,X22))))))))))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&((app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0&leq(esk53_0,esk52_0))&((ssItem(esk57_0)&(memberP(esk55_0,esk57_0)&(~(leq(esk57_0,esk53_0))|~(leq(esk52_0,esk57_0)))))|~(leq(esk52_0,esk53_0)))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:((((((((((((((~(ssItem(X26))|~(memberP(X24,X26)))|(leq(X21,X26)&leq(X26,X22)))&leq(X21,X22))|((~(ssList(X25))|~(app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25)=esk50_0))|~(leq(X22,X21))))|~(ssList(X24)))|~(ssList(X23)))|~(ssItem(X22)))|~(ssItem(X21)))&(esk51_0=esk49_0&esk50_0=esk48_0))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&((app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0&leq(esk53_0,esk52_0))&((ssItem(esk57_0)&(memberP(esk55_0,esk57_0)&(~(leq(esk57_0,esk53_0))|~(leq(esk52_0,esk57_0)))))|~(leq(esk52_0,esk53_0))))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:((((((((((((((leq(X21,X26)|(~(ssItem(X26))|~(memberP(X24,X26))))|((~(ssList(X25))|~(app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25)=esk50_0))|~(leq(X22,X21))))|~(ssList(X24)))|~(ssList(X23)))|~(ssItem(X22)))|~(ssItem(X21)))&((((((leq(X26,X22)|(~(ssItem(X26))|~(memberP(X24,X26))))|((~(ssList(X25))|~(app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25)=esk50_0))|~(leq(X22,X21))))|~(ssList(X24)))|~(ssList(X23)))|~(ssItem(X22)))|~(ssItem(X21))))&(((((leq(X21,X22)|((~(ssList(X25))|~(app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25)=esk50_0))|~(leq(X22,X21))))|~(ssList(X24)))|~(ssList(X23)))|~(ssItem(X22)))|~(ssItem(X21))))&(esk51_0=esk49_0&esk50_0=esk48_0))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&((app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0&leq(esk53_0,esk52_0))&((ssItem(esk57_0)|~(leq(esk52_0,esk53_0)))&((memberP(esk55_0,esk57_0)|~(leq(esk52_0,esk53_0)))&((~(leq(esk57_0,esk53_0))|~(leq(esk52_0,esk57_0)))|~(leq(esk52_0,esk53_0))))))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~leq(esk52_0,esk53_0)|~leq(esk52_0,esk57_0)|~leq(esk57_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(memberP(esk55_0,esk57_0)|~leq(esk52_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(ssItem(esk57_0)|~leq(esk52_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(leq(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(esk50_0=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(leq(X1,X2)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~ssList(X4)|~leq(X2,X1)|app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5)!=esk50_0|~ssList(X5)),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(leq(X6,X2)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~ssList(X4)|~leq(X2,X1)|app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5)!=esk50_0|~ssList(X5)|~memberP(X4,X6)|~ssItem(X6)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(leq(X1,X6)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~ssList(X4)|~leq(X2,X1)|app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5)!=esk50_0|~ssList(X5)|~memberP(X4,X6)|~ssItem(X6)),inference(split_conjunct,[status(thm)],[572])).
% cnf(596,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(rw,[status(thm)],[581,587,theory(equality)])).
% cnf(1054,negated_conjecture,(leq(esk52_0,esk53_0)|~leq(esk53_0,esk52_0)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[589,596,theory(equality)])).
% cnf(1065,negated_conjecture,(leq(esk52_0,esk53_0)|$false|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1054,580,theory(equality)])).
% cnf(1066,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1065,582,theory(equality)])).
% cnf(1067,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false|$false|~ssList(esk54_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1066,583,theory(equality)])).
% cnf(1068,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false|$false|$false|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1067,584,theory(equality)])).
% cnf(1069,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false|$false|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1068,585,theory(equality)])).
% cnf(1070,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false|$false|$false|$false|$false),inference(rw,[status(thm)],[1069,586,theory(equality)])).
% cnf(1071,negated_conjecture,(leq(esk52_0,esk53_0)),inference(cn,[status(thm)],[1070,theory(equality)])).
% cnf(1468,negated_conjecture,(esk53_0=esk52_0|~leq(esk53_0,esk52_0)|~ssItem(esk52_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[158,1071,theory(equality)])).
% cnf(1472,negated_conjecture,($false|~leq(esk52_0,esk57_0)|~leq(esk57_0,esk53_0)),inference(rw,[status(thm)],[577,1071,theory(equality)])).
% cnf(1473,negated_conjecture,(~leq(esk52_0,esk57_0)|~leq(esk57_0,esk53_0)),inference(cn,[status(thm)],[1472,theory(equality)])).
% cnf(1474,negated_conjecture,(memberP(esk55_0,esk57_0)|$false),inference(rw,[status(thm)],[578,1071,theory(equality)])).
% cnf(1475,negated_conjecture,(memberP(esk55_0,esk57_0)),inference(cn,[status(thm)],[1474,theory(equality)])).
% cnf(1476,negated_conjecture,(ssItem(esk57_0)|$false),inference(rw,[status(thm)],[579,1071,theory(equality)])).
% cnf(1477,negated_conjecture,(ssItem(esk57_0)),inference(cn,[status(thm)],[1476,theory(equality)])).
% cnf(1481,negated_conjecture,(esk53_0=esk52_0|$false|~ssItem(esk52_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[1468,580,theory(equality)])).
% cnf(1482,negated_conjecture,(esk53_0=esk52_0|$false|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1481,586,theory(equality)])).
% cnf(1483,negated_conjecture,(esk53_0=esk52_0|$false|$false|$false),inference(rw,[status(thm)],[1482,585,theory(equality)])).
% cnf(1484,negated_conjecture,(esk53_0=esk52_0),inference(cn,[status(thm)],[1483,theory(equality)])).
% cnf(1506,negated_conjecture,(leq(esk52_0,esk52_0)),inference(rw,[status(thm)],[1071,1484,theory(equality)])).
% cnf(1507,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk52_0,nil)),esk56_0)=esk50_0),inference(rw,[status(thm)],[596,1484,theory(equality)])).
% cnf(1544,negated_conjecture,(~leq(esk52_0,esk57_0)|~leq(esk57_0,esk52_0)),inference(rw,[status(thm)],[1473,1484,theory(equality)])).
% cnf(1738,negated_conjecture,(leq(X1,esk52_0)|~leq(esk52_0,esk52_0)|~memberP(esk55_0,X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[590,1507,theory(equality)])).
% cnf(1739,negated_conjecture,(leq(esk52_0,X1)|~leq(esk52_0,esk52_0)|~memberP(esk55_0,X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[591,1507,theory(equality)])).
% cnf(1791,negated_conjecture,(leq(X1,esk52_0)|$false|~memberP(esk55_0,X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1738,1506,theory(equality)])).
% cnf(1792,negated_conjecture,(leq(X1,esk52_0)|$false|~memberP(esk55_0,X1)|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1791,582,theory(equality)])).
% cnf(1793,negated_conjecture,(leq(X1,esk52_0)|$false|~memberP(esk55_0,X1)|$false|$false|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1792,583,theory(equality)])).
% cnf(1794,negated_conjecture,(leq(X1,esk52_0)|$false|~memberP(esk55_0,X1)|$false|$false|$false|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1793,584,theory(equality)])).
% cnf(1795,negated_conjecture,(leq(X1,esk52_0)|$false|~memberP(esk55_0,X1)|$false|$false|$false|~ssItem(X1)|$false),inference(rw,[status(thm)],[1794,586,theory(equality)])).
% cnf(1796,negated_conjecture,(leq(X1,esk52_0)|~memberP(esk55_0,X1)|~ssItem(X1)),inference(cn,[status(thm)],[1795,theory(equality)])).
% cnf(1797,negated_conjecture,(leq(esk52_0,X1)|$false|~memberP(esk55_0,X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1739,1506,theory(equality)])).
% cnf(1798,negated_conjecture,(leq(esk52_0,X1)|$false|~memberP(esk55_0,X1)|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1797,582,theory(equality)])).
% cnf(1799,negated_conjecture,(leq(esk52_0,X1)|$false|~memberP(esk55_0,X1)|$false|$false|~ssList(esk54_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1798,583,theory(equality)])).
% cnf(1800,negated_conjecture,(leq(esk52_0,X1)|$false|~memberP(esk55_0,X1)|$false|$false|$false|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1799,584,theory(equality)])).
% cnf(1801,negated_conjecture,(leq(esk52_0,X1)|$false|~memberP(esk55_0,X1)|$false|$false|$false|~ssItem(X1)|$false),inference(rw,[status(thm)],[1800,586,theory(equality)])).
% cnf(1802,negated_conjecture,(leq(esk52_0,X1)|~memberP(esk55_0,X1)|~ssItem(X1)),inference(cn,[status(thm)],[1801,theory(equality)])).
% cnf(6998,negated_conjecture,(leq(esk57_0,esk52_0)|~ssItem(esk57_0)),inference(spm,[status(thm)],[1796,1475,theory(equality)])).
% cnf(6999,negated_conjecture,(leq(esk57_0,esk52_0)|$false),inference(rw,[status(thm)],[6998,1477,theory(equality)])).
% cnf(7000,negated_conjecture,(leq(esk57_0,esk52_0)),inference(cn,[status(thm)],[6999,theory(equality)])).
% cnf(7006,negated_conjecture,(~leq(esk52_0,esk57_0)|$false),inference(rw,[status(thm)],[1544,7000,theory(equality)])).
% cnf(7007,negated_conjecture,(~leq(esk52_0,esk57_0)),inference(cn,[status(thm)],[7006,theory(equality)])).
% cnf(7069,negated_conjecture,(leq(esk52_0,esk57_0)|~ssItem(esk57_0)),inference(spm,[status(thm)],[1802,1475,theory(equality)])).
% cnf(7070,negated_conjecture,(leq(esk52_0,esk57_0)|$false),inference(rw,[status(thm)],[7069,1477,theory(equality)])).
% cnf(7071,negated_conjecture,(leq(esk52_0,esk57_0)),inference(cn,[status(thm)],[7070,theory(equality)])).
% cnf(7072,negated_conjecture,($false),inference(sr,[status(thm)],[7071,7007,theory(equality)])).
% cnf(7073,negated_conjecture,($false),7072,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 698
% # ...of these trivial : 15
% # ...subsumed : 87
% # ...remaining for further processing: 596
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 18
% # Backward-rewritten : 78
% # Generated clauses : 2445
% # ...of the previous two non-trivial : 2138
% # Contextual simplify-reflections : 45
% # Paramodulations : 2352
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 494
% # Positive orientable unit clauses: 97
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 394
% # Current number of unprocessed clauses: 1545
% # ...number of literals in the above : 8956
% # Clause-clause subsumption calls (NU) : 12840
% # Rec. Clause-clause subsumption calls : 9984
% # Unit Clause-clause subsumption calls : 124
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 232
% # Indexed BW rewrite successes : 42
% # Backwards rewriting index: 382 leaves, 1.60+/-1.762 terms/leaf
% # Paramod-from index: 164 leaves, 1.23+/-1.129 terms/leaf
% # Paramod-into index: 346 leaves, 1.48+/-1.638 terms/leaf
% # -------------------------------------------------
% # User time : 0.208 s
% # System time : 0.008 s
% # Total time : 0.216 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.41 CPU 0.49 WC
% FINAL PrfWatch: 0.41 CPU 0.49 WC
% SZS output end Solution for /tmp/SystemOnTPTP16352/SWC153+1.tptp
%
%------------------------------------------------------------------------------