TSTP Solution File: SWC300+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC300+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 : art01.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:43:43 EST 2010
% Result : Theorem 1.69s
% Output : Solution 1.69s
% 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/SystemOnTPTP28653/SWC300+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28653/SWC300+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28653/SWC300+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 28749
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(8, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(11, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),file('/tmp/SRASS.s.p', ax33)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(18, 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(22, 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(38, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)<=>(~(X1=X2)&leq(X1,X2))))),file('/tmp/SRASS.s.p', ax93)).
% fof(66, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>((leq(X1,X2)&leq(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax29)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|~(totalorderedP(X3)))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>(~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1)|~(lt(X6,X5))))))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|~(totalorderedP(X3)))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>(~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1)|~(lt(X6,X5)))))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|~(totalorderedP(X3)))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>(~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1)|~(lt(X6,X5)))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(109, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(110, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[109])).
% fof(111, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[110])).
% cnf(112,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[111])).
% cnf(113,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(135, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(136, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[135])).
% fof(137, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[136])).
% cnf(138,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[137])).
% fof(146, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(lt(X1,X2))|~(lt(X2,X1))))),inference(fof_nnf,[status(thm)],[98])).
% fof(147, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X3]:![X4]:((~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[147])).
% cnf(149,plain,(~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[148])).
% fof(166, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[17])).
% fof(167, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[166])).
% fof(168, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[167])).
% cnf(169,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[168])).
% fof(170, 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)],[18])).
% fof(171, 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)],[170])).
% fof(172, 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)],[171])).
% cnf(173,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[172])).
% fof(187, 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)],[22])).
% fof(188, 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)],[187])).
% fof(189, 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(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&~(leq(esk5_1(X7),esk6_1(X7)))))))))|totalorderedP(X7)))),inference(skolemize,[status(esa)],[188])).
% fof(190, 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(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&~(leq(esk5_1(X7),esk6_1(X7)))))))))|totalorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[189])).
% fof(191, 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(esk5_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssItem(esk6_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk7_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk8_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk9_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((app(app(esk7_1(X7),cons(esk5_1(X7),esk8_1(X7))),cons(esk6_1(X7),esk9_1(X7)))=X7|totalorderedP(X7))|~(ssList(X7)))&((~(leq(esk5_1(X7),esk6_1(X7)))|totalorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[190])).
% cnf(199,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)],[191])).
% fof(312, 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)],[38])).
% fof(313, 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)],[312])).
% fof(314, 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)],[313])).
% fof(315, 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)],[314])).
% cnf(317,plain,(leq(X1,X2)|~ssItem(X1)|~ssItem(X2)|~lt(X1,X2)),inference(split_conjunct,[status(thm)],[315])).
% fof(470, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(leq(X1,X2))|~(leq(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[66])).
% fof(471, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[470])).
% fof(472, plain,![X3]:![X4]:((~(ssItem(X4))|((~(leq(X3,X4))|~(leq(X4,X3)))|X3=X4))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[471])).
% cnf(473,plain,(X1=X2|~ssItem(X1)|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[472])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&totalorderedP(X3))&?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1<(X6,X5)))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&(((X11=X13&X10=X12)&totalorderedP(X12))&?[X14]:(ssItem(X14)&?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&(app(app(app(app(X16,cons(X14,nil)),X17),cons(X15,nil)),X18)=X10<(X15,X14)))))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk49_0=esk51_0&esk48_0=esk50_0)&totalorderedP(esk50_0))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0<(esk53_0,esk52_0)))))))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(lt(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(totalorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(584,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(588,negated_conjecture,(totalorderedP(esk48_0)),inference(rw,[status(thm)],[578,579,theory(equality)])).
% cnf(623,negated_conjecture,(~lt(esk52_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[149,571,theory(equality)])).
% cnf(624,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[623,576,theory(equality)])).
% cnf(625,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[624,577,theory(equality)])).
% cnf(626,negated_conjecture,(~lt(esk52_0,esk53_0)),inference(cn,[status(thm)],[625,theory(equality)])).
% cnf(670,negated_conjecture,(leq(esk53_0,esk52_0)|~ssItem(esk52_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[317,571,theory(equality)])).
% cnf(671,negated_conjecture,(leq(esk53_0,esk52_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[670,577,theory(equality)])).
% cnf(672,negated_conjecture,(leq(esk53_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[671,576,theory(equality)])).
% cnf(673,negated_conjecture,(leq(esk53_0,esk52_0)),inference(cn,[status(thm)],[672,theory(equality)])).
% cnf(902,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|~ssList(esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[572,173,theory(equality)])).
% cnf(913,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|$false|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(rw,[status(thm)],[902,574,theory(equality)])).
% cnf(914,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|$false|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[913,575,theory(equality)])).
% cnf(915,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[914,theory(equality)])).
% cnf(1408,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[473,673,theory(equality)])).
% cnf(1415,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1408,576,theory(equality)])).
% cnf(1416,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[1415,577,theory(equality)])).
% cnf(1417,negated_conjecture,(esk52_0=esk53_0|~leq(esk52_0,esk53_0)),inference(cn,[status(thm)],[1416,theory(equality)])).
% cnf(1593,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[915,112,theory(equality)])).
% cnf(1594,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1593,113,theory(equality)])).
% cnf(1595,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|$false|$false),inference(rw,[status(thm)],[1594,577,theory(equality)])).
% cnf(1596,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0),inference(cn,[status(thm)],[1595,theory(equality)])).
% cnf(1614,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1596,169,theory(equality)])).
% cnf(1654,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1614,574,theory(equality)])).
% cnf(1655,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0|$false|$false),inference(rw,[status(thm)],[1654,577,theory(equality)])).
% cnf(1656,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk48_0),inference(cn,[status(thm)],[1655,theory(equality)])).
% cnf(1673,negated_conjecture,(esk48_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(esk56_0)|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(spm,[status(thm)],[173,1656,theory(equality)])).
% cnf(1705,negated_conjecture,(esk48_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|$false|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(rw,[status(thm)],[1673,573,theory(equality)])).
% cnf(1706,negated_conjecture,(esk48_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[1705,theory(equality)])).
% cnf(2478,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1706,112,theory(equality)])).
% cnf(2479,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2478,113,theory(equality)])).
% cnf(2480,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|$false),inference(rw,[status(thm)],[2479,576,theory(equality)])).
% cnf(2481,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[2480,theory(equality)])).
% cnf(2482,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(cons(esk52_0,esk55_0))|~ssList(esk54_0)),inference(spm,[status(thm)],[2481,138,theory(equality)])).
% cnf(2483,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(cons(esk52_0,esk55_0))|$false),inference(rw,[status(thm)],[2482,575,theory(equality)])).
% cnf(2484,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(cons(esk52_0,esk55_0))),inference(cn,[status(thm)],[2483,theory(equality)])).
% cnf(2485,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2484,112,theory(equality)])).
% cnf(2486,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2485,574,theory(equality)])).
% cnf(2487,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0|$false|$false),inference(rw,[status(thm)],[2486,577,theory(equality)])).
% cnf(2488,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk48_0),inference(cn,[status(thm)],[2487,theory(equality)])).
% cnf(2506,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk48_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2488,169,theory(equality)])).
% cnf(2519,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk48_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2506,573,theory(equality)])).
% cnf(2520,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk48_0|$false|$false),inference(rw,[status(thm)],[2519,576,theory(equality)])).
% cnf(2521,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk48_0),inference(cn,[status(thm)],[2520,theory(equality)])).
% cnf(2545,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[199,2521,theory(equality)])).
% cnf(2580,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2545,573,theory(equality)])).
% cnf(2581,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|$false|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2580,574,theory(equality)])).
% cnf(2582,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2581,575,theory(equality)])).
% cnf(2583,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2582,576,theory(equality)])).
% cnf(2584,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2583,577,theory(equality)])).
% cnf(2585,negated_conjecture,(leq(esk52_0,esk53_0)|esk48_0!=X1|~totalorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2584,theory(equality)])).
% cnf(6597,negated_conjecture,(leq(esk52_0,esk53_0)|~totalorderedP(esk48_0)|~ssList(esk48_0)),inference(er,[status(thm)],[2585,theory(equality)])).
% cnf(6598,negated_conjecture,(leq(esk52_0,esk53_0)|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[6597,588,theory(equality)])).
% cnf(6599,negated_conjecture,(leq(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[6598,584,theory(equality)])).
% cnf(6600,negated_conjecture,(leq(esk52_0,esk53_0)),inference(cn,[status(thm)],[6599,theory(equality)])).
% cnf(6607,negated_conjecture,(esk53_0=esk52_0|$false),inference(rw,[status(thm)],[1417,6600,theory(equality)])).
% cnf(6608,negated_conjecture,(esk53_0=esk52_0),inference(cn,[status(thm)],[6607,theory(equality)])).
% cnf(6874,negated_conjecture,(~lt(esk52_0,esk52_0)),inference(rw,[status(thm)],[626,6608,theory(equality)])).
% cnf(6879,negated_conjecture,(lt(esk52_0,esk52_0)),inference(rw,[status(thm)],[571,6608,theory(equality)])).
% cnf(6886,negated_conjecture,($false),inference(sr,[status(thm)],[6879,6874,theory(equality)])).
% cnf(6887,negated_conjecture,($false),6886,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 695
% # ...of these trivial : 14
% # ...subsumed : 92
% # ...remaining for further processing: 589
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 76
% # Backward-rewritten : 266
% # Generated clauses : 2327
% # ...of the previous two non-trivial : 2214
% # Contextual simplify-reflections : 53
% # Paramodulations : 2232
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 240
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 208
% # Current number of unprocessed clauses: 760
% # ...number of literals in the above : 4678
% # Clause-clause subsumption calls (NU) : 12264
% # Rec. Clause-clause subsumption calls : 9700
% # Unit Clause-clause subsumption calls : 118
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 266 leaves, 1.33+/-1.078 terms/leaf
% # Paramod-from index: 131 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 238 leaves, 1.20+/-0.898 terms/leaf
% # -------------------------------------------------
% # User time : 0.205 s
% # System time : 0.007 s
% # Total time : 0.212 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.48 WC
% FINAL PrfWatch: 0.43 CPU 0.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP28653/SWC300+1.tptp
%
%------------------------------------------------------------------------------