TSTP Solution File: SWC068+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC068+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 : art03.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:57:33 EST 2010
% Result : Theorem 1.56s
% Output : Solution 1.56s
% 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/SystemOnTPTP16476/SWC068+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16476/SWC068+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16476/SWC068+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 16572
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(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(8, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X3,X2)=app(X1,X2)=>X3=X1)))),file('/tmp/SRASS.s.p', ax79)).
% 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(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(16, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(app(X4,X4)=X3)|~(X2=X4))|~(X1=X3))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|(nil=X2&nil=X1)))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(app(X4,X4)=X3)|~(X2=X4))|~(X1=X3))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|(nil=X2&nil=X1))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, 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(104, 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)],[103])).
% fof(105, 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)],[104])).
% fof(106, 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)],[105])).
% fof(107, 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)],[106])).
% cnf(111,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[107])).
% fof(112, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(113, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[113])).
% fof(115, 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)],[114])).
% cnf(116,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[115])).
% cnf(118,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(119, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(120, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[120])).
% cnf(122,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[121])).
% fof(134, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(135, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[134])).
% cnf(136,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[135])).
% fof(149, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X3,X2)=app(X1,X2))|X3=X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(150, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4)))),inference(variable_rename,[status(thm)],[149])).
% fof(151, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[150])).
% cnf(152,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X3,X2)!=app(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[151])).
% fof(157, 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(158, 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)],[157])).
% fof(159, 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)],[158])).
% cnf(160,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[159])).
% fof(161, 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)],[15])).
% fof(162, 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)],[161])).
% fof(163, 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)],[162])).
% fof(164, 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)],[163])).
% cnf(167,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[164])).
% fof(168, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[16])).
% fof(169, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[168])).
% cnf(170,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[169])).
% fof(197, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(rearsegP(X1,X2))|?[X3]:(ssList(X3)&app(X3,X2)=X1))&(![X3]:(~(ssList(X3))|~(app(X3,X2)=X1))|rearsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[22])).
% fof(198, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|?[X6]:(ssList(X6)&app(X6,X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(variable_rename,[status(thm)],[197])).
% fof(199, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk4_2(X4,X5))&app(esk4_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[198])).
% fof(200, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk4_2(X4,X5))&app(esk4_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[199])).
% fof(201, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk4_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk4_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[200])).
% cnf(202,plain,(app(esk4_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[201])).
% cnf(203,plain,(ssList(esk4_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[201])).
% cnf(204,plain,(rearsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X3,X2)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[201])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((app(X4,X4)=X3&X2=X4)&X1=X3)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))&(~(nil=X2)|~(nil=X1))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((((app(X9,X9)=X8&X7=X9)&X6=X8)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(X7,X10)))|~(segmentP(X6,X10))))&(~(nil=X7)|~(nil=X6))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((app(esk51_0,esk51_0)=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10))))&(~(nil=esk49_0)|~(nil=esk48_0))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X10]:(((((((((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10)))&((app(esk51_0,esk51_0)=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0))&(~(nil=esk49_0)|~(nil=esk48_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% cnf(571,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(app(esk51_0,esk51_0)=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk48_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[575,577,theory(equality)])).
% cnf(581,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[572,577,theory(equality)])).
% cnf(584,negated_conjecture,(app(esk51_0,esk51_0)=esk48_0),inference(rw,[status(thm)],[578,576,theory(equality)])).
% cnf(588,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk48_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(606,negated_conjecture,(nil=esk51_0|esk48_0!=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[167,584,theory(equality)])).
% cnf(608,negated_conjecture,(nil=esk51_0|esk48_0!=nil|$false),inference(rw,[status(thm)],[606,581,theory(equality)])).
% cnf(609,negated_conjecture,(nil=esk51_0|esk48_0!=nil),inference(cn,[status(thm)],[608,theory(equality)])).
% cnf(624,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk51_0,X1)|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[588,116,theory(equality)])).
% cnf(625,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk51_0,X1)|~ssList(X1)|$false),inference(rw,[status(thm)],[624,118,theory(equality)])).
% cnf(626,negated_conjecture,(X1=nil|~segmentP(esk48_0,X1)|~segmentP(esk51_0,X1)|~ssList(X1)),inference(cn,[status(thm)],[625,theory(equality)])).
% cnf(707,negated_conjecture,(X1=esk51_0|app(X1,esk51_0)!=esk48_0|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[152,584,theory(equality)])).
% cnf(713,negated_conjecture,(X1=esk51_0|app(X1,esk51_0)!=esk48_0|$false|~ssList(X1)),inference(rw,[status(thm)],[707,581,theory(equality)])).
% cnf(714,negated_conjecture,(X1=esk51_0|app(X1,esk51_0)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[713,theory(equality)])).
% cnf(741,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)|~ssList(app(X1,X2))),inference(er,[status(thm)],[204,theory(equality)])).
% cnf(783,negated_conjecture,(segmentP(X1,esk51_0)|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[111,584,theory(equality)])).
% cnf(787,negated_conjecture,(segmentP(X1,esk51_0)|app(esk48_0,X2)!=X1|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[783,581,theory(equality)])).
% cnf(788,negated_conjecture,(segmentP(X1,esk51_0)|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[787,theory(equality)])).
% cnf(837,negated_conjecture,(app(esk48_0,X1)=app(esk51_0,app(esk51_0,X1))|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[160,584,theory(equality)])).
% cnf(843,negated_conjecture,(app(esk48_0,X1)=app(esk51_0,app(esk51_0,X1))|~ssList(X1)|$false),inference(rw,[status(thm)],[837,581,theory(equality)])).
% cnf(844,negated_conjecture,(app(esk48_0,X1)=app(esk51_0,app(esk51_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[843,theory(equality)])).
% cnf(1355,negated_conjecture,(esk48_0!=nil),inference(csr,[status(thm)],[609,580])).
% cnf(1815,negated_conjecture,(app(esk51_0,esk51_0)=app(esk48_0,nil)|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[844,170,theory(equality)])).
% cnf(1845,negated_conjecture,(esk48_0=app(esk48_0,nil)|~ssList(nil)|~ssList(esk51_0)),inference(rw,[status(thm)],[1815,584,theory(equality)])).
% cnf(1846,negated_conjecture,(esk48_0=app(esk48_0,nil)|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[1845,118,theory(equality)])).
% cnf(1847,negated_conjecture,(esk48_0=app(esk48_0,nil)|$false|$false),inference(rw,[status(thm)],[1846,581,theory(equality)])).
% cnf(1848,negated_conjecture,(esk48_0=app(esk48_0,nil)),inference(cn,[status(thm)],[1847,theory(equality)])).
% cnf(1856,negated_conjecture,(X1=esk48_0|app(X1,nil)!=esk48_0|~ssList(esk48_0)|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[152,1848,theory(equality)])).
% cnf(1881,negated_conjecture,(X1=esk48_0|app(X1,nil)!=esk48_0|$false|~ssList(nil)|~ssList(X1)),inference(rw,[status(thm)],[1856,571,theory(equality)])).
% cnf(1882,negated_conjecture,(X1=esk48_0|app(X1,nil)!=esk48_0|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[1881,118,theory(equality)])).
% cnf(1883,negated_conjecture,(X1=esk48_0|app(X1,nil)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[1882,theory(equality)])).
% cnf(5580,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[741,122])).
% cnf(5586,negated_conjecture,(rearsegP(esk48_0,esk51_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[5580,584,theory(equality)])).
% cnf(5605,negated_conjecture,(rearsegP(esk48_0,nil)|~ssList(esk48_0)|~ssList(nil)),inference(spm,[status(thm)],[5580,1848,theory(equality)])).
% cnf(5628,negated_conjecture,(rearsegP(esk48_0,esk51_0)|$false),inference(rw,[status(thm)],[5586,581,theory(equality)])).
% cnf(5629,negated_conjecture,(rearsegP(esk48_0,esk51_0)),inference(cn,[status(thm)],[5628,theory(equality)])).
% cnf(5682,negated_conjecture,(rearsegP(esk48_0,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[5605,571,theory(equality)])).
% cnf(5683,negated_conjecture,(rearsegP(esk48_0,nil)|$false|$false),inference(rw,[status(thm)],[5682,118,theory(equality)])).
% cnf(5684,negated_conjecture,(rearsegP(esk48_0,nil)),inference(cn,[status(thm)],[5683,theory(equality)])).
% cnf(5710,negated_conjecture,(ssList(esk4_2(esk48_0,esk51_0))|~ssList(esk51_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[203,5629,theory(equality)])).
% cnf(5711,negated_conjecture,(app(esk4_2(esk48_0,esk51_0),esk51_0)=esk48_0|~ssList(esk51_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[202,5629,theory(equality)])).
% cnf(5715,negated_conjecture,(ssList(esk4_2(esk48_0,esk51_0))|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5710,581,theory(equality)])).
% cnf(5716,negated_conjecture,(ssList(esk4_2(esk48_0,esk51_0))|$false|$false),inference(rw,[status(thm)],[5715,571,theory(equality)])).
% cnf(5717,negated_conjecture,(ssList(esk4_2(esk48_0,esk51_0))),inference(cn,[status(thm)],[5716,theory(equality)])).
% cnf(5718,negated_conjecture,(app(esk4_2(esk48_0,esk51_0),esk51_0)=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5711,581,theory(equality)])).
% cnf(5719,negated_conjecture,(app(esk4_2(esk48_0,esk51_0),esk51_0)=esk48_0|$false|$false),inference(rw,[status(thm)],[5718,571,theory(equality)])).
% cnf(5720,negated_conjecture,(app(esk4_2(esk48_0,esk51_0),esk51_0)=esk48_0),inference(cn,[status(thm)],[5719,theory(equality)])).
% cnf(5748,negated_conjecture,(esk4_2(esk48_0,esk51_0)=esk51_0|~ssList(esk4_2(esk48_0,esk51_0))),inference(spm,[status(thm)],[714,5720,theory(equality)])).
% cnf(5805,negated_conjecture,(esk4_2(esk48_0,esk51_0)=esk51_0|$false),inference(rw,[status(thm)],[5748,5717,theory(equality)])).
% cnf(5806,negated_conjecture,(esk4_2(esk48_0,esk51_0)=esk51_0),inference(cn,[status(thm)],[5805,theory(equality)])).
% cnf(5921,negated_conjecture,(ssList(esk4_2(esk48_0,nil))|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[203,5684,theory(equality)])).
% cnf(5922,negated_conjecture,(app(esk4_2(esk48_0,nil),nil)=esk48_0|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[202,5684,theory(equality)])).
% cnf(5926,negated_conjecture,(ssList(esk4_2(esk48_0,nil))|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5921,118,theory(equality)])).
% cnf(5927,negated_conjecture,(ssList(esk4_2(esk48_0,nil))|$false|$false),inference(rw,[status(thm)],[5926,571,theory(equality)])).
% cnf(5928,negated_conjecture,(ssList(esk4_2(esk48_0,nil))),inference(cn,[status(thm)],[5927,theory(equality)])).
% cnf(5929,negated_conjecture,(app(esk4_2(esk48_0,nil),nil)=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[5922,118,theory(equality)])).
% cnf(5930,negated_conjecture,(app(esk4_2(esk48_0,nil),nil)=esk48_0|$false|$false),inference(rw,[status(thm)],[5929,571,theory(equality)])).
% cnf(5931,negated_conjecture,(app(esk4_2(esk48_0,nil),nil)=esk48_0),inference(cn,[status(thm)],[5930,theory(equality)])).
% cnf(5961,negated_conjecture,(esk4_2(esk48_0,nil)=esk48_0|~ssList(esk4_2(esk48_0,nil))),inference(spm,[status(thm)],[1883,5931,theory(equality)])).
% cnf(6019,negated_conjecture,(esk4_2(esk48_0,nil)=esk48_0|$false),inference(rw,[status(thm)],[5961,5928,theory(equality)])).
% cnf(6020,negated_conjecture,(esk4_2(esk48_0,nil)=esk48_0),inference(cn,[status(thm)],[6019,theory(equality)])).
% cnf(8661,negated_conjecture,(segmentP(X1,esk51_0)|esk48_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk48_0)),inference(spm,[status(thm)],[788,170,theory(equality)])).
% cnf(8666,negated_conjecture,(segmentP(X1,esk51_0)|esk48_0!=X1|$false|~ssList(X1)|~ssList(esk48_0)),inference(rw,[status(thm)],[8661,118,theory(equality)])).
% cnf(8667,negated_conjecture,(segmentP(X1,esk51_0)|esk48_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[8666,571,theory(equality)])).
% cnf(8668,negated_conjecture,(segmentP(X1,esk51_0)|esk48_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[8667,theory(equality)])).
% cnf(8675,negated_conjecture,(segmentP(esk48_0,esk51_0)|~ssList(esk48_0)),inference(er,[status(thm)],[8668,theory(equality)])).
% cnf(8676,negated_conjecture,(segmentP(esk48_0,esk51_0)|$false),inference(rw,[status(thm)],[8675,571,theory(equality)])).
% cnf(8677,negated_conjecture,(segmentP(esk48_0,esk51_0)),inference(cn,[status(thm)],[8676,theory(equality)])).
% cnf(8684,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,esk51_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[626,8677,theory(equality)])).
% cnf(8703,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,esk51_0)|$false),inference(rw,[status(thm)],[8684,581,theory(equality)])).
% cnf(8704,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,esk51_0)),inference(cn,[status(thm)],[8703,theory(equality)])).
% cnf(8705,negated_conjecture,(esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[8704,136,theory(equality)])).
% cnf(8706,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[8705,581,theory(equality)])).
% cnf(8707,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[8706,theory(equality)])).
% cnf(8848,negated_conjecture,(esk48_0=esk51_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5806,8707,theory(equality)]),6020,theory(equality)])).
% cnf(8849,negated_conjecture,(esk48_0=nil),inference(rw,[status(thm)],[8848,8707,theory(equality)])).
% cnf(8850,negated_conjecture,($false),inference(sr,[status(thm)],[8849,1355,theory(equality)])).
% cnf(8851,negated_conjecture,($false),8850,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 931
% # ...of these trivial : 3
% # ...subsumed : 254
% # ...remaining for further processing: 674
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 23
% # Backward-rewritten : 375
% # Generated clauses : 2726
% # ...of the previous two non-trivial : 2468
% # Contextual simplify-reflections : 82
% # Paramodulations : 2625
% # Factorizations : 0
% # Equation resolutions : 101
% # Current number of processed clauses: 270
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 223
% # Current number of unprocessed clauses: 727
% # ...number of literals in the above : 4860
% # Clause-clause subsumption calls (NU) : 9215
% # Rec. Clause-clause subsumption calls : 7323
% # Unit Clause-clause subsumption calls : 3016
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 244
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 269 leaves, 1.38+/-1.133 terms/leaf
% # Paramod-from index: 138 leaves, 1.04+/-0.424 terms/leaf
% # Paramod-into index: 243 leaves, 1.24+/-0.973 terms/leaf
% # -------------------------------------------------
% # User time : 0.233 s
% # System time : 0.007 s
% # Total time : 0.240 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.46 CPU 0.54 WC
% FINAL PrfWatch: 0.46 CPU 0.54 WC
% SZS output end Solution for /tmp/SystemOnTPTP16476/SWC068+1.tptp
%
%------------------------------------------------------------------------------