TSTP Solution File: SWC355+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC355+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:01:22 EST 2010
% Result : Theorem 1.81s
% Output : Solution 1.81s
% 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/SystemOnTPTP6725/SWC355+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6725/SWC355+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6725/SWC355+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 6857
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.029 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)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(13, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X2,X3)=app(X2,X1)=>X3=X1)))),file('/tmp/SRASS.s.p', ax80)).
% fof(45, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% 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)=>~(app(X3,cons(X5,nil))=X4)))|segmentP(X2,X1))&(~(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)=>~(app(X3,cons(X5,nil))=X4)))|segmentP(X2,X1))&(~(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)=>~(app(X3,cons(X5,nil))=X4)))|segmentP(X2,X1))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[118])).
% cnf(123,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[119])).
% fof(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(131, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[131])).
% cnf(133,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% 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(194, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X2,X3)=app(X2,X1))|X3=X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(195, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4)))),inference(variable_rename,[status(thm)],[194])).
% fof(196, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[195])).
% cnf(197,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X2,X3)!=app(X2,X1)|~ssList(X3)),inference(split_conjunct,[status(thm)],[196])).
% fof(318, 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)],[45])).
% fof(319, 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)],[318])).
% fof(320, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk20_2(X4,X5))&app(X5,esk20_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[319])).
% fof(321, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk20_2(X4,X5))&app(X5,esk20_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[320])).
% fof(322, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk20_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk20_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[321])).
% cnf(323,plain,(app(X2,esk20_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[322])).
% cnf(324,plain,(ssList(esk20_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[322])).
% cnf(325,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[322])).
% 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)&app(X3,cons(X5,nil))=X4))&~(segmentP(X2,X1)))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((X7=X9&X6=X8)&(((neq(X7,nil)&?[X10]:(ssItem(X10)&app(X8,cons(X10,nil))=X9))&~(segmentP(X7,X6)))|(neq(X7,nil)&~(neq(X9,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)&(ssItem(esk52_0)&app(esk50_0,cons(esk52_0,nil))=esk51_0))&~(segmentP(esk49_0,esk48_0)))|(neq(esk49_0,nil)&~(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)&((((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)|app(esk50_0,cons(esk52_0,nil))=esk51_0)&(~(neq(esk51_0,nil))|app(esk50_0,cons(esk52_0,nil))=esk51_0))))&((neq(esk49_0,nil)|~(segmentP(esk49_0,esk48_0)))&(~(neq(esk51_0,nil))|~(segmentP(esk49_0,esk48_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(~segmentP(esk49_0,esk48_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(app(esk50_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_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(588,negated_conjecture,($false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[572,581,theory(equality)]),579,theory(equality)])).
% cnf(589,negated_conjecture,(~segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(590,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[576,581,theory(equality)]),579,theory(equality)])).
% cnf(591,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(599,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[574,580,theory(equality)])).
% cnf(600,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[599,581,theory(equality)])).
% cnf(601,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[600,581,theory(equality)]),579,theory(equality)])).
% cnf(602,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk49_0),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(719,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(cons(esk52_0,nil))|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[197,602,theory(equality)])).
% cnf(727,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(cons(esk52_0,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[719,585,theory(equality)])).
% cnf(728,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(cn,[status(thm)],[727,theory(equality)])).
% cnf(766,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(cons(esk52_0,nil))|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[325,602,theory(equality)])).
% cnf(770,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(cons(esk52_0,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[766,585,theory(equality)])).
% cnf(771,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(cn,[status(thm)],[770,theory(equality)])).
% cnf(836,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[123,166,theory(equality)])).
% cnf(842,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[836,134,theory(equality)])).
% cnf(843,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[842,theory(equality)])).
% cnf(1779,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(X1)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[728,133,theory(equality)])).
% cnf(1780,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1779,134,theory(equality)])).
% cnf(1781,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[1780,591,theory(equality)])).
% cnf(1782,negated_conjecture,(X1=cons(esk52_0,nil)|app(esk48_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[1781,theory(equality)])).
% cnf(3055,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[771,133,theory(equality)])).
% cnf(3056,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3055,134,theory(equality)])).
% cnf(3057,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[3056,591,theory(equality)])).
% cnf(3058,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[3057,theory(equality)])).
% cnf(3059,negated_conjecture,(frontsegP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[3058,theory(equality)])).
% cnf(3060,negated_conjecture,(frontsegP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[3059,584,theory(equality)])).
% cnf(3061,negated_conjecture,(frontsegP(esk49_0,esk48_0)),inference(cn,[status(thm)],[3060,theory(equality)])).
% cnf(3062,negated_conjecture,(ssList(esk20_2(esk49_0,esk48_0))|~ssList(esk48_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[324,3061,theory(equality)])).
% cnf(3064,negated_conjecture,(app(esk48_0,esk20_2(esk49_0,esk48_0))=esk49_0|~ssList(esk48_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[323,3061,theory(equality)])).
% cnf(3067,negated_conjecture,(ssList(esk20_2(esk49_0,esk48_0))|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[3062,585,theory(equality)])).
% cnf(3068,negated_conjecture,(ssList(esk20_2(esk49_0,esk48_0))|$false|$false),inference(rw,[status(thm)],[3067,584,theory(equality)])).
% cnf(3069,negated_conjecture,(ssList(esk20_2(esk49_0,esk48_0))),inference(cn,[status(thm)],[3068,theory(equality)])).
% cnf(3073,negated_conjecture,(app(esk48_0,esk20_2(esk49_0,esk48_0))=esk49_0|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[3064,585,theory(equality)])).
% cnf(3074,negated_conjecture,(app(esk48_0,esk20_2(esk49_0,esk48_0))=esk49_0|$false|$false),inference(rw,[status(thm)],[3073,584,theory(equality)])).
% cnf(3075,negated_conjecture,(app(esk48_0,esk20_2(esk49_0,esk48_0))=esk49_0),inference(cn,[status(thm)],[3074,theory(equality)])).
% cnf(3096,negated_conjecture,(esk20_2(esk49_0,esk48_0)=cons(esk52_0,nil)|~ssList(esk20_2(esk49_0,esk48_0))),inference(spm,[status(thm)],[1782,3075,theory(equality)])).
% cnf(3140,negated_conjecture,(esk20_2(esk49_0,esk48_0)=cons(esk52_0,nil)|$false),inference(rw,[status(thm)],[3096,3069,theory(equality)])).
% cnf(3141,negated_conjecture,(esk20_2(esk49_0,esk48_0)=cons(esk52_0,nil)),inference(cn,[status(thm)],[3140,theory(equality)])).
% cnf(3142,negated_conjecture,(ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[3069,3141,theory(equality)])).
% cnf(9800,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|~ssList(cons(esk52_0,nil))|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[843,602,theory(equality)])).
% cnf(9845,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[9800,3142,theory(equality)])).
% cnf(9846,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[9845,585,theory(equality)])).
% cnf(9847,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[9846,theory(equality)])).
% cnf(10050,negated_conjecture,(segmentP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[9847,theory(equality)])).
% cnf(10051,negated_conjecture,(segmentP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[10050,584,theory(equality)])).
% cnf(10052,negated_conjecture,(segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[10051,theory(equality)])).
% cnf(10053,negated_conjecture,($false),inference(sr,[status(thm)],[10052,589,theory(equality)])).
% cnf(10054,negated_conjecture,($false),10053,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1080
% # ...of these trivial : 9
% # ...subsumed : 325
% # ...remaining for further processing: 746
% # Other redundant clauses eliminated : 109
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 72
% # Backward-rewritten : 61
% # Generated clauses : 3592
% # ...of the previous two non-trivial : 3124
% # Contextual simplify-reflections : 294
% # Paramodulations : 3435
% # Factorizations : 0
% # Equation resolutions : 157
% # Current number of processed clauses: 607
% # Positive orientable unit clauses: 118
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 486
% # Current number of unprocessed clauses: 1902
% # ...number of literals in the above : 11269
% # Clause-clause subsumption calls (NU) : 13044
% # Rec. Clause-clause subsumption calls : 8967
% # Unit Clause-clause subsumption calls : 286
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 50
% # Indexed BW rewrite successes : 37
% # Backwards rewriting index: 588 leaves, 1.24+/-0.824 terms/leaf
% # Paramod-from index: 316 leaves, 1.08+/-0.355 terms/leaf
% # Paramod-into index: 545 leaves, 1.15+/-0.692 terms/leaf
% # -------------------------------------------------
% # User time : 0.249 s
% # System time : 0.009 s
% # Total time : 0.258 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.48 CPU 0.55 WC
% FINAL PrfWatch: 0.48 CPU 0.55 WC
% SZS output end Solution for /tmp/SystemOnTPTP6725/SWC355+1.tptp
%
%------------------------------------------------------------------------------