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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC327+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 : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:54:31 EST 2010

% Result   : Theorem 1.57s
% Output   : Solution 1.57s
% 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/SystemOnTPTP1376/SWC327+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1376/SWC327+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1376/SWC327+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 1508
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(8, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(18, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(19, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% 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)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|(?[X9]:(((ssList(X9)&app(X1,X9)=X2)&![X10]:(ssItem(X10)=>![X11]:(ssList(X11)=>(~(app(cons(X10,nil),X11)=X9)|![X12]:(ssList(X12)=>~(app(X12,cons(X10,nil))=X1))))))&equalelemsP(X1))&(~(nil=X1)|nil=X2))))))),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)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|(?[X9]:(((ssList(X9)&app(X1,X9)=X2)&![X10]:(ssItem(X10)=>![X11]:(ssList(X11)=>(~(app(cons(X10,nil),X11)=X9)|![X12]:(ssList(X12)=>~(app(X12,cons(X10,nil))=X1))))))&equalelemsP(X1))&(~(nil=X1)|nil=X2)))))))),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))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|(?[X9]:(((ssList(X9)&app(X1,X9)=X2)&![X10]:(ssItem(X10)=>![X11]:(ssList(X11)=>(~(app(cons(X10,nil),X11)=X9)|![X12]:(ssList(X12)=>~(app(X12,cons(X10,nil))=X1))))))&equalelemsP(X1))&(~(nil=X1)|nil=X2)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(121, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(122, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[8])).
% 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(178, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[18])).
% fof(179, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[178])).
% fof(180, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[179])).
% fof(181, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[180])).
% cnf(183,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[181])).
% cnf(184,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[181])).
% fof(185, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[19])).
% fof(186, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[185])).
% cnf(187,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[186])).
% 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&equalelemsP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssList(X8))|~(app(X8,cons(X6,nil))=X3)))))))&(nil=X4|~(nil=X3)))&(![X9]:(((~(ssList(X9))|~(app(X1,X9)=X2))|?[X10]:(ssItem(X10)&?[X11]:(ssList(X11)&(app(cons(X10,nil),X11)=X9&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X1)))))|~(equalelemsP(X1)))|(nil=X1&~(nil=X2)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&((((X14=X16&X13=X15)&?[X17]:(ssList(X17)&((app(X15,X17)=X16&equalelemsP(X15))&![X18]:(~(ssItem(X18))|![X19]:((~(ssList(X19))|~(app(cons(X18,nil),X19)=X17))|![X20]:(~(ssList(X20))|~(app(X20,cons(X18,nil))=X15)))))))&(nil=X16|~(nil=X15)))&(![X21]:(((~(ssList(X21))|~(app(X13,X21)=X14))|?[X22]:(ssItem(X22)&?[X23]:(ssList(X23)&(app(cons(X22,nil),X23)=X21&?[X24]:(ssList(X24)&app(X24,cons(X22,nil))=X13)))))|~(equalelemsP(X13)))|(nil=X13&~(nil=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)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0))&![X18]:(~(ssItem(X18))|![X19]:((~(ssList(X19))|~(app(cons(X18,nil),X19)=esk52_0))|![X20]:(~(ssList(X20))|~(app(X20,cons(X18,nil))=esk50_0)))))))&(nil=esk51_0|~(nil=esk50_0)))&(![X21]:(((~(ssList(X21))|~(app(esk48_0,X21)=esk49_0))|(ssItem(esk53_1(X21))&(ssList(esk54_1(X21))&(app(cons(esk53_1(X21),nil),esk54_1(X21))=X21&(ssList(esk55_1(X21))&app(esk55_1(X21),cons(esk53_1(X21),nil))=esk48_0)))))|~(equalelemsP(esk48_0)))|(nil=esk48_0&~(nil=esk49_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X18]:![X19]:![X20]:![X21]:(((((((((~(ssList(X21))|~(app(esk48_0,X21)=esk49_0))|(ssItem(esk53_1(X21))&(ssList(esk54_1(X21))&(app(cons(esk53_1(X21),nil),esk54_1(X21))=X21&(ssList(esk55_1(X21))&app(esk55_1(X21),cons(esk53_1(X21),nil))=esk48_0)))))|~(equalelemsP(esk48_0)))|(nil=esk48_0&~(nil=esk49_0)))&(((((((~(ssList(X20))|~(app(X20,cons(X18,nil))=esk50_0))|(~(ssList(X19))|~(app(cons(X18,nil),X19)=esk52_0)))|~(ssItem(X18)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_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,![X18]:![X19]:![X20]:![X21]:((((((((nil=esk48_0|((ssItem(esk53_1(X21))|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0))))&(~(nil=esk49_0)|((ssItem(esk53_1(X21))|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0)))))&(((nil=esk48_0|((ssList(esk54_1(X21))|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0))))&(~(nil=esk49_0)|((ssList(esk54_1(X21))|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0)))))&(((nil=esk48_0|((app(cons(esk53_1(X21),nil),esk54_1(X21))=X21|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0))))&(~(nil=esk49_0)|((app(cons(esk53_1(X21),nil),esk54_1(X21))=X21|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0)))))&(((nil=esk48_0|((ssList(esk55_1(X21))|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0))))&(~(nil=esk49_0)|((ssList(esk55_1(X21))|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0)))))&((nil=esk48_0|((app(esk55_1(X21),cons(esk53_1(X21),nil))=esk48_0|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0))))&(~(nil=esk49_0)|((app(esk55_1(X21),cons(esk53_1(X21),nil))=esk48_0|(~(ssList(X21))|~(app(esk48_0,X21)=esk49_0)))|~(equalelemsP(esk48_0)))))))))&(((((((~(ssList(X20))|~(app(X20,cons(X18,nil))=esk50_0))|(~(ssList(X19))|~(app(cons(X18,nil),X19)=esk52_0)))|~(ssItem(X18)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_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(577,negated_conjecture,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(equalelemsP(esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(~ssItem(X1)|app(cons(X1,nil),X2)!=esk52_0|~ssList(X2)|app(X3,cons(X1,nil))!=esk50_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=esk48_0|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=esk48_0|nil=esk48_0|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(ssList(esk55_1(X1))|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(ssList(esk55_1(X1))|nil=esk48_0|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(app(cons(esk53_1(X1),nil),esk54_1(X1))=X1|nil=esk48_0|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(ssList(esk54_1(X1))|nil=esk48_0|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(ssItem(esk53_1(X1))|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssItem(esk53_1(X1))|nil=esk48_0|~equalelemsP(esk48_0)|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(596,negated_conjecture,(equalelemsP(esk48_0)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(597,negated_conjecture,(esk49_0=nil|esk50_0!=nil),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(598,negated_conjecture,(esk49_0=nil|esk48_0!=nil),inference(rw,[status(thm)],[597,578,theory(equality)])).
% cnf(599,negated_conjecture,(app(esk48_0,esk52_0)=esk51_0),inference(rw,[status(thm)],[582,578,theory(equality)])).
% cnf(600,negated_conjecture,(app(esk48_0,esk52_0)=esk49_0),inference(rw,[status(thm)],[599,579,theory(equality)])).
% cnf(601,negated_conjecture,(ssItem(esk53_1(X1))|esk49_0!=nil|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[592,596,theory(equality)])).
% cnf(602,negated_conjecture,(ssItem(esk53_1(X1))|esk49_0!=nil|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(605,negated_conjecture,(ssList(esk55_1(X1))|esk49_0!=nil|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[586,596,theory(equality)])).
% cnf(606,negated_conjecture,(ssList(esk55_1(X1))|esk49_0!=nil|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[605,theory(equality)])).
% cnf(607,negated_conjecture,(esk48_0=nil|ssItem(esk53_1(X1))|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[593,596,theory(equality)])).
% cnf(608,negated_conjecture,(esk48_0=nil|ssItem(esk53_1(X1))|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[607,theory(equality)])).
% cnf(610,negated_conjecture,(esk48_0=nil|ssItem(esk53_1(esk52_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[608,600,theory(equality)])).
% cnf(614,negated_conjecture,(esk48_0=nil|ssItem(esk53_1(esk52_0))|$false),inference(rw,[status(thm)],[610,580,theory(equality)])).
% cnf(615,negated_conjecture,(esk48_0=nil|ssItem(esk53_1(esk52_0))),inference(cn,[status(thm)],[614,theory(equality)])).
% cnf(616,negated_conjecture,(esk48_0=nil|ssList(esk54_1(X1))|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[591,596,theory(equality)])).
% cnf(617,negated_conjecture,(esk48_0=nil|ssList(esk54_1(X1))|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[616,theory(equality)])).
% cnf(619,negated_conjecture,(esk48_0=nil|ssList(esk54_1(esk52_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[617,600,theory(equality)])).
% cnf(623,negated_conjecture,(esk48_0=nil|ssList(esk54_1(esk52_0))|$false),inference(rw,[status(thm)],[619,580,theory(equality)])).
% cnf(624,negated_conjecture,(esk48_0=nil|ssList(esk54_1(esk52_0))),inference(cn,[status(thm)],[623,theory(equality)])).
% cnf(625,negated_conjecture,(esk48_0=nil|ssList(esk55_1(X1))|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[587,596,theory(equality)])).
% cnf(626,negated_conjecture,(esk48_0=nil|ssList(esk55_1(X1))|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[625,theory(equality)])).
% cnf(628,negated_conjecture,(esk48_0=nil|ssList(esk55_1(esk52_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[626,600,theory(equality)])).
% cnf(632,negated_conjecture,(esk48_0=nil|ssList(esk55_1(esk52_0))|$false),inference(rw,[status(thm)],[628,580,theory(equality)])).
% cnf(633,negated_conjecture,(esk48_0=nil|ssList(esk55_1(esk52_0))),inference(cn,[status(thm)],[632,theory(equality)])).
% cnf(670,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=esk48_0|esk49_0!=nil|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[584,596,theory(equality)])).
% cnf(671,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=esk48_0|esk49_0!=nil|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(672,negated_conjecture,(esk48_0=nil|app(esk55_1(X1),cons(esk53_1(X1),nil))=esk48_0|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[585,596,theory(equality)])).
% cnf(673,negated_conjecture,(esk48_0=nil|app(esk55_1(X1),cons(esk53_1(X1),nil))=esk48_0|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[672,theory(equality)])).
% cnf(675,negated_conjecture,(app(esk55_1(esk52_0),cons(esk53_1(esk52_0),nil))=esk48_0|esk48_0=nil|~ssList(esk52_0)),inference(spm,[status(thm)],[673,600,theory(equality)])).
% cnf(679,negated_conjecture,(app(esk55_1(esk52_0),cons(esk53_1(esk52_0),nil))=esk48_0|esk48_0=nil|$false),inference(rw,[status(thm)],[675,580,theory(equality)])).
% cnf(680,negated_conjecture,(app(esk55_1(esk52_0),cons(esk53_1(esk52_0),nil))=esk48_0|esk48_0=nil),inference(cn,[status(thm)],[679,theory(equality)])).
% cnf(715,negated_conjecture,(esk48_0=nil|app(cons(esk53_1(X1),nil),esk54_1(X1))=X1|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[589,596,theory(equality)])).
% cnf(716,negated_conjecture,(esk48_0=nil|app(cons(esk53_1(X1),nil),esk54_1(X1))=X1|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[715,theory(equality)])).
% cnf(718,negated_conjecture,(app(cons(esk53_1(esk52_0),nil),esk54_1(esk52_0))=esk52_0|esk48_0=nil|~ssList(esk52_0)),inference(spm,[status(thm)],[716,600,theory(equality)])).
% cnf(722,negated_conjecture,(app(cons(esk53_1(esk52_0),nil),esk54_1(esk52_0))=esk52_0|esk48_0=nil|$false),inference(rw,[status(thm)],[718,580,theory(equality)])).
% cnf(723,negated_conjecture,(app(cons(esk53_1(esk52_0),nil),esk54_1(esk52_0))=esk52_0|esk48_0=nil),inference(cn,[status(thm)],[722,theory(equality)])).
% cnf(724,negated_conjecture,(app(X3,cons(X1,nil))!=esk48_0|app(cons(X1,nil),X2)!=esk52_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)),inference(rw,[status(thm)],[583,578,theory(equality)])).
% cnf(1465,negated_conjecture,(esk48_0=nil|app(cons(esk53_1(esk52_0),nil),X1)!=esk52_0|~ssList(esk55_1(esk52_0))|~ssList(X1)|~ssItem(esk53_1(esk52_0))),inference(spm,[status(thm)],[724,680,theory(equality)])).
% cnf(2102,negated_conjecture,(esk48_0=nil|app(cons(esk53_1(esk52_0),nil),X1)!=esk52_0|~ssList(esk55_1(esk52_0))|~ssList(X1)),inference(csr,[status(thm)],[1465,615])).
% cnf(2103,negated_conjecture,(esk48_0=nil|app(cons(esk53_1(esk52_0),nil),X1)!=esk52_0|~ssList(X1)),inference(csr,[status(thm)],[2102,633])).
% cnf(2106,negated_conjecture,(esk48_0=nil|~ssList(esk54_1(esk52_0))),inference(spm,[status(thm)],[2103,723,theory(equality)])).
% cnf(2111,negated_conjecture,(esk48_0=nil),inference(csr,[status(thm)],[2106,624])).
% cnf(2150,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=nil|app(esk48_0,X1)!=esk49_0|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[671,2111,theory(equality)])).
% cnf(2151,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=nil|app(nil,X1)!=esk49_0|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[2150,2111,theory(equality)])).
% cnf(2155,negated_conjecture,(ssList(esk55_1(X1))|app(nil,X1)!=esk49_0|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[606,2111,theory(equality)])).
% cnf(2157,negated_conjecture,(ssItem(esk53_1(X1))|app(nil,X1)!=esk49_0|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[602,2111,theory(equality)])).
% cnf(2169,negated_conjecture,(esk49_0=nil|$false),inference(rw,[status(thm)],[598,2111,theory(equality)])).
% cnf(2170,negated_conjecture,(esk49_0=nil),inference(cn,[status(thm)],[2169,theory(equality)])).
% cnf(2192,negated_conjecture,(ssList(esk55_1(X1))|app(nil,X1)!=nil|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[2155,2170,theory(equality)])).
% cnf(2193,negated_conjecture,(ssList(esk55_1(X1))|app(nil,X1)!=nil|$false|~ssList(X1)),inference(rw,[status(thm)],[2192,2170,theory(equality)])).
% cnf(2194,negated_conjecture,(ssList(esk55_1(X1))|app(nil,X1)!=nil|~ssList(X1)),inference(cn,[status(thm)],[2193,theory(equality)])).
% cnf(2195,negated_conjecture,(ssList(esk55_1(nil))|~ssList(nil)),inference(spm,[status(thm)],[2194,187,theory(equality)])).
% cnf(2198,negated_conjecture,(ssList(esk55_1(nil))|$false),inference(rw,[status(thm)],[2195,125,theory(equality)])).
% cnf(2199,negated_conjecture,(ssList(esk55_1(nil))),inference(cn,[status(thm)],[2198,theory(equality)])).
% cnf(2222,negated_conjecture,(ssItem(esk53_1(X1))|app(nil,X1)!=nil|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[2157,2170,theory(equality)])).
% cnf(2223,negated_conjecture,(ssItem(esk53_1(X1))|app(nil,X1)!=nil|$false|~ssList(X1)),inference(rw,[status(thm)],[2222,2170,theory(equality)])).
% cnf(2224,negated_conjecture,(ssItem(esk53_1(X1))|app(nil,X1)!=nil|~ssList(X1)),inference(cn,[status(thm)],[2223,theory(equality)])).
% cnf(2225,negated_conjecture,(ssItem(esk53_1(nil))|~ssList(nil)),inference(spm,[status(thm)],[2224,187,theory(equality)])).
% cnf(2228,negated_conjecture,(ssItem(esk53_1(nil))|$false),inference(rw,[status(thm)],[2225,125,theory(equality)])).
% cnf(2229,negated_conjecture,(ssItem(esk53_1(nil))),inference(cn,[status(thm)],[2228,theory(equality)])).
% cnf(2589,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=nil|app(nil,X1)!=nil|esk49_0!=nil|~ssList(X1)),inference(rw,[status(thm)],[2151,2170,theory(equality)])).
% cnf(2590,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=nil|app(nil,X1)!=nil|$false|~ssList(X1)),inference(rw,[status(thm)],[2589,2170,theory(equality)])).
% cnf(2591,negated_conjecture,(app(esk55_1(X1),cons(esk53_1(X1),nil))=nil|app(nil,X1)!=nil|~ssList(X1)),inference(cn,[status(thm)],[2590,theory(equality)])).
% cnf(2592,negated_conjecture,(app(esk55_1(nil),cons(esk53_1(nil),nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[2591,187,theory(equality)])).
% cnf(2597,negated_conjecture,(app(esk55_1(nil),cons(esk53_1(nil),nil))=nil|$false),inference(rw,[status(thm)],[2592,125,theory(equality)])).
% cnf(2598,negated_conjecture,(app(esk55_1(nil),cons(esk53_1(nil),nil))=nil),inference(cn,[status(thm)],[2597,theory(equality)])).
% cnf(2601,negated_conjecture,(nil=esk55_1(nil)|~ssList(cons(esk53_1(nil),nil))|~ssList(esk55_1(nil))),inference(spm,[status(thm)],[183,2598,theory(equality)])).
% cnf(2624,negated_conjecture,(nil=esk55_1(nil)|~ssList(cons(esk53_1(nil),nil))|$false),inference(rw,[status(thm)],[2601,2199,theory(equality)])).
% cnf(2625,negated_conjecture,(nil=esk55_1(nil)|~ssList(cons(esk53_1(nil),nil))),inference(cn,[status(thm)],[2624,theory(equality)])).
% cnf(2684,negated_conjecture,(esk55_1(nil)=nil|~ssList(nil)|~ssItem(esk53_1(nil))),inference(spm,[status(thm)],[2625,124,theory(equality)])).
% cnf(2685,negated_conjecture,(esk55_1(nil)=nil|$false|~ssItem(esk53_1(nil))),inference(rw,[status(thm)],[2684,125,theory(equality)])).
% cnf(2686,negated_conjecture,(esk55_1(nil)=nil|$false|$false),inference(rw,[status(thm)],[2685,2229,theory(equality)])).
% cnf(2687,negated_conjecture,(esk55_1(nil)=nil),inference(cn,[status(thm)],[2686,theory(equality)])).
% cnf(2691,negated_conjecture,(app(nil,cons(esk53_1(nil),nil))=nil),inference(rw,[status(thm)],[2598,2687,theory(equality)])).
% cnf(2701,negated_conjecture,(nil=cons(esk53_1(nil),nil)|~ssList(cons(esk53_1(nil),nil))|~ssList(nil)),inference(spm,[status(thm)],[184,2691,theory(equality)])).
% cnf(2737,negated_conjecture,(nil=cons(esk53_1(nil),nil)|~ssList(cons(esk53_1(nil),nil))|$false),inference(rw,[status(thm)],[2701,125,theory(equality)])).
% cnf(2738,negated_conjecture,(nil=cons(esk53_1(nil),nil)|~ssList(cons(esk53_1(nil),nil))),inference(cn,[status(thm)],[2737,theory(equality)])).
% cnf(2767,negated_conjecture,(cons(esk53_1(nil),nil)=nil|~ssList(nil)|~ssItem(esk53_1(nil))),inference(spm,[status(thm)],[2738,124,theory(equality)])).
% cnf(2768,negated_conjecture,(cons(esk53_1(nil),nil)=nil|$false|~ssItem(esk53_1(nil))),inference(rw,[status(thm)],[2767,125,theory(equality)])).
% cnf(2769,negated_conjecture,(cons(esk53_1(nil),nil)=nil|$false|$false),inference(rw,[status(thm)],[2768,2229,theory(equality)])).
% cnf(2770,negated_conjecture,(cons(esk53_1(nil),nil)=nil),inference(cn,[status(thm)],[2769,theory(equality)])).
% cnf(2771,negated_conjecture,(~ssList(nil)|~ssItem(esk53_1(nil))),inference(spm,[status(thm)],[146,2770,theory(equality)])).
% cnf(2812,negated_conjecture,($false|~ssItem(esk53_1(nil))),inference(rw,[status(thm)],[2771,125,theory(equality)])).
% cnf(2813,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2812,2229,theory(equality)])).
% cnf(2814,negated_conjecture,($false),inference(cn,[status(thm)],[2813,theory(equality)])).
% cnf(2815,negated_conjecture,($false),2814,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 367
% # ...of these trivial                : 8
% # ...subsumed                        : 57
% # ...remaining for further processing: 302
% # Other redundant clauses eliminated : 73
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 62
% # Generated clauses                  : 1139
% # ...of the previous two non-trivial : 941
% # Contextual simplify-reflections    : 71
% # Paramodulations                    : 1039
% # Factorizations                     : 0
% # Equation resolutions               : 100
% # Current number of processed clauses: 232
% #    Positive orientable unit clauses: 27
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 203
% # Current number of unprocessed clauses: 496
% # ...number of literals in the above : 3565
% # Clause-clause subsumption calls (NU) : 1720
% # Rec. Clause-clause subsumption calls : 940
% # Unit Clause-clause subsumption calls : 56
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 10
% # Indexed BW rewrite successes       : 10
% # Backwards rewriting index:   259 leaves,   1.34+/-1.091 terms/leaf
% # Paramod-from index:          125 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          225 leaves,   1.21+/-0.922 terms/leaf
% # -------------------------------------------------
% # User time              : 0.089 s
% # System time            : 0.008 s
% # Total time             : 0.097 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.32 WC
% FINAL PrfWatch: 0.24 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP1376/SWC327+1.tptp
% 
%------------------------------------------------------------------------------