TSTP Solution File: SWC315+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC315+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 : art07.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:46:11 EST 2010

% Result   : Theorem 1.32s
% Output   : Solution 1.32s
% 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/SystemOnTPTP15154/SWC315+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP15154/SWC315+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15154/SWC315+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 15250
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(25, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(26, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>tl(cons(X2,X1))=X1)),file('/tmp/SRASS.s.p', ax25)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X2))|app(X6,cons(X5,nil))=X1))&(~(nil=X2)|nil=X1)))|(![X7]:(ssItem(X7)=>![X8]:((~(ssList(X8))|~(app(cons(X7,nil),X8)=X4))|~(app(X8,cons(X7,nil))=X3)))&neq(X4,nil)))))),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))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X2))|app(X6,cons(X5,nil))=X1))&(~(nil=X2)|nil=X1)))|(![X7]:(ssItem(X7)=>![X8]:((~(ssList(X8))|~(app(cons(X7,nil),X8)=X4))|~(app(X8,cons(X7,nil))=X3)))&neq(X4,nil))))))),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))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X2))|app(X6,cons(X5,nil))=X1))&(~(nil=X2)|nil=X1)))|(![X7]:(ssItem(X7)=>![X8]:((~(ssList(X8))|~(app(cons(X7,nil),X8)=X4))|~(app(X8,cons(X7,nil))=X3)))&neq(X4,nil))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[117])).
% cnf(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(144, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[145])).
% fof(166, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[15])).
% 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(234, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[25])).
% fof(235, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[235])).
% cnf(237,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[236])).
% fof(238, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|tl(cons(X2,X1))=X1)),inference(fof_nnf,[status(thm)],[26])).
% fof(239, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|tl(cons(X4,X3))=X3)),inference(variable_rename,[status(thm)],[238])).
% fof(240, plain,![X3]:![X4]:((~(ssItem(X4))|tl(cons(X4,X3))=X3)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[239])).
% cnf(241,plain,(tl(cons(X2,X1))=X1|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[240])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((((ssList(X4)&X2=X4)&X1=X3)&(nil=X3|~(nil=X4)))&(?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&app(cons(X5,nil),X6)=X2)&~(app(X6,cons(X5,nil))=X1)))|(nil=X2&~(nil=X1))))&(?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X4)&app(X8,cons(X7,nil))=X3))|~(neq(X4,nil))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(((((ssList(X12)&X10=X12)&X9=X11)&(nil=X11|~(nil=X12)))&(?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(cons(X13,nil),X14)=X10)&~(app(X14,cons(X13,nil))=X9)))|(nil=X10&~(nil=X9))))&(?[X15]:(ssItem(X15)&?[X16]:((ssList(X16)&app(cons(X15,nil),X16)=X12)&app(X16,cons(X15,nil))=X11))|~(neq(X12,nil))))))),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)&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&((ssList(esk53_0)&app(cons(esk52_0,nil),esk53_0)=esk49_0)&~(app(esk53_0,cons(esk52_0,nil))=esk48_0)))|(nil=esk49_0&~(nil=esk48_0))))&((ssItem(esk54_0)&((ssList(esk55_0)&app(cons(esk54_0,nil),esk55_0)=esk51_0)&app(esk55_0,cons(esk54_0,nil))=esk50_0))|~(neq(esk51_0,nil))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(((((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&(nil=esk50_0|~(nil=esk51_0)))&(((nil=esk49_0|ssItem(esk52_0))&(~(nil=esk48_0)|ssItem(esk52_0)))&((((nil=esk49_0|ssList(esk53_0))&(~(nil=esk48_0)|ssList(esk53_0)))&((nil=esk49_0|app(cons(esk52_0,nil),esk53_0)=esk49_0)&(~(nil=esk48_0)|app(cons(esk52_0,nil),esk53_0)=esk49_0)))&((nil=esk49_0|~(app(esk53_0,cons(esk52_0,nil))=esk48_0))&(~(nil=esk48_0)|~(app(esk53_0,cons(esk52_0,nil))=esk48_0))))))&((ssItem(esk54_0)|~(neq(esk51_0,nil)))&(((ssList(esk55_0)|~(neq(esk51_0,nil)))&(app(cons(esk54_0,nil),esk55_0)=esk51_0|~(neq(esk51_0,nil))))&(app(esk55_0,cons(esk54_0,nil))=esk50_0|~(neq(esk51_0,nil))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(app(esk55_0,cons(esk54_0,nil))=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(app(cons(esk54_0,nil),esk55_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssList(esk55_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(ssItem(esk54_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(nil=esk49_0|app(esk53_0,cons(esk52_0,nil))!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk49_0|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk49_0|nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk53_0)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk53_0)|nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(ssItem(esk52_0)|nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(589,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(591,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[589,586,theory(equality)])).
% cnf(594,negated_conjecture,(esk48_0=nil|esk51_0!=nil),inference(rw,[status(thm)],[584,585,theory(equality)])).
% cnf(595,negated_conjecture,(esk51_0=nil|ssItem(esk52_0)),inference(rw,[status(thm)],[583,586,theory(equality)])).
% cnf(596,negated_conjecture,(esk51_0=nil|ssList(esk53_0)),inference(rw,[status(thm)],[581,586,theory(equality)])).
% cnf(597,negated_conjecture,(esk51_0=nil|app(esk53_0,cons(esk52_0,nil))!=esk48_0),inference(rw,[status(thm)],[577,586,theory(equality)])).
% cnf(598,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|esk48_0!=nil),inference(rw,[status(thm)],[578,586,theory(equality)])).
% cnf(599,negated_conjecture,(esk51_0=nil|app(cons(esk52_0,nil),esk53_0)=esk49_0),inference(rw,[status(thm)],[579,586,theory(equality)])).
% cnf(600,negated_conjecture,(esk51_0=nil|app(cons(esk52_0,nil),esk53_0)=esk51_0),inference(rw,[status(thm)],[599,586,theory(equality)])).
% cnf(601,negated_conjecture,(app(esk55_0,cons(esk54_0,nil))=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[572,585,theory(equality)])).
% cnf(673,negated_conjecture,(ssItem(esk54_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[575,119,theory(equality)])).
% cnf(674,negated_conjecture,(ssList(esk55_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[574,119,theory(equality)])).
% cnf(675,negated_conjecture,(app(esk55_0,cons(esk54_0,nil))=esk48_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[601,119,theory(equality)])).
% cnf(676,negated_conjecture,(app(cons(esk54_0,nil),esk55_0)=esk51_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[573,119,theory(equality)])).
% cnf(677,negated_conjecture,(ssItem(esk54_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[673,125,theory(equality)])).
% cnf(678,negated_conjecture,(ssItem(esk54_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[677,591,theory(equality)])).
% cnf(679,negated_conjecture,(ssItem(esk54_0)|esk51_0=nil),inference(cn,[status(thm)],[678,theory(equality)])).
% cnf(680,negated_conjecture,(ssList(esk55_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[674,125,theory(equality)])).
% cnf(681,negated_conjecture,(ssList(esk55_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[680,591,theory(equality)])).
% cnf(682,negated_conjecture,(ssList(esk55_0)|esk51_0=nil),inference(cn,[status(thm)],[681,theory(equality)])).
% cnf(683,negated_conjecture,(app(esk55_0,cons(esk54_0,nil))=esk48_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[675,125,theory(equality)])).
% cnf(684,negated_conjecture,(app(esk55_0,cons(esk54_0,nil))=esk48_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[683,591,theory(equality)])).
% cnf(685,negated_conjecture,(app(esk55_0,cons(esk54_0,nil))=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[684,theory(equality)])).
% cnf(686,negated_conjecture,(app(cons(esk54_0,nil),esk55_0)=esk51_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[676,125,theory(equality)])).
% cnf(687,negated_conjecture,(app(cons(esk54_0,nil),esk55_0)=esk51_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[686,591,theory(equality)])).
% cnf(688,negated_conjecture,(app(cons(esk54_0,nil),esk55_0)=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[687,theory(equality)])).
% cnf(692,negated_conjecture,(cons(esk52_0,esk53_0)=esk51_0|esk51_0=nil|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[600,169,theory(equality)])).
% cnf(1408,negated_conjecture,(esk51_0=cons(esk54_0,esk55_0)|esk51_0=nil|~ssList(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[169,688,theory(equality)])).
% cnf(1416,negated_conjecture,(cons(esk52_0,esk53_0)=esk51_0|esk51_0=nil|~ssList(esk53_0)),inference(csr,[status(thm)],[692,595])).
% cnf(1417,negated_conjecture,(cons(esk52_0,esk53_0)=esk51_0|esk51_0=nil),inference(csr,[status(thm)],[1416,596])).
% cnf(1425,negated_conjecture,(hd(esk51_0)=esk52_0|esk51_0=nil|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[237,1417,theory(equality)])).
% cnf(1426,negated_conjecture,(tl(esk51_0)=esk53_0|esk51_0=nil|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[241,1417,theory(equality)])).
% cnf(1452,negated_conjecture,(cons(esk54_0,esk55_0)=esk51_0|esk51_0=nil|~ssList(esk55_0)),inference(csr,[status(thm)],[1408,679])).
% cnf(1453,negated_conjecture,(cons(esk54_0,esk55_0)=esk51_0|esk51_0=nil),inference(csr,[status(thm)],[1452,682])).
% cnf(1461,negated_conjecture,(hd(esk51_0)=esk54_0|esk51_0=nil|~ssList(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[237,1453,theory(equality)])).
% cnf(1462,negated_conjecture,(tl(esk51_0)=esk55_0|esk51_0=nil|~ssList(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[241,1453,theory(equality)])).
% cnf(1738,negated_conjecture,(hd(esk51_0)=esk52_0|esk51_0=nil|~ssList(esk53_0)),inference(csr,[status(thm)],[1425,595])).
% cnf(1739,negated_conjecture,(hd(esk51_0)=esk52_0|esk51_0=nil),inference(csr,[status(thm)],[1738,596])).
% cnf(1789,negated_conjecture,(tl(esk51_0)=esk53_0|esk51_0=nil|~ssList(esk53_0)),inference(csr,[status(thm)],[1426,595])).
% cnf(1790,negated_conjecture,(tl(esk51_0)=esk53_0|esk51_0=nil),inference(csr,[status(thm)],[1789,596])).
% cnf(1832,negated_conjecture,(hd(esk51_0)=esk54_0|esk51_0=nil|~ssList(esk55_0)),inference(csr,[status(thm)],[1461,679])).
% cnf(1833,negated_conjecture,(hd(esk51_0)=esk54_0|esk51_0=nil),inference(csr,[status(thm)],[1832,682])).
% cnf(1840,negated_conjecture,(esk54_0=esk52_0|esk51_0=nil),inference(spm,[status(thm)],[1739,1833,theory(equality)])).
% cnf(1855,negated_conjecture,(app(esk55_0,cons(esk52_0,nil))=esk48_0|esk51_0=nil),inference(spm,[status(thm)],[685,1840,theory(equality)])).
% cnf(2054,negated_conjecture,(tl(esk51_0)=esk55_0|esk51_0=nil|~ssList(esk55_0)),inference(csr,[status(thm)],[1462,679])).
% cnf(2055,negated_conjecture,(tl(esk51_0)=esk55_0|esk51_0=nil),inference(csr,[status(thm)],[2054,682])).
% cnf(2058,negated_conjecture,(esk55_0=esk53_0|esk51_0=nil),inference(spm,[status(thm)],[1790,2055,theory(equality)])).
% cnf(2072,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk48_0|esk51_0=nil),inference(spm,[status(thm)],[1855,2058,theory(equality)])).
% cnf(2165,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[2072,597])).
% cnf(2228,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=nil|esk48_0!=nil),inference(rw,[status(thm)],[598,2165,theory(equality)])).
% cnf(2236,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[594,2165,theory(equality)])).
% cnf(2237,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[2236,theory(equality)])).
% cnf(2242,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[580,2237,theory(equality)])).
% cnf(2243,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[2242,theory(equality)])).
% cnf(2244,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[582,2237,theory(equality)])).
% cnf(2245,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[2244,theory(equality)])).
% cnf(2253,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=nil|$false),inference(rw,[status(thm)],[2228,2237,theory(equality)])).
% cnf(2254,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=nil),inference(cn,[status(thm)],[2253,theory(equality)])).
% cnf(2270,negated_conjecture,(nil=cons(esk52_0,esk53_0)|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[169,2254,theory(equality)])).
% cnf(2304,negated_conjecture,(nil=cons(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2270,2243,theory(equality)])).
% cnf(2305,negated_conjecture,(nil=cons(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[2304,2245,theory(equality)])).
% cnf(2306,negated_conjecture,(nil=cons(esk52_0,esk53_0)),inference(cn,[status(thm)],[2305,theory(equality)])).
% cnf(2311,negated_conjecture,(~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[146,2306,theory(equality)])).
% cnf(2354,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2311,2243,theory(equality)])).
% cnf(2355,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2354,2245,theory(equality)])).
% cnf(2356,negated_conjecture,($false),inference(cn,[status(thm)],[2355,theory(equality)])).
% cnf(2357,negated_conjecture,($false),2356,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 305
% # ...of these trivial                : 2
% # ...subsumed                        : 38
% # ...remaining for further processing: 265
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 54
% # Generated clauses                  : 1158
% # ...of the previous two non-trivial : 994
% # Contextual simplify-reflections    : 54
% # Paramodulations                    : 1067
% # Factorizations                     : 0
% # Equation resolutions               : 91
% # Current number of processed clauses: 205
% #    Positive orientable unit clauses: 26
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 176
% # Current number of unprocessed clauses: 459
% # ...number of literals in the above : 3224
% # Clause-clause subsumption calls (NU) : 1633
% # Rec. Clause-clause subsumption calls : 806
% # Unit Clause-clause subsumption calls : 72
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 4
% # Indexed BW rewrite successes       : 4
% # Backwards rewriting index:   249 leaves,   1.33+/-1.102 terms/leaf
% # Paramod-from index:          109 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          206 leaves,   1.23+/-0.961 terms/leaf
% # -------------------------------------------------
% # User time              : 0.090 s
% # System time            : 0.007 s
% # Total time             : 0.097 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP15154/SWC315+1.tptp
% 
%------------------------------------------------------------------------------