TSTP Solution File: SWC364+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC364+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 07:57:25 EST 2010
% Result : Theorem 1.59s
% Output : Solution 1.59s
% 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/SystemOnTPTP29286/SWC364+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29286/SWC364+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29286/SWC364+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 29382
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 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]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssItem(X3)=>cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),file('/tmp/SRASS.s.p', ax27)).
% fof(20, 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(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(25, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(33, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>tl(cons(X2,X1))=X1)),file('/tmp/SRASS.s.p', ax25)).
% fof(46, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(58, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(rearsegP(X1,X2)=>rearsegP(app(X3,X1),X2))))),file('/tmp/SRASS.s.p', ax50)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|![X5]:(ssItem(X5)=>~(app(cons(X5,nil),X3)=X4)))|segmentP(X2,X1))&(~(neq(X2,nil))|neq(X4,nil)))))))),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]:(ssItem(X5)=>~(app(cons(X5,nil),X3)=X4)))|segmentP(X2,X1))&(~(neq(X2,nil))|neq(X4,nil))))))))),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]:(ssItem(X5)=>~(app(cons(X5,nil),X3)=X4)))|segmentP(X2,X1))&(~(neq(X2,nil))|neq(X4,nil))))))))),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(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(131, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[131])).
% cnf(133,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(156, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(157, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[156])).
% fof(158, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[157])).
% cnf(159,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[158])).
% fof(160, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssItem(X3))|cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(161, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4)))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X4]:![X5]:![X6]:(((~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[161])).
% cnf(163,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[162])).
% fof(190, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X3,X2)=app(X1,X2))|X3=X1)))),inference(fof_nnf,[status(thm)],[20])).
% fof(191, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4)))),inference(variable_rename,[status(thm)],[190])).
% fof(192, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[191])).
% cnf(193,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X3,X2)!=app(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[192])).
% fof(198, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(199, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[198])).
% fof(200, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[199])).
% cnf(201,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[200])).
% fof(213, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[25])).
% fof(214, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[213])).
% cnf(215,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[214])).
% fof(270, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|tl(cons(X2,X1))=X1)),inference(fof_nnf,[status(thm)],[33])).
% fof(271, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|tl(cons(X4,X3))=X3)),inference(variable_rename,[status(thm)],[270])).
% fof(272, plain,![X3]:![X4]:((~(ssItem(X4))|tl(cons(X4,X3))=X3)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[271])).
% cnf(273,plain,(tl(cons(X2,X1))=X1|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[272])).
% fof(326, 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)],[46])).
% fof(327, 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)],[326])).
% fof(328, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk21_2(X4,X5))&app(esk21_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[327])).
% fof(329, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk21_2(X4,X5))&app(esk21_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[328])).
% fof(330, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk21_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk21_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[329])).
% cnf(331,plain,(app(esk21_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[330])).
% cnf(332,plain,(ssList(esk21_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[330])).
% cnf(333,plain,(rearsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X3,X2)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[330])).
% fof(432, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(rearsegP(X1,X2))|rearsegP(app(X3,X1),X2))))),inference(fof_nnf,[status(thm)],[58])).
% fof(433, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5))))),inference(variable_rename,[status(thm)],[432])).
% fof(434, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[433])).
% cnf(435,plain,(rearsegP(app(X3,X1),X2)|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[434])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&?[X5]:(ssItem(X5)&app(cons(X5,nil),X3)=X4))&~(segmentP(X2,X1)))|(neq(X2,nil)&~(neq(X4,nil))))))))),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)&(((neq(X7,nil)&?[X10]:(ssItem(X10)&app(cons(X10,nil),X8)=X9))&~(segmentP(X7,X6)))|(neq(X7,nil)&~(neq(X9,nil))))))))),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)&(ssItem(esk52_0)&app(cons(esk52_0,nil),esk50_0)=esk51_0))&~(segmentP(esk49_0,esk48_0)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, 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)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&((neq(esk49_0,nil)|app(cons(esk52_0,nil),esk50_0)=esk51_0)&(~(neq(esk51_0,nil))|app(cons(esk52_0,nil),esk50_0)=esk51_0))))&((neq(esk49_0,nil)|~(segmentP(esk49_0,esk48_0)))&(~(neq(esk51_0,nil))|~(segmentP(esk49_0,esk48_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(~segmentP(esk49_0,esk48_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(app(cons(esk52_0,nil),esk50_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(588,negated_conjecture,($false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[572,581,theory(equality)]),579,theory(equality)])).
% cnf(589,negated_conjecture,(~segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(590,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[576,581,theory(equality)]),579,theory(equality)])).
% cnf(591,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(599,negated_conjecture,(app(cons(esk52_0,nil),esk48_0)=esk51_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[574,580,theory(equality)])).
% cnf(600,negated_conjecture,(app(cons(esk52_0,nil),esk48_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[599,581,theory(equality)])).
% cnf(601,negated_conjecture,(app(cons(esk52_0,nil),esk48_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[600,581,theory(equality)]),579,theory(equality)])).
% cnf(602,negated_conjecture,(app(cons(esk52_0,nil),esk48_0)=esk49_0),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(682,negated_conjecture,(cons(esk52_0,esk48_0)=esk49_0|~ssList(esk48_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[602,201,theory(equality)])).
% cnf(684,negated_conjecture,(cons(esk52_0,esk48_0)=esk49_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[682,585,theory(equality)])).
% cnf(685,negated_conjecture,(cons(esk52_0,esk48_0)=esk49_0|$false|$false),inference(rw,[status(thm)],[684,591,theory(equality)])).
% cnf(686,negated_conjecture,(cons(esk52_0,esk48_0)=esk49_0),inference(cn,[status(thm)],[685,theory(equality)])).
% cnf(745,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(cons(esk52_0,nil))|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[193,602,theory(equality)])).
% cnf(754,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(cons(esk52_0,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[745,585,theory(equality)])).
% cnf(755,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(cn,[status(thm)],[754,theory(equality)])).
% cnf(840,negated_conjecture,(segmentP(X1,esk48_0)|app(esk49_0,X2)!=X1|~ssList(X2)|~ssList(cons(esk52_0,nil))|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[123,602,theory(equality)])).
% cnf(846,negated_conjecture,(segmentP(X1,esk48_0)|app(esk49_0,X2)!=X1|~ssList(X2)|~ssList(cons(esk52_0,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[840,585,theory(equality)])).
% cnf(847,negated_conjecture,(segmentP(X1,esk48_0)|app(esk49_0,X2)!=X1|~ssList(X2)|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(cn,[status(thm)],[846,theory(equality)])).
% cnf(930,negated_conjecture,(cons(esk52_0,app(nil,esk48_0))=esk49_0|~ssList(nil)|~ssList(esk48_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[602,163,theory(equality)])).
% cnf(937,negated_conjecture,(cons(esk52_0,app(nil,esk48_0))=esk49_0|$false|~ssList(esk48_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[930,134,theory(equality)])).
% cnf(938,negated_conjecture,(cons(esk52_0,app(nil,esk48_0))=esk49_0|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[937,585,theory(equality)])).
% cnf(939,negated_conjecture,(cons(esk52_0,app(nil,esk48_0))=esk49_0|$false|$false|$false),inference(rw,[status(thm)],[938,591,theory(equality)])).
% cnf(940,negated_conjecture,(cons(esk52_0,app(nil,esk48_0))=esk49_0),inference(cn,[status(thm)],[939,theory(equality)])).
% cnf(1388,negated_conjecture,(tl(esk49_0)=esk48_0|~ssList(esk48_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[273,686,theory(equality)])).
% cnf(1436,negated_conjecture,(tl(esk49_0)=esk48_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1388,585,theory(equality)])).
% cnf(1437,negated_conjecture,(tl(esk49_0)=esk48_0|$false|$false),inference(rw,[status(thm)],[1436,591,theory(equality)])).
% cnf(1438,negated_conjecture,(tl(esk49_0)=esk48_0),inference(cn,[status(thm)],[1437,theory(equality)])).
% cnf(1513,negated_conjecture,(tl(esk49_0)=app(nil,esk48_0)|~ssList(app(nil,esk48_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[273,940,theory(equality)])).
% cnf(1554,negated_conjecture,(tl(esk49_0)=app(nil,esk48_0)|~ssList(app(nil,esk48_0))|$false),inference(rw,[status(thm)],[1513,591,theory(equality)])).
% cnf(1555,negated_conjecture,(tl(esk49_0)=app(nil,esk48_0)|~ssList(app(nil,esk48_0))),inference(cn,[status(thm)],[1554,theory(equality)])).
% cnf(1801,negated_conjecture,(esk48_0=app(nil,esk48_0)|~ssList(app(nil,esk48_0))),inference(rw,[status(thm)],[1555,1438,theory(equality)])).
% cnf(1802,negated_conjecture,(app(nil,esk48_0)=esk48_0|~ssList(esk48_0)|~ssList(nil)),inference(spm,[status(thm)],[1801,159,theory(equality)])).
% cnf(1803,negated_conjecture,(app(nil,esk48_0)=esk48_0|$false|~ssList(nil)),inference(rw,[status(thm)],[1802,585,theory(equality)])).
% cnf(1804,negated_conjecture,(app(nil,esk48_0)=esk48_0|$false|$false),inference(rw,[status(thm)],[1803,134,theory(equality)])).
% cnf(1805,negated_conjecture,(app(nil,esk48_0)=esk48_0),inference(cn,[status(thm)],[1804,theory(equality)])).
% cnf(1810,negated_conjecture,(rearsegP(X1,esk48_0)|esk48_0!=X1|~ssList(nil)|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[333,1805,theory(equality)])).
% cnf(1837,negated_conjecture,(rearsegP(X1,esk48_0)|esk48_0!=X1|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[1810,134,theory(equality)])).
% cnf(1838,negated_conjecture,(rearsegP(X1,esk48_0)|esk48_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[1837,585,theory(equality)])).
% cnf(1839,negated_conjecture,(rearsegP(X1,esk48_0)|esk48_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[1838,theory(equality)])).
% cnf(2093,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(X1)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[755,133,theory(equality)])).
% cnf(2094,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2093,134,theory(equality)])).
% cnf(2095,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2094,591,theory(equality)])).
% cnf(2096,negated_conjecture,(X1=cons(esk52_0,nil)|app(X1,esk48_0)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[2095,theory(equality)])).
% cnf(3804,negated_conjecture,(rearsegP(esk48_0,esk48_0)|~ssList(esk48_0)),inference(er,[status(thm)],[1839,theory(equality)])).
% cnf(3805,negated_conjecture,(rearsegP(esk48_0,esk48_0)|$false),inference(rw,[status(thm)],[3804,585,theory(equality)])).
% cnf(3806,negated_conjecture,(rearsegP(esk48_0,esk48_0)),inference(cn,[status(thm)],[3805,theory(equality)])).
% cnf(3809,negated_conjecture,(rearsegP(app(X1,esk48_0),esk48_0)|~ssList(X1)|~ssList(esk48_0)),inference(spm,[status(thm)],[435,3806,theory(equality)])).
% cnf(3815,negated_conjecture,(rearsegP(app(X1,esk48_0),esk48_0)|~ssList(X1)|$false),inference(rw,[status(thm)],[3809,585,theory(equality)])).
% cnf(3816,negated_conjecture,(rearsegP(app(X1,esk48_0),esk48_0)|~ssList(X1)),inference(cn,[status(thm)],[3815,theory(equality)])).
% cnf(3902,negated_conjecture,(rearsegP(esk49_0,esk48_0)|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[3816,602,theory(equality)])).
% cnf(3928,negated_conjecture,(rearsegP(esk49_0,esk48_0)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3902,133,theory(equality)])).
% cnf(3930,negated_conjecture,(rearsegP(esk49_0,esk48_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3928,134,theory(equality)])).
% cnf(3931,negated_conjecture,(rearsegP(esk49_0,esk48_0)|$false|$false),inference(rw,[status(thm)],[3930,591,theory(equality)])).
% cnf(3932,negated_conjecture,(rearsegP(esk49_0,esk48_0)),inference(cn,[status(thm)],[3931,theory(equality)])).
% cnf(3933,negated_conjecture,(ssList(esk21_2(esk49_0,esk48_0))|~ssList(esk48_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[332,3932,theory(equality)])).
% cnf(3934,negated_conjecture,(app(esk21_2(esk49_0,esk48_0),esk48_0)=esk49_0|~ssList(esk48_0)|~ssList(esk49_0)),inference(spm,[status(thm)],[331,3932,theory(equality)])).
% cnf(3939,negated_conjecture,(ssList(esk21_2(esk49_0,esk48_0))|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[3933,585,theory(equality)])).
% cnf(3940,negated_conjecture,(ssList(esk21_2(esk49_0,esk48_0))|$false|$false),inference(rw,[status(thm)],[3939,584,theory(equality)])).
% cnf(3941,negated_conjecture,(ssList(esk21_2(esk49_0,esk48_0))),inference(cn,[status(thm)],[3940,theory(equality)])).
% cnf(3942,negated_conjecture,(app(esk21_2(esk49_0,esk48_0),esk48_0)=esk49_0|$false|~ssList(esk49_0)),inference(rw,[status(thm)],[3934,585,theory(equality)])).
% cnf(3943,negated_conjecture,(app(esk21_2(esk49_0,esk48_0),esk48_0)=esk49_0|$false|$false),inference(rw,[status(thm)],[3942,584,theory(equality)])).
% cnf(3944,negated_conjecture,(app(esk21_2(esk49_0,esk48_0),esk48_0)=esk49_0),inference(cn,[status(thm)],[3943,theory(equality)])).
% cnf(3969,negated_conjecture,(esk21_2(esk49_0,esk48_0)=cons(esk52_0,nil)|~ssList(esk21_2(esk49_0,esk48_0))),inference(spm,[status(thm)],[2096,3944,theory(equality)])).
% cnf(4018,negated_conjecture,(esk21_2(esk49_0,esk48_0)=cons(esk52_0,nil)|$false),inference(rw,[status(thm)],[3969,3941,theory(equality)])).
% cnf(4019,negated_conjecture,(esk21_2(esk49_0,esk48_0)=cons(esk52_0,nil)),inference(cn,[status(thm)],[4018,theory(equality)])).
% cnf(4028,negated_conjecture,(ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[3941,4019,theory(equality)])).
% cnf(9957,negated_conjecture,(segmentP(X1,esk48_0)|app(esk49_0,X2)!=X1|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[847,4028,theory(equality)])).
% cnf(9958,negated_conjecture,(segmentP(X1,esk48_0)|app(esk49_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[9957,theory(equality)])).
% cnf(9960,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk49_0)),inference(spm,[status(thm)],[9958,215,theory(equality)])).
% cnf(9964,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(X1)|~ssList(esk49_0)),inference(rw,[status(thm)],[9960,134,theory(equality)])).
% cnf(9965,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[9964,584,theory(equality)])).
% cnf(9966,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[9965,theory(equality)])).
% cnf(10222,negated_conjecture,(segmentP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[9966,theory(equality)])).
% cnf(10223,negated_conjecture,(segmentP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[10222,584,theory(equality)])).
% cnf(10224,negated_conjecture,(segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[10223,theory(equality)])).
% cnf(10225,negated_conjecture,($false),inference(sr,[status(thm)],[10224,589,theory(equality)])).
% cnf(10226,negated_conjecture,($false),10225,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1147
% # ...of these trivial : 14
% # ...subsumed : 474
% # ...remaining for further processing: 659
% # Other redundant clauses eliminated : 101
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 63
% # Backward-rewritten : 43
% # Generated clauses : 3564
% # ...of the previous two non-trivial : 3011
% # Contextual simplify-reflections : 267
% # Paramodulations : 3412
% # Factorizations : 0
% # Equation resolutions : 152
% # Current number of processed clauses: 547
% # Positive orientable unit clauses: 96
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 429
% # Current number of unprocessed clauses: 1660
% # ...number of literals in the above : 10025
% # Clause-clause subsumption calls (NU) : 14513
% # Rec. Clause-clause subsumption calls : 9902
% # Unit Clause-clause subsumption calls : 274
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 37
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 456 leaves, 1.27+/-0.915 terms/leaf
% # Paramod-from index: 245 leaves, 1.04+/-0.303 terms/leaf
% # Paramod-into index: 413 leaves, 1.16+/-0.770 terms/leaf
% # -------------------------------------------------
% # User time : 0.244 s
% # System time : 0.016 s
% # Total time : 0.260 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.49 CPU 0.58 WC
% FINAL PrfWatch: 0.49 CPU 0.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP29286/SWC364+1.tptp
%
%------------------------------------------------------------------------------