TSTP Solution File: SWC400+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC400+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 08:03:16 EST 2010
% Result : Theorem 3.93s
% Output : Solution 3.93s
% 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/SystemOnTPTP31396/SWC400+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31396/SWC400+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31396/SWC400+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 31492
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(7, 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(8, axiom,![X1]:(ssItem(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(memberP(app(X2,X3),X1)<=>(memberP(X2,X1)|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax36)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>(memberP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(X3,cons(X2,X4))=X1))))),file('/tmp/SRASS.s.p', ax3)).
% fof(16, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(22, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(23, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(46, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(68, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(69, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(82, 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(84, axiom,![X1]:(ssList(X1)=>rearsegP(X1,nil)),file('/tmp/SRASS.s.p', ax51)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5)))))))),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))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))))))),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))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% 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)],[7])).
% 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(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)],[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(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)],[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(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)],[135])).
% cnf(137,plain,(app(app(esk3_2(X1,X2),X2),esk4_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~segmentP(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,plain,(ssList(esk4_2(X1,X2))|~ssList(X1)|~ssList(X2)|~segmentP(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% cnf(139,plain,(ssList(esk3_2(X1,X2))|~ssList(X1)|~ssList(X2)|~segmentP(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% fof(141, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(memberP(app(X2,X3),X1))|(memberP(X2,X1)|memberP(X3,X1)))&((~(memberP(X2,X1))&~(memberP(X3,X1)))|memberP(app(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[8])).
% fof(142, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[141])).
% fof(143, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4))))|~(ssList(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[142])).
% fof(144, plain,![X4]:![X5]:![X6]:(((((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&(((((~(memberP(X5,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[143])).
% cnf(145,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X3,X1)),inference(split_conjunct,[status(thm)],[144])).
% cnf(146,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X2,X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(169, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|((~(memberP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(X3,cons(X2,X4))=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(X3,cons(X2,X4))=X1)))|memberP(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(170, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|((~(memberP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(X7,cons(X6,X8))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(X9,cons(X6,X10))=X5)))|memberP(X5,X6))))),inference(variable_rename,[status(thm)],[169])).
% fof(171, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|((~(memberP(X5,X6))|(ssList(esk5_2(X5,X6))&(ssList(esk6_2(X5,X6))&app(esk5_2(X5,X6),cons(X6,esk6_2(X5,X6)))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(X9,cons(X6,X10))=X5)))|memberP(X5,X6))))),inference(skolemize,[status(esa)],[170])).
% fof(172, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(X9,cons(X6,X10))=X5))|~(ssList(X9)))|memberP(X5,X6))&(~(memberP(X5,X6))|(ssList(esk5_2(X5,X6))&(ssList(esk6_2(X5,X6))&app(esk5_2(X5,X6),cons(X6,esk6_2(X5,X6)))=X5))))|~(ssItem(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[171])).
% fof(173, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(X9,cons(X6,X10))=X5))|~(ssList(X9)))|memberP(X5,X6))|~(ssItem(X6)))|~(ssList(X5)))&((((ssList(esk5_2(X5,X6))|~(memberP(X5,X6)))|~(ssItem(X6)))|~(ssList(X5)))&((((ssList(esk6_2(X5,X6))|~(memberP(X5,X6)))|~(ssItem(X6)))|~(ssList(X5)))&(((app(esk5_2(X5,X6),cons(X6,esk6_2(X5,X6)))=X5|~(memberP(X5,X6)))|~(ssItem(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[172])).
% cnf(174,plain,(app(esk5_2(X1,X2),cons(X2,esk6_2(X1,X2)))=X1|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2)),inference(split_conjunct,[status(thm)],[173])).
% cnf(175,plain,(ssList(esk6_2(X1,X2))|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2)),inference(split_conjunct,[status(thm)],[173])).
% cnf(176,plain,(ssList(esk5_2(X1,X2))|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2)),inference(split_conjunct,[status(thm)],[173])).
% fof(178, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[16])).
% fof(179, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[178])).
% fof(180, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[179])).
% cnf(181,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[180])).
% fof(193, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[20])).
% fof(194, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[193])).
% fof(195, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[194])).
% cnf(196,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[195])).
% cnf(201,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[22])).
% fof(202, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(203, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[202])).
% fof(204, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[203])).
% cnf(205,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[204])).
% fof(333, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[46])).
% fof(334, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[333])).
% cnf(335,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[334])).
% fof(414, 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)],[68])).
% fof(415, 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)],[414])).
% fof(416, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk24_2(X4,X5))&app(X5,esk24_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[415])).
% fof(417, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk24_2(X4,X5))&app(X5,esk24_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[416])).
% fof(418, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk24_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk24_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[417])).
% cnf(419,plain,(app(X2,esk24_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[418])).
% cnf(420,plain,(ssList(esk24_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[418])).
% cnf(421,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[418])).
% fof(422, 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)],[69])).
% fof(423, 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)],[422])).
% fof(424, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk25_2(X4,X5))&app(esk25_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[423])).
% fof(425, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk25_2(X4,X5))&app(esk25_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[424])).
% fof(426, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk25_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk25_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[425])).
% cnf(427,plain,(app(esk25_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[426])).
% cnf(428,plain,(ssList(esk25_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[426])).
% fof(526, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(rearsegP(X1,X2))|rearsegP(app(X3,X1),X2))))),inference(fof_nnf,[status(thm)],[82])).
% fof(527, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5))))),inference(variable_rename,[status(thm)],[526])).
% fof(528, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[527])).
% cnf(529,plain,(rearsegP(app(X3,X1),X2)|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[528])).
% fof(539, plain,![X1]:(~(ssList(X1))|rearsegP(X1,nil)),inference(fof_nnf,[status(thm)],[84])).
% fof(540, plain,![X2]:(~(ssList(X2))|rearsegP(X2,nil)),inference(variable_rename,[status(thm)],[539])).
% cnf(541,plain,(rearsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[540])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&segmentP(X4,X3))&totalorderedP(X3))&?[X5]:(ssItem(X5)&(memberP(X1,X5)&~(memberP(X2,X5))))))))),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)&segmentP(X9,X8))&totalorderedP(X8))&?[X10]:(ssItem(X10)&(memberP(X6,X10)&~(memberP(X7,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)&segmentP(esk51_0,esk50_0))&totalorderedP(esk50_0))&(ssItem(esk52_0)&(memberP(esk48_0,esk52_0)&~(memberP(esk49_0,esk52_0))))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(~memberP(esk49_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(memberP(esk48_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(581,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(582,negated_conjecture,(~memberP(esk51_0,esk52_0)),inference(rw,[status(thm)],[571,577,theory(equality)])).
% cnf(583,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[581,576,theory(equality)])).
% cnf(584,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[580,577,theory(equality)])).
% cnf(587,negated_conjecture,(memberP(esk50_0,esk52_0)),inference(rw,[status(thm)],[572,576,theory(equality)])).
% cnf(618,negated_conjecture,(ssList(esk3_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[139,575,theory(equality)])).
% cnf(621,negated_conjecture,(ssList(esk3_2(esk51_0,esk50_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[618,583,theory(equality)])).
% cnf(622,negated_conjecture,(ssList(esk3_2(esk51_0,esk50_0))|$false|$false),inference(rw,[status(thm)],[621,584,theory(equality)])).
% cnf(623,negated_conjecture,(ssList(esk3_2(esk51_0,esk50_0))),inference(cn,[status(thm)],[622,theory(equality)])).
% cnf(626,negated_conjecture,(ssList(esk4_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[138,575,theory(equality)])).
% cnf(629,negated_conjecture,(ssList(esk4_2(esk51_0,esk50_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[626,583,theory(equality)])).
% cnf(630,negated_conjecture,(ssList(esk4_2(esk51_0,esk50_0))|$false|$false),inference(rw,[status(thm)],[629,584,theory(equality)])).
% cnf(631,negated_conjecture,(ssList(esk4_2(esk51_0,esk50_0))),inference(cn,[status(thm)],[630,theory(equality)])).
% cnf(634,negated_conjecture,(ssList(esk5_2(esk50_0,esk52_0))|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[176,587,theory(equality)])).
% cnf(635,negated_conjecture,(ssList(esk5_2(esk50_0,esk52_0))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[634,583,theory(equality)])).
% cnf(636,negated_conjecture,(ssList(esk5_2(esk50_0,esk52_0))|$false|$false),inference(rw,[status(thm)],[635,573,theory(equality)])).
% cnf(637,negated_conjecture,(ssList(esk5_2(esk50_0,esk52_0))),inference(cn,[status(thm)],[636,theory(equality)])).
% cnf(638,negated_conjecture,(ssList(esk6_2(esk50_0,esk52_0))|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[175,587,theory(equality)])).
% cnf(639,negated_conjecture,(ssList(esk6_2(esk50_0,esk52_0))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[638,583,theory(equality)])).
% cnf(640,negated_conjecture,(ssList(esk6_2(esk50_0,esk52_0))|$false|$false),inference(rw,[status(thm)],[639,573,theory(equality)])).
% cnf(641,negated_conjecture,(ssList(esk6_2(esk50_0,esk52_0))),inference(cn,[status(thm)],[640,theory(equality)])).
% cnf(715,negated_conjecture,(memberP(app(X1,esk50_0),esk52_0)|~ssList(esk50_0)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[145,587,theory(equality)])).
% cnf(716,negated_conjecture,(memberP(app(X1,esk50_0),esk52_0)|$false|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[715,583,theory(equality)])).
% cnf(717,negated_conjecture,(memberP(app(X1,esk50_0),esk52_0)|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[716,573,theory(equality)])).
% cnf(718,negated_conjecture,(memberP(app(X1,esk50_0),esk52_0)|~ssList(X1)),inference(cn,[status(thm)],[717,theory(equality)])).
% cnf(738,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[421,theory(equality)])).
% cnf(832,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(nil)|~ssList(X2)),inference(spm,[status(thm)],[529,541,theory(equality)])).
% cnf(834,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|$false|~ssList(X2)),inference(rw,[status(thm)],[832,201,theory(equality)])).
% cnf(835,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[834,theory(equality)])).
% cnf(961,plain,(ssList(app(X1,app(X2,X3)))|~ssList(X3)|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[205,196,theory(equality)])).
% cnf(997,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),cons(esk52_0,esk6_2(esk50_0,esk52_0)))=esk50_0|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[174,587,theory(equality)])).
% cnf(998,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),cons(esk52_0,esk6_2(esk50_0,esk52_0)))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[997,583,theory(equality)])).
% cnf(999,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),cons(esk52_0,esk6_2(esk50_0,esk52_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[998,573,theory(equality)])).
% cnf(1000,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),cons(esk52_0,esk6_2(esk50_0,esk52_0)))=esk50_0),inference(cn,[status(thm)],[999,theory(equality)])).
% cnf(1001,negated_conjecture,(app(app(esk3_2(esk51_0,esk50_0),esk50_0),esk4_2(esk51_0,esk50_0))=esk51_0|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[137,575,theory(equality)])).
% cnf(1004,negated_conjecture,(app(app(esk3_2(esk51_0,esk50_0),esk50_0),esk4_2(esk51_0,esk50_0))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[1001,583,theory(equality)])).
% cnf(1005,negated_conjecture,(app(app(esk3_2(esk51_0,esk50_0),esk50_0),esk4_2(esk51_0,esk50_0))=esk51_0|$false|$false),inference(rw,[status(thm)],[1004,584,theory(equality)])).
% cnf(1006,negated_conjecture,(app(app(esk3_2(esk51_0,esk50_0),esk50_0),esk4_2(esk51_0,esk50_0))=esk51_0),inference(cn,[status(thm)],[1005,theory(equality)])).
% cnf(1414,negated_conjecture,(memberP(app(app(X1,esk50_0),X2),esk52_0)|~ssList(X2)|~ssList(app(X1,esk50_0))|~ssItem(esk52_0)|~ssList(X1)),inference(spm,[status(thm)],[146,718,theory(equality)])).
% cnf(1430,negated_conjecture,(memberP(app(app(X1,esk50_0),X2),esk52_0)|~ssList(X2)|~ssList(app(X1,esk50_0))|$false|~ssList(X1)),inference(rw,[status(thm)],[1414,573,theory(equality)])).
% cnf(1431,negated_conjecture,(memberP(app(app(X1,esk50_0),X2),esk52_0)|~ssList(X2)|~ssList(app(X1,esk50_0))|~ssList(X1)),inference(cn,[status(thm)],[1430,theory(equality)])).
% cnf(3173,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[738,205])).
% cnf(3183,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))|~ssList(cons(esk52_0,esk6_2(esk50_0,esk52_0)))|~ssList(esk5_2(esk50_0,esk52_0))),inference(spm,[status(thm)],[3173,1000,theory(equality)])).
% cnf(3209,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))|~ssList(cons(esk52_0,esk6_2(esk50_0,esk52_0)))|$false),inference(rw,[status(thm)],[3183,637,theory(equality)])).
% cnf(3210,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))|~ssList(cons(esk52_0,esk6_2(esk50_0,esk52_0)))),inference(cn,[status(thm)],[3209,theory(equality)])).
% cnf(3230,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))|~ssList(esk6_2(esk50_0,esk52_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[3210,181,theory(equality)])).
% cnf(3233,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3230,641,theory(equality)])).
% cnf(3234,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))|$false|$false),inference(rw,[status(thm)],[3233,573,theory(equality)])).
% cnf(3235,negated_conjecture,(frontsegP(esk50_0,esk5_2(esk50_0,esk52_0))),inference(cn,[status(thm)],[3234,theory(equality)])).
% cnf(3236,negated_conjecture,(ssList(esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))|~ssList(esk5_2(esk50_0,esk52_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[420,3235,theory(equality)])).
% cnf(3238,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))=esk50_0|~ssList(esk5_2(esk50_0,esk52_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[419,3235,theory(equality)])).
% cnf(3243,negated_conjecture,(ssList(esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[3236,637,theory(equality)])).
% cnf(3244,negated_conjecture,(ssList(esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))|$false|$false),inference(rw,[status(thm)],[3243,583,theory(equality)])).
% cnf(3245,negated_conjecture,(ssList(esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))),inference(cn,[status(thm)],[3244,theory(equality)])).
% cnf(3249,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))=esk50_0|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[3238,637,theory(equality)])).
% cnf(3250,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[3249,583,theory(equality)])).
% cnf(3251,negated_conjecture,(app(esk5_2(esk50_0,esk52_0),esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))=esk50_0),inference(cn,[status(thm)],[3250,theory(equality)])).
% cnf(6461,negated_conjecture,(rearsegP(esk50_0,nil)|~ssList(esk5_2(esk50_0,esk52_0))|~ssList(esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))),inference(spm,[status(thm)],[835,3251,theory(equality)])).
% cnf(6491,negated_conjecture,(rearsegP(esk50_0,nil)|$false|~ssList(esk24_2(esk50_0,esk5_2(esk50_0,esk52_0)))),inference(rw,[status(thm)],[6461,637,theory(equality)])).
% cnf(6492,negated_conjecture,(rearsegP(esk50_0,nil)|$false|$false),inference(rw,[status(thm)],[6491,3245,theory(equality)])).
% cnf(6493,negated_conjecture,(rearsegP(esk50_0,nil)),inference(cn,[status(thm)],[6492,theory(equality)])).
% cnf(6530,negated_conjecture,(ssList(esk25_2(esk50_0,nil))|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[428,6493,theory(equality)])).
% cnf(6531,negated_conjecture,(app(esk25_2(esk50_0,nil),nil)=esk50_0|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[427,6493,theory(equality)])).
% cnf(6535,negated_conjecture,(ssList(esk25_2(esk50_0,nil))|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[6530,201,theory(equality)])).
% cnf(6536,negated_conjecture,(ssList(esk25_2(esk50_0,nil))|$false|$false),inference(rw,[status(thm)],[6535,583,theory(equality)])).
% cnf(6537,negated_conjecture,(ssList(esk25_2(esk50_0,nil))),inference(cn,[status(thm)],[6536,theory(equality)])).
% cnf(6538,negated_conjecture,(app(esk25_2(esk50_0,nil),nil)=esk50_0|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[6531,201,theory(equality)])).
% cnf(6539,negated_conjecture,(app(esk25_2(esk50_0,nil),nil)=esk50_0|$false|$false),inference(rw,[status(thm)],[6538,583,theory(equality)])).
% cnf(6540,negated_conjecture,(app(esk25_2(esk50_0,nil),nil)=esk50_0),inference(cn,[status(thm)],[6539,theory(equality)])).
% cnf(7073,negated_conjecture,(esk50_0=esk25_2(esk50_0,nil)|~ssList(esk25_2(esk50_0,nil))),inference(spm,[status(thm)],[335,6540,theory(equality)])).
% cnf(7146,negated_conjecture,(esk50_0=esk25_2(esk50_0,nil)|$false),inference(rw,[status(thm)],[7073,6537,theory(equality)])).
% cnf(7147,negated_conjecture,(esk50_0=esk25_2(esk50_0,nil)),inference(cn,[status(thm)],[7146,theory(equality)])).
% cnf(7153,negated_conjecture,(app(esk50_0,nil)=esk50_0),inference(rw,[status(thm)],[6540,7147,theory(equality)])).
% cnf(19112,plain,(ssList(app(X1,app(X2,X3)))|~ssList(X2)|~ssList(X1)|~ssList(X3)),inference(csr,[status(thm)],[961,205])).
% cnf(19114,negated_conjecture,(ssList(app(X1,esk50_0))|~ssList(nil)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[19112,7153,theory(equality)])).
% cnf(19167,negated_conjecture,(ssList(app(X1,esk50_0))|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[19114,201,theory(equality)])).
% cnf(19168,negated_conjecture,(ssList(app(X1,esk50_0))|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[19167,583,theory(equality)])).
% cnf(19169,negated_conjecture,(ssList(app(X1,esk50_0))|~ssList(X1)),inference(cn,[status(thm)],[19168,theory(equality)])).
% cnf(65644,negated_conjecture,(memberP(app(app(X1,esk50_0),X2),esk52_0)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[1431,19169])).
% cnf(65670,negated_conjecture,(memberP(esk51_0,esk52_0)|~ssList(esk4_2(esk51_0,esk50_0))|~ssList(esk3_2(esk51_0,esk50_0))),inference(spm,[status(thm)],[65644,1006,theory(equality)])).
% cnf(65719,negated_conjecture,(memberP(esk51_0,esk52_0)|$false|~ssList(esk3_2(esk51_0,esk50_0))),inference(rw,[status(thm)],[65670,631,theory(equality)])).
% cnf(65720,negated_conjecture,(memberP(esk51_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[65719,623,theory(equality)])).
% cnf(65721,negated_conjecture,(memberP(esk51_0,esk52_0)),inference(cn,[status(thm)],[65720,theory(equality)])).
% cnf(65722,negated_conjecture,($false),inference(sr,[status(thm)],[65721,582,theory(equality)])).
% cnf(65723,negated_conjecture,($false),65722,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4708
% # ...of these trivial : 20
% # ...subsumed : 1931
% # ...remaining for further processing: 2757
% # Other redundant clauses eliminated : 767
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 254
% # Backward-rewritten : 569
% # Generated clauses : 24923
% # ...of the previous two non-trivial : 21898
% # Contextual simplify-reflections : 2268
% # Paramodulations : 23860
% # Factorizations : 0
% # Equation resolutions : 1063
% # Current number of processed clauses: 1928
% # Positive orientable unit clauses: 343
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 1582
% # Current number of unprocessed clauses: 14489
% # ...number of literals in the above : 108145
% # Clause-clause subsumption calls (NU) : 106728
% # Rec. Clause-clause subsumption calls : 56194
% # Unit Clause-clause subsumption calls : 975
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 664
% # Indexed BW rewrite successes : 137
% # Backwards rewriting index: 1743 leaves, 1.31+/-1.078 terms/leaf
% # Paramod-from index: 676 leaves, 1.29+/-1.174 terms/leaf
% # Paramod-into index: 1367 leaves, 1.27+/-1.069 terms/leaf
% # -------------------------------------------------
% # User time : 1.691 s
% # System time : 0.042 s
% # Total time : 1.733 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.81 CPU 3.14 WC
% FINAL PrfWatch: 2.81 CPU 3.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP31396/SWC400+1.tptp
%
%------------------------------------------------------------------------------