TSTP Solution File: SWC389+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC389+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 08:01:37 EST 2010
% Result : Theorem 1.32s
% Output : Solution 1.32s
% 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/SystemOnTPTP29340/SWC389+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29340/SWC389+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29340/SWC389+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 29436
% 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(4, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(5, 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(6, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(8, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(21, axiom,~(singletonP(nil)),file('/tmp/SRASS.s.p', ax39)).
% fof(27, axiom,![X1]:(ssList(X1)=>(segmentP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax58)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3))))|(segmentP(X2,X1)&(~(neq(X2,nil))|singletonP(X1))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3))))|(segmentP(X2,X1)&(~(neq(X2,nil))|singletonP(X1)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(100, plain,~(singletonP(nil)),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3))))|(segmentP(X2,X1)&(~(neq(X2,nil))|singletonP(X1)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(124, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(125, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk5_1(X3))&cons(esk5_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk5_1(X3))&cons(esk5_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[126])).
% fof(128, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk5_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk5_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[127])).
% cnf(131,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[128])).
% fof(132, 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)],[5])).
% fof(133, 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)],[132])).
% fof(134, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk6_2(X5,X6))&(ssList(esk7_2(X5,X6))&app(app(esk6_2(X5,X6),X6),esk7_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[133])).
% fof(135, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk6_2(X5,X6))&(ssList(esk7_2(X5,X6))&app(app(esk6_2(X5,X6),X6),esk7_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[134])).
% fof(136, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk6_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk7_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk6_2(X5,X6),X6),esk7_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[135])).
% cnf(140,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[136])).
% fof(141, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[6])).
% fof(142, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[141])).
% fof(143, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[142])).
% fof(144, 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)],[143])).
% cnf(146,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[144])).
% cnf(151,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(209,plain,(~singletonP(nil)),inference(split_conjunct,[status(thm)],[100])).
% fof(228, plain,![X1]:(~(ssList(X1))|((~(segmentP(nil,X1))|nil=X1)&(~(nil=X1)|segmentP(nil,X1)))),inference(fof_nnf,[status(thm)],[27])).
% fof(229, plain,![X2]:(~(ssList(X2))|((~(segmentP(nil,X2))|nil=X2)&(~(nil=X2)|segmentP(nil,X2)))),inference(variable_rename,[status(thm)],[228])).
% fof(230, plain,![X2]:(((~(segmentP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|segmentP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[229])).
% cnf(231,plain,(segmentP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[230])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&(?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((((ssList(X7)&cons(X5,nil)=X3)&app(app(X6,X3),X7)=X4)&![X8]:((~(ssItem(X8))|~(memberP(X6,X8)))|~(lt(X5,X8))))&![X9]:((~(ssItem(X9))|~(memberP(X7,X9)))|~(lt(X9,X5))))))|(nil=X4&nil=X3)))&(~(segmentP(X2,X1))|(neq(X2,nil)&~(singletonP(X1)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:((((ssList(X13)&X11=X13)&X10=X12)&(?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:((((ssList(X16)&cons(X14,nil)=X12)&app(app(X15,X12),X16)=X13)&![X17]:((~(ssItem(X17))|~(memberP(X15,X17)))|~(lt(X14,X17))))&![X18]:((~(ssItem(X18))|~(memberP(X16,X18)))|~(lt(X18,X14))))))|(nil=X13&nil=X12)))&(~(segmentP(X11,X10))|(neq(X11,nil)&~(singletonP(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)&((ssItem(esk52_0)&(ssList(esk53_0)&((((ssList(esk54_0)&cons(esk52_0,nil)=esk50_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&![X17]:((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&![X18]:((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))))|(nil=esk51_0&nil=esk50_0)))&(~(segmentP(esk49_0,esk48_0))|(neq(esk49_0,nil)&~(singletonP(esk48_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:(((((((((((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))&(((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))&((ssList(esk54_0)&cons(esk52_0,nil)=esk50_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))&ssList(esk53_0))&ssItem(esk52_0))|(nil=esk51_0&nil=esk50_0))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&(~(segmentP(esk49_0,esk48_0))|(neq(esk49_0,nil)&~(singletonP(esk48_0)))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X17]:![X18]:((((((((((nil=esk51_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))&(nil=esk50_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))))&(((nil=esk51_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&(nil=esk50_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))))&((((nil=esk51_0|ssList(esk54_0))&(nil=esk50_0|ssList(esk54_0)))&((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0)))&((nil=esk51_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&(nil=esk50_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))))&((nil=esk51_0|ssList(esk53_0))&(nil=esk50_0|ssList(esk53_0))))&((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&((neq(esk49_0,nil)|~(segmentP(esk49_0,esk48_0)))&(~(singletonP(esk48_0))|~(segmentP(esk49_0,esk48_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,(~segmentP(esk49_0,esk48_0)|~singletonP(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(app(app(esk53_0,esk50_0),esk54_0)=esk51_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(ssList(esk54_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(595,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,578,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,579,theory(equality)])).
% cnf(599,negated_conjecture,(~singletonP(esk50_0)|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[576,578,theory(equality)])).
% cnf(600,negated_conjecture,(~singletonP(esk50_0)|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[599,579,theory(equality)]),578,theory(equality)])).
% cnf(601,negated_conjecture,(neq(esk51_0,nil)|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(602,negated_conjecture,(neq(esk51_0,nil)|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[601,579,theory(equality)]),578,theory(equality)])).
% cnf(603,plain,(segmentP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[231,theory(equality)])).
% cnf(604,plain,(segmentP(nil,nil)|$false),inference(rw,[status(thm)],[603,151,theory(equality)])).
% cnf(605,plain,(segmentP(nil,nil)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(668,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[131,theory(equality)])).
% cnf(673,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[146,theory(equality)])).
% cnf(921,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(esk53_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[140,585,theory(equality)])).
% cnf(929,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(esk53_0)|$false|~ssList(X1)),inference(rw,[status(thm)],[921,595,theory(equality)])).
% cnf(930,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(esk53_0)|~ssList(X1)),inference(cn,[status(thm)],[929,theory(equality)])).
% cnf(2084,negated_conjecture,(singletonP(esk50_0)|esk50_0=nil|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[668,587,theory(equality)])).
% cnf(2085,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[668,588,theory(equality)])).
% cnf(2089,negated_conjecture,(singletonP(esk50_0)|esk50_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2084,595,theory(equality)])).
% cnf(2090,negated_conjecture,(singletonP(esk50_0)|esk50_0=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[2089,theory(equality)])).
% cnf(2091,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2085,595,theory(equality)])).
% cnf(2092,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[2091,theory(equality)])).
% cnf(2097,negated_conjecture,(esk50_0=nil|singletonP(esk50_0)),inference(csr,[status(thm)],[2090,581])).
% cnf(2098,negated_conjecture,(esk50_0=nil|~segmentP(esk51_0,esk50_0)),inference(spm,[status(thm)],[600,2097,theory(equality)])).
% cnf(2099,negated_conjecture,(esk51_0=nil|singletonP(esk50_0)),inference(csr,[status(thm)],[2092,582])).
% cnf(2215,negated_conjecture,(esk50_0=nil|segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk54_0)|~ssList(X1)),inference(csr,[status(thm)],[930,583])).
% cnf(2216,negated_conjecture,(esk50_0=nil|segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[2215,589])).
% cnf(2217,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2216,theory(equality)])).
% cnf(2218,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[2217,596,theory(equality)])).
% cnf(2219,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[2218,theory(equality)])).
% cnf(2220,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[2219,2098])).
% cnf(2243,negated_conjecture,(esk51_0=nil|singletonP(nil)),inference(rw,[status(thm)],[2099,2220,theory(equality)])).
% cnf(2244,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[2243,209,theory(equality)])).
% cnf(2290,negated_conjecture,(neq(esk51_0,nil)|~segmentP(esk51_0,nil)),inference(rw,[status(thm)],[602,2220,theory(equality)])).
% cnf(2325,negated_conjecture,(neq(nil,nil)|~segmentP(esk51_0,nil)),inference(rw,[status(thm)],[2290,2244,theory(equality)])).
% cnf(2326,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2325,2244,theory(equality)]),605,theory(equality)])).
% cnf(2327,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[2326,theory(equality)])).
% cnf(2328,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[673,2327,theory(equality)])).
% cnf(2330,negated_conjecture,($false),inference(rw,[status(thm)],[2328,151,theory(equality)])).
% cnf(2331,negated_conjecture,($false),inference(cn,[status(thm)],[2330,theory(equality)])).
% cnf(2332,negated_conjecture,($false),2331,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 317
% # ...of these trivial : 5
% # ...subsumed : 33
% # ...remaining for further processing: 279
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 69
% # Generated clauses : 894
% # ...of the previous two non-trivial : 765
% # Contextual simplify-reflections : 64
% # Paramodulations : 798
% # Factorizations : 0
% # Equation resolutions : 96
% # Current number of processed clauses: 201
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 176
% # Current number of unprocessed clauses: 440
% # ...number of literals in the above : 3168
% # Clause-clause subsumption calls (NU) : 1489
% # Rec. Clause-clause subsumption calls : 507
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 231 leaves, 1.35+/-1.141 terms/leaf
% # Paramod-from index: 107 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 196 leaves, 1.24+/-0.984 terms/leaf
% # -------------------------------------------------
% # User time : 0.086 s
% # System time : 0.005 s
% # Total time : 0.091 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP29340/SWC389+1.tptp
%
%------------------------------------------------------------------------------