TSTP Solution File: SWC057+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC057+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:00:21 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP17508/SWC057+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17508/SWC057+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17508/SWC057+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 17640
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(11, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(16, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[106])).
% cnf(109,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(138, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(139, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[138])).
% cnf(140,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[139])).
% fof(141, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[11])).
% fof(142, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[141])).
% cnf(143,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[142])).
% fof(155, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[14])).
% fof(156, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[156])).
% fof(158, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[157])).
% fof(159, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk1_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[158])).
% cnf(160,plain,(app(X2,esk1_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% cnf(161,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% fof(163, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(164, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[164])).
% fof(166, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[165])).
% fof(167, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk2_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[166])).
% cnf(171,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[167])).
% fof(172, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[16])).
% fof(173, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[172])).
% cnf(174,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[173])).
% fof(175, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[17])).
% fof(176, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[175])).
% fof(177, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[176])).
% fof(178, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[177])).
% cnf(180,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[178])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))))&((nil=X4&nil=X3)|(neq(X3,nil)&frontsegP(X4,X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:((((ssList(X9)&X7=X9)&X6=X8)&((nil=X7&~(nil=X6))|(neq(X7,nil)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(X7,X10)))|~(segmentP(X6,X10))))))&((nil=X9&nil=X8)|(neq(X8,nil)&frontsegP(X9,X8))))))),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)&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10))))))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:((((((((((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X10]:((((((((nil=esk49_0|(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10))))&(~(nil=esk48_0)|(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&(((neq(esk50_0,nil)|nil=esk51_0)&(frontsegP(esk51_0,esk50_0)|nil=esk51_0))&((neq(esk50_0,nil)|nil=esk50_0)&(frontsegP(esk51_0,esk50_0)|nil=esk50_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(576,negated_conjecture,(nil=esk50_0|frontsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(nil=esk49_0|~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,580,theory(equality)])).
% cnf(590,negated_conjecture,(neq(esk49_0,nil)|esk50_0!=nil),inference(rw,[status(thm)],[583,580,theory(equality)])).
% cnf(591,negated_conjecture,(esk50_0=nil|frontsegP(esk49_0,esk50_0)),inference(rw,[status(thm)],[576,581,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|neq(esk50_0,nil)),inference(rw,[status(thm)],[579,581,theory(equality)])).
% cnf(603,negated_conjecture,(esk49_0=nil|~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[586,580,theory(equality)])).
% cnf(605,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[603,140,theory(equality)])).
% cnf(609,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)|~neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[605,587,theory(equality)])).
% cnf(610,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[609,theory(equality)])).
% cnf(615,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(635,negated_conjecture,(ssList(esk1_2(esk49_0,esk50_0))|esk50_0=nil|~ssList(esk50_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[161,591,theory(equality)])).
% cnf(639,negated_conjecture,(ssList(esk1_2(esk49_0,esk50_0))|esk50_0=nil|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[635,587,theory(equality)])).
% cnf(640,negated_conjecture,(ssList(esk1_2(esk49_0,esk50_0))|esk50_0=nil|$false|$false),inference(rw,[status(thm)],[639,574,theory(equality)])).
% cnf(641,negated_conjecture,(ssList(esk1_2(esk49_0,esk50_0))|esk50_0=nil),inference(cn,[status(thm)],[640,theory(equality)])).
% cnf(803,negated_conjecture,(app(esk50_0,esk1_2(esk49_0,esk50_0))=esk49_0|esk50_0=nil|~ssList(esk50_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[160,591,theory(equality)])).
% cnf(807,negated_conjecture,(app(esk50_0,esk1_2(esk49_0,esk50_0))=esk49_0|esk50_0=nil|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[803,587,theory(equality)])).
% cnf(808,negated_conjecture,(app(esk50_0,esk1_2(esk49_0,esk50_0))=esk49_0|esk50_0=nil|$false|$false),inference(rw,[status(thm)],[807,574,theory(equality)])).
% cnf(809,negated_conjecture,(app(esk50_0,esk1_2(esk49_0,esk50_0))=esk49_0|esk50_0=nil),inference(cn,[status(thm)],[808,theory(equality)])).
% cnf(831,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[171,174,theory(equality)])).
% cnf(834,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[831,110,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(1382,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)),inference(csr,[status(thm)],[610,592])).
% cnf(1534,negated_conjecture,(nil=esk50_0|esk49_0!=nil|~ssList(esk1_2(esk49_0,esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[180,809,theory(equality)])).
% cnf(1548,negated_conjecture,(nil=esk50_0|esk49_0!=nil|~ssList(esk1_2(esk49_0,esk50_0))|$false),inference(rw,[status(thm)],[1534,587,theory(equality)])).
% cnf(1549,negated_conjecture,(nil=esk50_0|esk49_0!=nil|~ssList(esk1_2(esk49_0,esk50_0))),inference(cn,[status(thm)],[1548,theory(equality)])).
% cnf(1577,negated_conjecture,(esk50_0=nil|esk49_0!=nil),inference(csr,[status(thm)],[1549,641])).
% cnf(5112,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk49_0!=X1|~ssList(esk1_2(esk49_0,esk50_0))|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[835,809,theory(equality)])).
% cnf(5141,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk49_0!=X1|~ssList(esk1_2(esk49_0,esk50_0))|$false|~ssList(X1)),inference(rw,[status(thm)],[5112,587,theory(equality)])).
% cnf(5142,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk49_0!=X1|~ssList(esk1_2(esk49_0,esk50_0))|~ssList(X1)),inference(cn,[status(thm)],[5141,theory(equality)])).
% cnf(5191,negated_conjecture,(esk50_0=nil|segmentP(X1,esk50_0)|esk49_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[5142,641])).
% cnf(5192,negated_conjecture,(esk50_0=nil|segmentP(esk49_0,esk50_0)|~ssList(esk49_0)),inference(er,[status(thm)],[5191,theory(equality)])).
% cnf(5193,negated_conjecture,(esk50_0=nil|segmentP(esk49_0,esk50_0)|$false),inference(rw,[status(thm)],[5192,574,theory(equality)])).
% cnf(5194,negated_conjecture,(esk50_0=nil|segmentP(esk49_0,esk50_0)),inference(cn,[status(thm)],[5193,theory(equality)])).
% cnf(5201,negated_conjecture,(esk49_0=nil|esk50_0=nil),inference(spm,[status(thm)],[1382,5194,theory(equality)])).
% cnf(5220,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[5201,1577])).
% cnf(5393,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,nil)),inference(rw,[status(thm)],[1382,5220,theory(equality)])).
% cnf(5399,negated_conjecture,(neq(esk49_0,nil)|$false),inference(rw,[status(thm)],[590,5220,theory(equality)])).
% cnf(5400,negated_conjecture,(neq(esk49_0,nil)),inference(cn,[status(thm)],[5399,theory(equality)])).
% cnf(5412,negated_conjecture,(esk49_0=nil|~ssList(esk49_0)),inference(spm,[status(thm)],[5393,143,theory(equality)])).
% cnf(5413,negated_conjecture,(esk49_0=nil|$false),inference(rw,[status(thm)],[5412,574,theory(equality)])).
% cnf(5414,negated_conjecture,(esk49_0=nil),inference(cn,[status(thm)],[5413,theory(equality)])).
% cnf(5562,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[5400,5414,theory(equality)])).
% cnf(5565,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[615,5562,theory(equality)])).
% cnf(5567,negated_conjecture,($false),inference(rw,[status(thm)],[5565,110,theory(equality)])).
% cnf(5568,negated_conjecture,($false),inference(cn,[status(thm)],[5567,theory(equality)])).
% cnf(5569,negated_conjecture,($false),5568,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 853
% # ...of these trivial : 2
% # ...subsumed : 356
% # ...remaining for further processing: 495
% # Other redundant clauses eliminated : 95
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 36
% # Backward-rewritten : 190
% # Generated clauses : 2146
% # ...of the previous two non-trivial : 1881
% # Contextual simplify-reflections : 465
% # Paramodulations : 1997
% # Factorizations : 0
% # Equation resolutions : 149
% # Current number of processed clauses: 263
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 238
% # Current number of unprocessed clauses: 795
% # ...number of literals in the above : 5581
% # Clause-clause subsumption calls (NU) : 12123
% # Rec. Clause-clause subsumption calls : 4939
% # Unit Clause-clause subsumption calls : 124
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 260 leaves, 1.39+/-1.166 terms/leaf
% # Paramod-from index: 141 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 234 leaves, 1.23+/-1.003 terms/leaf
% # -------------------------------------------------
% # User time : 0.161 s
% # System time : 0.013 s
% # Total time : 0.174 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.42 WC
% FINAL PrfWatch: 0.34 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP17508/SWC057+1.tptp
%
%------------------------------------------------------------------------------