TSTP Solution File: SWC080+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC080+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 : art02.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:00:14 EST 2010
% Result : Theorem 1.49s
% Output : Solution 1.49s
% 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/SystemOnTPTP15950/SWC080+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15950/SWC080+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15950/SWC080+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 16046
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% 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(16, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(((~(ssList(X6))|~(neq(X6,nil)))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(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]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(((~(ssList(X6))|~(neq(X6,nil)))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(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]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(((~(ssList(X6))|~(neq(X6,nil)))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(neq(X2,nil))|neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(155, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[14])).
% fof(156, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[156])).
% fof(158, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[157])).
% fof(159, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk1_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[158])).
% cnf(160,plain,(app(X2,esk1_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% cnf(161,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(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(172, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[16])).
% fof(173, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[172])).
% cnf(174,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[173])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((ssList(X4)&X2=X4)&X1=X3)&(((neq(X2,nil)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))&?[X6]:(((ssList(X6)&neq(X6,nil))&frontsegP(X4,X6))&frontsegP(X3,X6)))|(neq(X2,nil)&~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(((ssList(X10)&X8=X10)&X7=X9)&(((neq(X8,nil)&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(X8,X11)))|~(segmentP(X7,X11))))&?[X12]:(((ssList(X12)&neq(X12,nil))&frontsegP(X10,X12))&frontsegP(X9,X12)))|(neq(X8,nil)&~(neq(X10,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)&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11))))&(((ssList(esk52_0)&neq(esk52_0,nil))&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:((((((((((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11)))&neq(esk49_0,nil))&(((ssList(esk52_0)&neq(esk52_0,nil))&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:((((((((neq(esk49_0,nil)|(((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11))))&(~(neq(esk51_0,nil))|(((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((((neq(esk49_0,nil)|ssList(esk52_0))&(~(neq(esk51_0,nil))|ssList(esk52_0)))&((neq(esk49_0,nil)|neq(esk52_0,nil))&(~(neq(esk51_0,nil))|neq(esk52_0,nil))))&((neq(esk49_0,nil)|frontsegP(esk51_0,esk52_0))&(~(neq(esk51_0,nil))|frontsegP(esk51_0,esk52_0))))&((neq(esk49_0,nil)|frontsegP(esk50_0,esk52_0))&(~(neq(esk51_0,nil))|frontsegP(esk50_0,esk52_0)))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_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(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(frontsegP(esk50_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(frontsegP(esk51_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(neq(esk52_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(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,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssList(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,577,theory(equality)]),588,theory(equality)])).
% cnf(594,negated_conjecture,(ssList(esk52_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(598,negated_conjecture,(neq(esk52_0,nil)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,577,theory(equality)]),588,theory(equality)])).
% cnf(599,negated_conjecture,(neq(esk52_0,nil)),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(600,negated_conjecture,(frontsegP(esk48_0,esk52_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,576,theory(equality)])).
% cnf(601,negated_conjecture,(frontsegP(esk48_0,esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[600,577,theory(equality)]),588,theory(equality)])).
% cnf(602,negated_conjecture,(frontsegP(esk48_0,esk52_0)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,(frontsegP(esk49_0,esk52_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(604,negated_conjecture,(frontsegP(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[603,577,theory(equality)]),588,theory(equality)])).
% cnf(605,negated_conjecture,(frontsegP(esk49_0,esk52_0)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(624,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,577,theory(equality)]),588,theory(equality)])).
% cnf(625,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)),inference(cn,[status(thm)],[624,theory(equality)])).
% cnf(658,negated_conjecture,(ssList(esk1_2(esk49_0,esk52_0))|~ssList(esk52_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[161,605,theory(equality)])).
% cnf(659,negated_conjecture,(ssList(esk1_2(esk48_0,esk52_0))|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[161,602,theory(equality)])).
% cnf(662,negated_conjecture,(ssList(esk1_2(esk49_0,esk52_0))|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[658,594,theory(equality)])).
% cnf(663,negated_conjecture,(ssList(esk1_2(esk49_0,esk52_0))|$false|$false),inference(rw,[status(thm)],[662,574,theory(equality)])).
% cnf(664,negated_conjecture,(ssList(esk1_2(esk49_0,esk52_0))),inference(cn,[status(thm)],[663,theory(equality)])).
% cnf(665,negated_conjecture,(ssList(esk1_2(esk48_0,esk52_0))|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[659,594,theory(equality)])).
% cnf(666,negated_conjecture,(ssList(esk1_2(esk48_0,esk52_0))|$false|$false),inference(rw,[status(thm)],[665,573,theory(equality)])).
% cnf(667,negated_conjecture,(ssList(esk1_2(esk48_0,esk52_0))),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(829,negated_conjecture,(app(esk52_0,esk1_2(esk49_0,esk52_0))=esk49_0|~ssList(esk52_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[160,605,theory(equality)])).
% cnf(830,negated_conjecture,(app(esk52_0,esk1_2(esk48_0,esk52_0))=esk48_0|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[160,602,theory(equality)])).
% cnf(833,negated_conjecture,(app(esk52_0,esk1_2(esk49_0,esk52_0))=esk49_0|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[829,594,theory(equality)])).
% cnf(834,negated_conjecture,(app(esk52_0,esk1_2(esk49_0,esk52_0))=esk49_0|$false|$false),inference(rw,[status(thm)],[833,574,theory(equality)])).
% cnf(835,negated_conjecture,(app(esk52_0,esk1_2(esk49_0,esk52_0))=esk49_0),inference(cn,[status(thm)],[834,theory(equality)])).
% cnf(836,negated_conjecture,(app(esk52_0,esk1_2(esk48_0,esk52_0))=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[830,594,theory(equality)])).
% cnf(837,negated_conjecture,(app(esk52_0,esk1_2(esk48_0,esk52_0))=esk48_0|$false|$false),inference(rw,[status(thm)],[836,573,theory(equality)])).
% cnf(838,negated_conjecture,(app(esk52_0,esk1_2(esk48_0,esk52_0))=esk48_0),inference(cn,[status(thm)],[837,theory(equality)])).
% cnf(854,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[171,174,theory(equality)])).
% cnf(857,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[854,110,theory(equality)])).
% cnf(858,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[857,theory(equality)])).
% cnf(7307,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|~ssList(esk1_2(esk49_0,esk52_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[858,835,theory(equality)])).
% cnf(7308,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|~ssList(esk1_2(esk48_0,esk52_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[858,838,theory(equality)])).
% cnf(7348,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|$false|~ssList(esk52_0)|~ssList(X1)),inference(rw,[status(thm)],[7307,664,theory(equality)])).
% cnf(7349,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[7348,594,theory(equality)])).
% cnf(7350,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[7349,theory(equality)])).
% cnf(7351,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|$false|~ssList(esk52_0)|~ssList(X1)),inference(rw,[status(thm)],[7308,667,theory(equality)])).
% cnf(7352,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[7351,594,theory(equality)])).
% cnf(7353,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[7352,theory(equality)])).
% cnf(7436,negated_conjecture,(segmentP(esk49_0,esk52_0)|~ssList(esk49_0)),inference(er,[status(thm)],[7350,theory(equality)])).
% cnf(7437,negated_conjecture,(segmentP(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[7436,574,theory(equality)])).
% cnf(7438,negated_conjecture,(segmentP(esk49_0,esk52_0)),inference(cn,[status(thm)],[7437,theory(equality)])).
% cnf(7463,negated_conjecture,(segmentP(esk48_0,esk52_0)|~ssList(esk48_0)),inference(er,[status(thm)],[7353,theory(equality)])).
% cnf(7464,negated_conjecture,(segmentP(esk48_0,esk52_0)|$false),inference(rw,[status(thm)],[7463,573,theory(equality)])).
% cnf(7465,negated_conjecture,(segmentP(esk48_0,esk52_0)),inference(cn,[status(thm)],[7464,theory(equality)])).
% cnf(7472,negated_conjecture,(~segmentP(esk49_0,esk52_0)|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[625,7465,theory(equality)])).
% cnf(7491,negated_conjecture,($false|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(rw,[status(thm)],[7472,7438,theory(equality)])).
% cnf(7492,negated_conjecture,($false|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[7491,599,theory(equality)])).
% cnf(7493,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[7492,594,theory(equality)])).
% cnf(7494,negated_conjecture,($false),inference(cn,[status(thm)],[7493,theory(equality)])).
% cnf(7495,negated_conjecture,($false),7494,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 866
% # ...of these trivial : 13
% # ...subsumed : 229
% # ...remaining for further processing: 624
% # Other redundant clauses eliminated : 95
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 31
% # Backward-rewritten : 34
% # Generated clauses : 2725
% # ...of the previous two non-trivial : 2281
% # Contextual simplify-reflections : 223
% # Paramodulations : 2573
% # Factorizations : 0
% # Equation resolutions : 152
% # Current number of processed clauses: 553
% # Positive orientable unit clauses: 99
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 451
% # Current number of unprocessed clauses: 1476
% # ...number of literals in the above : 8780
% # Clause-clause subsumption calls (NU) : 7085
% # Rec. Clause-clause subsumption calls : 4283
% # Unit Clause-clause subsumption calls : 103
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 500 leaves, 1.23+/-0.877 terms/leaf
% # Paramod-from index: 273 leaves, 1.04+/-0.238 terms/leaf
% # Paramod-into index: 447 leaves, 1.15+/-0.756 terms/leaf
% # -------------------------------------------------
% # User time : 0.190 s
% # System time : 0.009 s
% # Total time : 0.199 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.47 WC
% FINAL PrfWatch: 0.38 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP15950/SWC080+1.tptp
%
%------------------------------------------------------------------------------