TSTP Solution File: SWC067+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC067+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:08 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/SystemOnTPTP16217/SWC067+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16217/SWC067+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16217/SWC067+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 16313
% 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(3, 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(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(19, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(22, 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]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)<(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)<(X13,X11)))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X15]:(((ssList(X15)&neq(X15,nil))&segmentP(X2,X15))&segmentP(X1,X15))))))))),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]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)<(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)<(X13,X11)))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X15]:(((ssList(X15)&neq(X15,nil))&segmentP(X2,X15))&segmentP(X1,X15)))))))))),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))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)<(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)<(X13,X11)))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X15]:(((ssList(X15)&neq(X15,nil))&segmentP(X2,X15))&segmentP(X1,X15)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[118])).
% cnf(123,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[119])).
% fof(137, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(138, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[138])).
% fof(140, 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)],[139])).
% cnf(141,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[140])).
% cnf(142,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[140])).
% cnf(147,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(196, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[19])).
% fof(197, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[196])).
% cnf(198,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[197])).
% fof(206, plain,![X1]:(~(ssList(X1))|((~(segmentP(nil,X1))|nil=X1)&(~(nil=X1)|segmentP(nil,X1)))),inference(fof_nnf,[status(thm)],[22])).
% fof(207, plain,![X2]:(~(ssList(X2))|((~(segmentP(nil,X2))|nil=X2)&(~(nil=X2)|segmentP(nil,X2)))),inference(variable_rename,[status(thm)],[206])).
% fof(208, plain,![X2]:(((~(segmentP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|segmentP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[207])).
% cnf(210,plain,(nil=X1|~ssList(X1)|~segmentP(nil,X1)),inference(split_conjunct,[status(thm)],[208])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(((app(app(X5,X3),X6)=X4&strictorderedP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(X8,cons(X7,nil))=X5))|![X9]:(~(ssItem(X9))|![X10]:((~(ssList(X10))|~(app(cons(X9,nil),X10)=X3))|~(lt(X7,X9)))))))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(cons(X11,nil),X12)=X6))|![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(X14,cons(X13,nil))=X3))|~(lt(X13,X11))))))))))&(nil=X4|~(nil=X3)))&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X15]:(((~(ssList(X15))|~(neq(X15,nil)))|~(segmentP(X2,X15)))|~(segmentP(X1,X15)))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&((((X17=X19&X16=X18)&?[X20]:(ssList(X20)&?[X21]:(ssList(X21)&(((app(app(X20,X18),X21)=X19&strictorderedP(X18))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(X23,cons(X22,nil))=X20))|![X24]:(~(ssItem(X24))|![X25]:((~(ssList(X25))|~(app(cons(X24,nil),X25)=X18))|~(lt(X22,X24)))))))&![X26]:(~(ssItem(X26))|![X27]:((~(ssList(X27))|~(app(cons(X26,nil),X27)=X21))|![X28]:(~(ssItem(X28))|![X29]:((~(ssList(X29))|~(app(X29,cons(X28,nil))=X18))|~(lt(X28,X26))))))))))&(nil=X19|~(nil=X18)))&((nil=X17&~(nil=X16))|(neq(X17,nil)&![X30]:(((~(ssList(X30))|~(neq(X30,nil)))|~(segmentP(X17,X30)))|~(segmentP(X16,X30)))))))))),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)&(ssList(esk52_0)&(ssList(esk53_0)&(((app(app(esk52_0,esk50_0),esk53_0)=esk51_0&strictorderedP(esk50_0))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(X23,cons(X22,nil))=esk52_0))|![X24]:(~(ssItem(X24))|![X25]:((~(ssList(X25))|~(app(cons(X24,nil),X25)=esk50_0))|~(lt(X22,X24)))))))&![X26]:(~(ssItem(X26))|![X27]:((~(ssList(X27))|~(app(cons(X26,nil),X27)=esk53_0))|![X28]:(~(ssItem(X28))|![X29]:((~(ssList(X29))|~(app(X29,cons(X28,nil))=esk50_0))|~(lt(X28,X26))))))))))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X30]:(((~(ssList(X30))|~(neq(X30,nil)))|~(segmentP(esk49_0,X30)))|~(segmentP(esk48_0,X30)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X22]:![X23]:![X24]:![X25]:![X26]:![X27]:![X28]:![X29]:![X30]:((((((((((~(ssList(X30))|~(neq(X30,nil)))|~(segmentP(esk49_0,X30)))|~(segmentP(esk48_0,X30)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&((((((((((~(ssList(X29))|~(app(X29,cons(X28,nil))=esk50_0))|~(lt(X28,X26)))|~(ssItem(X28)))|(~(ssList(X27))|~(app(cons(X26,nil),X27)=esk53_0)))|~(ssItem(X26)))&((((((~(ssList(X25))|~(app(cons(X24,nil),X25)=esk50_0))|~(lt(X22,X24)))|~(ssItem(X24)))|(~(ssList(X23))|~(app(X23,cons(X22,nil))=esk52_0)))|~(ssItem(X22)))&(app(app(esk52_0,esk50_0),esk53_0)=esk51_0&strictorderedP(esk50_0))))&ssList(esk53_0))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X22]:![X23]:![X24]:![X25]:![X26]:![X27]:![X28]:![X29]:![X30]:((((((((nil=esk49_0|(((~(ssList(X30))|~(neq(X30,nil)))|~(segmentP(esk49_0,X30)))|~(segmentP(esk48_0,X30))))&(~(nil=esk48_0)|(((~(ssList(X30))|~(neq(X30,nil)))|~(segmentP(esk49_0,X30)))|~(segmentP(esk48_0,X30)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&((((((((((~(ssList(X29))|~(app(X29,cons(X28,nil))=esk50_0))|~(lt(X28,X26)))|~(ssItem(X28)))|(~(ssList(X27))|~(app(cons(X26,nil),X27)=esk53_0)))|~(ssItem(X26)))&((((((~(ssList(X25))|~(app(cons(X24,nil),X25)=esk50_0))|~(lt(X22,X24)))|~(ssItem(X24)))|(~(ssList(X23))|~(app(X23,cons(X22,nil))=esk52_0)))|~(ssItem(X22)))&(app(app(esk52_0,esk50_0),esk53_0)=esk51_0&strictorderedP(esk50_0))))&ssList(esk53_0))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0))))&ssList(esk51_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(577,negated_conjecture,(nil=esk51_0|nil!=esk50_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(580,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(app(app(esk52_0,esk50_0),esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,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(590,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,578,theory(equality)])).
% cnf(593,negated_conjecture,(esk49_0=nil|esk50_0!=nil),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(594,negated_conjecture,(neq(esk49_0,nil)|esk50_0!=nil),inference(rw,[status(thm)],[586,578,theory(equality)])).
% cnf(595,negated_conjecture,(app(app(esk52_0,esk50_0),esk53_0)=esk49_0),inference(rw,[status(thm)],[583,579,theory(equality)])).
% cnf(601,negated_conjecture,(esk49_0=nil|~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[589,578,theory(equality)])).
% cnf(603,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)|~ssList(esk50_0)|~neq(esk50_0,nil)),inference(spm,[status(thm)],[601,198,theory(equality)])).
% cnf(607,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)|$false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[603,590,theory(equality)])).
% cnf(608,negated_conjecture,(esk49_0=nil|~segmentP(esk49_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[607,theory(equality)])).
% cnf(641,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[142,theory(equality)])).
% cnf(855,negated_conjecture,(segmentP(X1,esk50_0)|esk49_0!=X1|~ssList(esk53_0)|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[123,595,theory(equality)])).
% cnf(864,negated_conjecture,(segmentP(X1,esk50_0)|esk49_0!=X1|$false|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[855,581,theory(equality)])).
% cnf(865,negated_conjecture,(segmentP(X1,esk50_0)|esk49_0!=X1|$false|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[864,580,theory(equality)])).
% cnf(866,negated_conjecture,(segmentP(X1,esk50_0)|esk49_0!=X1|$false|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[865,590,theory(equality)])).
% cnf(867,negated_conjecture,(segmentP(X1,esk50_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[866,theory(equality)])).
% cnf(1819,negated_conjecture,(segmentP(esk49_0,esk50_0)|~ssList(esk49_0)),inference(er,[status(thm)],[867,theory(equality)])).
% cnf(1820,negated_conjecture,(segmentP(esk49_0,esk50_0)|$false),inference(rw,[status(thm)],[1819,574,theory(equality)])).
% cnf(1821,negated_conjecture,(segmentP(esk49_0,esk50_0)),inference(cn,[status(thm)],[1820,theory(equality)])).
% cnf(1828,negated_conjecture,(esk49_0=nil|$false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[608,1821,theory(equality)])).
% cnf(1829,negated_conjecture,(esk49_0=nil|~neq(esk50_0,nil)),inference(cn,[status(thm)],[1828,theory(equality)])).
% cnf(1849,negated_conjecture,(esk49_0=nil|esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[1829,141,theory(equality)])).
% cnf(1850,negated_conjecture,(esk49_0=nil|esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[1849,147,theory(equality)])).
% cnf(1851,negated_conjecture,(esk49_0=nil|esk50_0=nil|$false|$false),inference(rw,[status(thm)],[1850,590,theory(equality)])).
% cnf(1852,negated_conjecture,(esk49_0=nil|esk50_0=nil),inference(cn,[status(thm)],[1851,theory(equality)])).
% cnf(1853,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[1852,593])).
% cnf(1857,negated_conjecture,(segmentP(nil,esk50_0)),inference(rw,[status(thm)],[1821,1853,theory(equality)])).
% cnf(1873,negated_conjecture,(neq(nil,nil)|esk50_0!=nil),inference(rw,[status(thm)],[594,1853,theory(equality)])).
% cnf(1889,negated_conjecture,(nil=esk50_0|~ssList(esk50_0)),inference(spm,[status(thm)],[210,1857,theory(equality)])).
% cnf(1908,negated_conjecture,(nil=esk50_0|$false),inference(rw,[status(thm)],[1889,590,theory(equality)])).
% cnf(1909,negated_conjecture,(nil=esk50_0),inference(cn,[status(thm)],[1908,theory(equality)])).
% cnf(1929,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1873,1909,theory(equality)])).
% cnf(1930,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1929,theory(equality)])).
% cnf(1931,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[641,1930,theory(equality)])).
% cnf(1933,negated_conjecture,($false),inference(rw,[status(thm)],[1931,147,theory(equality)])).
% cnf(1934,negated_conjecture,($false),inference(cn,[status(thm)],[1933,theory(equality)])).
% cnf(1935,negated_conjecture,($false),1934,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 260
% # ...of these trivial : 2
% # ...subsumed : 9
% # ...remaining for further processing: 249
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 39
% # Generated clauses : 716
% # ...of the previous two non-trivial : 611
% # Contextual simplify-reflections : 3
% # Paramodulations : 623
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 202
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 175
% # Current number of unprocessed clauses: 445
% # ...number of literals in the above : 3189
% # Clause-clause subsumption calls (NU) : 973
% # Rec. Clause-clause subsumption calls : 218
% # Unit Clause-clause subsumption calls : 47
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 234 leaves, 1.35+/-1.134 terms/leaf
% # Paramod-from index: 108 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 198 leaves, 1.24+/-0.979 terms/leaf
% # -------------------------------------------------
% # User time : 0.071 s
% # System time : 0.008 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP16217/SWC067+1.tptp
%
%------------------------------------------------------------------------------