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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC090+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:02:06 EST 2010

% Result   : Theorem 3.10s
% Output   : Solution 3.10s
% 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/SystemOnTPTP16729/SWC090+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP16729/SWC090+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16729/SWC090+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 16825
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.91 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(5, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(8, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(segmentP(X1,X2)=>segmentP(app(app(X3,X1),X4),X2)))))),file('/tmp/SRASS.s.p', ax56)).
% fof(13, 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(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(16, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(30, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(frontsegP(X1,X2)=>frontsegP(app(X1,X3),X2))))),file('/tmp/SRASS.s.p', ax43)).
% fof(32, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(39, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% 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)=>![X7]:(ssList(X7)=>(~(app(X6,X7)=X4)|~(app(X7,X6)=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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(X6,X7)=X4)|~(app(X7,X6)=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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(X6,X7)=X4)|~(app(X7,X6)=X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(113, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(114, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, 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)],[115])).
% cnf(117,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[116])).
% cnf(119,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(120, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(121, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[121])).
% cnf(123,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[122])).
% fof(124, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[5])).
% fof(125, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[124])).
% cnf(126,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[125])).
% fof(135, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(136, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[135])).
% cnf(137,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[136])).
% fof(138, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(~(segmentP(X1,X2))|segmentP(app(app(X3,X1),X4),X2)))))),inference(fof_nnf,[status(thm)],[9])).
% fof(139, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:(~(ssList(X7))|![X8]:(~(ssList(X8))|(~(segmentP(X5,X6))|segmentP(app(app(X7,X5),X8),X6)))))),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,![X5]:![X6]:![X7]:![X8]:((((~(ssList(X8))|(~(segmentP(X5,X6))|segmentP(app(app(X7,X5),X8),X6)))|~(ssList(X7)))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[139])).
% cnf(141,plain,(segmentP(app(app(X3,X1),X4),X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|~segmentP(X1,X2)|~ssList(X4)),inference(split_conjunct,[status(thm)],[140])).
% fof(154, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X2,X3)=app(X2,X1))|X3=X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(155, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4)))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[155])).
% cnf(157,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X2,X3)!=app(X2,X1)|~ssList(X3)),inference(split_conjunct,[status(thm)],[156])).
% fof(158, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[14])).
% fof(159, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[158])).
% fof(160, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[159])).
% cnf(161,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[160])).
% fof(169, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[16])).
% fof(170, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[169])).
% cnf(171,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[170])).
% fof(190, 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)],[21])).
% fof(191, 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)],[190])).
% fof(192, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[191])).
% fof(193, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[192])).
% fof(194, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk3_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk3_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[193])).
% cnf(195,plain,(app(X2,esk3_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[194])).
% cnf(196,plain,(ssList(esk3_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[194])).
% cnf(197,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[194])).
% fof(240, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(frontsegP(X1,X2))|frontsegP(app(X1,X3),X2))))),inference(fof_nnf,[status(thm)],[30])).
% fof(241, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5))))),inference(variable_rename,[status(thm)],[240])).
% fof(242, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[241])).
% cnf(243,plain,(frontsegP(app(X1,X3),X2)|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[242])).
% fof(248, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[32])).
% fof(249, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[248])).
% cnf(250,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[249])).
% fof(277, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[39])).
% fof(278, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[277])).
% cnf(279,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[278])).
% 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)&?[X7]:(ssList(X7)&(app(X6,X7)=X4&app(X7,X6)=X3)))))))),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]:(((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(X9,X12)))|~(segmentP(X8,X12))))&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(app(X13,X14)=X11&app(X14,X13)=X10)))))))),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]:(((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(esk49_0,X12)))|~(segmentP(esk48_0,X12))))&(ssList(esk52_0)&(ssList(esk53_0)&(app(esk52_0,esk53_0)=esk51_0&app(esk53_0,esk52_0)=esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:(((((((((~(ssList(X12))|~(neq(X12,nil)))|~(segmentP(esk49_0,X12)))|~(segmentP(esk48_0,X12)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(ssList(esk52_0)&(ssList(esk53_0)&(app(esk52_0,esk53_0)=esk51_0&app(esk53_0,esk52_0)=esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(app(esk53_0,esk52_0)=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(esk52_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(app(esk52_0,esk53_0)=esk49_0),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(587,negated_conjecture,(app(esk53_0,esk52_0)=esk48_0),inference(rw,[status(thm)],[576,581,theory(equality)])).
% cnf(591,negated_conjecture,(~segmentP(esk48_0,esk49_0)|~segmentP(esk49_0,esk49_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[583,580,theory(equality)])).
% cnf(592,negated_conjecture,(~segmentP(esk48_0,esk49_0)|~segmentP(esk49_0,esk49_0)|$false),inference(rw,[status(thm)],[591,573,theory(equality)])).
% cnf(593,negated_conjecture,(~segmentP(esk48_0,esk49_0)|~segmentP(esk49_0,esk49_0)),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(645,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[583,117,theory(equality)])).
% cnf(646,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~ssList(X1)|$false),inference(rw,[status(thm)],[645,119,theory(equality)])).
% cnf(647,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~ssList(X1)),inference(cn,[status(thm)],[646,theory(equality)])).
% cnf(682,plain,(ssList(esk3_2(X1,X1))|~ssList(X1)),inference(spm,[status(thm)],[196,279,theory(equality)])).
% cnf(709,negated_conjecture,(X1=esk52_0|app(esk53_0,X1)!=esk48_0|~ssList(esk52_0)|~ssList(esk53_0)|~ssList(X1)),inference(spm,[status(thm)],[157,587,theory(equality)])).
% cnf(712,plain,(X1=nil|app(X2,X1)!=X2|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[157,171,theory(equality)])).
% cnf(717,negated_conjecture,(X1=esk52_0|app(esk53_0,X1)!=esk48_0|$false|~ssList(esk53_0)|~ssList(X1)),inference(rw,[status(thm)],[709,579,theory(equality)])).
% cnf(718,negated_conjecture,(X1=esk52_0|app(esk53_0,X1)!=esk48_0|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[717,578,theory(equality)])).
% cnf(719,negated_conjecture,(X1=esk52_0|app(esk53_0,X1)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[718,theory(equality)])).
% cnf(725,plain,(X1=nil|app(X2,X1)!=X2|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[712,119,theory(equality)])).
% cnf(726,plain,(X1=nil|app(X2,X1)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[725,theory(equality)])).
% cnf(775,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[197,theory(equality)])).
% cnf(863,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[243,250,theory(equality)])).
% cnf(865,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[863,119,theory(equality)])).
% cnf(866,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[865,theory(equality)])).
% cnf(872,plain,(app(X1,esk3_2(X1,X1))=X1|~ssList(X1)),inference(spm,[status(thm)],[195,279,theory(equality)])).
% cnf(893,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)|~ssList(esk52_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[161,587,theory(equality)])).
% cnf(894,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)|~ssList(esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[161,586,theory(equality)])).
% cnf(896,plain,(app(X1,X2)=app(nil,app(X1,X2))|~ssList(X2)|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[161,126,theory(equality)])).
% cnf(900,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[893,579,theory(equality)])).
% cnf(901,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[900,578,theory(equality)])).
% cnf(902,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[901,theory(equality)])).
% cnf(903,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[894,578,theory(equality)])).
% cnf(904,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[903,579,theory(equality)])).
% cnf(905,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[904,theory(equality)])).
% cnf(906,plain,(app(X1,X2)=app(nil,app(X1,X2))|~ssList(X2)|~ssList(X1)|$false),inference(rw,[status(thm)],[896,119,theory(equality)])).
% cnf(907,plain,(app(X1,X2)=app(nil,app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[906,theory(equality)])).
% cnf(933,plain,(segmentP(app(app(X1,X2),X3),X2)|~ssList(X3)|~ssList(X1)|~ssList(X2)),inference(spm,[status(thm)],[141,137,theory(equality)])).
% cnf(1967,negated_conjecture,(app(esk53_0,esk52_0)=app(esk48_0,nil)|~ssList(nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[902,171,theory(equality)])).
% cnf(1968,negated_conjecture,(app(esk53_0,esk49_0)=app(esk48_0,esk53_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[902,586,theory(equality)])).
% cnf(1997,negated_conjecture,(esk48_0=app(esk48_0,nil)|~ssList(nil)|~ssList(esk52_0)),inference(rw,[status(thm)],[1967,587,theory(equality)])).
% cnf(1998,negated_conjecture,(esk48_0=app(esk48_0,nil)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[1997,119,theory(equality)])).
% cnf(1999,negated_conjecture,(esk48_0=app(esk48_0,nil)|$false|$false),inference(rw,[status(thm)],[1998,579,theory(equality)])).
% cnf(2000,negated_conjecture,(esk48_0=app(esk48_0,nil)),inference(cn,[status(thm)],[1999,theory(equality)])).
% cnf(2001,negated_conjecture,(app(esk53_0,esk49_0)=app(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[1968,578,theory(equality)])).
% cnf(2002,negated_conjecture,(app(esk53_0,esk49_0)=app(esk48_0,esk53_0)),inference(cn,[status(thm)],[2001,theory(equality)])).
% cnf(2069,negated_conjecture,(esk49_0=esk52_0|app(esk48_0,esk53_0)!=esk48_0|~ssList(esk49_0)),inference(spm,[status(thm)],[719,2002,theory(equality)])).
% cnf(2112,negated_conjecture,(esk49_0=esk52_0|app(esk48_0,esk53_0)!=esk48_0|$false),inference(rw,[status(thm)],[2069,573,theory(equality)])).
% cnf(2113,negated_conjecture,(esk49_0=esk52_0|app(esk48_0,esk53_0)!=esk48_0),inference(cn,[status(thm)],[2112,theory(equality)])).
% cnf(2335,negated_conjecture,(app(esk52_0,esk53_0)=app(esk49_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[905,171,theory(equality)])).
% cnf(2367,negated_conjecture,(esk49_0=app(esk49_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(rw,[status(thm)],[2335,586,theory(equality)])).
% cnf(2368,negated_conjecture,(esk49_0=app(esk49_0,nil)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[2367,119,theory(equality)])).
% cnf(2369,negated_conjecture,(esk49_0=app(esk49_0,nil)|$false|$false),inference(rw,[status(thm)],[2368,578,theory(equality)])).
% cnf(2370,negated_conjecture,(esk49_0=app(esk49_0,nil)),inference(cn,[status(thm)],[2369,theory(equality)])).
% cnf(5341,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[775,123])).
% cnf(5376,negated_conjecture,(frontsegP(esk49_0,esk49_0)|~ssList(nil)|~ssList(esk49_0)),inference(spm,[status(thm)],[5341,2370,theory(equality)])).
% cnf(5377,negated_conjecture,(frontsegP(esk48_0,esk48_0)|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[5341,2000,theory(equality)])).
% cnf(5484,negated_conjecture,(frontsegP(esk49_0,esk49_0)|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[5376,119,theory(equality)])).
% cnf(5485,negated_conjecture,(frontsegP(esk49_0,esk49_0)|$false|$false),inference(rw,[status(thm)],[5484,573,theory(equality)])).
% cnf(5486,negated_conjecture,(frontsegP(esk49_0,esk49_0)),inference(cn,[status(thm)],[5485,theory(equality)])).
% cnf(5487,negated_conjecture,(frontsegP(esk48_0,esk48_0)|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5377,119,theory(equality)])).
% cnf(5488,negated_conjecture,(frontsegP(esk48_0,esk48_0)|$false|$false),inference(rw,[status(thm)],[5487,572,theory(equality)])).
% cnf(5489,negated_conjecture,(frontsegP(esk48_0,esk48_0)),inference(cn,[status(thm)],[5488,theory(equality)])).
% cnf(5734,negated_conjecture,(ssList(esk3_2(esk49_0,esk49_0))|~ssList(esk49_0)),inference(spm,[status(thm)],[196,5486,theory(equality)])).
% cnf(5735,negated_conjecture,(app(esk49_0,esk3_2(esk49_0,esk49_0))=esk49_0|~ssList(esk49_0)),inference(spm,[status(thm)],[195,5486,theory(equality)])).
% cnf(5738,negated_conjecture,(ssList(esk3_2(esk49_0,esk49_0))|$false),inference(rw,[status(thm)],[5734,573,theory(equality)])).
% cnf(5739,negated_conjecture,(ssList(esk3_2(esk49_0,esk49_0))),inference(cn,[status(thm)],[5738,theory(equality)])).
% cnf(5740,negated_conjecture,(app(esk49_0,esk3_2(esk49_0,esk49_0))=esk49_0|$false),inference(rw,[status(thm)],[5735,573,theory(equality)])).
% cnf(5741,negated_conjecture,(app(esk49_0,esk3_2(esk49_0,esk49_0))=esk49_0),inference(cn,[status(thm)],[5740,theory(equality)])).
% cnf(5762,negated_conjecture,(esk3_2(esk49_0,esk49_0)=nil|~ssList(esk49_0)|~ssList(esk3_2(esk49_0,esk49_0))),inference(spm,[status(thm)],[726,5741,theory(equality)])).
% cnf(5807,negated_conjecture,(esk3_2(esk49_0,esk49_0)=nil|$false|~ssList(esk3_2(esk49_0,esk49_0))),inference(rw,[status(thm)],[5762,573,theory(equality)])).
% cnf(5808,negated_conjecture,(esk3_2(esk49_0,esk49_0)=nil|$false|$false),inference(rw,[status(thm)],[5807,5739,theory(equality)])).
% cnf(5809,negated_conjecture,(esk3_2(esk49_0,esk49_0)=nil),inference(cn,[status(thm)],[5808,theory(equality)])).
% cnf(5832,negated_conjecture,(ssList(esk3_2(esk48_0,esk48_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[196,5489,theory(equality)])).
% cnf(5833,negated_conjecture,(app(esk48_0,esk3_2(esk48_0,esk48_0))=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[195,5489,theory(equality)])).
% cnf(5836,negated_conjecture,(ssList(esk3_2(esk48_0,esk48_0))|$false),inference(rw,[status(thm)],[5832,572,theory(equality)])).
% cnf(5837,negated_conjecture,(ssList(esk3_2(esk48_0,esk48_0))),inference(cn,[status(thm)],[5836,theory(equality)])).
% cnf(5838,negated_conjecture,(app(esk48_0,esk3_2(esk48_0,esk48_0))=esk48_0|$false),inference(rw,[status(thm)],[5833,572,theory(equality)])).
% cnf(5839,negated_conjecture,(app(esk48_0,esk3_2(esk48_0,esk48_0))=esk48_0),inference(cn,[status(thm)],[5838,theory(equality)])).
% cnf(5856,negated_conjecture,(esk3_2(esk48_0,esk48_0)=nil|~ssList(esk48_0)|~ssList(esk3_2(esk48_0,esk48_0))),inference(spm,[status(thm)],[726,5839,theory(equality)])).
% cnf(5901,negated_conjecture,(esk3_2(esk48_0,esk48_0)=nil|$false|~ssList(esk3_2(esk48_0,esk48_0))),inference(rw,[status(thm)],[5856,572,theory(equality)])).
% cnf(5902,negated_conjecture,(esk3_2(esk48_0,esk48_0)=nil|$false|$false),inference(rw,[status(thm)],[5901,5837,theory(equality)])).
% cnf(5903,negated_conjecture,(esk3_2(esk48_0,esk48_0)=nil),inference(cn,[status(thm)],[5902,theory(equality)])).
% cnf(12177,negated_conjecture,(frontsegP(esk49_0,nil)|~ssList(esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[866,586,theory(equality)])).
% cnf(12313,negated_conjecture,(frontsegP(esk49_0,nil)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[12177,578,theory(equality)])).
% cnf(12314,negated_conjecture,(frontsegP(esk49_0,nil)|$false|$false),inference(rw,[status(thm)],[12313,579,theory(equality)])).
% cnf(12315,negated_conjecture,(frontsegP(esk49_0,nil)),inference(cn,[status(thm)],[12314,theory(equality)])).
% cnf(12554,negated_conjecture,(ssList(esk3_2(esk49_0,nil))|~ssList(nil)|~ssList(esk49_0)),inference(spm,[status(thm)],[196,12315,theory(equality)])).
% cnf(12556,negated_conjecture,(app(nil,esk3_2(esk49_0,nil))=esk49_0|~ssList(nil)|~ssList(esk49_0)),inference(spm,[status(thm)],[195,12315,theory(equality)])).
% cnf(12559,negated_conjecture,(ssList(esk3_2(esk49_0,nil))|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[12554,119,theory(equality)])).
% cnf(12560,negated_conjecture,(ssList(esk3_2(esk49_0,nil))|$false|$false),inference(rw,[status(thm)],[12559,573,theory(equality)])).
% cnf(12561,negated_conjecture,(ssList(esk3_2(esk49_0,nil))),inference(cn,[status(thm)],[12560,theory(equality)])).
% cnf(12565,negated_conjecture,(app(nil,esk3_2(esk49_0,nil))=esk49_0|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[12556,119,theory(equality)])).
% cnf(12566,negated_conjecture,(app(nil,esk3_2(esk49_0,nil))=esk49_0|$false|$false),inference(rw,[status(thm)],[12565,573,theory(equality)])).
% cnf(12567,negated_conjecture,(app(nil,esk3_2(esk49_0,nil))=esk49_0),inference(cn,[status(thm)],[12566,theory(equality)])).
% cnf(12593,negated_conjecture,(esk49_0=esk3_2(esk49_0,nil)|~ssList(esk3_2(esk49_0,nil))),inference(spm,[status(thm)],[126,12567,theory(equality)])).
% cnf(12656,negated_conjecture,(esk49_0=esk3_2(esk49_0,nil)|$false),inference(rw,[status(thm)],[12593,12561,theory(equality)])).
% cnf(12657,negated_conjecture,(esk49_0=esk3_2(esk49_0,nil)),inference(cn,[status(thm)],[12656,theory(equality)])).
% cnf(12757,negated_conjecture,(app(nil,esk49_0)=esk49_0),inference(rw,[status(thm)],[12567,12657,theory(equality)])).
% cnf(14324,negated_conjecture,(app(esk52_0,esk53_0)=app(esk49_0,esk3_2(esk53_0,esk53_0))|~ssList(esk3_2(esk53_0,esk53_0))|~ssList(esk53_0)),inference(spm,[status(thm)],[905,872,theory(equality)])).
% cnf(14380,negated_conjecture,(esk49_0=app(esk49_0,esk3_2(esk53_0,esk53_0))|~ssList(esk3_2(esk53_0,esk53_0))|~ssList(esk53_0)),inference(rw,[status(thm)],[14324,586,theory(equality)])).
% cnf(14381,negated_conjecture,(esk49_0=app(esk49_0,esk3_2(esk53_0,esk53_0))|~ssList(esk3_2(esk53_0,esk53_0))|$false),inference(rw,[status(thm)],[14380,578,theory(equality)])).
% cnf(14382,negated_conjecture,(esk49_0=app(esk49_0,esk3_2(esk53_0,esk53_0))|~ssList(esk3_2(esk53_0,esk53_0))),inference(cn,[status(thm)],[14381,theory(equality)])).
% cnf(30107,negated_conjecture,(segmentP(app(esk48_0,X1),esk52_0)|~ssList(X1)|~ssList(esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[933,587,theory(equality)])).
% cnf(30130,negated_conjecture,(segmentP(app(esk49_0,X1),esk53_0)|~ssList(X1)|~ssList(esk52_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[933,586,theory(equality)])).
% cnf(30187,negated_conjecture,(segmentP(app(esk49_0,X1),esk49_0)|~ssList(X1)|~ssList(nil)|~ssList(esk49_0)),inference(spm,[status(thm)],[933,12757,theory(equality)])).
% cnf(30241,negated_conjecture,(segmentP(app(esk48_0,X1),esk52_0)|~ssList(X1)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[30107,578,theory(equality)])).
% cnf(30242,negated_conjecture,(segmentP(app(esk48_0,X1),esk52_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[30241,579,theory(equality)])).
% cnf(30243,negated_conjecture,(segmentP(app(esk48_0,X1),esk52_0)|~ssList(X1)),inference(cn,[status(thm)],[30242,theory(equality)])).
% cnf(30309,negated_conjecture,(segmentP(app(esk49_0,X1),esk53_0)|~ssList(X1)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[30130,579,theory(equality)])).
% cnf(30310,negated_conjecture,(segmentP(app(esk49_0,X1),esk53_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[30309,578,theory(equality)])).
% cnf(30311,negated_conjecture,(segmentP(app(esk49_0,X1),esk53_0)|~ssList(X1)),inference(cn,[status(thm)],[30310,theory(equality)])).
% cnf(30455,negated_conjecture,(segmentP(app(esk49_0,X1),esk49_0)|~ssList(X1)|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[30187,119,theory(equality)])).
% cnf(30456,negated_conjecture,(segmentP(app(esk49_0,X1),esk49_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[30455,573,theory(equality)])).
% cnf(30457,negated_conjecture,(segmentP(app(esk49_0,X1),esk49_0)|~ssList(X1)),inference(cn,[status(thm)],[30456,theory(equality)])).
% cnf(48855,negated_conjecture,(segmentP(esk48_0,esk52_0)|~ssList(esk3_2(esk48_0,esk48_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[30243,872,theory(equality)])).
% cnf(48878,negated_conjecture,(segmentP(esk48_0,esk52_0)|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[48855,5903,theory(equality)]),119,theory(equality)])).
% cnf(48879,negated_conjecture,(segmentP(esk48_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[48878,572,theory(equality)])).
% cnf(48880,negated_conjecture,(segmentP(esk48_0,esk52_0)),inference(cn,[status(thm)],[48879,theory(equality)])).
% cnf(49313,negated_conjecture,(segmentP(esk49_0,esk53_0)|~ssList(esk3_2(esk49_0,esk49_0))|~ssList(esk49_0)),inference(spm,[status(thm)],[30311,872,theory(equality)])).
% cnf(49336,negated_conjecture,(segmentP(esk49_0,esk53_0)|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[49313,5809,theory(equality)]),119,theory(equality)])).
% cnf(49337,negated_conjecture,(segmentP(esk49_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[49336,573,theory(equality)])).
% cnf(49338,negated_conjecture,(segmentP(esk49_0,esk53_0)),inference(cn,[status(thm)],[49337,theory(equality)])).
% cnf(49723,negated_conjecture,(segmentP(esk49_0,esk49_0)|~ssList(esk3_2(esk49_0,esk49_0))|~ssList(esk49_0)),inference(spm,[status(thm)],[30457,872,theory(equality)])).
% cnf(49746,negated_conjecture,(segmentP(esk49_0,esk49_0)|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[49723,5809,theory(equality)]),119,theory(equality)])).
% cnf(49747,negated_conjecture,(segmentP(esk49_0,esk49_0)|$false|$false),inference(rw,[status(thm)],[49746,573,theory(equality)])).
% cnf(49748,negated_conjecture,(segmentP(esk49_0,esk49_0)),inference(cn,[status(thm)],[49747,theory(equality)])).
% cnf(49775,negated_conjecture,(~segmentP(esk48_0,esk49_0)|$false),inference(rw,[status(thm)],[593,49748,theory(equality)])).
% cnf(49776,negated_conjecture,(~segmentP(esk48_0,esk49_0)),inference(cn,[status(thm)],[49775,theory(equality)])).
% cnf(58057,negated_conjecture,(app(esk49_0,esk3_2(esk53_0,esk53_0))=esk49_0|~ssList(esk53_0)),inference(spm,[status(thm)],[14382,682,theory(equality)])).
% cnf(58058,negated_conjecture,(app(esk49_0,esk3_2(esk53_0,esk53_0))=esk49_0|$false),inference(rw,[status(thm)],[58057,578,theory(equality)])).
% cnf(58059,negated_conjecture,(app(esk49_0,esk3_2(esk53_0,esk53_0))=esk49_0),inference(cn,[status(thm)],[58058,theory(equality)])).
% cnf(58092,negated_conjecture,(esk3_2(esk53_0,esk53_0)=nil|~ssList(esk49_0)|~ssList(esk3_2(esk53_0,esk53_0))),inference(spm,[status(thm)],[726,58059,theory(equality)])).
% cnf(58193,negated_conjecture,(esk3_2(esk53_0,esk53_0)=nil|$false|~ssList(esk3_2(esk53_0,esk53_0))),inference(rw,[status(thm)],[58092,573,theory(equality)])).
% cnf(58194,negated_conjecture,(esk3_2(esk53_0,esk53_0)=nil|~ssList(esk3_2(esk53_0,esk53_0))),inference(cn,[status(thm)],[58193,theory(equality)])).
% cnf(58260,negated_conjecture,(esk3_2(esk53_0,esk53_0)=nil|~ssList(esk53_0)),inference(spm,[status(thm)],[58194,682,theory(equality)])).
% cnf(58261,negated_conjecture,(esk3_2(esk53_0,esk53_0)=nil|$false),inference(rw,[status(thm)],[58260,578,theory(equality)])).
% cnf(58262,negated_conjecture,(esk3_2(esk53_0,esk53_0)=nil),inference(cn,[status(thm)],[58261,theory(equality)])).
% cnf(58264,negated_conjecture,(app(esk53_0,nil)=esk53_0|~ssList(esk53_0)),inference(spm,[status(thm)],[872,58262,theory(equality)])).
% cnf(58284,negated_conjecture,(app(esk53_0,nil)=esk53_0|$false),inference(rw,[status(thm)],[58264,578,theory(equality)])).
% cnf(58285,negated_conjecture,(app(esk53_0,nil)=esk53_0),inference(cn,[status(thm)],[58284,theory(equality)])).
% cnf(58296,negated_conjecture,(app(nil,esk53_0)=esk53_0|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[907,58285,theory(equality)])).
% cnf(58392,negated_conjecture,(app(nil,esk53_0)=esk53_0|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[58296,119,theory(equality)])).
% cnf(58393,negated_conjecture,(app(nil,esk53_0)=esk53_0|$false|$false),inference(rw,[status(thm)],[58392,578,theory(equality)])).
% cnf(58394,negated_conjecture,(app(nil,esk53_0)=esk53_0),inference(cn,[status(thm)],[58393,theory(equality)])).
% cnf(58553,negated_conjecture,(segmentP(app(esk53_0,X1),esk53_0)|~ssList(X1)|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[933,58394,theory(equality)])).
% cnf(58624,negated_conjecture,(segmentP(app(esk53_0,X1),esk53_0)|~ssList(X1)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[58553,119,theory(equality)])).
% cnf(58625,negated_conjecture,(segmentP(app(esk53_0,X1),esk53_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[58624,578,theory(equality)])).
% cnf(58626,negated_conjecture,(segmentP(app(esk53_0,X1),esk53_0)|~ssList(X1)),inference(cn,[status(thm)],[58625,theory(equality)])).
% cnf(60363,negated_conjecture,(segmentP(esk48_0,esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[58626,587,theory(equality)])).
% cnf(60409,negated_conjecture,(segmentP(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[60363,579,theory(equality)])).
% cnf(60410,negated_conjecture,(segmentP(esk48_0,esk53_0)),inference(cn,[status(thm)],[60409,theory(equality)])).
% cnf(60478,negated_conjecture,(esk53_0=nil|~segmentP(esk49_0,esk53_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[647,60410,theory(equality)])).
% cnf(60497,negated_conjecture,(esk53_0=nil|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[60478,49338,theory(equality)])).
% cnf(60498,negated_conjecture,(esk53_0=nil|$false|$false),inference(rw,[status(thm)],[60497,578,theory(equality)])).
% cnf(60499,negated_conjecture,(esk53_0=nil),inference(cn,[status(thm)],[60498,theory(equality)])).
% cnf(61274,negated_conjecture,(esk52_0=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2113,60499,theory(equality)]),2000,theory(equality)])).
% cnf(61275,negated_conjecture,(esk52_0=esk49_0),inference(cn,[status(thm)],[61274,theory(equality)])).
% cnf(61381,negated_conjecture,(segmentP(esk48_0,esk49_0)),inference(rw,[status(thm)],[48880,61275,theory(equality)])).
% cnf(61382,negated_conjecture,($false),inference(sr,[status(thm)],[61381,49776,theory(equality)])).
% cnf(61383,negated_conjecture,($false),61382,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 2528
% # ...of these trivial                : 181
% # ...subsumed                        : 513
% # ...remaining for further processing: 1834
% # Other redundant clauses eliminated : 203
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 58
% # Backward-rewritten                 : 1110
% # Generated clauses                  : 17478
% # ...of the previous two non-trivial : 16120
% # Contextual simplify-reflections    : 308
% # Paramodulations                    : 17211
% # Factorizations                     : 0
% # Equation resolutions               : 267
% # Current number of processed clauses: 660
% #    Positive orientable unit clauses: 214
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 443
% # Current number of unprocessed clauses: 5593
% # ...number of literals in the above : 29956
% # Clause-clause subsumption calls (NU) : 82306
% # Rec. Clause-clause subsumption calls : 72439
% # Unit Clause-clause subsumption calls : 10040
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1645
% # Indexed BW rewrite successes       : 79
% # Backwards rewriting index:   562 leaves,   1.48+/-1.291 terms/leaf
% # Paramod-from index:          301 leaves,   1.23+/-1.029 terms/leaf
% # Paramod-into index:          507 leaves,   1.40+/-1.237 terms/leaf
% # -------------------------------------------------
% # User time              : 1.056 s
% # System time            : 0.040 s
% # Total time             : 1.096 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.97 CPU 2.09 WC
% FINAL PrfWatch: 1.97 CPU 2.09 WC
% SZS output end Solution for /tmp/SystemOnTPTP16729/SWC090+1.tptp
% 
%------------------------------------------------------------------------------