TSTP Solution File: SWC081+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC081+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 : art02.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:33 EST 2010
% Result : Theorem 1.71s
% Output : Solution 1.71s
% 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/SystemOnTPTP16209/SWC081+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16209/SWC081+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16209/SWC081+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 16305
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% 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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|(![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(nil=X4)|~(nil=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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|(![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(nil=X4)|~(nil=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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|(![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% 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)&neq(X2,nil))&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))&(?[X6]:(ssList(X6)&((neq(X6,nil)&frontsegP(X4,X6))&frontsegP(X3,X6)))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((((X8=X10&X7=X9)&neq(X8,nil))&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(X8,X11)))|~(segmentP(X7,X11))))&(?[X12]:(ssList(X12)&((neq(X12,nil)&frontsegP(X10,X12))&frontsegP(X9,X12)))|(nil=X10&nil=X9))))))),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))&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11))))&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:(((((((((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_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,![X11]:(((((((((~(ssList(X11))|~(neq(X11,nil)))|~(segmentP(esk49_0,X11)))|~(segmentP(esk48_0,X11)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(((nil=esk51_0|ssList(esk52_0))&(nil=esk50_0|ssList(esk52_0)))&((((nil=esk51_0|neq(esk52_0,nil))&(nil=esk50_0|neq(esk52_0,nil)))&((nil=esk51_0|frontsegP(esk51_0,esk52_0))&(nil=esk50_0|frontsegP(esk51_0,esk52_0))))&((nil=esk51_0|frontsegP(esk50_0,esk52_0))&(nil=esk50_0|frontsegP(esk50_0,esk52_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,(frontsegP(esk50_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(frontsegP(esk50_0,esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(frontsegP(esk51_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(neq(esk52_0,nil)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(neq(esk52_0,nil)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,586,theory(equality)])).
% cnf(590,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,587,theory(equality)])).
% cnf(593,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[585,587,theory(equality)])).
% cnf(600,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[588,586,theory(equality)])).
% cnf(601,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[600,587,theory(equality)])).
% cnf(602,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[601,143,theory(equality)])).
% cnf(604,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[602,110,theory(equality)])).
% cnf(605,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)|$false|$false),inference(rw,[status(thm)],[604,589,theory(equality)])).
% cnf(606,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[605,theory(equality)])).
% cnf(633,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,579,theory(equality)])).
% cnf(635,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[161,577,theory(equality)])).
% cnf(636,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[161,578,theory(equality)])).
% cnf(639,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[633,590,theory(equality)])).
% cnf(640,negated_conjecture,(ssList(esk1_2(esk51_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[639,theory(equality)])).
% cnf(643,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[635,589,theory(equality)])).
% cnf(644,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[643,theory(equality)])).
% cnf(645,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[636,589,theory(equality)])).
% cnf(646,negated_conjecture,(ssList(esk1_2(esk50_0,esk52_0))|esk51_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[645,theory(equality)])).
% cnf(820,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil|~ssList(esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[160,579,theory(equality)])).
% cnf(822,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[160,577,theory(equality)])).
% cnf(823,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[160,578,theory(equality)])).
% cnf(826,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[820,590,theory(equality)])).
% cnf(827,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[826,theory(equality)])).
% cnf(830,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[822,589,theory(equality)])).
% cnf(831,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[830,theory(equality)])).
% cnf(832,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil|~ssList(esk52_0)|$false),inference(rw,[status(thm)],[823,589,theory(equality)])).
% cnf(833,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil|~ssList(esk52_0)),inference(cn,[status(thm)],[832,theory(equality)])).
% cnf(849,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(852,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[849,110,theory(equality)])).
% cnf(853,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[852,theory(equality)])).
% cnf(1397,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[606,143,theory(equality)])).
% cnf(1398,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1397,590,theory(equality)])).
% cnf(1399,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1398,theory(equality)])).
% cnf(1555,negated_conjecture,(esk50_0=nil|ssList(esk1_2(esk51_0,esk52_0))),inference(csr,[status(thm)],[640,583])).
% cnf(1557,negated_conjecture,(esk50_0=nil|ssList(esk1_2(esk50_0,esk52_0))),inference(csr,[status(thm)],[644,583])).
% cnf(1558,negated_conjecture,(esk51_0=nil|ssList(esk1_2(esk50_0,esk52_0))),inference(csr,[status(thm)],[646,584])).
% cnf(1576,negated_conjecture,(app(esk52_0,esk1_2(esk51_0,esk52_0))=esk51_0|esk50_0=nil),inference(csr,[status(thm)],[827,583])).
% cnf(1630,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk50_0=nil),inference(csr,[status(thm)],[831,583])).
% cnf(1669,negated_conjecture,(app(esk52_0,esk1_2(esk50_0,esk52_0))=esk50_0|esk51_0=nil),inference(csr,[status(thm)],[833,584])).
% cnf(1670,negated_conjecture,(nil=esk52_0|esk51_0=nil|esk50_0!=nil|~ssList(esk1_2(esk50_0,esk52_0))|~ssList(esk52_0)),inference(spm,[status(thm)],[180,1669,theory(equality)])).
% cnf(1685,negated_conjecture,(esk52_0=nil|esk51_0=nil|esk50_0!=nil|~ssList(esk1_2(esk50_0,esk52_0))),inference(csr,[status(thm)],[1670,584])).
% cnf(1686,negated_conjecture,(esk52_0=nil|esk51_0=nil|esk50_0!=nil),inference(csr,[status(thm)],[1685,1558])).
% cnf(5913,negated_conjecture,(segmentP(X1,esk52_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk52_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[853,1576,theory(equality)])).
% cnf(5915,negated_conjecture,(segmentP(X1,esk52_0)|esk50_0=nil|esk50_0!=X1|~ssList(esk1_2(esk50_0,esk52_0))|~ssList(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[853,1630,theory(equality)])).
% cnf(6026,negated_conjecture,(esk50_0=nil|segmentP(X1,esk52_0)|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk52_0))|~ssList(X1)),inference(csr,[status(thm)],[5913,583])).
% cnf(6027,negated_conjecture,(esk50_0=nil|segmentP(X1,esk52_0)|esk51_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[6026,1555])).
% cnf(6028,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk52_0)|~ssList(esk51_0)),inference(er,[status(thm)],[6027,theory(equality)])).
% cnf(6029,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk52_0)|$false),inference(rw,[status(thm)],[6028,590,theory(equality)])).
% cnf(6030,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk52_0)),inference(cn,[status(thm)],[6029,theory(equality)])).
% cnf(11463,negated_conjecture,(esk50_0=nil|segmentP(X1,esk52_0)|esk50_0!=X1|~ssList(esk1_2(esk50_0,esk52_0))|~ssList(X1)),inference(csr,[status(thm)],[5915,583])).
% cnf(11464,negated_conjecture,(esk50_0=nil|segmentP(X1,esk52_0)|esk50_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[11463,1557])).
% cnf(11465,negated_conjecture,(esk50_0=nil|segmentP(esk50_0,esk52_0)|~ssList(esk50_0)),inference(er,[status(thm)],[11464,theory(equality)])).
% cnf(11466,negated_conjecture,(esk50_0=nil|segmentP(esk50_0,esk52_0)|$false),inference(rw,[status(thm)],[11465,589,theory(equality)])).
% cnf(11467,negated_conjecture,(esk50_0=nil|segmentP(esk50_0,esk52_0)),inference(cn,[status(thm)],[11466,theory(equality)])).
% cnf(11474,negated_conjecture,(esk50_0=nil|~segmentP(esk51_0,esk52_0)|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[601,11467,theory(equality)])).
% cnf(11488,negated_conjecture,(esk50_0=nil|~segmentP(esk51_0,esk52_0)|~neq(esk52_0,nil)),inference(csr,[status(thm)],[11474,583])).
% cnf(11489,negated_conjecture,(esk50_0=nil|~segmentP(esk51_0,esk52_0)),inference(csr,[status(thm)],[11488,581])).
% cnf(11490,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[11489,6030])).
% cnf(11919,negated_conjecture,(esk51_0=nil|esk52_0=nil|$false),inference(rw,[status(thm)],[1686,11490,theory(equality)])).
% cnf(11920,negated_conjecture,(esk51_0=nil|esk52_0=nil),inference(cn,[status(thm)],[11919,theory(equality)])).
% cnf(11989,negated_conjecture,(esk51_0=nil|neq(nil,nil)),inference(spm,[status(thm)],[582,11920,theory(equality)])).
% cnf(12005,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[11989,1399,theory(equality)])).
% cnf(12241,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[593,12005,theory(equality)])).
% cnf(12242,negated_conjecture,($false),inference(sr,[status(thm)],[12241,1399,theory(equality)])).
% cnf(12243,negated_conjecture,($false),12242,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1550
% # ...of these trivial : 2
% # ...subsumed : 843
% # ...remaining for further processing: 705
% # Other redundant clauses eliminated : 166
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 377
% # Generated clauses : 5327
% # ...of the previous two non-trivial : 4766
% # Contextual simplify-reflections : 1115
% # Paramodulations : 5089
% # Factorizations : 0
% # Equation resolutions : 238
% # Current number of processed clauses: 303
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 279
% # Current number of unprocessed clauses: 1281
% # ...number of literals in the above : 8639
% # Clause-clause subsumption calls (NU) : 27962
% # Rec. Clause-clause subsumption calls : 10816
% # Unit Clause-clause subsumption calls : 205
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 290 leaves, 1.41+/-1.142 terms/leaf
% # Paramod-from index: 150 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 253 leaves, 1.25+/-0.986 terms/leaf
% # -------------------------------------------------
% # User time : 0.327 s
% # System time : 0.017 s
% # Total time : 0.344 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.61 CPU 0.69 WC
% FINAL PrfWatch: 0.61 CPU 0.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP16209/SWC081+1.tptp
%
%------------------------------------------------------------------------------