TSTP Solution File: SWC303+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC303+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:49:03 EST 2010
% Result : Theorem 1.68s
% Output : Solution 1.68s
% 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/SystemOnTPTP27805/SWC303+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27805/SWC303+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27805/SWC303+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 27937
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.028 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(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)=>((leq(X1,X2)&leq(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax29)).
% fof(15, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),file('/tmp/SRASS.s.p', ax33)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(22, 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(28, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)<=>(~(X1=X2)&leq(X1,X2))))),file('/tmp/SRASS.s.p', ax93)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((((~(ssList(X4))|~(X4=X2))|~(X3=X1))|![X5]:(((~(ssList(X5))|~(app(X3,X5)=X4))|~(totalorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)&leq(X8,X6)))))))|![X10]:(ssItem(X10)=>![X11]:(ssItem(X11)=>![X12]:(ssList(X12)=>![X13]:(ssList(X13)=>![X14]:((~(ssList(X14))|~(app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14)=X1))|~(lt(X11,X10))))))))|(~(nil=X4)&nil=X3))))),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]:(((~(ssList(X5))|~(app(X3,X5)=X4))|~(totalorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)&leq(X8,X6)))))))|![X10]:(ssItem(X10)=>![X11]:(ssItem(X11)=>![X12]:(ssList(X12)=>![X13]:(ssList(X13)=>![X14]:((~(ssList(X14))|~(app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14)=X1))|~(lt(X11,X10))))))))|(~(nil=X4)&nil=X3)))))),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)],[15,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((((~(ssList(X4))|~(X4=X2))|~(X3=X1))|![X5]:(((~(ssList(X5))|~(app(X3,X5)=X4))|~(totalorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)&leq(X8,X6)))))))|![X10]:(ssItem(X10)=>![X11]:(ssItem(X11)=>![X12]:(ssList(X12)=>![X13]:(ssList(X13)=>![X14]:((~(ssList(X14))|~(app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14)=X1))|~(lt(X11,X10))))))))|(~(nil=X4)&nil=X3)))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(109, 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)],[2])).
% fof(110, 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)],[109])).
% fof(111, 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(esk3_1(X7))&(ssItem(esk4_1(X7))&(ssList(esk5_1(X7))&(ssList(esk6_1(X7))&(ssList(esk7_1(X7))&(app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7&~(leq(esk3_1(X7),esk4_1(X7)))))))))|totalorderedP(X7)))),inference(skolemize,[status(esa)],[110])).
% fof(112, 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(esk3_1(X7))&(ssItem(esk4_1(X7))&(ssList(esk5_1(X7))&(ssList(esk6_1(X7))&(ssList(esk7_1(X7))&(app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7&~(leq(esk3_1(X7),esk4_1(X7)))))))))|totalorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, 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(esk3_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssItem(esk4_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk5_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk6_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk7_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7|totalorderedP(X7))|~(ssList(X7)))&((~(leq(esk3_1(X7),esk4_1(X7)))|totalorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[112])).
% cnf(121,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)],[113])).
% fof(122, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(123, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[122])).
% fof(124, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[123])).
% cnf(125,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[124])).
% cnf(126,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(148, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(149, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[148])).
% fof(150, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[149])).
% cnf(151,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[150])).
% fof(159, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(leq(X1,X2))|~(leq(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(160, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[159])).
% fof(161, plain,![X3]:![X4]:((~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[160])).
% cnf(162,plain,(X1=X2|~ssItem(X1)|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[161])).
% fof(170, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(lt(X1,X2))|~(lt(X2,X1))))),inference(fof_nnf,[status(thm)],[98])).
% fof(171, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))),inference(variable_rename,[status(thm)],[170])).
% fof(172, plain,![X3]:![X4]:((~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[171])).
% cnf(173,plain,(~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[172])).
% fof(190, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[21])).
% fof(191, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[190])).
% fof(192, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[191])).
% cnf(193,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[192])).
% fof(194, 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)],[22])).
% fof(195, 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)],[194])).
% fof(196, 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)],[195])).
% cnf(197,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[196])).
% fof(219, 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)],[28])).
% fof(220, 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)],[219])).
% fof(221, 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)],[220])).
% fof(222, 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)],[221])).
% cnf(224,plain,(leq(X1,X2)|~ssItem(X1)|~ssItem(X2)|~lt(X1,X2)),inference(split_conjunct,[status(thm)],[222])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((((ssList(X4)&X4=X2)&X3=X1)&?[X5]:(((ssList(X5)&app(X3,X5)=X4)&totalorderedP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X3))|~(leq(X8,X6))))))))&?[X10]:(ssItem(X10)&?[X11]:(ssItem(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:((ssList(X14)&app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14)=X1)<(X11,X10)))))))&(nil=X4|~(nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(((((ssList(X18)&X18=X16)&X17=X15)&?[X19]:(((ssList(X19)&app(X17,X19)=X18)&totalorderedP(X17))&![X20]:(~(ssItem(X20))|![X21]:((~(ssList(X21))|~(app(cons(X20,nil),X21)=X19))|![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(X23,cons(X22,nil))=X17))|~(leq(X22,X20))))))))&?[X24]:(ssItem(X24)&?[X25]:(ssItem(X25)&?[X26]:(ssList(X26)&?[X27]:(ssList(X27)&?[X28]:((ssList(X28)&app(app(app(app(X26,cons(X24,nil)),X27),cons(X25,nil)),X28)=X15)<(X25,X24)))))))&(nil=X18|~(nil=X17)))))),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)&(((ssList(esk52_0)&app(esk50_0,esk52_0)=esk51_0)&totalorderedP(esk50_0))&![X20]:(~(ssItem(X20))|![X21]:((~(ssList(X21))|~(app(cons(X20,nil),X21)=esk52_0))|![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(X23,cons(X22,nil))=esk50_0))|~(leq(X22,X20))))))))&(ssItem(esk53_0)&(ssItem(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&((ssList(esk57_0)&app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0)=esk48_0)<(esk54_0,esk53_0)))))))&(nil=esk51_0|~(nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X20]:![X21]:![X22]:![X23]:((((((((((((~(ssList(X23))|~(app(X23,cons(X22,nil))=esk50_0))|~(leq(X22,X20)))|~(ssItem(X22)))|(~(ssList(X21))|~(app(cons(X20,nil),X21)=esk52_0)))|~(ssItem(X20)))&((ssList(esk52_0)&app(esk50_0,esk52_0)=esk51_0)&totalorderedP(esk50_0)))&((ssList(esk51_0)&esk51_0=esk49_0)&esk50_0=esk48_0))&(ssItem(esk53_0)&(ssItem(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&((ssList(esk57_0)&app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0)=esk48_0)<(esk54_0,esk53_0)))))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(lt(esk54_0,esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk57_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssItem(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(esk50_0=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(totalorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(590,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,583,theory(equality)])).
% cnf(594,negated_conjecture,(app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0)=esk50_0),inference(rw,[status(thm)],[577,583,theory(equality)])).
% cnf(642,negated_conjecture,(~lt(esk53_0,esk54_0)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[173,576,theory(equality)])).
% cnf(643,negated_conjecture,(~lt(esk53_0,esk54_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[642,581,theory(equality)])).
% cnf(644,negated_conjecture,(~lt(esk53_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[643,582,theory(equality)])).
% cnf(645,negated_conjecture,(~lt(esk53_0,esk54_0)),inference(cn,[status(thm)],[644,theory(equality)])).
% cnf(656,negated_conjecture,(leq(esk54_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[224,576,theory(equality)])).
% cnf(657,negated_conjecture,(leq(esk54_0,esk53_0)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[656,582,theory(equality)])).
% cnf(658,negated_conjecture,(leq(esk54_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[657,581,theory(equality)])).
% cnf(659,negated_conjecture,(leq(esk54_0,esk53_0)),inference(cn,[status(thm)],[658,theory(equality)])).
% cnf(978,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|~ssList(esk56_0)|~ssList(cons(esk53_0,nil))|~ssList(esk55_0)),inference(spm,[status(thm)],[594,197,theory(equality)])).
% cnf(990,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|$false|~ssList(cons(esk53_0,nil))|~ssList(esk55_0)),inference(rw,[status(thm)],[978,579,theory(equality)])).
% cnf(991,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|$false|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[990,580,theory(equality)])).
% cnf(992,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[991,theory(equality)])).
% cnf(1451,negated_conjecture,(esk53_0=esk54_0|~leq(esk53_0,esk54_0)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[162,659,theory(equality)])).
% cnf(1458,negated_conjecture,(esk53_0=esk54_0|~leq(esk53_0,esk54_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1451,581,theory(equality)])).
% cnf(1459,negated_conjecture,(esk53_0=esk54_0|~leq(esk53_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[1458,582,theory(equality)])).
% cnf(1460,negated_conjecture,(esk53_0=esk54_0|~leq(esk53_0,esk54_0)),inference(cn,[status(thm)],[1459,theory(equality)])).
% cnf(1663,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[992,125,theory(equality)])).
% cnf(1664,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1663,126,theory(equality)])).
% cnf(1665,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1664,582,theory(equality)])).
% cnf(1666,negated_conjecture,(app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0),inference(cn,[status(thm)],[1665,theory(equality)])).
% cnf(1684,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1666,193,theory(equality)])).
% cnf(1724,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1684,579,theory(equality)])).
% cnf(1725,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1724,582,theory(equality)])).
% cnf(1726,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0),inference(cn,[status(thm)],[1725,theory(equality)])).
% cnf(1743,negated_conjecture,(esk50_0=app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))|~ssList(esk57_0)|~ssList(cons(esk54_0,nil))|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))),inference(spm,[status(thm)],[197,1726,theory(equality)])).
% cnf(1775,negated_conjecture,(esk50_0=app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))|$false|~ssList(cons(esk54_0,nil))|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))),inference(rw,[status(thm)],[1743,578,theory(equality)])).
% cnf(1776,negated_conjecture,(esk50_0=app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))|~ssList(cons(esk54_0,nil))|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))),inference(cn,[status(thm)],[1775,theory(equality)])).
% cnf(2548,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1776,125,theory(equality)])).
% cnf(2549,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2548,126,theory(equality)])).
% cnf(2550,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))|$false|$false),inference(rw,[status(thm)],[2549,581,theory(equality)])).
% cnf(2551,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,esk56_0)))),inference(cn,[status(thm)],[2550,theory(equality)])).
% cnf(2552,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(cons(esk53_0,esk56_0))|~ssList(esk55_0)),inference(spm,[status(thm)],[2551,151,theory(equality)])).
% cnf(2553,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(cons(esk53_0,esk56_0))|$false),inference(rw,[status(thm)],[2552,580,theory(equality)])).
% cnf(2554,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(cons(esk53_0,esk56_0))),inference(cn,[status(thm)],[2553,theory(equality)])).
% cnf(2555,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2554,125,theory(equality)])).
% cnf(2556,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2555,579,theory(equality)])).
% cnf(2557,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2556,582,theory(equality)])).
% cnf(2558,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0),inference(cn,[status(thm)],[2557,theory(equality)])).
% cnf(2576,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0))=esk50_0|~ssList(esk57_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[2558,193,theory(equality)])).
% cnf(2589,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0))=esk50_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2576,578,theory(equality)])).
% cnf(2590,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2589,581,theory(equality)])).
% cnf(2591,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0))=esk50_0),inference(cn,[status(thm)],[2590,theory(equality)])).
% cnf(2614,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|~ssList(esk57_0)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[121,2591,theory(equality)])).
% cnf(2643,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|$false|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2614,578,theory(equality)])).
% cnf(2644,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2643,579,theory(equality)])).
% cnf(2645,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2644,580,theory(equality)])).
% cnf(2646,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2645,581,theory(equality)])).
% cnf(2647,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2646,582,theory(equality)])).
% cnf(2648,negated_conjecture,(leq(esk53_0,esk54_0)|esk50_0!=X1|~totalorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2647,theory(equality)])).
% cnf(5915,negated_conjecture,(leq(esk53_0,esk54_0)|~totalorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2648,theory(equality)])).
% cnf(5916,negated_conjecture,(leq(esk53_0,esk54_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[5915,586,theory(equality)])).
% cnf(5917,negated_conjecture,(leq(esk53_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[5916,590,theory(equality)])).
% cnf(5918,negated_conjecture,(leq(esk53_0,esk54_0)),inference(cn,[status(thm)],[5917,theory(equality)])).
% cnf(5925,negated_conjecture,(esk54_0=esk53_0|$false),inference(rw,[status(thm)],[1460,5918,theory(equality)])).
% cnf(5926,negated_conjecture,(esk54_0=esk53_0),inference(cn,[status(thm)],[5925,theory(equality)])).
% cnf(6197,negated_conjecture,(lt(esk53_0,esk53_0)),inference(rw,[status(thm)],[576,5926,theory(equality)])).
% cnf(6198,negated_conjecture,(~lt(esk53_0,esk53_0)),inference(rw,[status(thm)],[645,5926,theory(equality)])).
% cnf(6210,negated_conjecture,($false),inference(sr,[status(thm)],[6197,6198,theory(equality)])).
% cnf(6211,negated_conjecture,($false),6210,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 549
% # ...of these trivial : 15
% # ...subsumed : 15
% # ...remaining for further processing: 519
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 266
% # Generated clauses : 2038
% # ...of the previous two non-trivial : 1935
% # Contextual simplify-reflections : 20
% # Paramodulations : 1944
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 226
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 192
% # Current number of unprocessed clauses: 674
% # ...number of literals in the above : 4002
% # Clause-clause subsumption calls (NU) : 10212
% # Rec. Clause-clause subsumption calls : 7733
% # Unit Clause-clause subsumption calls : 114
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 255 leaves, 1.34+/-1.122 terms/leaf
% # Paramod-from index: 120 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 222 leaves, 1.21+/-0.928 terms/leaf
% # -------------------------------------------------
% # User time : 0.162 s
% # System time : 0.010 s
% # Total time : 0.172 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.35 CPU 0.43 WC
% FINAL PrfWatch: 0.35 CPU 0.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP27805/SWC303+1.tptp
%
%------------------------------------------------------------------------------