TSTP Solution File: SWC191+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC191+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 : art04.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:19:03 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP31841/SWC191+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31841/SWC191+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31841/SWC191+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 31937
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(ssList(X1)=>(equalelemsP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>(app(X4,cons(X2,cons(X3,X5)))=X1=>X2=X3))))))),file('/tmp/SRASS.s.p', ax14)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(8, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssItem(X3)=>cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),file('/tmp/SRASS.s.p', ax27)).
% fof(33, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(34, 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&equalelemsP(X5)))|![X6]:(ssItem(X6)=>![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>(~(app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9)=X1)|X6=X7)))))))))),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))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&equalelemsP(X5)))|![X6]:(ssItem(X6)=>![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>(~(app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9)=X1)|X6=X7))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&equalelemsP(X5)))|![X6]:(ssItem(X6)=>![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>(~(app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9)=X1)|X6=X7))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(132, plain,![X1]:(~(ssList(X1))|((~(equalelemsP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|(~(app(X4,cons(X2,cons(X3,X5)))=X1)|X2=X3))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&(app(X4,cons(X2,cons(X3,X5)))=X1&~(X2=X3))))))|equalelemsP(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(133, plain,![X6]:(~(ssList(X6))|((~(equalelemsP(X6))|![X7]:(~(ssItem(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))))))&(?[X11]:(ssItem(X11)&?[X12]:(ssItem(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(app(X13,cons(X11,cons(X12,X14)))=X6&~(X11=X12))))))|equalelemsP(X6)))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,![X6]:(~(ssList(X6))|((~(equalelemsP(X6))|![X7]:(~(ssItem(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))))))&((ssItem(esk6_1(X6))&(ssItem(esk7_1(X6))&(ssList(esk8_1(X6))&(ssList(esk9_1(X6))&(app(esk8_1(X6),cons(esk6_1(X6),cons(esk7_1(X6),esk9_1(X6))))=X6&~(esk6_1(X6)=esk7_1(X6)))))))|equalelemsP(X6)))),inference(skolemize,[status(esa)],[133])).
% fof(135, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))|~(ssList(X9)))|~(ssItem(X8)))|~(ssItem(X7)))|~(equalelemsP(X6)))&((ssItem(esk6_1(X6))&(ssItem(esk7_1(X6))&(ssList(esk8_1(X6))&(ssList(esk9_1(X6))&(app(esk8_1(X6),cons(esk6_1(X6),cons(esk7_1(X6),esk9_1(X6))))=X6&~(esk6_1(X6)=esk7_1(X6)))))))|equalelemsP(X6)))|~(ssList(X6))),inference(shift_quantors,[status(thm)],[134])).
% fof(136, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))|~(ssList(X9)))|~(ssItem(X8)))|~(ssItem(X7)))|~(equalelemsP(X6)))|~(ssList(X6)))&(((ssItem(esk6_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssItem(esk7_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssList(esk8_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssList(esk9_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((app(esk8_1(X6),cons(esk6_1(X6),cons(esk7_1(X6),esk9_1(X6))))=X6|equalelemsP(X6))|~(ssList(X6)))&((~(esk6_1(X6)=esk7_1(X6))|equalelemsP(X6))|~(ssList(X6))))))))),inference(distribute,[status(thm)],[135])).
% cnf(143,plain,(X2=X3|~ssList(X1)|~equalelemsP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|app(X4,cons(X2,cons(X3,X5)))!=X1|~ssList(X5)),inference(split_conjunct,[status(thm)],[136])).
% fof(150, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(151, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[151])).
% cnf(153,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[152])).
% cnf(154,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[8])).
% fof(180, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssItem(X3))|cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(181, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4)))),inference(variable_rename,[status(thm)],[180])).
% fof(182, plain,![X4]:![X5]:![X6]:(((~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[181])).
% cnf(183,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[182])).
% fof(252, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[33])).
% fof(253, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[252])).
% fof(254, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[253])).
% cnf(255,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[254])).
% fof(256, 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)],[34])).
% fof(257, 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)],[256])).
% fof(258, 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)],[257])).
% cnf(259,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[258])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&frontsegP(X4,X3))&equalelemsP(X3))&![X5]:((((~(ssList(X5))|~(neq(X3,X5)))|~(frontsegP(X4,X5)))|~(segmentP(X5,X3)))|~(equalelemsP(X5))))&?[X6]:(ssItem(X6)&?[X7]:(ssItem(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&(app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9)=X1&~(X6=X7))))))))))),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)&frontsegP(X13,X12))&equalelemsP(X12))&![X14]:((((~(ssList(X14))|~(neq(X12,X14)))|~(frontsegP(X13,X14)))|~(segmentP(X14,X12)))|~(equalelemsP(X14))))&?[X15]:(ssItem(X15)&?[X16]:(ssItem(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&(app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18)=X10&~(X15=X16))))))))))),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)&frontsegP(esk51_0,esk50_0))&equalelemsP(esk50_0))&![X14]:((((~(ssList(X14))|~(neq(esk50_0,X14)))|~(frontsegP(esk51_0,X14)))|~(segmentP(X14,esk50_0)))|~(equalelemsP(X14))))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0&~(esk52_0=esk53_0))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X14]:((((((((((~(ssList(X14))|~(neq(esk50_0,X14)))|~(frontsegP(esk51_0,X14)))|~(segmentP(X14,esk50_0)))|~(equalelemsP(X14)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&frontsegP(esk51_0,esk50_0))&equalelemsP(esk50_0)))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0&~(esk52_0=esk53_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(576,negated_conjecture,(esk52_0!=esk53_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(equalelemsP(esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,584,theory(equality)])).
% cnf(591,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[577,584,theory(equality)])).
% cnf(919,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[591,259,theory(equality)])).
% cnf(929,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[919,579,theory(equality)])).
% cnf(930,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[929,theory(equality)])).
% cnf(1611,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[930,153,theory(equality)])).
% cnf(1612,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1611,154,theory(equality)])).
% cnf(1613,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|$false|$false),inference(rw,[status(thm)],[1612,580,theory(equality)])).
% cnf(1614,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1613,theory(equality)])).
% cnf(1615,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1614,153,theory(equality)])).
% cnf(1616,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1615,154,theory(equality)])).
% cnf(1617,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1616,581,theory(equality)])).
% cnf(1618,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0),inference(cn,[status(thm)],[1617,theory(equality)])).
% cnf(1636,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssItem(esk52_0)),inference(spm,[status(thm)],[1618,255,theory(equality)])).
% cnf(1676,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[1636,581,theory(equality)])).
% cnf(1677,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[1676,theory(equality)])).
% cnf(1678,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1677,153,theory(equality)])).
% cnf(1679,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1678,154,theory(equality)])).
% cnf(1680,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1679,580,theory(equality)])).
% cnf(1681,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0),inference(cn,[status(thm)],[1680,theory(equality)])).
% cnf(1696,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|~ssList(esk55_0)|~ssList(cons(esk52_0,cons(esk53_0,nil)))|~ssList(esk54_0)),inference(spm,[status(thm)],[259,1681,theory(equality)])).
% cnf(1728,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|$false|~ssList(cons(esk52_0,cons(esk53_0,nil)))|~ssList(esk54_0)),inference(rw,[status(thm)],[1696,578,theory(equality)])).
% cnf(1729,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|$false|~ssList(cons(esk52_0,cons(esk53_0,nil)))|$false),inference(rw,[status(thm)],[1728,579,theory(equality)])).
% cnf(1730,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|~ssList(cons(esk52_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[1729,theory(equality)])).
% cnf(1734,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))|~ssItem(esk52_0)),inference(spm,[status(thm)],[1730,153,theory(equality)])).
% cnf(1735,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[1734,581,theory(equality)])).
% cnf(1736,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[1735,theory(equality)])).
% cnf(1737,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1736,153,theory(equality)])).
% cnf(1738,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1737,154,theory(equality)])).
% cnf(1739,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[1738,580,theory(equality)])).
% cnf(1740,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0),inference(cn,[status(thm)],[1739,theory(equality)])).
% cnf(1755,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1740,183,theory(equality)])).
% cnf(1787,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1755,578,theory(equality)])).
% cnf(1788,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|$false|$false),inference(rw,[status(thm)],[1787,581,theory(equality)])).
% cnf(1789,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[1788,theory(equality)])).
% cnf(1790,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1789,153,theory(equality)])).
% cnf(1791,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1790,154,theory(equality)])).
% cnf(1792,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[1791,580,theory(equality)])).
% cnf(1793,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0),inference(cn,[status(thm)],[1792,theory(equality)])).
% cnf(1815,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|~ssList(esk55_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1793,255,theory(equality)])).
% cnf(1868,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1815,578,theory(equality)])).
% cnf(1869,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[1868,580,theory(equality)])).
% cnf(1870,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0),inference(cn,[status(thm)],[1869,theory(equality)])).
% cnf(1891,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[143,1870,theory(equality)])).
% cnf(1939,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1891,578,theory(equality)])).
% cnf(1940,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1939,579,theory(equality)])).
% cnf(1941,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1940,580,theory(equality)])).
% cnf(1942,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[1941,581,theory(equality)])).
% cnf(1943,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|~ssList(X1)),inference(cn,[status(thm)],[1942,theory(equality)])).
% cnf(1944,negated_conjecture,(esk50_0!=X1|~equalelemsP(X1)|~ssList(X1)),inference(sr,[status(thm)],[1943,576,theory(equality)])).
% cnf(2919,negated_conjecture,(~equalelemsP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[1944,theory(equality)])).
% cnf(2920,negated_conjecture,($false|~ssList(esk50_0)),inference(rw,[status(thm)],[2919,582,theory(equality)])).
% cnf(2921,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2920,587,theory(equality)])).
% cnf(2922,negated_conjecture,($false),inference(cn,[status(thm)],[2921,theory(equality)])).
% cnf(2923,negated_conjecture,($false),2922,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 314
% # ...of these trivial : 2
% # ...subsumed : 8
% # ...remaining for further processing: 304
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 21
% # Generated clauses : 1032
% # ...of the previous two non-trivial : 874
% # Contextual simplify-reflections : 4
% # Paramodulations : 938
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 273
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 219
% # Current number of unprocessed clauses: 742
% # ...number of literals in the above : 4556
% # Clause-clause subsumption calls (NU) : 1998
% # Rec. Clause-clause subsumption calls : 1232
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 303 leaves, 1.34+/-1.087 terms/leaf
% # Paramod-from index: 125 leaves, 1.06+/-0.395 terms/leaf
% # Paramod-into index: 254 leaves, 1.24+/-0.943 terms/leaf
% # -------------------------------------------------
% # User time : 0.098 s
% # System time : 0.003 s
% # Total time : 0.101 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.33 WC
% FINAL PrfWatch: 0.25 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP31841/SWC191+1.tptp
%
%------------------------------------------------------------------------------