TSTP Solution File: SWC380+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC380+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 08:04:49 EST 2010
% Result : Theorem 1.64s
% Output : Solution 1.64s
% 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/SystemOnTPTP8471/SWC380+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8471/SWC380+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8471/SWC380+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 8603
% 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(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(13, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(15, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(26, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(27, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(28, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(29, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>tl(cons(X2,X1))=X1)),file('/tmp/SRASS.s.p', ax25)).
% fof(56, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssItem(X5)&cons(X5,nil)=X1)&memberP(X2,X5)))|![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>(~(cons(X6,nil)=X3)|~(app(cons(X6,nil),X7)=X4)))))&(~(neq(X2,nil))|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))|(((~(neq(X2,nil))|?[X5]:((ssItem(X5)&cons(X5,nil)=X1)&memberP(X2,X5)))|![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>(~(cons(X6,nil)=X3)|~(app(cons(X6,nil),X7)=X4)))))&(~(neq(X2,nil))|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))|(((~(neq(X2,nil))|?[X5]:((ssItem(X5)&cons(X5,nil)=X1)&memberP(X2,X5)))|![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>(~(cons(X6,nil)=X3)|~(app(cons(X6,nil),X7)=X4)))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(152, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(153, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[153])).
% cnf(155,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[154])).
% fof(164, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[13])).
% fof(165, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[164])).
% cnf(166,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[165])).
% fof(174, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[15])).
% fof(175, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[174])).
% fof(176, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[175])).
% fof(177, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[176])).
% cnf(179,plain,(memberP(cons(X2,X3),X1)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|X1!=X2),inference(split_conjunct,[status(thm)],[177])).
% fof(200, 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)],[21])).
% fof(201, 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)],[200])).
% fof(202, 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)],[201])).
% fof(203, 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)],[202])).
% cnf(205,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[203])).
% fof(243, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[26])).
% fof(244, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[243])).
% fof(245, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[244])).
% cnf(246,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[245])).
% fof(247, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[27])).
% fof(248, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[247])).
% fof(249, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[248])).
% cnf(250,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[249])).
% fof(251, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[28])).
% fof(252, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[251])).
% fof(253, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[252])).
% cnf(254,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[253])).
% fof(255, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|tl(cons(X2,X1))=X1)),inference(fof_nnf,[status(thm)],[29])).
% fof(256, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|tl(cons(X4,X3))=X3)),inference(variable_rename,[status(thm)],[255])).
% fof(257, plain,![X3]:![X4]:((~(ssItem(X4))|tl(cons(X4,X3))=X3)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[256])).
% cnf(258,plain,(tl(cons(X2,X1))=X1|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[257])).
% fof(425, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[56])).
% fof(426, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[425])).
% cnf(427,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[426])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X1))|~(memberP(X2,X5))))&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&(cons(X6,nil)=X3&app(cons(X6,nil),X7)=X4))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&((X9=X11&X8=X10)&(((neq(X9,nil)&![X12]:((~(ssItem(X12))|~(cons(X12,nil)=X8))|~(memberP(X9,X12))))&?[X13]:(ssItem(X13)&?[X14]:(ssList(X14)&(cons(X13,nil)=X10&app(cons(X13,nil),X14)=X11))))|(neq(X9,nil)&~(neq(X11,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)&(((neq(esk49_0,nil)&![X12]:((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12))))&(ssItem(esk52_0)&(ssList(esk53_0)&(cons(esk52_0,nil)=esk50_0&app(cons(esk52_0,nil),esk53_0)=esk51_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:((((((((((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12)))&neq(esk49_0,nil))&(ssItem(esk52_0)&(ssList(esk53_0)&(cons(esk52_0,nil)=esk50_0&app(cons(esk52_0,nil),esk53_0)=esk51_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X12]:(((((((((neq(esk49_0,nil)|((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12))))&(~(neq(esk51_0,nil))|((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&(((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&(((neq(esk49_0,nil)|cons(esk52_0,nil)=esk50_0)&(~(neq(esk51_0,nil))|cons(esk52_0,nil)=esk50_0))&((neq(esk49_0,nil)|app(cons(esk52_0,nil),esk53_0)=esk51_0)&(~(neq(esk51_0,nil))|app(cons(esk52_0,nil),esk53_0)=esk51_0))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),588,theory(equality)])).
% cnf(594,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),588,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,(cons(esk52_0,nil)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(598,negated_conjecture,(cons(esk52_0,nil)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[597,578,theory(equality)]),588,theory(equality)])).
% cnf(599,negated_conjecture,(cons(esk52_0,nil)=esk48_0),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(612,negated_conjecture,(app(esk48_0,esk53_0)=esk51_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,599,theory(equality)])).
% cnf(613,negated_conjecture,(app(esk48_0,esk53_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[612,578,theory(equality)])).
% cnf(614,negated_conjecture,(app(esk48_0,esk53_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[613,578,theory(equality)]),588,theory(equality)])).
% cnf(615,negated_conjecture,(app(esk48_0,esk53_0)=esk49_0),inference(cn,[status(thm)],[614,theory(equality)])).
% cnf(619,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|~memberP(esk49_0,X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,578,theory(equality)]),588,theory(equality)])).
% cnf(620,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(cn,[status(thm)],[619,theory(equality)])).
% cnf(621,negated_conjecture,(~memberP(esk49_0,esk52_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[620,599,theory(equality)])).
% cnf(622,negated_conjecture,(~memberP(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[621,594,theory(equality)])).
% cnf(623,negated_conjecture,(~memberP(esk49_0,esk52_0)),inference(cn,[status(thm)],[622,theory(equality)])).
% cnf(625,negated_conjecture,(esk48_0!=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[155,599,theory(equality)])).
% cnf(626,negated_conjecture,(esk48_0!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[625,134,theory(equality)])).
% cnf(627,negated_conjecture,(esk48_0!=nil|$false|$false),inference(rw,[status(thm)],[626,594,theory(equality)])).
% cnf(628,negated_conjecture,(esk48_0!=nil),inference(cn,[status(thm)],[627,theory(equality)])).
% cnf(688,negated_conjecture,(nil=esk48_0|esk49_0!=nil|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[205,615,theory(equality)])).
% cnf(690,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[688,596,theory(equality)])).
% cnf(691,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|$false),inference(rw,[status(thm)],[690,573,theory(equality)])).
% cnf(692,negated_conjecture,(nil=esk48_0|esk49_0!=nil),inference(cn,[status(thm)],[691,theory(equality)])).
% cnf(732,negated_conjecture,(hd(esk48_0)=esk52_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[254,599,theory(equality)])).
% cnf(734,negated_conjecture,(hd(esk48_0)=esk52_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[732,134,theory(equality)])).
% cnf(735,negated_conjecture,(hd(esk48_0)=esk52_0|$false|$false),inference(rw,[status(thm)],[734,594,theory(equality)])).
% cnf(736,negated_conjecture,(hd(esk48_0)=esk52_0),inference(cn,[status(thm)],[735,theory(equality)])).
% cnf(740,negated_conjecture,(tl(esk48_0)=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[258,599,theory(equality)])).
% cnf(742,negated_conjecture,(tl(esk48_0)=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[740,134,theory(equality)])).
% cnf(743,negated_conjecture,(tl(esk48_0)=nil|$false|$false),inference(rw,[status(thm)],[742,594,theory(equality)])).
% cnf(744,negated_conjecture,(tl(esk48_0)=nil),inference(cn,[status(thm)],[743,theory(equality)])).
% cnf(787,plain,(memberP(cons(X1,X2),X1)|~ssList(X2)|~ssItem(X1)),inference(er,[status(thm)],[179,theory(equality)])).
% cnf(876,negated_conjecture,(hd(esk49_0)=hd(esk48_0)|nil=esk48_0|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[246,615,theory(equality)])).
% cnf(878,negated_conjecture,(hd(esk49_0)=hd(esk48_0)|nil=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[876,596,theory(equality)])).
% cnf(879,negated_conjecture,(hd(esk49_0)=hd(esk48_0)|nil=esk48_0|$false|$false),inference(rw,[status(thm)],[878,573,theory(equality)])).
% cnf(880,negated_conjecture,(hd(esk49_0)=hd(esk48_0)|nil=esk48_0),inference(cn,[status(thm)],[879,theory(equality)])).
% cnf(1038,negated_conjecture,(tl(esk49_0)=app(tl(esk48_0),esk53_0)|nil=esk48_0|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[250,615,theory(equality)])).
% cnf(1043,negated_conjecture,(tl(esk49_0)=app(tl(esk48_0),esk53_0)|nil=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[1038,596,theory(equality)])).
% cnf(1044,negated_conjecture,(tl(esk49_0)=app(tl(esk48_0),esk53_0)|nil=esk48_0|$false|$false),inference(rw,[status(thm)],[1043,573,theory(equality)])).
% cnf(1045,negated_conjecture,(tl(esk49_0)=app(tl(esk48_0),esk53_0)|nil=esk48_0),inference(cn,[status(thm)],[1044,theory(equality)])).
% cnf(1526,negated_conjecture,(esk49_0!=nil),inference(sr,[status(thm)],[692,628,theory(equality)])).
% cnf(1916,negated_conjecture,(esk52_0=hd(esk49_0)|esk48_0=nil),inference(rw,[status(thm)],[880,736,theory(equality)])).
% cnf(1917,negated_conjecture,(hd(esk49_0)=esk52_0),inference(sr,[status(thm)],[1916,628,theory(equality)])).
% cnf(1919,negated_conjecture,(cons(esk52_0,tl(esk49_0))=esk49_0|nil=esk49_0|~ssList(esk49_0)),inference(spm,[status(thm)],[427,1917,theory(equality)])).
% cnf(1927,negated_conjecture,(cons(esk52_0,tl(esk49_0))=esk49_0|nil=esk49_0|$false),inference(rw,[status(thm)],[1919,574,theory(equality)])).
% cnf(1928,negated_conjecture,(cons(esk52_0,tl(esk49_0))=esk49_0|nil=esk49_0),inference(cn,[status(thm)],[1927,theory(equality)])).
% cnf(1929,negated_conjecture,(cons(esk52_0,tl(esk49_0))=esk49_0),inference(sr,[status(thm)],[1928,1526,theory(equality)])).
% cnf(2061,negated_conjecture,(app(nil,esk53_0)=tl(esk49_0)|esk48_0=nil),inference(rw,[status(thm)],[1045,744,theory(equality)])).
% cnf(2062,negated_conjecture,(tl(esk49_0)=app(nil,esk53_0)),inference(sr,[status(thm)],[2061,628,theory(equality)])).
% cnf(2067,negated_conjecture,(cons(esk52_0,app(nil,esk53_0))=esk49_0),inference(rw,[status(thm)],[1929,2062,theory(equality)])).
% cnf(2115,negated_conjecture,(cons(esk52_0,esk53_0)=esk49_0|~ssList(esk53_0)),inference(spm,[status(thm)],[2067,166,theory(equality)])).
% cnf(2212,negated_conjecture,(cons(esk52_0,esk53_0)=esk49_0|$false),inference(rw,[status(thm)],[2115,596,theory(equality)])).
% cnf(2213,negated_conjecture,(cons(esk52_0,esk53_0)=esk49_0),inference(cn,[status(thm)],[2212,theory(equality)])).
% cnf(6391,negated_conjecture,(memberP(esk49_0,esk52_0)|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[787,2213,theory(equality)])).
% cnf(6401,negated_conjecture,(memberP(esk49_0,esk52_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[6391,596,theory(equality)])).
% cnf(6402,negated_conjecture,(memberP(esk49_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[6401,594,theory(equality)])).
% cnf(6403,negated_conjecture,(memberP(esk49_0,esk52_0)),inference(cn,[status(thm)],[6402,theory(equality)])).
% cnf(6404,negated_conjecture,($false),inference(sr,[status(thm)],[6403,623,theory(equality)])).
% cnf(6405,negated_conjecture,($false),6404,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 682
% # ...of these trivial : 11
% # ...subsumed : 201
% # ...remaining for further processing: 470
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 44
% # Generated clauses : 2150
% # ...of the previous two non-trivial : 1749
% # Contextual simplify-reflections : 97
% # Paramodulations : 2050
% # Factorizations : 0
% # Equation resolutions : 100
% # Current number of processed clauses: 401
% # Positive orientable unit clauses: 74
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 315
% # Current number of unprocessed clauses: 966
% # ...number of literals in the above : 5976
% # Clause-clause subsumption calls (NU) : 4927
% # Rec. Clause-clause subsumption calls : 3157
% # Unit Clause-clause subsumption calls : 200
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 381 leaves, 1.24+/-0.918 terms/leaf
% # Paramod-from index: 205 leaves, 1.00+/-0.070 terms/leaf
% # Paramod-into index: 342 leaves, 1.14+/-0.757 terms/leaf
% # -------------------------------------------------
% # User time : 0.147 s
% # System time : 0.006 s
% # Total time : 0.153 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.41 WC
% FINAL PrfWatch: 0.34 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP8471/SWC380+1.tptp
%
%------------------------------------------------------------------------------