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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC053+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 : art04.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 06:55:04 EST 2010

% Result   : Theorem 1.67s
% Output   : Solution 1.67s
% 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/SystemOnTPTP14789/SWC053+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14789/SWC053+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14789/SWC053+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 14885
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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)=>(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(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(frontsegP(X4,X5)))|~(frontsegP(X3,X5))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:(((ssList(X6)&neq(X6,nil))&segmentP(X2,X6))&segmentP(X1,X6))))))))),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)=>((~(neq(X5,nil))|~(frontsegP(X4,X5)))|~(frontsegP(X3,X5))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:(((ssList(X6)&neq(X6,nil))&segmentP(X2,X6))&segmentP(X1,X6)))))))))),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)=>((~(neq(X5,nil))|~(frontsegP(X4,X5)))|~(frontsegP(X3,X5))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:(((ssList(X6)&neq(X6,nil))&segmentP(X2,X6))&segmentP(X1,X6)))))))))),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))|((~(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(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(180,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[178])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&(?[X5]:(ssList(X5)&((neq(X5,nil)&frontsegP(X4,X5))&frontsegP(X3,X5)))|(nil=X4&nil=X3)))&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X6]:(((~(ssList(X6))|~(neq(X6,nil)))|~(segmentP(X2,X6)))|~(segmentP(X1,X6)))))))))),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)&(?[X11]:(ssList(X11)&((neq(X11,nil)&frontsegP(X10,X11))&frontsegP(X9,X11)))|(nil=X10&nil=X9)))&((nil=X8&~(nil=X7))|(neq(X8,nil)&![X12]:(((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(X8,X12)))|~(segmentP(X7,X12)))))))))),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)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|(nil=esk51_0&nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X12]:(((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(esk49_0,X12)))|~(segmentP(esk48_0,X12)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:((((((((((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(esk49_0,X12)))|~(segmentP(esk48_0,X12)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&((esk49_0=esk51_0&esk48_0=esk50_0)&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_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,![X12]:((((((((nil=esk49_0|(((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(esk49_0,X12)))|~(segmentP(esk48_0,X12))))&(~(nil=esk48_0)|(((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(esk49_0,X12)))|~(segmentP(esk48_0,X12)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&((esk49_0=esk51_0&esk48_0=esk50_0)&(((nil=esk51_0|ssList(esk52_0))&(nil=esk50_0|ssList(esk52_0)))&((((nil=esk51_0|neq(esk52_0,nil))&(nil=esk50_0|neq(esk52_0,nil)))&((nil=esk51_0|frontsegP(esk51_0,esk52_0))&(nil=esk50_0|frontsegP(esk51_0,esk52_0))))&((nil=esk51_0|frontsegP(esk50_0,esk52_0))&(nil=esk50_0|frontsegP(esk50_0,esk52_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,(frontsegP(esk50_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(frontsegP(esk50_0,esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(frontsegP(esk51_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(frontsegP(esk51_0,esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(neq(esk52_0,nil)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(neq(esk52_0,nil)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(nil=esk49_0|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,585,theory(equality)])).
% cnf(592,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,586,theory(equality)])).
% cnf(595,negated_conjecture,(neq(esk51_0,nil)|esk48_0!=nil),inference(rw,[status(thm)],[587,586,theory(equality)])).
% cnf(596,negated_conjecture,(neq(esk51_0,nil)|esk50_0!=nil),inference(rw,[status(thm)],[595,585,theory(equality)])).
% cnf(608,negated_conjecture,(esk51_0=nil|~ssList(X1)|~neq(X1,nil)|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[590,586,theory(equality)])).
% cnf(609,negated_conjecture,(esk51_0=nil|~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[608,585,theory(equality)])).
% cnf(610,negated_conjecture,(esk51_0=nil|~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[609,586,theory(equality)])).
% cnf(611,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,nil)|~neq(nil,nil)|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[610,143,theory(equality)])).
% cnf(613,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,nil)|~neq(nil,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[611,110,theory(equality)])).
% cnf(614,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,nil)|~neq(nil,nil)|$false|$false),inference(rw,[status(thm)],[613,591,theory(equality)])).
% cnf(615,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[614,theory(equality)])).
% cnf(622,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(642,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,579,theory(equality)])).
% cnf(643,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,580,theory(equality)])).
% cnf(644,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[161,577,theory(equality)])).
% cnf(645,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[161,578,theory(equality)])).
% cnf(648,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[642,592,theory(equality)])).
% cnf(649,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[648,theory(equality)])).
% cnf(650,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[643,592,theory(equality)])).
% cnf(651,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[650,theory(equality)])).
% cnf(652,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[644,591,theory(equality)])).
% cnf(653,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[652,theory(equality)])).
% cnf(654,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[645,591,theory(equality)])).
% cnf(655,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[654,theory(equality)])).
% cnf(829,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil|~ssList(esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[160,579,theory(equality)])).
% cnf(830,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk51_0=nil|~ssList(esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[160,580,theory(equality)])).
% cnf(831,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[160,577,theory(equality)])).
% cnf(832,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[160,578,theory(equality)])).
% cnf(835,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[829,592,theory(equality)])).
% cnf(836,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[835,theory(equality)])).
% cnf(837,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk51_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[830,592,theory(equality)])).
% cnf(838,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk51_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[837,theory(equality)])).
% cnf(839,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[831,591,theory(equality)])).
% cnf(840,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[839,theory(equality)])).
% cnf(841,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[832,591,theory(equality)])).
% cnf(842,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[841,theory(equality)])).
% cnf(858,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(861,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[858,110,theory(equality)])).
% cnf(862,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[861,theory(equality)])).
% cnf(1406,negated_conjecture,(esk51_0=nil|~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[615,143,theory(equality)])).
% cnf(1407,negated_conjecture,(esk51_0=nil|~neq(nil,nil)|$false),inference(rw,[status(thm)],[1406,592,theory(equality)])).
% cnf(1408,negated_conjecture,(esk51_0=nil|~neq(nil,nil)),inference(cn,[status(thm)],[1407,theory(equality)])).
% cnf(1564,negated_conjecture,(esk50_0=nil|ssList(esk1_2(esk51_0,esk52_0))),inference(csr,[status(thm)],[649,583])).
% cnf(1565,negated_conjecture,(esk51_0=nil|ssList(esk1_2(esk51_0,esk52_0))),inference(csr,[status(thm)],[651,584])).
% cnf(1566,negated_conjecture,(esk50_0=nil|ssList(esk1_2(esk50_0,esk52_0))),inference(csr,[status(thm)],[653,583])).
% cnf(1567,negated_conjecture,(esk51_0=nil|ssList(esk1_2(esk50_0,esk52_0))),inference(csr,[status(thm)],[655,584])).
% cnf(1585,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil),inference(csr,[status(thm)],[836,583])).
% cnf(1586,negated_conjecture,(nil=esk52_0|esk50_0=nil|esk51_0!=nil|~ssList(esk1_2(esk51_0,esk52_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[180,1585,theory(equality)])).
% cnf(1601,negated_conjecture,(esk52_0=nil|esk50_0=nil|esk51_0!=nil|~ssList(esk1_2(esk51_0,esk52_0))),inference(csr,[status(thm)],[1586,583])).
% cnf(1602,negated_conjecture,(esk52_0=nil|esk50_0=nil|esk51_0!=nil),inference(csr,[status(thm)],[1601,1564])).
% cnf(1612,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk51_0=nil),inference(csr,[status(thm)],[838,584])).
% cnf(1635,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil),inference(csr,[status(thm)],[840,583])).
% cnf(1674,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil),inference(csr,[status(thm)],[842,584])).
% cnf(1675,negated_conjecture,(nil=esk52_0|esk51_0=nil|esk50_0!=nil|~ssList(esk1_2(esk50_0,esk52_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[180,1674,theory(equality)])).
% cnf(1690,negated_conjecture,(esk52_0=nil|esk51_0=nil|esk50_0!=nil|~ssList(esk1_2(esk50_0,esk52_0))),inference(csr,[status(thm)],[1675,584])).
% cnf(1691,negated_conjecture,(esk52_0=nil|esk51_0=nil|esk50_0!=nil),inference(csr,[status(thm)],[1690,1567])).
% cnf(5867,negated_conjecture,(segmentP(X1,esk52_0)|esk51_0=nil|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk52_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[862,1612,theory(equality)])).
% cnf(5868,negated_conjecture,(segmentP(X1,esk52_0)|esk50_0=nil|esk50_0!=X1|~ssList(esk1_2(esk50_0,esk52_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[862,1635,theory(equality)])).
% cnf(9900,negated_conjecture,(esk51_0=nil|segmentP(X1,esk52_0)|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk52_0))|~ssList(X1)),inference(csr,[status(thm)],[5867,584])).
% cnf(9901,negated_conjecture,(esk51_0=nil|segmentP(X1,esk52_0)|esk51_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[9900,1565])).
% cnf(9902,negated_conjecture,(esk51_0=nil|segmentP(esk51_0,esk52_0)|~ssList(esk51_0)),inference(er,[status(thm)],[9901,theory(equality)])).
% cnf(9903,negated_conjecture,(esk51_0=nil|segmentP(esk51_0,esk52_0)|$false),inference(rw,[status(thm)],[9902,592,theory(equality)])).
% cnf(9904,negated_conjecture,(esk51_0=nil|segmentP(esk51_0,esk52_0)),inference(cn,[status(thm)],[9903,theory(equality)])).
% cnf(9944,negated_conjecture,(esk50_0=nil|segmentP(X1,esk52_0)|esk50_0!=X1|~ssList(esk1_2(esk50_0,esk52_0))|~ssList(X1)),inference(csr,[status(thm)],[5868,583])).
% cnf(9945,negated_conjecture,(esk50_0=nil|segmentP(X1,esk52_0)|esk50_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[9944,1566])).
% cnf(9946,negated_conjecture,(esk50_0=nil|segmentP(esk50_0,esk52_0)|~ssList(esk50_0)),inference(er,[status(thm)],[9945,theory(equality)])).
% cnf(9947,negated_conjecture,(esk50_0=nil|segmentP(esk50_0,esk52_0)|$false),inference(rw,[status(thm)],[9946,591,theory(equality)])).
% cnf(9948,negated_conjecture,(esk50_0=nil|segmentP(esk50_0,esk52_0)),inference(cn,[status(thm)],[9947,theory(equality)])).
% cnf(9955,negated_conjecture,(esk51_0=nil|esk50_0=nil|~segmentP(esk51_0,esk52_0)|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[610,9948,theory(equality)])).
% cnf(9969,negated_conjecture,(esk51_0=nil|esk50_0=nil|~segmentP(esk51_0,esk52_0)|~neq(esk52_0,nil)),inference(csr,[status(thm)],[9955,584])).
% cnf(9970,negated_conjecture,(esk51_0=nil|esk50_0=nil|~segmentP(esk51_0,esk52_0)),inference(csr,[status(thm)],[9969,582])).
% cnf(9971,negated_conjecture,(esk51_0=nil|esk50_0=nil),inference(csr,[status(thm)],[9970,9904])).
% cnf(9986,negated_conjecture,(esk51_0=nil|esk52_0=nil),inference(spm,[status(thm)],[1691,9971,theory(equality)])).
% cnf(10106,negated_conjecture,(esk51_0=nil|neq(nil,nil)),inference(spm,[status(thm)],[582,9986,theory(equality)])).
% cnf(10186,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[10106,1408])).
% cnf(10609,negated_conjecture,(esk50_0=nil|esk52_0=nil|$false),inference(rw,[status(thm)],[1602,10186,theory(equality)])).
% cnf(10610,negated_conjecture,(esk50_0=nil|esk52_0=nil),inference(cn,[status(thm)],[10609,theory(equality)])).
% cnf(10628,negated_conjecture,(neq(nil,nil)|esk50_0!=nil),inference(rw,[status(thm)],[596,10186,theory(equality)])).
% cnf(10727,negated_conjecture,(esk50_0=nil|neq(nil,nil)),inference(spm,[status(thm)],[581,10610,theory(equality)])).
% cnf(10859,negated_conjecture,(neq(nil,nil)),inference(csr,[status(thm)],[10727,10628])).
% cnf(10860,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[622,10859,theory(equality)])).
% cnf(10863,negated_conjecture,($false),inference(rw,[status(thm)],[10860,110,theory(equality)])).
% cnf(10864,negated_conjecture,($false),inference(cn,[status(thm)],[10863,theory(equality)])).
% cnf(10865,negated_conjecture,($false),10864,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1432
% # ...of these trivial                : 2
% # ...subsumed                        : 754
% # ...remaining for further processing: 676
% # Other redundant clauses eliminated : 128
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 39
% # Backward-rewritten                 : 258
% # Generated clauses                  : 4828
% # ...of the previous two non-trivial : 4280
% # Contextual simplify-reflections    : 1010
% # Paramodulations                    : 4634
% # Factorizations                     : 0
% # Equation resolutions               : 194
% # Current number of processed clauses: 373
% #    Positive orientable unit clauses: 23
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 348
% # Current number of unprocessed clauses: 1452
% # ...number of literals in the above : 9409
% # Clause-clause subsumption calls (NU) : 24325
% # Rec. Clause-clause subsumption calls : 9622
% # Unit Clause-clause subsumption calls : 178
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 7
% # Indexed BW rewrite successes       : 7
% # Backwards rewriting index:   364 leaves,   1.33+/-1.030 terms/leaf
% # Paramod-from index:          200 leaves,   1.01+/-0.157 terms/leaf
% # Paramod-into index:          330 leaves,   1.19+/-0.873 terms/leaf
% # -------------------------------------------------
% # User time              : 0.301 s
% # System time            : 0.013 s
% # Total time             : 0.314 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.57 CPU 0.66 WC
% FINAL PrfWatch: 0.57 CPU 0.66 WC
% SZS output end Solution for /tmp/SystemOnTPTP14789/SWC053+1.tptp
% 
%------------------------------------------------------------------------------