%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC161+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:14:48 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP28860/SWC161+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28860/SWC161+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28860/SWC161+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 28956
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>(strictorderedP(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=>lt(X2,X3))))))))),file('/tmp/SRASS.s.p', ax12)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(16, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),file('/tmp/SRASS.s.p', ax33)).
% fof(25, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(26, 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]:(ssItem(X1)=>~(lt(X1,X1))),file('/tmp/SRASS.s.p', ax90)).
% fof(31, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(leq(X1,X2)=>(X1=X2|lt(X1,X2))))),file('/tmp/SRASS.s.p', ax92)).
% 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))|~(strictorderedP(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)<(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)<(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))|~(leq(X16,X15)))|(![X20]:((~(ssItem(X20))|~(memberP(X18,X20)))|(leq(X15,X20)&leq(X20,X16)))&leq(X15,X16))))))))|(~(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))|~(strictorderedP(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)<(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)<(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))|~(leq(X16,X15)))|(![X20]:((~(ssItem(X20))|~(memberP(X18,X20)))|(leq(X15,X20)&leq(X20,X16)))&leq(X15,X16))))))))|(~(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)],[16,theory(equality)])).
% fof(100, plain,![X1]:(ssItem(X1)=>~(lt(X1,X1))),inference(fof_simplification,[status(thm)],[29,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))|~(strictorderedP(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)<(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)<(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))|~(leq(X16,X15)))|(![X20]:((~(ssItem(X20))|~(memberP(X18,X20)))|(leq(X15,X20)&leq(X20,X16)))&leq(X15,X16))))))))|(~(nil=X4)&nil=X3)))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|((~(strictorderedP(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)|lt(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&~(lt(X2,X3))))))))|strictorderedP(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X7]:(~(ssList(X7))|((~(strictorderedP(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)|lt(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&~(lt(X13,X14))))))))|strictorderedP(X7)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X7]:(~(ssList(X7))|((~(strictorderedP(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)|lt(X8,X9))))))))&((ssItem(esk5_1(X7))&(ssItem(esk6_1(X7))&(ssList(esk7_1(X7))&(ssList(esk8_1(X7))&(ssList(esk9_1(X7))&(app(app(esk7_1(X7),cons(esk5_1(X7),esk8_1(X7))),cons(esk6_1(X7),esk9_1(X7)))=X7&~(lt(esk5_1(X7),esk6_1(X7)))))))))|strictorderedP(X7)))),inference(skolemize,[status(esa)],[119])).
% fof(121, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(strictorderedP(X7)))&((ssItem(esk5_1(X7))&(ssItem(esk6_1(X7))&(ssList(esk7_1(X7))&(ssList(esk8_1(X7))&(ssList(esk9_1(X7))&(app(app(esk7_1(X7),cons(esk5_1(X7),esk8_1(X7))),cons(esk6_1(X7),esk9_1(X7)))=X7&~(lt(esk5_1(X7),esk6_1(X7)))))))))|strictorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[120])).
% fof(122, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(strictorderedP(X7)))|~(ssList(X7)))&(((ssItem(esk5_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssItem(esk6_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk7_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk8_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk9_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((app(app(esk7_1(X7),cons(esk5_1(X7),esk8_1(X7))),cons(esk6_1(X7),esk9_1(X7)))=X7|strictorderedP(X7))|~(ssList(X7)))&((~(lt(esk5_1(X7),esk6_1(X7)))|strictorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[121])).
% cnf(130,plain,(lt(X2,X3)|~ssList(X1)|~strictorderedP(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)],[122])).
% fof(131, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(132, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[132])).
% cnf(134,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[133])).
% cnf(135,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(157, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(158, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[157])).
% fof(159, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[158])).
% cnf(160,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[159])).
% fof(179, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(lt(X1,X2))|~(lt(X2,X1))))),inference(fof_nnf,[status(thm)],[98])).
% fof(180, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X3]:![X4]:((~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[180])).
% cnf(182,plain,(~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[181])).
% fof(216, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(217, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[216])).
% fof(218, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[217])).
% cnf(219,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[218])).
% fof(220, 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)],[26])).
% fof(221, 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)],[220])).
% fof(222, 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)],[221])).
% cnf(223,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[222])).
% fof(234, plain,![X1]:(~(ssItem(X1))|~(lt(X1,X1))),inference(fof_nnf,[status(thm)],[100])).
% fof(235, plain,![X2]:(~(ssItem(X2))|~(lt(X2,X2))),inference(variable_rename,[status(thm)],[234])).
% cnf(236,plain,(~lt(X1,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[235])).
% fof(241, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(leq(X1,X2))|(X1=X2|lt(X1,X2))))),inference(fof_nnf,[status(thm)],[31])).
% fof(242, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(leq(X3,X4))|(X3=X4|lt(X3,X4))))),inference(variable_rename,[status(thm)],[241])).
% fof(243, plain,![X3]:![X4]:((~(ssItem(X4))|(~(leq(X3,X4))|(X3=X4|lt(X3,X4))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[242])).
% cnf(244,plain,(lt(X1,X2)|X1=X2|~ssItem(X1)|~leq(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[243])).
% 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)&strictorderedP(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))|~(lt(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))|~(lt(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)&leq(X16,X15))&(?[X20]:((ssItem(X20)&memberP(X18,X20))&(~(leq(X15,X20))|~(leq(X20,X16))))|~(leq(X15,X16)))))))))&(nil=X4|~(nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X21]:(ssList(X21)&?[X22]:(ssList(X22)&?[X23]:(ssList(X23)&?[X24]:(((((ssList(X24)&X22=X24)&X21=X23)&?[X25]:(ssList(X25)&?[X26]:((((ssList(X26)&app(app(X25,X23),X26)=X24)&strictorderedP(X23))&![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(X28,cons(X27,nil))=X25))|![X29]:(~(ssItem(X29))|![X30]:((~(ssList(X30))|~(app(cons(X29,nil),X30)=X23))|~(lt(X27,X29)))))))&![X31]:(~(ssItem(X31))|![X32]:((~(ssList(X32))|~(app(cons(X31,nil),X32)=X26))|![X33]:(~(ssItem(X33))|![X34]:((~(ssList(X34))|~(app(X34,cons(X33,nil))=X23))|~(lt(X33,X31)))))))))&?[X35]:(ssItem(X35)&?[X36]:(ssItem(X36)&?[X37]:(ssList(X37)&?[X38]:(ssList(X38)&?[X39]:(((ssList(X39)&app(app(app(app(X37,cons(X35,nil)),X38),cons(X36,nil)),X39)=X21)&leq(X36,X35))&(?[X40]:((ssItem(X40)&memberP(X38,X40))&(~(leq(X35,X40))|~(leq(X40,X36))))|~(leq(X35,X36)))))))))&(nil=X24|~(nil=X23)))))),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)&strictorderedP(esk50_0))&![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(X28,cons(X27,nil))=esk52_0))|![X29]:(~(ssItem(X29))|![X30]:((~(ssList(X30))|~(app(cons(X29,nil),X30)=esk50_0))|~(lt(X27,X29)))))))&![X31]:(~(ssItem(X31))|![X32]:((~(ssList(X32))|~(app(cons(X31,nil),X32)=esk53_0))|![X33]:(~(ssItem(X33))|![X34]:((~(ssList(X34))|~(app(X34,cons(X33,nil))=esk50_0))|~(lt(X33,X31)))))))))&(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)&leq(esk55_0,esk54_0))&(((ssItem(esk59_0)&memberP(esk57_0,esk59_0))&(~(leq(esk54_0,esk59_0))|~(leq(esk59_0,esk55_0))))|~(leq(esk54_0,esk55_0)))))))))&(nil=esk51_0|~(nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:![X33]:![X34]:(((((((((((((~(ssList(X34))|~(app(X34,cons(X33,nil))=esk50_0))|~(lt(X33,X31)))|~(ssItem(X33)))|(~(ssList(X32))|~(app(cons(X31,nil),X32)=esk53_0)))|~(ssItem(X31)))&((((((~(ssList(X30))|~(app(cons(X29,nil),X30)=esk50_0))|~(lt(X27,X29)))|~(ssItem(X29)))|(~(ssList(X28))|~(app(X28,cons(X27,nil))=esk52_0)))|~(ssItem(X27)))&((ssList(esk53_0)&app(app(esk52_0,esk50_0),esk53_0)=esk51_0)&strictorderedP(esk50_0))))&ssList(esk52_0))&((ssList(esk51_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)&leq(esk55_0,esk54_0))&(((ssItem(esk59_0)&memberP(esk57_0,esk59_0))&(~(leq(esk54_0,esk59_0))|~(leq(esk59_0,esk55_0))))|~(leq(esk54_0,esk55_0)))))))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:![X33]:![X34]:(((((((((((((~(ssList(X34))|~(app(X34,cons(X33,nil))=esk50_0))|~(lt(X33,X31)))|~(ssItem(X33)))|(~(ssList(X32))|~(app(cons(X31,nil),X32)=esk53_0)))|~(ssItem(X31)))&((((((~(ssList(X30))|~(app(cons(X29,nil),X30)=esk50_0))|~(lt(X27,X29)))|~(ssItem(X29)))|(~(ssList(X28))|~(app(X28,cons(X27,nil))=esk52_0)))|~(ssItem(X27)))&((ssList(esk53_0)&app(app(esk52_0,esk50_0),esk53_0)=esk51_0)&strictorderedP(esk50_0))))&ssList(esk52_0))&((ssList(esk51_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)&leq(esk55_0,esk54_0))&(((ssItem(esk59_0)|~(leq(esk54_0,esk55_0)))&(memberP(esk57_0,esk59_0)|~(leq(esk54_0,esk55_0))))&((~(leq(esk54_0,esk59_0))|~(leq(esk59_0,esk55_0)))|~(leq(esk54_0,esk55_0))))))))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(leq(esk55_0,esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,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)],[572])).
% cnf(582,negated_conjecture,(ssList(esk58_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk57_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(ssItem(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(strictorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(596,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,587,theory(equality)])).
% cnf(600,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)],[581,587,theory(equality)])).
% cnf(790,negated_conjecture,(esk55_0=esk54_0|lt(esk55_0,esk54_0)|~ssItem(esk54_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[244,580,theory(equality)])).
% cnf(793,negated_conjecture,(esk55_0=esk54_0|lt(esk55_0,esk54_0)|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[790,586,theory(equality)])).
% cnf(794,negated_conjecture,(esk55_0=esk54_0|lt(esk55_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[793,585,theory(equality)])).
% cnf(795,negated_conjecture,(esk55_0=esk54_0|lt(esk55_0,esk54_0)),inference(cn,[status(thm)],[794,theory(equality)])).
% cnf(991,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)],[600,223,theory(equality)])).
% cnf(1004,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)],[991,583,theory(equality)])).
% cnf(1005,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)],[1004,584,theory(equality)])).
% cnf(1006,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)],[1005,theory(equality)])).
% cnf(1452,negated_conjecture,(esk55_0=esk54_0|~lt(esk54_0,esk55_0)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[182,795,theory(equality)])).
% cnf(1459,negated_conjecture,(esk55_0=esk54_0|~lt(esk54_0,esk55_0)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1452,585,theory(equality)])).
% cnf(1460,negated_conjecture,(esk55_0=esk54_0|~lt(esk54_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[1459,586,theory(equality)])).
% cnf(1461,negated_conjecture,(esk55_0=esk54_0|~lt(esk54_0,esk55_0)),inference(cn,[status(thm)],[1460,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|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1006,134,theory(equality)])).
% cnf(1715,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)],[1714,135,theory(equality)])).
% cnf(1716,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)],[1715,586,theory(equality)])).
% cnf(1717,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)],[1716,theory(equality)])).
% cnf(1735,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)],[1717,219,theory(equality)])).
% cnf(1775,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)],[1735,583,theory(equality)])).
% cnf(1776,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)],[1775,586,theory(equality)])).
% cnf(1777,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0)=esk50_0),inference(cn,[status(thm)],[1776,theory(equality)])).
% cnf(1794,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)],[223,1777,theory(equality)])).
% cnf(1826,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)],[1794,582,theory(equality)])).
% cnf(1827,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)],[1826,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)))|~ssList(nil)|~ssItem(esk55_0)),inference(spm,[status(thm)],[1827,134,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(app(esk56_0,cons(esk54_0,esk57_0)))|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[2599,135,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(app(esk56_0,cons(esk54_0,esk57_0)))|$false|$false),inference(rw,[status(thm)],[2600,585,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(app(esk56_0,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(cons(esk54_0,esk57_0))|~ssList(esk56_0)),inference(spm,[status(thm)],[2602,160,theory(equality)])).
% cnf(2604,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)],[2603,584,theory(equality)])).
% cnf(2605,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)],[2604,theory(equality)])).
% cnf(2606,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)],[2605,134,theory(equality)])).
% cnf(2607,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)],[2606,583,theory(equality)])).
% cnf(2608,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)],[2607,586,theory(equality)])).
% cnf(2609,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0))=esk50_0),inference(cn,[status(thm)],[2608,theory(equality)])).
% cnf(2627,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)],[2609,219,theory(equality)])).
% cnf(2640,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)],[2627,582,theory(equality)])).
% cnf(2641,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2640,585,theory(equality)])).
% cnf(2642,negated_conjecture,(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0))=esk50_0),inference(cn,[status(thm)],[2641,theory(equality)])).
% cnf(2665,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk58_0)|~ssList(esk57_0)|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[130,2642,theory(equality)])).
% cnf(2694,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(esk57_0)|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2665,582,theory(equality)])).
% cnf(2695,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2694,583,theory(equality)])).
% cnf(2696,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2695,584,theory(equality)])).
% cnf(2697,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2696,585,theory(equality)])).
% cnf(2698,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2697,586,theory(equality)])).
% cnf(2699,negated_conjecture,(lt(esk54_0,esk55_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2698,theory(equality)])).
% cnf(5938,negated_conjecture,(lt(esk54_0,esk55_0)|~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2699,theory(equality)])).
% cnf(5939,negated_conjecture,(lt(esk54_0,esk55_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[5938,591,theory(equality)])).
% cnf(5940,negated_conjecture,(lt(esk54_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[5939,596,theory(equality)])).
% cnf(5941,negated_conjecture,(lt(esk54_0,esk55_0)),inference(cn,[status(thm)],[5940,theory(equality)])).
% cnf(5951,negated_conjecture,(esk55_0=esk54_0|$false),inference(rw,[status(thm)],[1461,5941,theory(equality)])).
% cnf(5952,negated_conjecture,(esk55_0=esk54_0),inference(cn,[status(thm)],[5951,theory(equality)])).
% cnf(6007,negated_conjecture,(lt(esk54_0,esk54_0)),inference(rw,[status(thm)],[5941,5952,theory(equality)])).
% cnf(6229,negated_conjecture,(~ssItem(esk54_0)),inference(spm,[status(thm)],[236,6007,theory(equality)])).
% cnf(6234,negated_conjecture,($false),inference(rw,[status(thm)],[6229,586,theory(equality)])).
% cnf(6235,negated_conjecture,($false),inference(cn,[status(thm)],[6234,theory(equality)])).
% cnf(6236,negated_conjecture,($false),6235,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 553
% # ...of these trivial : 14
% # ...subsumed : 16
% # ...remaining for further processing: 523
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 269
% # Generated clauses : 2055
% # ...of the previous two non-trivial : 1952
% # Contextual simplify-reflections : 19
% # Paramodulations : 1961
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 228
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 193
% # Current number of unprocessed clauses: 689
% # ...number of literals in the above : 4093
% # Clause-clause subsumption calls (NU) : 10002
% # Rec. Clause-clause subsumption calls : 7442
% # Unit Clause-clause subsumption calls : 117
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 258 leaves, 1.33+/-1.109 terms/leaf
% # Paramod-from index: 120 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 223 leaves, 1.21+/-0.926 terms/leaf
% # -------------------------------------------------
% # User time : 0.179 s
% # System time : 0.005 s
% # Total time : 0.184 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.36 CPU 0.45 WC
% FINAL PrfWatch: 0.36 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP28860/SWC161+1.tptp
%
%------------------------------------------------------------------------------