TSTP Solution File: SWC108+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC108+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 : art03.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:04:51 EST 2010
% Result : Theorem 1.45s
% Output : Solution 1.45s
% 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/SystemOnTPTP21436/SWC108+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21436/SWC108+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21436/SWC108+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 21532
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(18, 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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&segmentP(X2,X1)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3))))))))),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=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&segmentP(X2,X1)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),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=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&segmentP(X2,X1)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, 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)],[106])).
% cnf(109,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(141, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[11])).
% fof(142, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[141])).
% cnf(143,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[142])).
% fof(155, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(rearsegP(X1,X2))|?[X3]:(ssList(X3)&app(X3,X2)=X1))&(![X3]:(~(ssList(X3))|~(app(X3,X2)=X1))|rearsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[14])).
% fof(156, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|?[X6]:(ssList(X6)&app(X6,X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(esk1_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[156])).
% fof(158, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(esk1_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[157])).
% fof(159, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk1_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[158])).
% cnf(160,plain,(app(esk1_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% cnf(161,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% fof(163, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(164, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[164])).
% fof(166, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[165])).
% fof(167, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk2_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[166])).
% cnf(171,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[167])).
% fof(175, 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)],[17])).
% fof(176, 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)],[175])).
% fof(177, 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)],[176])).
% fof(178, 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)],[177])).
% cnf(181,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[178])).
% fof(182, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[18])).
% fof(183, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[182])).
% cnf(184,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[183])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&((nil=X2&~(nil=X1))|(neq(X2,nil)&(~(neq(X1,nil))|~(segmentP(X2,X1))))))&((nil=X4&nil=X3)|(neq(X3,nil)&rearsegP(X4,X3)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(((X6=X8&X5=X7)&((nil=X6&~(nil=X5))|(neq(X6,nil)&(~(neq(X5,nil))|~(segmentP(X6,X5))))))&((nil=X8&nil=X7)|(neq(X7,nil)&rearsegP(X8,X7)))))))),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=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&rearsegP(esk51_0,esk50_0)))))))),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)&(((neq(esk49_0,nil)|nil=esk49_0)&((~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))|nil=esk49_0))&((neq(esk49_0,nil)|~(nil=esk48_0))&((~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))|~(nil=esk48_0)))))&(((neq(esk50_0,nil)|nil=esk51_0)&(rearsegP(esk51_0,esk50_0)|nil=esk51_0))&((neq(esk50_0,nil)|nil=esk50_0)&(rearsegP(esk51_0,esk50_0)|nil=esk50_0)))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(nil=esk50_0|rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(nil=esk49_0|~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(590,negated_conjecture,(esk48_0=nil|rearsegP(esk51_0,esk50_0)),inference(rw,[status(thm)],[572,580,theory(equality)])).
% cnf(591,negated_conjecture,(esk48_0=nil|rearsegP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[590,581,theory(equality)]),580,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|neq(esk50_0,nil)),inference(rw,[status(thm)],[575,581,theory(equality)])).
% cnf(593,negated_conjecture,(esk49_0=nil|neq(esk48_0,nil)),inference(rw,[status(thm)],[592,580,theory(equality)])).
% cnf(596,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk48_0)),inference(csr,[status(thm)],[578,593])).
% cnf(607,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(627,negated_conjecture,(ssList(esk1_2(esk49_0,esk48_0))|esk48_0=nil|~ssList(esk48_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[161,591,theory(equality)])).
% cnf(631,negated_conjecture,(ssList(esk1_2(esk49_0,esk48_0))|esk48_0=nil|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[627,585,theory(equality)])).
% cnf(632,negated_conjecture,(ssList(esk1_2(esk49_0,esk48_0))|esk48_0=nil|$false|$false),inference(rw,[status(thm)],[631,584,theory(equality)])).
% cnf(633,negated_conjecture,(ssList(esk1_2(esk49_0,esk48_0))|esk48_0=nil),inference(cn,[status(thm)],[632,theory(equality)])).
% cnf(795,negated_conjecture,(app(esk1_2(esk49_0,esk48_0),esk48_0)=esk49_0|esk48_0=nil|~ssList(esk48_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[160,591,theory(equality)])).
% cnf(799,negated_conjecture,(app(esk1_2(esk49_0,esk48_0),esk48_0)=esk49_0|esk48_0=nil|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[795,585,theory(equality)])).
% cnf(800,negated_conjecture,(app(esk1_2(esk49_0,esk48_0),esk48_0)=esk49_0|esk48_0=nil|$false|$false),inference(rw,[status(thm)],[799,584,theory(equality)])).
% cnf(801,negated_conjecture,(app(esk1_2(esk49_0,esk48_0),esk48_0)=esk49_0|esk48_0=nil),inference(cn,[status(thm)],[800,theory(equality)])).
% cnf(821,plain,(segmentP(app(app(X1,X2),X3),X2)|~ssList(X3)|~ssList(X1)|~ssList(X2)|~ssList(app(app(X1,X2),X3))),inference(er,[status(thm)],[171,theory(equality)])).
% cnf(1532,negated_conjecture,(nil=esk48_0|esk49_0!=nil|~ssList(esk48_0)|~ssList(esk1_2(esk49_0,esk48_0))),inference(spm,[status(thm)],[181,801,theory(equality)])).
% cnf(1557,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|~ssList(esk1_2(esk49_0,esk48_0))),inference(rw,[status(thm)],[1532,585,theory(equality)])).
% cnf(1558,negated_conjecture,(nil=esk48_0|esk49_0!=nil|~ssList(esk1_2(esk49_0,esk48_0))),inference(cn,[status(thm)],[1557,theory(equality)])).
% cnf(1565,negated_conjecture,(esk48_0=nil|esk49_0!=nil),inference(csr,[status(thm)],[1558,633])).
% cnf(4882,negated_conjecture,(segmentP(app(esk49_0,X1),esk48_0)|esk48_0=nil|~ssList(app(esk49_0,X1))|~ssList(X1)|~ssList(esk1_2(esk49_0,esk48_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[821,801,theory(equality)])).
% cnf(4923,negated_conjecture,(segmentP(app(esk49_0,X1),esk48_0)|esk48_0=nil|~ssList(app(esk49_0,X1))|~ssList(X1)|~ssList(esk1_2(esk49_0,esk48_0))|$false),inference(rw,[status(thm)],[4882,585,theory(equality)])).
% cnf(4924,negated_conjecture,(segmentP(app(esk49_0,X1),esk48_0)|esk48_0=nil|~ssList(app(esk49_0,X1))|~ssList(X1)|~ssList(esk1_2(esk49_0,esk48_0))),inference(cn,[status(thm)],[4923,theory(equality)])).
% cnf(4952,negated_conjecture,(esk48_0=nil|segmentP(app(esk49_0,X1),esk48_0)|~ssList(app(esk49_0,X1))|~ssList(X1)),inference(csr,[status(thm)],[4924,633])).
% cnf(4953,negated_conjecture,(esk48_0=nil|segmentP(esk49_0,esk48_0)|~ssList(esk49_0)|~ssList(nil)),inference(spm,[status(thm)],[4952,184,theory(equality)])).
% cnf(4959,negated_conjecture,(esk48_0=nil|segmentP(esk49_0,esk48_0)|$false|~ssList(nil)),inference(rw,[status(thm)],[4953,584,theory(equality)])).
% cnf(4960,negated_conjecture,(esk48_0=nil|segmentP(esk49_0,esk48_0)|$false|$false),inference(rw,[status(thm)],[4959,110,theory(equality)])).
% cnf(4961,negated_conjecture,(esk48_0=nil|segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[4960,theory(equality)])).
% cnf(4980,negated_conjecture,(esk49_0=nil|esk48_0=nil),inference(spm,[status(thm)],[596,4961,theory(equality)])).
% cnf(4999,negated_conjecture,(esk48_0=nil),inference(csr,[status(thm)],[4980,1565])).
% cnf(5115,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,nil)),inference(rw,[status(thm)],[596,4999,theory(equality)])).
% cnf(5116,negated_conjecture,(neq(esk49_0,nil)|$false),inference(rw,[status(thm)],[577,4999,theory(equality)])).
% cnf(5117,negated_conjecture,(neq(esk49_0,nil)),inference(cn,[status(thm)],[5116,theory(equality)])).
% cnf(5126,negated_conjecture,(esk49_0=nil|~ssList(esk49_0)),inference(spm,[status(thm)],[5115,143,theory(equality)])).
% cnf(5127,negated_conjecture,(esk49_0=nil|$false),inference(rw,[status(thm)],[5126,584,theory(equality)])).
% cnf(5128,negated_conjecture,(esk49_0=nil),inference(cn,[status(thm)],[5127,theory(equality)])).
% cnf(5294,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[5117,5128,theory(equality)])).
% cnf(5297,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[607,5294,theory(equality)])).
% cnf(5299,negated_conjecture,($false),inference(rw,[status(thm)],[5297,110,theory(equality)])).
% cnf(5300,negated_conjecture,($false),inference(cn,[status(thm)],[5299,theory(equality)])).
% cnf(5301,negated_conjecture,($false),5300,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 784
% # ...of these trivial : 3
% # ...subsumed : 338
% # ...remaining for further processing: 443
% # Other redundant clauses eliminated : 83
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 28
% # Backward-rewritten : 145
% # Generated clauses : 2001
% # ...of the previous two non-trivial : 1730
% # Contextual simplify-reflections : 408
% # Paramodulations : 1871
% # Factorizations : 0
% # Equation resolutions : 130
% # Current number of processed clauses: 264
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 239
% # Current number of unprocessed clauses: 798
% # ...number of literals in the above : 5629
% # Clause-clause subsumption calls (NU) : 10217
% # Rec. Clause-clause subsumption calls : 4128
% # Unit Clause-clause subsumption calls : 120
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 262 leaves, 1.38+/-1.129 terms/leaf
% # Paramod-from index: 143 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 236 leaves, 1.22+/-0.955 terms/leaf
% # -------------------------------------------------
% # User time : 0.159 s
% # System time : 0.011 s
% # Total time : 0.170 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.42 WC
% FINAL PrfWatch: 0.34 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP21436/SWC108+1.tptp
%
%------------------------------------------------------------------------------