TSTP Solution File: SWC160+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC160+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:41 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/SystemOnTPTP28601/SWC160+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28601/SWC160+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28601/SWC160+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 28697
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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)=>((~(app(X3,X5)=X4)|~(strictorderedP(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)<(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)|~(leq(X11,X10)))|(![X15]:(ssItem(X15)=>(~(memberP(X13,X15))|(leq(X10,X15)&leq(X15,X11))))&leq(X10,X11)))))))))|(~(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)=>((~(app(X3,X5)=X4)|~(strictorderedP(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)<(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)|~(leq(X11,X10)))|(![X15]:(ssItem(X15)=>(~(memberP(X13,X15))|(leq(X10,X15)&leq(X15,X11))))&leq(X10,X11)))))))))|(~(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)=>((~(app(X3,X5)=X4)|~(strictorderedP(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)<(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)|~(leq(X11,X10)))|(![X15]:(ssItem(X15)=>(~(memberP(X13,X15))|(leq(X10,X15)&leq(X15,X11))))&leq(X10,X11)))))))))|(~(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)&((app(X3,X5)=X4&strictorderedP(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))|~(lt(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&leq(X11,X10))&(?[X15]:(ssItem(X15)&(memberP(X13,X15)&(~(leq(X10,X15))|~(leq(X15,X11)))))|~(leq(X10,X11))))))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&((((X17=X19&X16=X18)&?[X20]:(ssList(X20)&((app(X18,X20)=X19&strictorderedP(X18))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(cons(X21,nil),X22)=X20))|![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(X24,cons(X23,nil))=X18))|~(lt(X23,X21)))))))))&?[X25]:(ssItem(X25)&?[X26]:(ssItem(X26)&?[X27]:(ssList(X27)&?[X28]:(ssList(X28)&?[X29]:(ssList(X29)&((app(app(app(app(X27,cons(X25,nil)),X28),cons(X26,nil)),X29)=X16&leq(X26,X25))&(?[X30]:(ssItem(X30)&(memberP(X28,X30)&(~(leq(X25,X30))|~(leq(X30,X26)))))|~(leq(X25,X26))))))))))&(nil=X19|~(nil=X18))))))),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)&((app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(cons(X21,nil),X22)=esk52_0))|![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(X24,cons(X23,nil))=esk50_0))|~(lt(X23,X21)))))))))&(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&leq(esk54_0,esk53_0))&((ssItem(esk58_0)&(memberP(esk56_0,esk58_0)&(~(leq(esk53_0,esk58_0))|~(leq(esk58_0,esk54_0)))))|~(leq(esk53_0,esk54_0))))))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X21]:![X22]:![X23]:![X24]:((((((((((((((~(ssList(X24))|~(app(X24,cons(X23,nil))=esk50_0))|~(lt(X23,X21)))|~(ssItem(X23)))|(~(ssList(X22))|~(app(cons(X21,nil),X22)=esk52_0)))|~(ssItem(X21)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_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&leq(esk54_0,esk53_0))&((ssItem(esk58_0)&(memberP(esk56_0,esk58_0)&(~(leq(esk53_0,esk58_0))|~(leq(esk58_0,esk54_0)))))|~(leq(esk53_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])).
% fof(572, negated_conjecture,![X21]:![X22]:![X23]:![X24]:((((((((((((((~(ssList(X24))|~(app(X24,cons(X23,nil))=esk50_0))|~(lt(X23,X21)))|~(ssItem(X23)))|(~(ssList(X22))|~(app(cons(X21,nil),X22)=esk52_0)))|~(ssItem(X21)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_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&leq(esk54_0,esk53_0))&((ssItem(esk58_0)|~(leq(esk53_0,esk54_0)))&((memberP(esk56_0,esk58_0)|~(leq(esk53_0,esk54_0)))&((~(leq(esk53_0,esk58_0))|~(leq(esk58_0,esk54_0)))|~(leq(esk53_0,esk54_0))))))))))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_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(581,negated_conjecture,(leq(esk54_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,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)],[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,(ssList(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,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,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(594,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,588,theory(equality)])).
% cnf(598,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)],[582,588,theory(equality)])).
% cnf(795,negated_conjecture,(esk54_0=esk53_0|lt(esk54_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[244,581,theory(equality)])).
% cnf(798,negated_conjecture,(esk54_0=esk53_0|lt(esk54_0,esk53_0)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[795,587,theory(equality)])).
% cnf(799,negated_conjecture,(esk54_0=esk53_0|lt(esk54_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[798,586,theory(equality)])).
% cnf(800,negated_conjecture,(esk54_0=esk53_0|lt(esk54_0,esk53_0)),inference(cn,[status(thm)],[799,theory(equality)])).
% cnf(993,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)],[598,223,theory(equality)])).
% cnf(1005,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)],[993,584,theory(equality)])).
% cnf(1006,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)],[1005,585,theory(equality)])).
% cnf(1007,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)],[1006,theory(equality)])).
% cnf(1447,negated_conjecture,(esk54_0=esk53_0|~lt(esk53_0,esk54_0)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[182,800,theory(equality)])).
% cnf(1454,negated_conjecture,(esk54_0=esk53_0|~lt(esk53_0,esk54_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1447,586,theory(equality)])).
% cnf(1455,negated_conjecture,(esk54_0=esk53_0|~lt(esk53_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[1454,587,theory(equality)])).
% cnf(1456,negated_conjecture,(esk54_0=esk53_0|~lt(esk53_0,esk54_0)),inference(cn,[status(thm)],[1455,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|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1007,134,theory(equality)])).
% cnf(1667,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)],[1666,135,theory(equality)])).
% cnf(1668,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)],[1667,587,theory(equality)])).
% cnf(1669,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)],[1668,theory(equality)])).
% cnf(1687,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)],[1669,219,theory(equality)])).
% cnf(1727,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)],[1687,584,theory(equality)])).
% cnf(1728,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)],[1727,587,theory(equality)])).
% cnf(1729,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0)=esk50_0),inference(cn,[status(thm)],[1728,theory(equality)])).
% cnf(1746,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)],[223,1729,theory(equality)])).
% cnf(1778,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)],[1746,583,theory(equality)])).
% cnf(1779,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)],[1778,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)))|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1779,134,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(app(esk55_0,cons(esk53_0,esk56_0)))|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2551,135,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(app(esk55_0,cons(esk53_0,esk56_0)))|$false|$false),inference(rw,[status(thm)],[2552,586,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(app(esk55_0,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(cons(esk53_0,esk56_0))|~ssList(esk55_0)),inference(spm,[status(thm)],[2554,160,theory(equality)])).
% cnf(2556,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)],[2555,585,theory(equality)])).
% cnf(2557,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)],[2556,theory(equality)])).
% cnf(2558,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)],[2557,134,theory(equality)])).
% cnf(2559,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)],[2558,584,theory(equality)])).
% cnf(2560,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)],[2559,587,theory(equality)])).
% cnf(2561,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0))=esk50_0),inference(cn,[status(thm)],[2560,theory(equality)])).
% cnf(2579,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)],[2561,219,theory(equality)])).
% cnf(2592,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)],[2579,583,theory(equality)])).
% cnf(2593,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2592,586,theory(equality)])).
% cnf(2594,negated_conjecture,(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0))=esk50_0),inference(cn,[status(thm)],[2593,theory(equality)])).
% cnf(2617,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk57_0)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[130,2594,theory(equality)])).
% cnf(2646,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2617,583,theory(equality)])).
% cnf(2647,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2646,584,theory(equality)])).
% cnf(2648,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2647,585,theory(equality)])).
% cnf(2649,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2648,586,theory(equality)])).
% cnf(2650,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2649,587,theory(equality)])).
% cnf(2651,negated_conjecture,(lt(esk53_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2650,theory(equality)])).
% cnf(5910,negated_conjecture,(lt(esk53_0,esk54_0)|~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2651,theory(equality)])).
% cnf(5911,negated_conjecture,(lt(esk53_0,esk54_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[5910,591,theory(equality)])).
% cnf(5912,negated_conjecture,(lt(esk53_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[5911,594,theory(equality)])).
% cnf(5913,negated_conjecture,(lt(esk53_0,esk54_0)),inference(cn,[status(thm)],[5912,theory(equality)])).
% cnf(5919,negated_conjecture,(esk54_0=esk53_0|$false),inference(rw,[status(thm)],[1456,5913,theory(equality)])).
% cnf(5920,negated_conjecture,(esk54_0=esk53_0),inference(cn,[status(thm)],[5919,theory(equality)])).
% cnf(5976,negated_conjecture,(lt(esk53_0,esk53_0)),inference(rw,[status(thm)],[5913,5920,theory(equality)])).
% cnf(6201,negated_conjecture,(~ssItem(esk53_0)),inference(spm,[status(thm)],[236,5976,theory(equality)])).
% cnf(6206,negated_conjecture,($false),inference(rw,[status(thm)],[6201,587,theory(equality)])).
% cnf(6207,negated_conjecture,($false),inference(cn,[status(thm)],[6206,theory(equality)])).
% cnf(6208,negated_conjecture,($false),6207,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 551
% # ...of these trivial : 14
% # ...subsumed : 16
% # ...remaining for further processing: 521
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 269
% # Generated clauses : 2040
% # ...of the previous two non-trivial : 1937
% # Contextual simplify-reflections : 20
% # Paramodulations : 1946
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 226
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 193
% # Current number of unprocessed clauses: 674
% # ...number of literals in the above : 4005
% # Clause-clause subsumption calls (NU) : 10215
% # Rec. Clause-clause subsumption calls : 7751
% # Unit Clause-clause subsumption calls : 112
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 256 leaves, 1.34+/-1.113 terms/leaf
% # Paramod-from index: 121 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 223 leaves, 1.21+/-0.926 terms/leaf
% # -------------------------------------------------
% # User time : 0.177 s
% # System time : 0.007 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/SystemOnTPTP28601/SWC160+1.tptp
%
%------------------------------------------------------------------------------