%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC304+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 : art02.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:27 EST 2010
% Result : Theorem 1.47s
% Output : Solution 1.47s
% 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/SystemOnTPTP9638/SWC304+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9638/SWC304+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9638/SWC304+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 9734
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 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)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(totalorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)&leq(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)&leq(X13,X11)))))))))|![X15]:(ssItem(X15)=>![X16]:(ssItem(X16)=>![X17]:(ssList(X17)=>![X18]:(ssList(X18)=>![X19]:(ssList(X19)=>(~(app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19)=X1)|~(lt(X16,X15)))))))))|(~(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)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(totalorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)&leq(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)&leq(X13,X11)))))))))|![X15]:(ssItem(X15)=>![X16]:(ssItem(X16)=>![X17]:(ssList(X17)=>![X18]:(ssList(X18)=>![X19]:(ssList(X19)=>(~(app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19)=X1)|~(lt(X16,X15)))))))))|(~(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)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(totalorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)&leq(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)&leq(X13,X11)))))))))|![X15]:(ssItem(X15)=>![X16]:(ssItem(X16)=>![X17]:(ssList(X17)=>![X18]:(ssList(X18)=>![X19]:(ssList(X19)=>(~(app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19)=X1)|~(lt(X16,X15)))))))))|(~(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)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(((app(app(X5,X3),X6)=X4&totalorderedP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(X8,cons(X7,nil))=X5))|![X9]:(~(ssItem(X9))|![X10]:((~(ssList(X10))|~(app(cons(X9,nil),X10)=X3))|~(leq(X7,X9)))))))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(cons(X11,nil),X12)=X6))|![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(X14,cons(X13,nil))=X3))|~(leq(X13,X11))))))))))&?[X15]:(ssItem(X15)&?[X16]:(ssItem(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&(app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19)=X1<(X16,X15))))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X20]:(ssList(X20)&?[X21]:(ssList(X21)&?[X22]:(ssList(X22)&?[X23]:(ssList(X23)&((((X21=X23&X20=X22)&?[X24]:(ssList(X24)&?[X25]:(ssList(X25)&(((app(app(X24,X22),X25)=X23&totalorderedP(X22))&![X26]:(~(ssItem(X26))|![X27]:((~(ssList(X27))|~(app(X27,cons(X26,nil))=X24))|![X28]:(~(ssItem(X28))|![X29]:((~(ssList(X29))|~(app(cons(X28,nil),X29)=X22))|~(leq(X26,X28)))))))&![X30]:(~(ssItem(X30))|![X31]:((~(ssList(X31))|~(app(cons(X30,nil),X31)=X25))|![X32]:(~(ssItem(X32))|![X33]:((~(ssList(X33))|~(app(X33,cons(X32,nil))=X22))|~(leq(X32,X30))))))))))&?[X34]:(ssItem(X34)&?[X35]:(ssItem(X35)&?[X36]:(ssList(X36)&?[X37]:(ssList(X37)&?[X38]:(ssList(X38)&(app(app(app(app(X36,cons(X34,nil)),X37),cons(X35,nil)),X38)=X20<(X35,X34))))))))&(nil=X23|~(nil=X22))))))),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)&(ssList(esk52_0)&(ssList(esk53_0)&(((app(app(esk52_0,esk50_0),esk53_0)=esk51_0&totalorderedP(esk50_0))&![X26]:(~(ssItem(X26))|![X27]:((~(ssList(X27))|~(app(X27,cons(X26,nil))=esk52_0))|![X28]:(~(ssItem(X28))|![X29]:((~(ssList(X29))|~(app(cons(X28,nil),X29)=esk50_0))|~(leq(X26,X28)))))))&![X30]:(~(ssItem(X30))|![X31]:((~(ssList(X31))|~(app(cons(X30,nil),X31)=esk53_0))|![X32]:(~(ssItem(X32))|![X33]:((~(ssList(X33))|~(app(X33,cons(X32,nil))=esk50_0))|~(leq(X32,X30))))))))))&(ssItem(esk54_0)&(ssItem(esk55_0)&(ssList(esk56_0)&(ssList(esk57_0)&(ssList(esk58_0)&(app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0)=esk48_0<(esk55_0,esk54_0))))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X26]:![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:![X33]:(((((((((((((((~(ssList(X33))|~(app(X33,cons(X32,nil))=esk50_0))|~(leq(X32,X30)))|~(ssItem(X32)))|(~(ssList(X31))|~(app(cons(X30,nil),X31)=esk53_0)))|~(ssItem(X30)))&((((((~(ssList(X29))|~(app(cons(X28,nil),X29)=esk50_0))|~(leq(X26,X28)))|~(ssItem(X28)))|(~(ssList(X27))|~(app(X27,cons(X26,nil))=esk52_0)))|~(ssItem(X26)))&(app(app(esk52_0,esk50_0),esk53_0)=esk51_0&totalorderedP(esk50_0))))&ssList(esk53_0))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk54_0)&(ssItem(esk55_0)&(ssList(esk56_0)&(ssList(esk57_0)&(ssList(esk58_0)&(app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0)=esk48_0<(esk55_0,esk54_0))))))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_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(577,negated_conjecture,(lt(esk55_0,esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk58_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk57_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssItem(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(ssItem(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(588,negated_conjecture,(totalorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(592,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,584,theory(equality)])).
% cnf(596,negated_conjecture,(app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0)=esk50_0),inference(rw,[status(thm)],[578,584,theory(equality)])).
% cnf(641,negated_conjecture,(~lt(esk54_0,esk55_0)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[173,577,theory(equality)])).
% cnf(642,negated_conjecture,(~lt(esk54_0,esk55_0)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[641,582,theory(equality)])).
% cnf(643,negated_conjecture,(~lt(esk54_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[642,583,theory(equality)])).
% cnf(644,negated_conjecture,(~lt(esk54_0,esk55_0)),inference(cn,[status(thm)],[643,theory(equality)])).
% cnf(655,negated_conjecture,(leq(esk55_0,esk54_0)|~ssItem(esk54_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[224,577,theory(equality)])).
% cnf(656,negated_conjecture,(leq(esk55_0,esk54_0)|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[655,583,theory(equality)])).
% cnf(657,negated_conjecture,(leq(esk55_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[656,582,theory(equality)])).
% cnf(658,negated_conjecture,(leq(esk55_0,esk54_0)),inference(cn,[status(thm)],[657,theory(equality)])).
% cnf(972,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|~ssList(esk57_0)|~ssList(cons(esk54_0,nil))|~ssList(esk56_0)),inference(spm,[status(thm)],[596,197,theory(equality)])).
% cnf(985,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|$false|~ssList(cons(esk54_0,nil))|~ssList(esk56_0)),inference(rw,[status(thm)],[972,580,theory(equality)])).
% cnf(986,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|$false|~ssList(cons(esk54_0,nil))|$false),inference(rw,[status(thm)],[985,581,theory(equality)])).
% cnf(987,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|~ssList(cons(esk54_0,nil))),inference(cn,[status(thm)],[986,theory(equality)])).
% cnf(1456,negated_conjecture,(esk54_0=esk55_0|~leq(esk54_0,esk55_0)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[162,658,theory(equality)])).
% cnf(1463,negated_conjecture,(esk54_0=esk55_0|~leq(esk54_0,esk55_0)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1456,582,theory(equality)])).
% cnf(1464,negated_conjecture,(esk54_0=esk55_0|~leq(esk54_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[1463,583,theory(equality)])).
% cnf(1465,negated_conjecture,(esk54_0=esk55_0|~leq(esk54_0,esk55_0)),inference(cn,[status(thm)],[1464,theory(equality)])).
% cnf(1711,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[987,125,theory(equality)])).
% cnf(1712,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1711,126,theory(equality)])).
% cnf(1713,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1712,583,theory(equality)])).
% cnf(1714,negated_conjecture,(app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0),inference(cn,[status(thm)],[1713,theory(equality)])).
% cnf(1732,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|~ssList(esk57_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1714,193,theory(equality)])).
% cnf(1772,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1732,580,theory(equality)])).
% cnf(1773,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1772,583,theory(equality)])).
% cnf(1774,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0),inference(cn,[status(thm)],[1773,theory(equality)])).
% cnf(1791,negated_conjecture,(esk50_0=app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))|~ssList(esk58_0)|~ssList(cons(esk55_0,nil))|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))),inference(spm,[status(thm)],[197,1774,theory(equality)])).
% cnf(1823,negated_conjecture,(esk50_0=app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))|$false|~ssList(cons(esk55_0,nil))|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))),inference(rw,[status(thm)],[1791,579,theory(equality)])).
% cnf(1824,negated_conjecture,(esk50_0=app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))|~ssList(cons(esk55_0,nil))|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))),inference(cn,[status(thm)],[1823,theory(equality)])).
% cnf(2596,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))|~ssList(nil)|~ssItem(esk55_0)),inference(spm,[status(thm)],[1824,125,theory(equality)])).
% cnf(2597,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[2596,126,theory(equality)])).
% cnf(2598,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))|$false|$false),inference(rw,[status(thm)],[2597,582,theory(equality)])).
% cnf(2599,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,esk57_0)))),inference(cn,[status(thm)],[2598,theory(equality)])).
% cnf(2600,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(cons(esk54_0,esk57_0))|~ssList(esk56_0)),inference(spm,[status(thm)],[2599,151,theory(equality)])).
% cnf(2601,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(cons(esk54_0,esk57_0))|$false),inference(rw,[status(thm)],[2600,581,theory(equality)])).
% cnf(2602,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(cons(esk54_0,esk57_0))),inference(cn,[status(thm)],[2601,theory(equality)])).
% cnf(2603,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|~ssList(esk57_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[2602,125,theory(equality)])).
% cnf(2604,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2603,580,theory(equality)])).
% cnf(2605,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2604,583,theory(equality)])).
% cnf(2606,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0),inference(cn,[status(thm)],[2605,theory(equality)])).
% cnf(2624,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0))=esk50_0|~ssList(esk58_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[2606,193,theory(equality)])).
% cnf(2637,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0))=esk50_0|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[2624,579,theory(equality)])).
% cnf(2638,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2637,582,theory(equality)])).
% cnf(2639,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0))=esk50_0),inference(cn,[status(thm)],[2638,theory(equality)])).
% cnf(2662,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|~ssList(esk58_0)|~ssList(esk57_0)|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[121,2639,theory(equality)])).
% cnf(2691,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|$false|~ssList(esk57_0)|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2662,579,theory(equality)])).
% cnf(2692,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2691,580,theory(equality)])).
% cnf(2693,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2692,581,theory(equality)])).
% cnf(2694,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2693,582,theory(equality)])).
% cnf(2695,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2694,583,theory(equality)])).
% cnf(2696,negated_conjecture,(leq(esk54_0,esk55_0)|esk50_0!=X1|~totalorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2695,theory(equality)])).
% cnf(5947,negated_conjecture,(leq(esk54_0,esk55_0)|~totalorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2696,theory(equality)])).
% cnf(5948,negated_conjecture,(leq(esk54_0,esk55_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[5947,588,theory(equality)])).
% cnf(5949,negated_conjecture,(leq(esk54_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[5948,592,theory(equality)])).
% cnf(5950,negated_conjecture,(leq(esk54_0,esk55_0)),inference(cn,[status(thm)],[5949,theory(equality)])).
% cnf(5957,negated_conjecture,(esk55_0=esk54_0|$false),inference(rw,[status(thm)],[1465,5950,theory(equality)])).
% cnf(5958,negated_conjecture,(esk55_0=esk54_0),inference(cn,[status(thm)],[5957,theory(equality)])).
% cnf(6227,negated_conjecture,(~lt(esk54_0,esk54_0)),inference(rw,[status(thm)],[644,5958,theory(equality)])).
% cnf(6229,negated_conjecture,(lt(esk54_0,esk54_0)),inference(rw,[status(thm)],[577,5958,theory(equality)])).
% cnf(6246,negated_conjecture,($false),inference(sr,[status(thm)],[6229,6227,theory(equality)])).
% cnf(6247,negated_conjecture,($false),6246,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 553
% # ...of these trivial : 15
% # ...subsumed : 15
% # ...remaining for further processing: 523
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 266
% # Generated clauses : 2055
% # ...of the previous two non-trivial : 1950
% # Contextual simplify-reflections : 19
% # Paramodulations : 1961
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 230
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 194
% # Current number of unprocessed clauses: 687
% # ...number of literals in the above : 4086
% # Clause-clause subsumption calls (NU) : 10027
% # Rec. Clause-clause subsumption calls : 7458
% # Unit Clause-clause subsumption calls : 119
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 261 leaves, 1.33+/-1.110 terms/leaf
% # Paramod-from index: 121 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 226 leaves, 1.21+/-0.920 terms/leaf
% # -------------------------------------------------
% # User time : 0.177 s
% # System time : 0.009 s
% # Total time : 0.186 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.45 WC
% FINAL PrfWatch: 0.37 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP9638/SWC304+1.tptp
%
%------------------------------------------------------------------------------