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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC083+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 : art07.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:49 EST 2010

% Result   : Theorem 1.68s
% Output   : Solution 1.68s
% 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/SystemOnTPTP21542/SWC083+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21542/SWC083+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21542/SWC083+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 21638
% 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)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% 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(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(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)=>![X8]:((~(ssList(X8))|~(app(app(X6,X7),X8)=X3))|~(app(X6,X8)=X4)))))))),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)=>![X8]:((~(ssList(X8))|~(app(app(X6,X7),X8)=X3))|~(app(X6,X8)=X4))))))))),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)=>![X8]:((~(ssList(X8))|~(app(app(X6,X7),X8)=X3))|~(app(X6,X8)=X4))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, 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)],[1])).
% fof(105, 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)],[104])).
% fof(106, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk1_2(X5,X6))&(ssList(esk2_2(X5,X6))&app(app(esk1_2(X5,X6),X6),esk2_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk1_2(X5,X6))&(ssList(esk2_2(X5,X6))&app(app(esk1_2(X5,X6),X6),esk2_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[106])).
% fof(108, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk1_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk2_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk1_2(X5,X6),X6),esk2_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[107])).
% cnf(112,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[108])).
% 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(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(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)&?[X8]:((ssList(X8)&app(app(X6,X7),X8)=X3)&app(X6,X8)=X4))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(((((ssList(X12)&X10=X12)&X9=X11)&neq(X10,nil))&![X13]:(((~(ssList(X13))|~(neq(X13,nil)))|~(segmentP(X10,X13)))|~(segmentP(X9,X13))))&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:((ssList(X16)&app(app(X14,X15),X16)=X11)&app(X14,X16)=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)&neq(esk49_0,nil))&![X13]:(((~(ssList(X13))|~(neq(X13,nil)))|~(segmentP(esk49_0,X13)))|~(segmentP(esk48_0,X13))))&(ssList(esk52_0)&(ssList(esk53_0)&((ssList(esk54_0)&app(app(esk52_0,esk53_0),esk54_0)=esk50_0)&app(esk52_0,esk54_0)=esk51_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:((((((((~(ssList(X13))|~(neq(X13,nil)))|~(segmentP(esk49_0,X13)))|~(segmentP(esk48_0,X13)))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&neq(esk49_0,nil)))&(ssList(esk52_0)&(ssList(esk53_0)&((ssList(esk54_0)&app(app(esk52_0,esk53_0),esk54_0)=esk50_0)&app(esk52_0,esk54_0)=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(575,negated_conjecture,(app(esk52_0,esk54_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(app(app(esk52_0,esk53_0),esk54_0)=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(ssList(esk54_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(584,negated_conjecture,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(app(esk52_0,esk54_0)=esk49_0),inference(rw,[status(thm)],[575,582,theory(equality)])).
% cnf(588,negated_conjecture,(app(app(esk52_0,esk53_0),esk54_0)=esk48_0),inference(rw,[status(thm)],[576,581,theory(equality)])).
% cnf(592,negated_conjecture,(~segmentP(esk48_0,esk49_0)|~segmentP(esk49_0,esk49_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[584,580,theory(equality)])).
% cnf(593,negated_conjecture,(~segmentP(esk48_0,esk49_0)|~segmentP(esk49_0,esk49_0)|$false),inference(rw,[status(thm)],[592,573,theory(equality)])).
% cnf(594,negated_conjecture,(~segmentP(esk48_0,esk49_0)|~segmentP(esk49_0,esk49_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(643,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[584,117,theory(equality)])).
% cnf(644,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~ssList(X1)|$false),inference(rw,[status(thm)],[643,119,theory(equality)])).
% cnf(645,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~ssList(X1)),inference(cn,[status(thm)],[644,theory(equality)])).
% cnf(707,negated_conjecture,(X1=esk54_0|app(esk52_0,X1)!=esk49_0|~ssList(esk54_0)|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[157,587,theory(equality)])).
% cnf(715,negated_conjecture,(X1=esk54_0|app(esk52_0,X1)!=esk49_0|$false|~ssList(esk52_0)|~ssList(X1)),inference(rw,[status(thm)],[707,577,theory(equality)])).
% cnf(716,negated_conjecture,(X1=esk54_0|app(esk52_0,X1)!=esk49_0|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[715,579,theory(equality)])).
% cnf(717,negated_conjecture,(X1=esk54_0|app(esk52_0,X1)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[716,theory(equality)])).
% cnf(769,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[197,theory(equality)])).
% cnf(826,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[112,126,theory(equality)])).
% cnf(829,plain,(segmentP(X1,X2)|app(X3,X2)!=X1|~ssList(nil)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~ssList(app(X3,X2))),inference(spm,[status(thm)],[112,171,theory(equality)])).
% cnf(834,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[826,119,theory(equality)])).
% cnf(835,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[834,theory(equality)])).
% cnf(840,plain,(segmentP(X1,X2)|app(X3,X2)!=X1|$false|~ssList(X3)|~ssList(X2)|~ssList(X1)|~ssList(app(X3,X2))),inference(rw,[status(thm)],[829,119,theory(equality)])).
% cnf(841,plain,(segmentP(X1,X2)|app(X3,X2)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)|~ssList(app(X3,X2))),inference(cn,[status(thm)],[840,theory(equality)])).
% cnf(892,negated_conjecture,(app(esk52_0,app(esk53_0,esk54_0))=esk48_0|~ssList(esk54_0)|~ssList(esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[588,161,theory(equality)])).
% cnf(894,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk54_0,X1))|~ssList(X1)|~ssList(esk54_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[161,587,theory(equality)])).
% cnf(901,negated_conjecture,(app(esk52_0,app(esk53_0,esk54_0))=esk48_0|$false|~ssList(esk53_0)|~ssList(esk52_0)),inference(rw,[status(thm)],[892,577,theory(equality)])).
% cnf(902,negated_conjecture,(app(esk52_0,app(esk53_0,esk54_0))=esk48_0|$false|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[901,578,theory(equality)])).
% cnf(903,negated_conjecture,(app(esk52_0,app(esk53_0,esk54_0))=esk48_0|$false|$false|$false),inference(rw,[status(thm)],[902,579,theory(equality)])).
% cnf(904,negated_conjecture,(app(esk52_0,app(esk53_0,esk54_0))=esk48_0),inference(cn,[status(thm)],[903,theory(equality)])).
% cnf(905,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk54_0,X1))|~ssList(X1)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[894,577,theory(equality)])).
% cnf(906,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk54_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[905,579,theory(equality)])).
% cnf(907,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk54_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[906,theory(equality)])).
% cnf(1436,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(app(esk53_0,esk54_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[157,904,theory(equality)])).
% cnf(1459,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(app(esk53_0,esk54_0))|$false|~ssList(X1)),inference(rw,[status(thm)],[1436,579,theory(equality)])).
% cnf(1460,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(app(esk53_0,esk54_0))|~ssList(X1)),inference(cn,[status(thm)],[1459,theory(equality)])).
% cnf(2252,negated_conjecture,(app(esk54_0,X1)=esk54_0|app(esk49_0,X1)!=esk49_0|~ssList(app(esk54_0,X1))|~ssList(X1)),inference(spm,[status(thm)],[717,907,theory(equality)])).
% cnf(2590,negated_conjecture,(app(esk54_0,nil)=esk54_0|~ssList(app(esk54_0,nil))|~ssList(nil)|~ssList(esk49_0)),inference(spm,[status(thm)],[2252,171,theory(equality)])).
% cnf(2593,negated_conjecture,(app(esk54_0,nil)=esk54_0|~ssList(app(esk54_0,nil))|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[2590,119,theory(equality)])).
% cnf(2594,negated_conjecture,(app(esk54_0,nil)=esk54_0|~ssList(app(esk54_0,nil))|$false|$false),inference(rw,[status(thm)],[2593,573,theory(equality)])).
% cnf(2595,negated_conjecture,(app(esk54_0,nil)=esk54_0|~ssList(app(esk54_0,nil))),inference(cn,[status(thm)],[2594,theory(equality)])).
% cnf(2598,negated_conjecture,(app(esk54_0,nil)=esk54_0|~ssList(nil)|~ssList(esk54_0)),inference(spm,[status(thm)],[2595,123,theory(equality)])).
% cnf(2599,negated_conjecture,(app(esk54_0,nil)=esk54_0|$false|~ssList(esk54_0)),inference(rw,[status(thm)],[2598,119,theory(equality)])).
% cnf(2600,negated_conjecture,(app(esk54_0,nil)=esk54_0|$false|$false),inference(rw,[status(thm)],[2599,577,theory(equality)])).
% cnf(2601,negated_conjecture,(app(esk54_0,nil)=esk54_0),inference(cn,[status(thm)],[2600,theory(equality)])).
% cnf(3604,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(X1)|~ssList(esk54_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[1460,123,theory(equality)])).
% cnf(3605,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(X1)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[3604,577,theory(equality)])).
% cnf(3606,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[3605,578,theory(equality)])).
% cnf(3607,negated_conjecture,(X1=app(esk53_0,esk54_0)|app(esk52_0,X1)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[3606,theory(equality)])).
% cnf(5572,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[769,123])).
% cnf(5582,negated_conjecture,(frontsegP(esk48_0,esk52_0)|~ssList(app(esk53_0,esk54_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[5572,904,theory(equality)])).
% cnf(5626,negated_conjecture,(frontsegP(esk48_0,esk52_0)|~ssList(app(esk53_0,esk54_0))|$false),inference(rw,[status(thm)],[5582,579,theory(equality)])).
% cnf(5627,negated_conjecture,(frontsegP(esk48_0,esk52_0)|~ssList(app(esk53_0,esk54_0))),inference(cn,[status(thm)],[5626,theory(equality)])).
% cnf(5779,negated_conjecture,(frontsegP(esk48_0,esk52_0)|~ssList(esk54_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[5627,123,theory(equality)])).
% cnf(5780,negated_conjecture,(frontsegP(esk48_0,esk52_0)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[5779,577,theory(equality)])).
% cnf(5781,negated_conjecture,(frontsegP(esk48_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[5780,578,theory(equality)])).
% cnf(5782,negated_conjecture,(frontsegP(esk48_0,esk52_0)),inference(cn,[status(thm)],[5781,theory(equality)])).
% cnf(5783,negated_conjecture,(ssList(esk3_2(esk48_0,esk52_0))|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[196,5782,theory(equality)])).
% cnf(5785,negated_conjecture,(app(esk52_0,esk3_2(esk48_0,esk52_0))=esk48_0|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[195,5782,theory(equality)])).
% cnf(5789,negated_conjecture,(ssList(esk3_2(esk48_0,esk52_0))|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5783,579,theory(equality)])).
% cnf(5790,negated_conjecture,(ssList(esk3_2(esk48_0,esk52_0))|$false|$false),inference(rw,[status(thm)],[5789,572,theory(equality)])).
% cnf(5791,negated_conjecture,(ssList(esk3_2(esk48_0,esk52_0))),inference(cn,[status(thm)],[5790,theory(equality)])).
% cnf(5795,negated_conjecture,(app(esk52_0,esk3_2(esk48_0,esk52_0))=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5785,579,theory(equality)])).
% cnf(5796,negated_conjecture,(app(esk52_0,esk3_2(esk48_0,esk52_0))=esk48_0|$false|$false),inference(rw,[status(thm)],[5795,572,theory(equality)])).
% cnf(5797,negated_conjecture,(app(esk52_0,esk3_2(esk48_0,esk52_0))=esk48_0),inference(cn,[status(thm)],[5796,theory(equality)])).
% cnf(5828,negated_conjecture,(esk3_2(esk48_0,esk52_0)=app(esk53_0,esk54_0)|~ssList(esk3_2(esk48_0,esk52_0))),inference(spm,[status(thm)],[3607,5797,theory(equality)])).
% cnf(5884,negated_conjecture,(esk3_2(esk48_0,esk52_0)=app(esk53_0,esk54_0)|$false),inference(rw,[status(thm)],[5828,5791,theory(equality)])).
% cnf(5885,negated_conjecture,(esk3_2(esk48_0,esk52_0)=app(esk53_0,esk54_0)),inference(cn,[status(thm)],[5884,theory(equality)])).
% cnf(5887,negated_conjecture,(ssList(app(esk53_0,esk54_0))),inference(rw,[status(thm)],[5791,5885,theory(equality)])).
% cnf(7495,negated_conjecture,(segmentP(X1,esk54_0)|esk54_0!=X1|~ssList(nil)|~ssList(esk54_0)|~ssList(X1)),inference(spm,[status(thm)],[835,2601,theory(equality)])).
% cnf(7497,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|~ssList(esk54_0)|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[835,587,theory(equality)])).
% cnf(7500,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|~ssList(app(esk53_0,esk54_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[835,904,theory(equality)])).
% cnf(7535,negated_conjecture,(segmentP(X1,esk54_0)|esk54_0!=X1|$false|~ssList(esk54_0)|~ssList(X1)),inference(rw,[status(thm)],[7495,119,theory(equality)])).
% cnf(7536,negated_conjecture,(segmentP(X1,esk54_0)|esk54_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[7535,577,theory(equality)])).
% cnf(7537,negated_conjecture,(segmentP(X1,esk54_0)|esk54_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[7536,theory(equality)])).
% cnf(7540,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|$false|~ssList(esk52_0)|~ssList(X1)),inference(rw,[status(thm)],[7497,577,theory(equality)])).
% cnf(7541,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[7540,579,theory(equality)])).
% cnf(7542,negated_conjecture,(segmentP(X1,esk52_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[7541,theory(equality)])).
% cnf(7547,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|$false|~ssList(esk52_0)|~ssList(X1)),inference(rw,[status(thm)],[7500,5887,theory(equality)])).
% cnf(7548,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[7547,579,theory(equality)])).
% cnf(7549,negated_conjecture,(segmentP(X1,esk52_0)|esk48_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[7548,theory(equality)])).
% cnf(7612,negated_conjecture,(segmentP(esk54_0,esk54_0)|~ssList(esk54_0)),inference(er,[status(thm)],[7537,theory(equality)])).
% cnf(7613,negated_conjecture,(segmentP(esk54_0,esk54_0)|$false),inference(rw,[status(thm)],[7612,577,theory(equality)])).
% cnf(7614,negated_conjecture,(segmentP(esk54_0,esk54_0)),inference(cn,[status(thm)],[7613,theory(equality)])).
% cnf(7710,negated_conjecture,(segmentP(esk49_0,esk52_0)|~ssList(esk49_0)),inference(er,[status(thm)],[7542,theory(equality)])).
% cnf(7711,negated_conjecture,(segmentP(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[7710,573,theory(equality)])).
% cnf(7712,negated_conjecture,(segmentP(esk49_0,esk52_0)),inference(cn,[status(thm)],[7711,theory(equality)])).
% cnf(7829,negated_conjecture,(segmentP(esk48_0,esk52_0)|~ssList(esk48_0)),inference(er,[status(thm)],[7549,theory(equality)])).
% cnf(7830,negated_conjecture,(segmentP(esk48_0,esk52_0)|$false),inference(rw,[status(thm)],[7829,572,theory(equality)])).
% cnf(7831,negated_conjecture,(segmentP(esk48_0,esk52_0)),inference(cn,[status(thm)],[7830,theory(equality)])).
% cnf(7838,negated_conjecture,(esk52_0=nil|~segmentP(esk49_0,esk52_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[645,7831,theory(equality)])).
% cnf(7857,negated_conjecture,(esk52_0=nil|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[7838,7712,theory(equality)])).
% cnf(7858,negated_conjecture,(esk52_0=nil|$false|$false),inference(rw,[status(thm)],[7857,579,theory(equality)])).
% cnf(7859,negated_conjecture,(esk52_0=nil),inference(cn,[status(thm)],[7858,theory(equality)])).
% cnf(8040,negated_conjecture,(app(nil,app(esk53_0,esk54_0))=esk48_0),inference(rw,[status(thm)],[904,7859,theory(equality)])).
% cnf(8063,negated_conjecture,(app(nil,esk54_0)=esk49_0),inference(rw,[status(thm)],[587,7859,theory(equality)])).
% cnf(8137,negated_conjecture,(esk49_0=esk54_0|~ssList(esk54_0)),inference(spm,[status(thm)],[126,8063,theory(equality)])).
% cnf(8203,negated_conjecture,(esk49_0=esk54_0|$false),inference(rw,[status(thm)],[8137,577,theory(equality)])).
% cnf(8204,negated_conjecture,(esk49_0=esk54_0),inference(cn,[status(thm)],[8203,theory(equality)])).
% cnf(8236,negated_conjecture,(segmentP(esk49_0,esk49_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7614,8204,theory(equality)]),8204,theory(equality)])).
% cnf(8267,negated_conjecture,(ssList(app(esk53_0,esk49_0))),inference(rw,[status(thm)],[5887,8204,theory(equality)])).
% cnf(8362,plain,(segmentP(X1,X2)|app(X3,X2)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[841,123])).
% cnf(8437,negated_conjecture,(~segmentP(esk48_0,esk49_0)|$false),inference(rw,[status(thm)],[594,8236,theory(equality)])).
% cnf(8438,negated_conjecture,(~segmentP(esk48_0,esk49_0)),inference(cn,[status(thm)],[8437,theory(equality)])).
% cnf(8555,negated_conjecture,(app(nil,app(esk53_0,esk49_0))=esk48_0),inference(rw,[status(thm)],[8040,8204,theory(equality)])).
% cnf(8573,negated_conjecture,(esk48_0=app(esk53_0,esk49_0)|~ssList(app(esk53_0,esk49_0))),inference(spm,[status(thm)],[126,8555,theory(equality)])).
% cnf(8635,negated_conjecture,(esk48_0=app(esk53_0,esk49_0)|$false),inference(rw,[status(thm)],[8573,8267,theory(equality)])).
% cnf(8636,negated_conjecture,(esk48_0=app(esk53_0,esk49_0)),inference(cn,[status(thm)],[8635,theory(equality)])).
% cnf(8671,negated_conjecture,(segmentP(X1,esk49_0)|esk48_0!=X1|~ssList(esk53_0)|~ssList(esk49_0)|~ssList(X1)),inference(spm,[status(thm)],[8362,8636,theory(equality)])).
% cnf(8731,negated_conjecture,(segmentP(X1,esk49_0)|esk48_0!=X1|$false|~ssList(esk49_0)|~ssList(X1)),inference(rw,[status(thm)],[8671,578,theory(equality)])).
% cnf(8732,negated_conjecture,(segmentP(X1,esk49_0)|esk48_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[8731,573,theory(equality)])).
% cnf(8733,negated_conjecture,(segmentP(X1,esk49_0)|esk48_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[8732,theory(equality)])).
% cnf(13492,negated_conjecture,(segmentP(esk48_0,esk49_0)|~ssList(esk48_0)),inference(er,[status(thm)],[8733,theory(equality)])).
% cnf(13493,negated_conjecture,(segmentP(esk48_0,esk49_0)|$false),inference(rw,[status(thm)],[13492,572,theory(equality)])).
% cnf(13494,negated_conjecture,(segmentP(esk48_0,esk49_0)),inference(cn,[status(thm)],[13493,theory(equality)])).
% cnf(13495,negated_conjecture,($false),inference(sr,[status(thm)],[13494,8438,theory(equality)])).
% cnf(13496,negated_conjecture,($false),13495,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1247
% # ...of these trivial                : 30
% # ...subsumed                        : 373
% # ...remaining for further processing: 844
% # Other redundant clauses eliminated : 111
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 65
% # Backward-rewritten                 : 310
% # Generated clauses                  : 4638
% # ...of the previous two non-trivial : 4043
% # Contextual simplify-reflections    : 220
% # Paramodulations                    : 4475
% # Factorizations                     : 0
% # Equation resolutions               : 163
% # Current number of processed clauses: 463
% #    Positive orientable unit clauses: 95
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 365
% # Current number of unprocessed clauses: 1846
% # ...number of literals in the above : 10640
% # Clause-clause subsumption calls (NU) : 20188
% # Rec. Clause-clause subsumption calls : 12794
% # Unit Clause-clause subsumption calls : 1289
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 40
% # Indexed BW rewrite successes       : 40
% # Backwards rewriting index:   437 leaves,   1.24+/-0.911 terms/leaf
% # Paramod-from index:          237 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          397 leaves,   1.14+/-0.765 terms/leaf
% # -------------------------------------------------
% # User time              : 0.313 s
% # System time            : 0.015 s
% # Total time             : 0.328 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.59 CPU 0.67 WC
% FINAL PrfWatch: 0.59 CPU 0.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP21542/SWC083+1.tptp
% 
%------------------------------------------------------------------------------