TSTP Solution File: SWC302+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC302+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 : art07.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:44:10 EST 2010
% Result : Theorem 1.51s
% Output : Solution 1.51s
% 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/SystemOnTPTP14895/SWC302+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14895/SWC302+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14895/SWC302+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 14991
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(12, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),file('/tmp/SRASS.s.p', ax33)).
% fof(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(25, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(29, axiom,![X1]:(ssList(X1)=>(totalorderedP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1=>leq(X2,X3))))))))),file('/tmp/SRASS.s.p', ax11)).
% fof(45, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)<=>(~(X1=X2)&leq(X1,X2))))),file('/tmp/SRASS.s.p', ax93)).
% fof(70, 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)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|![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)=X1)|~(lt(X6,X5))))))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|![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)=X1)|~(lt(X6,X5)))))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|![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)=X1)|~(lt(X6,X5)))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[119])).
% cnf(121,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(144, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(145, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[144])).
% fof(146, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[145])).
% cnf(147,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[146])).
% fof(155, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(lt(X1,X2))|~(lt(X2,X1))))),inference(fof_nnf,[status(thm)],[98])).
% fof(156, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X3]:![X4]:((~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[156])).
% cnf(158,plain,(~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[157])).
% fof(198, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(199, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[198])).
% fof(200, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[199])).
% cnf(201,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[200])).
% fof(202, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[25])).
% fof(203, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[202])).
% fof(204, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[203])).
% cnf(205,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[204])).
% fof(219, plain,![X1]:(~(ssList(X1))|((~(totalorderedP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1)|leq(X2,X3))))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1&~(leq(X2,X3))))))))|totalorderedP(X1)))),inference(fof_nnf,[status(thm)],[29])).
% fof(220, plain,![X7]:(~(ssList(X7))|((~(totalorderedP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|leq(X8,X9))))))))&(?[X13]:(ssItem(X13)&?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(app(app(X15,cons(X13,X16)),cons(X14,X17))=X7&~(leq(X13,X14))))))))|totalorderedP(X7)))),inference(variable_rename,[status(thm)],[219])).
% fof(221, plain,![X7]:(~(ssList(X7))|((~(totalorderedP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|leq(X8,X9))))))))&((ssItem(esk7_1(X7))&(ssItem(esk8_1(X7))&(ssList(esk9_1(X7))&(ssList(esk10_1(X7))&(ssList(esk11_1(X7))&(app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7)))=X7&~(leq(esk7_1(X7),esk8_1(X7)))))))))|totalorderedP(X7)))),inference(skolemize,[status(esa)],[220])).
% fof(222, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|leq(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(totalorderedP(X7)))&((ssItem(esk7_1(X7))&(ssItem(esk8_1(X7))&(ssList(esk9_1(X7))&(ssList(esk10_1(X7))&(ssList(esk11_1(X7))&(app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7)))=X7&~(leq(esk7_1(X7),esk8_1(X7)))))))))|totalorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[221])).
% fof(223, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|leq(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(totalorderedP(X7)))|~(ssList(X7)))&(((ssItem(esk7_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssItem(esk8_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk9_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk10_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk11_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7)))=X7|totalorderedP(X7))|~(ssList(X7)))&((~(leq(esk7_1(X7),esk8_1(X7)))|totalorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[222])).
% cnf(231,plain,(leq(X2,X3)|~ssList(X1)|~totalorderedP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|~ssList(X5)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssList(X6)),inference(split_conjunct,[status(thm)],[223])).
% fof(344, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(lt(X1,X2))|(~(X1=X2)&leq(X1,X2)))&((X1=X2|~(leq(X1,X2)))|lt(X1,X2))))),inference(fof_nnf,[status(thm)],[45])).
% fof(345, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(lt(X3,X4))|(~(X3=X4)&leq(X3,X4)))&((X3=X4|~(leq(X3,X4)))|lt(X3,X4))))),inference(variable_rename,[status(thm)],[344])).
% fof(346, plain,![X3]:![X4]:((~(ssItem(X4))|((~(lt(X3,X4))|(~(X3=X4)&leq(X3,X4)))&((X3=X4|~(leq(X3,X4)))|lt(X3,X4))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[345])).
% fof(347, plain,![X3]:![X4]:(((((~(X3=X4)|~(lt(X3,X4)))|~(ssItem(X4)))|~(ssItem(X3)))&(((leq(X3,X4)|~(lt(X3,X4)))|~(ssItem(X4)))|~(ssItem(X3))))&((((X3=X4|~(leq(X3,X4)))|lt(X3,X4))|~(ssItem(X4)))|~(ssItem(X3)))),inference(distribute,[status(thm)],[346])).
% cnf(349,plain,(leq(X1,X2)|~ssItem(X1)|~ssItem(X2)|~lt(X1,X2)),inference(split_conjunct,[status(thm)],[347])).
% fof(484, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(leq(X1,X2))|~(leq(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[70])).
% fof(485, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[484])).
% fof(486, plain,![X3]:![X4]:((~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[485])).
% cnf(487,plain,(X1=X2|~ssItem(X1)|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[486])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&segmentP(X4,X3))&totalorderedP(X3))&?[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)=X1<(X6,X5)))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&segmentP(X13,X12))&totalorderedP(X12))&?[X14]:(ssItem(X14)&?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&(app(app(app(app(X16,cons(X14,nil)),X17),cons(X15,nil)),X18)=X10<(X15,X14)))))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&segmentP(esk51_0,esk50_0))&totalorderedP(esk50_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<(esk53_0,esk52_0)))))))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(lt(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,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)],[570])).
% cnf(573,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(totalorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(586,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[585,580,theory(equality)])).
% cnf(590,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)],[572,580,theory(equality)])).
% cnf(625,negated_conjecture,(~lt(esk52_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[158,571,theory(equality)])).
% cnf(626,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[625,576,theory(equality)])).
% cnf(627,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[626,577,theory(equality)])).
% cnf(628,negated_conjecture,(~lt(esk52_0,esk53_0)),inference(cn,[status(thm)],[627,theory(equality)])).
% cnf(672,negated_conjecture,(leq(esk53_0,esk52_0)|~ssItem(esk52_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[349,571,theory(equality)])).
% cnf(673,negated_conjecture,(leq(esk53_0,esk52_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[672,577,theory(equality)])).
% cnf(674,negated_conjecture,(leq(esk53_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[673,576,theory(equality)])).
% cnf(675,negated_conjecture,(leq(esk53_0,esk52_0)),inference(cn,[status(thm)],[674,theory(equality)])).
% cnf(921,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[590,205,theory(equality)])).
% cnf(932,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(rw,[status(thm)],[921,574,theory(equality)])).
% cnf(933,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[932,575,theory(equality)])).
% cnf(934,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[933,theory(equality)])).
% cnf(1434,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[487,675,theory(equality)])).
% cnf(1441,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1434,576,theory(equality)])).
% cnf(1442,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[1441,577,theory(equality)])).
% cnf(1443,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)),inference(cn,[status(thm)],[1442,theory(equality)])).
% cnf(1619,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[934,121,theory(equality)])).
% cnf(1620,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1619,122,theory(equality)])).
% cnf(1621,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1620,577,theory(equality)])).
% cnf(1622,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(cn,[status(thm)],[1621,theory(equality)])).
% cnf(1640,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1622,201,theory(equality)])).
% cnf(1680,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1640,574,theory(equality)])).
% cnf(1681,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1680,577,theory(equality)])).
% cnf(1682,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(cn,[status(thm)],[1681,theory(equality)])).
% cnf(1699,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(esk56_0)|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(spm,[status(thm)],[205,1682,theory(equality)])).
% cnf(1731,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|$false|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(rw,[status(thm)],[1699,573,theory(equality)])).
% cnf(1732,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[1731,theory(equality)])).
% cnf(2504,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1732,121,theory(equality)])).
% cnf(2505,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2504,122,theory(equality)])).
% cnf(2506,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|$false),inference(rw,[status(thm)],[2505,576,theory(equality)])).
% cnf(2507,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[2506,theory(equality)])).
% cnf(2508,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))|~ssList(esk54_0)),inference(spm,[status(thm)],[2507,147,theory(equality)])).
% cnf(2509,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))|$false),inference(rw,[status(thm)],[2508,575,theory(equality)])).
% cnf(2510,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))),inference(cn,[status(thm)],[2509,theory(equality)])).
% cnf(2511,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2510,121,theory(equality)])).
% cnf(2512,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2511,574,theory(equality)])).
% cnf(2513,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2512,577,theory(equality)])).
% cnf(2514,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0),inference(cn,[status(thm)],[2513,theory(equality)])).
% cnf(2532,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2514,201,theory(equality)])).
% cnf(2545,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2532,573,theory(equality)])).
% cnf(2546,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2545,576,theory(equality)])).
% cnf(2547,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0),inference(cn,[status(thm)],[2546,theory(equality)])).
% cnf(2571,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[231,2547,theory(equality)])).
% cnf(2606,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2571,573,theory(equality)])).
% cnf(2607,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2606,574,theory(equality)])).
% cnf(2608,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2607,575,theory(equality)])).
% cnf(2609,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2608,576,theory(equality)])).
% cnf(2610,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2609,577,theory(equality)])).
% cnf(2611,negated_conjecture,(leq(esk52_0,esk53_0)|esk50_0!=X1|~totalorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2610,theory(equality)])).
% cnf(6684,negated_conjecture,(leq(esk52_0,esk53_0)|~totalorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2611,theory(equality)])).
% cnf(6685,negated_conjecture,(leq(esk52_0,esk53_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[6684,578,theory(equality)])).
% cnf(6686,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[6685,586,theory(equality)])).
% cnf(6687,negated_conjecture,(leq(esk52_0,esk53_0)),inference(cn,[status(thm)],[6686,theory(equality)])).
% cnf(6694,negated_conjecture,(esk53_0=esk52_0|$false),inference(rw,[status(thm)],[1443,6687,theory(equality)])).
% cnf(6695,negated_conjecture,(esk53_0=esk52_0),inference(cn,[status(thm)],[6694,theory(equality)])).
% cnf(6966,negated_conjecture,(lt(esk52_0,esk52_0)),inference(rw,[status(thm)],[571,6695,theory(equality)])).
% cnf(6967,negated_conjecture,(~lt(esk52_0,esk52_0)),inference(rw,[status(thm)],[628,6695,theory(equality)])).
% cnf(6973,negated_conjecture,($false),inference(sr,[status(thm)],[6966,6967,theory(equality)])).
% cnf(6974,negated_conjecture,($false),6973,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 705
% # ...of these trivial : 14
% # ...subsumed : 93
% # ...remaining for further processing: 598
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 76
% # Backward-rewritten : 266
% # Generated clauses : 2351
% # ...of the previous two non-trivial : 2235
% # Contextual simplify-reflections : 53
% # Paramodulations : 2255
% # Factorizations : 0
% # Equation resolutions : 96
% # Current number of processed clauses: 249
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 213
% # Current number of unprocessed clauses: 772
% # ...number of literals in the above : 4722
% # Clause-clause subsumption calls (NU) : 12534
% # Rec. Clause-clause subsumption calls : 9948
% # Unit Clause-clause subsumption calls : 68
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 277 leaves, 1.32+/-1.059 terms/leaf
% # Paramod-from index: 135 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 247 leaves, 1.19+/-0.882 terms/leaf
% # -------------------------------------------------
% # User time : 0.205 s
% # System time : 0.005 s
% # Total time : 0.210 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.40 CPU 0.48 WC
% FINAL PrfWatch: 0.40 CPU 0.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP14895/SWC302+1.tptp
%
%------------------------------------------------------------------------------