%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC021+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 : art05.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:51:20 EST 2010

% Result   : Theorem 4.27s
% Output   : Solution 4.27s
% 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/SystemOnTPTP15369/SWC021+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP15369/SWC021+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15369/SWC021+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 15465
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% # Preprocessing time     : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>((frontsegP(X1,X2)&frontsegP(X2,X3))=>frontsegP(X1,X3))))),file('/tmp/SRASS.s.p', ax40)).
% fof(5, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(7, axiom,![X1]:(ssList(X1)=>(frontsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax46)).
% fof(11, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(16, 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(17, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(18, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(19, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(frontsegP(X1,X2)=>frontsegP(app(X1,X3),X2))))),file('/tmp/SRASS.s.p', ax43)).
% fof(22, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(26, axiom,![X1]:(ssItem(X1)=>strictorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax68)).
% fof(28, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(31, 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(33, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(34, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(35, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(40, axiom,![X1]:(ssList(X1)=>rearsegP(X1,nil)),file('/tmp/SRASS.s.p', ax51)).
% fof(44, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(45, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(53, 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(71, 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(78, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(79, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(81, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(strictorderedP(X3)))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|?[X6]:((((ssList(X6)&neq(X3,X6))&frontsegP(X4,X6))&segmentP(X6,X3))&strictorderedP(X6)))|(nil=X2&nil=X1)))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(strictorderedP(X3)))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|?[X6]:((((ssList(X6)&neq(X3,X6))&frontsegP(X4,X6))&segmentP(X6,X3))&strictorderedP(X6)))|(nil=X2&nil=X1))))))),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))|~(frontsegP(X4,X3)))|~(strictorderedP(X3)))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|?[X6]:((((ssList(X6)&neq(X3,X6))&frontsegP(X4,X6))&segmentP(X6,X3))&strictorderedP(X6)))|(nil=X2&nil=X1))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, 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)],[106])).
% cnf(108,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(111, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(frontsegP(X1,X2))|~(frontsegP(X2,X3)))|frontsegP(X1,X3))))),inference(fof_nnf,[status(thm)],[3])).
% fof(112, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(frontsegP(X4,X5))|~(frontsegP(X5,X6)))|frontsegP(X4,X6))))),inference(variable_rename,[status(thm)],[111])).
% fof(113, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(frontsegP(X4,X5))|~(frontsegP(X5,X6)))|frontsegP(X4,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[112])).
% cnf(114,plain,(frontsegP(X1,X3)|~ssList(X1)|~ssList(X2)|~frontsegP(X2,X3)|~frontsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[113])).
% fof(119, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(120, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(125, plain,![X1]:(~(ssList(X1))|((~(frontsegP(nil,X1))|nil=X1)&(~(nil=X1)|frontsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(126, plain,![X2]:(~(ssList(X2))|((~(frontsegP(nil,X2))|nil=X2)&(~(nil=X2)|frontsegP(nil,X2)))),inference(variable_rename,[status(thm)],[125])).
% fof(127, plain,![X2]:(((~(frontsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|frontsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(frontsegP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[127])).
% 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(156, 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)],[15])).
% fof(157, 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)],[156])).
% fof(158, 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)],[157])).
% fof(159, 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)],[158])).
% fof(160, 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)],[159])).
% cnf(161,plain,(app(X2,esk1_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[160])).
% cnf(162,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[160])).
% cnf(163,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[160])).
% fof(164, 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)],[16])).
% fof(165, 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)],[164])).
% fof(166, 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)],[165])).
% fof(167, 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)],[166])).
% fof(168, 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)],[167])).
% cnf(169,plain,(app(app(esk2_2(X1,X2),X2),esk3_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~segmentP(X1,X2)),inference(split_conjunct,[status(thm)],[168])).
% cnf(170,plain,(ssList(esk3_2(X1,X2))|~ssList(X1)|~ssList(X2)|~segmentP(X1,X2)),inference(split_conjunct,[status(thm)],[168])).
% cnf(171,plain,(ssList(esk2_2(X1,X2))|~ssList(X1)|~ssList(X2)|~segmentP(X1,X2)),inference(split_conjunct,[status(thm)],[168])).
% cnf(172,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[168])).
% fof(173, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[17])).
% fof(174, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[173])).
% cnf(175,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[174])).
% fof(176, 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)],[18])).
% fof(177, 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)],[176])).
% fof(178, 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)],[177])).
% fof(179, 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)],[178])).
% cnf(181,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[179])).
% cnf(182,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[179])).
% fof(183, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[19])).
% fof(184, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[183])).
% cnf(185,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[184])).
% fof(186, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(frontsegP(X1,X2))|frontsegP(app(X1,X3),X2))))),inference(fof_nnf,[status(thm)],[20])).
% fof(187, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5))))),inference(variable_rename,[status(thm)],[186])).
% fof(188, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[187])).
% cnf(189,plain,(frontsegP(app(X1,X3),X2)|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[188])).
% fof(194, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[22])).
% fof(195, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[194])).
% cnf(196,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(215, plain,![X1]:(~(ssItem(X1))|strictorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[26])).
% fof(216, plain,![X2]:(~(ssItem(X2))|strictorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[215])).
% cnf(217,plain,(strictorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[216])).
% fof(225, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[28])).
% fof(226, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[225])).
% fof(227, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[226])).
% cnf(228,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[227])).
% fof(237, 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)],[31])).
% fof(238, 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)],[237])).
% fof(239, 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)],[238])).
% cnf(240,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[239])).
% fof(246, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[33])).
% fof(247, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[246])).
% fof(248, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[247])).
% cnf(249,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[248])).
% fof(250, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[34])).
% fof(251, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[250])).
% cnf(252,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[251])).
% fof(253, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[35])).
% fof(254, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[253])).
% fof(255, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[254])).
% cnf(256,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[255])).
% fof(272, plain,![X1]:(~(ssList(X1))|rearsegP(X1,nil)),inference(fof_nnf,[status(thm)],[40])).
% fof(273, plain,![X2]:(~(ssList(X2))|rearsegP(X2,nil)),inference(variable_rename,[status(thm)],[272])).
% cnf(274,plain,(rearsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[273])).
% fof(288, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[44])).
% fof(289, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[288])).
% fof(290, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[289])).
% cnf(291,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[290])).
% fof(292, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[45])).
% fof(293, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[292])).
% fof(294, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[293])).
% cnf(295,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[294])).
% fof(341, 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)],[53])).
% fof(342, 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)],[341])).
% fof(343, 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)],[342])).
% cnf(344,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[343])).
% fof(399, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(rearsegP(X1,X2))|rearsegP(app(X3,X1),X2))))),inference(fof_nnf,[status(thm)],[71])).
% fof(400, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5))))),inference(variable_rename,[status(thm)],[399])).
% fof(401, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[400])).
% cnf(402,plain,(rearsegP(app(X3,X1),X2)|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[401])).
% fof(421, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[78])).
% fof(422, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[421])).
% fof(423, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[422])).
% cnf(424,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[423])).
% fof(425, 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)],[79])).
% fof(426, 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)],[425])).
% fof(427, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk16_2(X4,X5))&app(esk16_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[426])).
% fof(428, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk16_2(X4,X5))&app(esk16_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[427])).
% fof(429, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk16_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk16_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[428])).
% cnf(430,plain,(app(esk16_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[429])).
% cnf(431,plain,(ssList(esk16_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[429])).
% fof(447, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[81])).
% fof(448, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[447])).
% cnf(449,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[448])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((((X2=X4&X1=X3)&frontsegP(X4,X3))&strictorderedP(X3))&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(frontsegP(X2,X5)))|~(frontsegP(X1,X5))))&![X6]:((((~(ssList(X6))|~(neq(X3,X6)))|~(frontsegP(X4,X6)))|~(segmentP(X6,X3)))|~(strictorderedP(X6))))&(~(nil=X2)|~(nil=X1))))))),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)&frontsegP(X10,X9))&strictorderedP(X9))&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(X8,X11)))|~(frontsegP(X7,X11))))&![X12]:((((~(ssList(X12))|~(neq(X9,X12)))|~(frontsegP(X10,X12)))|~(segmentP(X12,X9)))|~(strictorderedP(X12))))&(~(nil=X8)|~(nil=X7))))))),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)&frontsegP(esk51_0,esk50_0))&strictorderedP(esk50_0))&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(esk49_0,X11)))|~(frontsegP(esk48_0,X11))))&![X12]:((((~(ssList(X12))|~(neq(esk50_0,X12)))|~(frontsegP(esk51_0,X12)))|~(segmentP(X12,esk50_0)))|~(strictorderedP(X12))))&(~(nil=esk49_0)|~(nil=esk48_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:![X12]:((((((((((~(ssList(X12))|~(neq(esk50_0,X12)))|~(frontsegP(esk51_0,X12)))|~(segmentP(X12,esk50_0)))|~(strictorderedP(X12)))&((((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(esk49_0,X11)))|~(frontsegP(esk48_0,X11)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&frontsegP(esk51_0,esk50_0))&strictorderedP(esk50_0))))&(~(nil=esk49_0)|~(nil=esk48_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(frontsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(~strictorderedP(X1)|~segmentP(X1,esk50_0)|~frontsegP(esk51_0,X1)|~neq(esk50_0,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[576,579,theory(equality)])).
% cnf(584,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[583,580,theory(equality)])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,579,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,580,theory(equality)])).
% cnf(589,plain,(frontsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(590,plain,(frontsegP(nil,nil)|$false),inference(rw,[status(thm)],[589,110,theory(equality)])).
% cnf(591,plain,(frontsegP(nil,nil)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(595,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk49_0,X1)),inference(rw,[status(thm)],[581,579,theory(equality)])).
% cnf(596,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk51_0,X1)),inference(rw,[status(thm)],[595,580,theory(equality)])).
% cnf(598,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[596,121,theory(equality)])).
% cnf(602,negated_conjecture,($false|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(rw,[status(thm)],[598,578,theory(equality)])).
% cnf(603,negated_conjecture,($false|~neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[602,585,theory(equality)])).
% cnf(604,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(686,plain,(ssList(esk16_2(X1,nil))|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[431,274,theory(equality)])).
% cnf(688,plain,(ssList(esk16_2(X1,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[686,110,theory(equality)])).
% cnf(689,plain,(ssList(esk16_2(X1,nil))|~ssList(X1)),inference(cn,[status(thm)],[688,theory(equality)])).
% cnf(703,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[163,theory(equality)])).
% cnf(786,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=app(X1,X2)|nil=X1|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[449,291,theory(equality)])).
% cnf(823,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(nil)|~ssList(X2)),inference(spm,[status(thm)],[402,274,theory(equality)])).
% cnf(825,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|$false|~ssList(X2)),inference(rw,[status(thm)],[823,110,theory(equality)])).
% cnf(826,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[825,theory(equality)])).
% cnf(831,plain,(app(esk16_2(X1,nil),nil)=X1|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[430,274,theory(equality)])).
% cnf(833,plain,(app(esk16_2(X1,nil),nil)=X1|$false|~ssList(X1)),inference(rw,[status(thm)],[831,110,theory(equality)])).
% cnf(834,plain,(app(esk16_2(X1,nil),nil)=X1|~ssList(X1)),inference(cn,[status(thm)],[833,theory(equality)])).
% cnf(841,plain,(nil=app(X1,X2)|ssList(app(tl(X1),X2))|nil=X1|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[196,295,theory(equality)])).
% cnf(958,plain,(ssList(cons(X1,app(X2,X3)))|~ssList(X3)|~ssList(cons(X1,X2))|~ssItem(X1)|~ssList(X2)),inference(spm,[status(thm)],[256,344,theory(equality)])).
% cnf(1331,plain,(ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[162,591,theory(equality)])).
% cnf(1332,plain,(app(nil,esk1_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[161,591,theory(equality)])).
% cnf(1335,plain,(ssList(esk1_2(nil,nil))|$false),inference(rw,[status(thm)],[1331,110,theory(equality)])).
% cnf(1336,plain,(ssList(esk1_2(nil,nil))),inference(cn,[status(thm)],[1335,theory(equality)])).
% cnf(1337,plain,(app(nil,esk1_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1332,110,theory(equality)])).
% cnf(1338,plain,(app(nil,esk1_2(nil,nil))=nil),inference(cn,[status(thm)],[1337,theory(equality)])).
% cnf(1358,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[604,108,theory(equality)])).
% cnf(1360,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[1358,110,theory(equality)])).
% cnf(1361,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[1360,585,theory(equality)])).
% cnf(1362,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1361,theory(equality)])).
% cnf(1364,negated_conjecture,(~strictorderedP(X1)|~segmentP(X1,nil)|~frontsegP(esk51_0,X1)|~neq(esk50_0,X1)|~ssList(X1)),inference(rw,[status(thm)],[582,1362,theory(equality)])).
% cnf(1365,negated_conjecture,(~strictorderedP(X1)|~segmentP(X1,nil)|~frontsegP(esk51_0,X1)|~neq(nil,X1)|~ssList(X1)),inference(rw,[status(thm)],[1364,1362,theory(equality)])).
% cnf(1367,negated_conjecture,(frontsegP(esk51_0,nil)),inference(rw,[status(thm)],[578,1362,theory(equality)])).
% cnf(1370,negated_conjecture,($false|esk51_0!=nil),inference(rw,[status(thm)],[584,1362,theory(equality)])).
% cnf(1371,negated_conjecture,(esk51_0!=nil),inference(cn,[status(thm)],[1370,theory(equality)])).
% cnf(1373,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[162,1367,theory(equality)])).
% cnf(1375,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,1367,theory(equality)])).
% cnf(1378,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[1373,110,theory(equality)])).
% cnf(1379,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[1378,586,theory(equality)])).
% cnf(1380,negated_conjecture,(ssList(esk1_2(esk51_0,nil))),inference(cn,[status(thm)],[1379,theory(equality)])).
% cnf(1385,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[1375,110,theory(equality)])).
% cnf(1386,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|$false|$false),inference(rw,[status(thm)],[1385,586,theory(equality)])).
% cnf(1387,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[1386,theory(equality)])).
% cnf(1413,plain,(nil=esk1_2(nil,nil)|~ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[182,1338,theory(equality)])).
% cnf(1440,plain,(nil=esk1_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1413,1336,theory(equality)])).
% cnf(1441,plain,(nil=esk1_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1440,110,theory(equality)])).
% cnf(1442,plain,(nil=esk1_2(nil,nil)),inference(cn,[status(thm)],[1441,theory(equality)])).
% cnf(1454,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1338,1442,theory(equality)])).
% cnf(1498,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)|~ssList(esk1_2(esk51_0,nil))),inference(spm,[status(thm)],[175,1387,theory(equality)])).
% cnf(1533,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)|$false),inference(rw,[status(thm)],[1498,1380,theory(equality)])).
% cnf(1534,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)),inference(cn,[status(thm)],[1533,theory(equality)])).
% cnf(1535,negated_conjecture,(app(nil,esk51_0)=esk51_0),inference(rw,[status(thm)],[1387,1534,theory(equality)])).
% cnf(1543,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(nil)|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[172,1535,theory(equality)])).
% cnf(1567,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|~ssList(esk51_0)|~ssList(X1)),inference(rw,[status(thm)],[1543,110,theory(equality)])).
% cnf(1568,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[1567,586,theory(equality)])).
% cnf(1569,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[1568,theory(equality)])).
% cnf(1745,negated_conjecture,(~strictorderedP(X1)|~frontsegP(esk51_0,X1)|~neq(nil,X1)|~ssList(X1)),inference(csr,[status(thm)],[1365,143])).
% cnf(2201,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[1569,185,theory(equality)])).
% cnf(2202,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(X1)|~ssList(esk51_0)),inference(rw,[status(thm)],[2201,110,theory(equality)])).
% cnf(2203,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2202,586,theory(equality)])).
% cnf(2204,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2203,theory(equality)])).
% cnf(2205,negated_conjecture,(segmentP(esk51_0,esk51_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2204,theory(equality)])).
% cnf(2206,negated_conjecture,(segmentP(esk51_0,esk51_0)|$false),inference(rw,[status(thm)],[2205,586,theory(equality)])).
% cnf(2207,negated_conjecture,(segmentP(esk51_0,esk51_0)),inference(cn,[status(thm)],[2206,theory(equality)])).
% cnf(2208,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[171,2207,theory(equality)])).
% cnf(2209,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[170,2207,theory(equality)])).
% cnf(2210,negated_conjecture,(app(app(esk2_2(esk51_0,esk51_0),esk51_0),esk3_2(esk51_0,esk51_0))=esk51_0|~ssList(esk51_0)),inference(spm,[status(thm)],[169,2207,theory(equality)])).
% cnf(2213,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2208,586,theory(equality)])).
% cnf(2214,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2213,theory(equality)])).
% cnf(2215,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2209,586,theory(equality)])).
% cnf(2216,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2215,theory(equality)])).
% cnf(2217,negated_conjecture,(app(app(esk2_2(esk51_0,esk51_0),esk51_0),esk3_2(esk51_0,esk51_0))=esk51_0|$false),inference(rw,[status(thm)],[2210,586,theory(equality)])).
% cnf(2218,negated_conjecture,(app(app(esk2_2(esk51_0,esk51_0),esk51_0),esk3_2(esk51_0,esk51_0))=esk51_0),inference(cn,[status(thm)],[2217,theory(equality)])).
% cnf(2240,negated_conjecture,(esk51_0=app(esk2_2(esk51_0,esk51_0),app(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)|~ssList(esk2_2(esk51_0,esk51_0))),inference(spm,[status(thm)],[240,2218,theory(equality)])).
% cnf(2278,negated_conjecture,(esk51_0=app(esk2_2(esk51_0,esk51_0),app(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|~ssList(esk51_0)|~ssList(esk2_2(esk51_0,esk51_0))),inference(rw,[status(thm)],[2240,2216,theory(equality)])).
% cnf(2279,negated_conjecture,(esk51_0=app(esk2_2(esk51_0,esk51_0),app(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|$false|~ssList(esk2_2(esk51_0,esk51_0))),inference(rw,[status(thm)],[2278,586,theory(equality)])).
% cnf(2280,negated_conjecture,(esk51_0=app(esk2_2(esk51_0,esk51_0),app(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|$false|$false),inference(rw,[status(thm)],[2279,2214,theory(equality)])).
% cnf(2281,negated_conjecture,(esk51_0=app(esk2_2(esk51_0,esk51_0),app(esk51_0,esk3_2(esk51_0,esk51_0)))),inference(cn,[status(thm)],[2280,theory(equality)])).
% cnf(2401,plain,(frontsegP(X1,esk16_2(X2,nil))|X2!=X1|~ssList(nil)|~ssList(esk16_2(X2,nil))|~ssList(X1)|~ssList(X2)),inference(spm,[status(thm)],[163,834,theory(equality)])).
% cnf(2427,plain,(frontsegP(X1,esk16_2(X2,nil))|X2!=X1|$false|~ssList(esk16_2(X2,nil))|~ssList(X1)|~ssList(X2)),inference(rw,[status(thm)],[2401,110,theory(equality)])).
% cnf(2428,plain,(frontsegP(X1,esk16_2(X2,nil))|X2!=X1|~ssList(esk16_2(X2,nil))|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[2427,theory(equality)])).
% cnf(2429,plain,(frontsegP(X1,esk16_2(X1,nil))|~ssList(esk16_2(X1,nil))|~ssList(X1)),inference(er,[status(thm)],[2428,theory(equality)])).
% cnf(2479,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(app(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(esk2_2(esk51_0,esk51_0))|~ssList(X1)),inference(spm,[status(thm)],[163,2281,theory(equality)])).
% cnf(2505,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(app(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|~ssList(X1)),inference(rw,[status(thm)],[2479,2214,theory(equality)])).
% cnf(2506,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(app(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(X1)),inference(cn,[status(thm)],[2505,theory(equality)])).
% cnf(2525,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(X1)|~ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[2506,256,theory(equality)])).
% cnf(2526,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(X1)|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2525,2216,theory(equality)])).
% cnf(2527,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2526,586,theory(equality)])).
% cnf(2528,negated_conjecture,(frontsegP(X1,esk2_2(esk51_0,esk51_0))|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2527,theory(equality)])).
% cnf(2529,negated_conjecture,(frontsegP(esk51_0,esk2_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(er,[status(thm)],[2528,theory(equality)])).
% cnf(2530,negated_conjecture,(frontsegP(esk51_0,esk2_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2529,586,theory(equality)])).
% cnf(2531,negated_conjecture,(frontsegP(esk51_0,esk2_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2530,theory(equality)])).
% cnf(2532,negated_conjecture,(ssList(esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))|~ssList(esk2_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[162,2531,theory(equality)])).
% cnf(2534,negated_conjecture,(app(esk2_2(esk51_0,esk51_0),esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))=esk51_0|~ssList(esk2_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[161,2531,theory(equality)])).
% cnf(2538,negated_conjecture,(ssList(esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2532,2214,theory(equality)])).
% cnf(2539,negated_conjecture,(ssList(esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))|$false|$false),inference(rw,[status(thm)],[2538,586,theory(equality)])).
% cnf(2540,negated_conjecture,(ssList(esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))),inference(cn,[status(thm)],[2539,theory(equality)])).
% cnf(2544,negated_conjecture,(app(esk2_2(esk51_0,esk51_0),esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2534,2214,theory(equality)])).
% cnf(2545,negated_conjecture,(app(esk2_2(esk51_0,esk51_0),esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))=esk51_0|$false|$false),inference(rw,[status(thm)],[2544,586,theory(equality)])).
% cnf(2546,negated_conjecture,(app(esk2_2(esk51_0,esk51_0),esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))=esk51_0),inference(cn,[status(thm)],[2545,theory(equality)])).
% cnf(2940,plain,(frontsegP(X1,esk16_2(X1,nil))|~ssList(X1)),inference(csr,[status(thm)],[2429,689])).
% cnf(3253,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[703,256])).
% cnf(3266,plain,(frontsegP(cons(X1,X2),cons(X1,nil))|~ssList(X2)|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[3253,424,theory(equality)])).
% cnf(3870,negated_conjecture,(rearsegP(esk51_0,nil)|~ssList(esk2_2(esk51_0,esk51_0))|~ssList(esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))),inference(spm,[status(thm)],[826,2546,theory(equality)])).
% cnf(3910,negated_conjecture,(rearsegP(esk51_0,nil)|$false|~ssList(esk1_2(esk51_0,esk2_2(esk51_0,esk51_0)))),inference(rw,[status(thm)],[3870,2214,theory(equality)])).
% cnf(3911,negated_conjecture,(rearsegP(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[3910,2540,theory(equality)])).
% cnf(3912,negated_conjecture,(rearsegP(esk51_0,nil)),inference(cn,[status(thm)],[3911,theory(equality)])).
% cnf(3939,negated_conjecture,(ssList(esk16_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[431,3912,theory(equality)])).
% cnf(3940,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[430,3912,theory(equality)])).
% cnf(3945,negated_conjecture,(ssList(esk16_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[3939,110,theory(equality)])).
% cnf(3946,negated_conjecture,(ssList(esk16_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[3945,586,theory(equality)])).
% cnf(3947,negated_conjecture,(ssList(esk16_2(esk51_0,nil))),inference(cn,[status(thm)],[3946,theory(equality)])).
% cnf(3948,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[3940,110,theory(equality)])).
% cnf(3949,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0|$false|$false),inference(rw,[status(thm)],[3948,586,theory(equality)])).
% cnf(3950,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0),inference(cn,[status(thm)],[3949,theory(equality)])).
% cnf(3987,negated_conjecture,(esk51_0=esk16_2(esk51_0,nil)|~ssList(esk16_2(esk51_0,nil))),inference(spm,[status(thm)],[185,3950,theory(equality)])).
% cnf(4047,negated_conjecture,(esk51_0=esk16_2(esk51_0,nil)|$false),inference(rw,[status(thm)],[3987,3947,theory(equality)])).
% cnf(4048,negated_conjecture,(esk51_0=esk16_2(esk51_0,nil)),inference(cn,[status(thm)],[4047,theory(equality)])).
% cnf(4062,negated_conjecture,(frontsegP(esk51_0,esk51_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[2940,4048,theory(equality)])).
% cnf(4063,negated_conjecture,(app(esk51_0,nil)=esk51_0),inference(rw,[status(thm)],[3950,4048,theory(equality)])).
% cnf(4070,negated_conjecture,(frontsegP(esk51_0,esk51_0)|$false),inference(rw,[status(thm)],[4062,586,theory(equality)])).
% cnf(4071,negated_conjecture,(frontsegP(esk51_0,esk51_0)),inference(cn,[status(thm)],[4070,theory(equality)])).
% cnf(4074,negated_conjecture,(frontsegP(app(esk51_0,X1),esk51_0)|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[189,4071,theory(equality)])).
% cnf(4083,negated_conjecture,(frontsegP(app(esk51_0,X1),esk51_0)|~ssList(X1)|$false),inference(rw,[status(thm)],[4074,586,theory(equality)])).
% cnf(4084,negated_conjecture,(frontsegP(app(esk51_0,X1),esk51_0)|~ssList(X1)),inference(cn,[status(thm)],[4083,theory(equality)])).
% cnf(4094,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[295,4063,theory(equality)])).
% cnf(4095,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[240,4063,theory(equality)])).
% cnf(4129,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[4094,110,theory(equality)])).
% cnf(4130,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[4129,586,theory(equality)])).
% cnf(4131,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0),inference(cn,[status(thm)],[4130,theory(equality)])).
% cnf(4132,negated_conjecture,(app(tl(esk51_0),nil)=tl(esk51_0)),inference(sr,[status(thm)],[4131,1371,theory(equality)])).
% cnf(4133,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[4095,110,theory(equality)])).
% cnf(4134,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[4133,586,theory(equality)])).
% cnf(4135,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[4134,theory(equality)])).
% cnf(4362,negated_conjecture,(frontsegP(X1,esk51_0)|~frontsegP(X1,app(esk51_0,X2))|~ssList(esk51_0)|~ssList(app(esk51_0,X2))|~ssList(X1)|~ssList(X2)),inference(spm,[status(thm)],[114,4084,theory(equality)])).
% cnf(4375,negated_conjecture,(frontsegP(X1,esk51_0)|~frontsegP(X1,app(esk51_0,X2))|$false|~ssList(app(esk51_0,X2))|~ssList(X1)|~ssList(X2)),inference(rw,[status(thm)],[4362,586,theory(equality)])).
% cnf(4376,negated_conjecture,(frontsegP(X1,esk51_0)|~frontsegP(X1,app(esk51_0,X2))|~ssList(app(esk51_0,X2))|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[4375,theory(equality)])).
% cnf(4680,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|app(X1,X2)=nil|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[786,256])).
% cnf(4681,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[4680,181])).
% cnf(4716,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[4681,4063,theory(equality)])).
% cnf(4744,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[4716,110,theory(equality)])).
% cnf(4745,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[4744,586,theory(equality)])).
% cnf(4746,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0),inference(cn,[status(thm)],[4745,theory(equality)])).
% cnf(4747,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0),inference(sr,[status(thm)],[4746,1371,theory(equality)])).
% cnf(5619,negated_conjecture,(frontsegP(X1,esk51_0)|~frontsegP(X1,app(esk51_0,X2))|~ssList(X1)|~ssList(X2)|~ssList(esk51_0)),inference(spm,[status(thm)],[4376,256,theory(equality)])).
% cnf(5632,negated_conjecture,(frontsegP(X1,esk51_0)|~frontsegP(X1,app(esk51_0,X2))|~ssList(X1)|~ssList(X2)|$false),inference(rw,[status(thm)],[5619,586,theory(equality)])).
% cnf(5633,negated_conjecture,(frontsegP(X1,esk51_0)|~frontsegP(X1,app(esk51_0,X2))|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[5632,theory(equality)])).
% cnf(5703,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[256,4135,theory(equality)])).
% cnf(5712,negated_conjecture,(rearsegP(app(esk51_0,X1),nil)|~ssList(esk51_0)|~ssList(app(nil,X1))|~ssList(X1)),inference(spm,[status(thm)],[826,4135,theory(equality)])).
% cnf(5745,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|$false|~ssList(X1)),inference(rw,[status(thm)],[5703,586,theory(equality)])).
% cnf(5746,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[5745,theory(equality)])).
% cnf(5767,negated_conjecture,(rearsegP(app(esk51_0,X1),nil)|$false|~ssList(app(nil,X1))|~ssList(X1)),inference(rw,[status(thm)],[5712,586,theory(equality)])).
% cnf(5768,negated_conjecture,(rearsegP(app(esk51_0,X1),nil)|~ssList(app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[5767,theory(equality)])).
% cnf(5902,negated_conjecture,(ssList(app(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[5746,1535,theory(equality)])).
% cnf(5917,negated_conjecture,(ssList(app(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[5902,586,theory(equality)])).
% cnf(5918,negated_conjecture,(ssList(app(esk51_0,esk51_0))),inference(cn,[status(thm)],[5917,theory(equality)])).
% cnf(6933,negated_conjecture,(rearsegP(app(esk51_0,esk51_0),nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[5768,1535,theory(equality)])).
% cnf(6949,negated_conjecture,(rearsegP(app(esk51_0,esk51_0),nil)|$false),inference(rw,[status(thm)],[6933,586,theory(equality)])).
% cnf(6950,negated_conjecture,(rearsegP(app(esk51_0,esk51_0),nil)),inference(cn,[status(thm)],[6949,theory(equality)])).
% cnf(6961,negated_conjecture,(ssList(esk16_2(app(esk51_0,esk51_0),nil))|~ssList(nil)|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[431,6950,theory(equality)])).
% cnf(6962,negated_conjecture,(app(esk16_2(app(esk51_0,esk51_0),nil),nil)=app(esk51_0,esk51_0)|~ssList(nil)|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[430,6950,theory(equality)])).
% cnf(6966,negated_conjecture,(ssList(esk16_2(app(esk51_0,esk51_0),nil))|$false|~ssList(app(esk51_0,esk51_0))),inference(rw,[status(thm)],[6961,110,theory(equality)])).
% cnf(6967,negated_conjecture,(ssList(esk16_2(app(esk51_0,esk51_0),nil))|$false|$false),inference(rw,[status(thm)],[6966,5918,theory(equality)])).
% cnf(6968,negated_conjecture,(ssList(esk16_2(app(esk51_0,esk51_0),nil))),inference(cn,[status(thm)],[6967,theory(equality)])).
% cnf(6969,negated_conjecture,(app(esk16_2(app(esk51_0,esk51_0),nil),nil)=app(esk51_0,esk51_0)|$false|~ssList(app(esk51_0,esk51_0))),inference(rw,[status(thm)],[6962,110,theory(equality)])).
% cnf(6970,negated_conjecture,(app(esk16_2(app(esk51_0,esk51_0),nil),nil)=app(esk51_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[6969,5918,theory(equality)])).
% cnf(6971,negated_conjecture,(app(esk16_2(app(esk51_0,esk51_0),nil),nil)=app(esk51_0,esk51_0)),inference(cn,[status(thm)],[6970,theory(equality)])).
% cnf(7008,negated_conjecture,(app(esk51_0,esk51_0)=esk16_2(app(esk51_0,esk51_0),nil)|~ssList(esk16_2(app(esk51_0,esk51_0),nil))),inference(spm,[status(thm)],[185,6971,theory(equality)])).
% cnf(7086,negated_conjecture,(app(esk51_0,esk51_0)=esk16_2(app(esk51_0,esk51_0),nil)|$false),inference(rw,[status(thm)],[7008,6968,theory(equality)])).
% cnf(7087,negated_conjecture,(app(esk51_0,esk51_0)=esk16_2(app(esk51_0,esk51_0),nil)),inference(cn,[status(thm)],[7086,theory(equality)])).
% cnf(7265,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),app(esk51_0,esk51_0))|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[2940,7087,theory(equality)])).
% cnf(7274,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),app(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[7265,5918,theory(equality)])).
% cnf(7275,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),app(esk51_0,esk51_0))),inference(cn,[status(thm)],[7274,theory(equality)])).
% cnf(7280,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),esk51_0)|~ssList(app(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[5633,7275,theory(equality)])).
% cnf(7289,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),esk51_0)|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[7280,5918,theory(equality)])).
% cnf(7290,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),esk51_0)|$false|$false),inference(rw,[status(thm)],[7289,586,theory(equality)])).
% cnf(7291,negated_conjecture,(frontsegP(app(esk51_0,esk51_0),esk51_0)),inference(cn,[status(thm)],[7290,theory(equality)])).
% cnf(7292,negated_conjecture,(ssList(esk1_2(app(esk51_0,esk51_0),esk51_0))|~ssList(esk51_0)|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[162,7291,theory(equality)])).
% cnf(7294,negated_conjecture,(app(esk51_0,esk1_2(app(esk51_0,esk51_0),esk51_0))=app(esk51_0,esk51_0)|~ssList(esk51_0)|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[161,7291,theory(equality)])).
% cnf(7299,negated_conjecture,(ssList(esk1_2(app(esk51_0,esk51_0),esk51_0))|$false|~ssList(app(esk51_0,esk51_0))),inference(rw,[status(thm)],[7292,586,theory(equality)])).
% cnf(7300,negated_conjecture,(ssList(esk1_2(app(esk51_0,esk51_0),esk51_0))|$false|$false),inference(rw,[status(thm)],[7299,5918,theory(equality)])).
% cnf(7301,negated_conjecture,(ssList(esk1_2(app(esk51_0,esk51_0),esk51_0))),inference(cn,[status(thm)],[7300,theory(equality)])).
% cnf(7306,negated_conjecture,(app(esk51_0,esk1_2(app(esk51_0,esk51_0),esk51_0))=app(esk51_0,esk51_0)|$false|~ssList(app(esk51_0,esk51_0))),inference(rw,[status(thm)],[7294,586,theory(equality)])).
% cnf(7307,negated_conjecture,(app(esk51_0,esk1_2(app(esk51_0,esk51_0),esk51_0))=app(esk51_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[7306,5918,theory(equality)])).
% cnf(7308,negated_conjecture,(app(esk51_0,esk1_2(app(esk51_0,esk51_0),esk51_0))=app(esk51_0,esk51_0)),inference(cn,[status(thm)],[7307,theory(equality)])).
% cnf(7475,negated_conjecture,(nil=esk51_0|app(esk51_0,esk51_0)!=nil|~ssList(esk1_2(app(esk51_0,esk51_0),esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[181,7308,theory(equality)])).
% cnf(7477,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|~ssList(esk1_2(app(esk51_0,esk51_0),esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[291,7308,theory(equality)])).
% cnf(7520,negated_conjecture,(nil=esk51_0|app(esk51_0,esk51_0)!=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[7475,7301,theory(equality)])).
% cnf(7521,negated_conjecture,(nil=esk51_0|app(esk51_0,esk51_0)!=nil|$false|$false),inference(rw,[status(thm)],[7520,586,theory(equality)])).
% cnf(7522,negated_conjecture,(nil=esk51_0|app(esk51_0,esk51_0)!=nil),inference(cn,[status(thm)],[7521,theory(equality)])).
% cnf(7523,negated_conjecture,(app(esk51_0,esk51_0)!=nil),inference(sr,[status(thm)],[7522,1371,theory(equality)])).
% cnf(7528,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[7477,7301,theory(equality)])).
% cnf(7529,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[7528,586,theory(equality)])).
% cnf(7530,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0),inference(cn,[status(thm)],[7529,theory(equality)])).
% cnf(7531,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)),inference(sr,[status(thm)],[7530,1371,theory(equality)])).
% cnf(7875,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[252,7531,theory(equality)])).
% cnf(7883,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[7875,5918,theory(equality)])).
% cnf(7884,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[7883,theory(equality)])).
% cnf(7885,negated_conjecture,(ssItem(hd(esk51_0))),inference(sr,[status(thm)],[7884,7523,theory(equality)])).
% cnf(8247,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[841,256])).
% cnf(8248,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[8247,181])).
% cnf(8254,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[8248,4132,theory(equality)])).
% cnf(8257,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[8254,110,theory(equality)])).
% cnf(8258,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|$false),inference(rw,[status(thm)],[8257,586,theory(equality)])).
% cnf(8259,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))),inference(cn,[status(thm)],[8258,theory(equality)])).
% cnf(8260,negated_conjecture,(ssList(tl(esk51_0))),inference(sr,[status(thm)],[8259,1371,theory(equality)])).
% cnf(20237,plain,(ssList(cons(X1,app(X2,X3)))|~ssItem(X1)|~ssList(X2)|~ssList(X3)),inference(csr,[status(thm)],[958,249])).
% cnf(20275,plain,(ssList(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[20237,1454,theory(equality)])).
% cnf(20350,plain,(ssList(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[20275,110,theory(equality)])).
% cnf(20351,plain,(ssList(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[20350,theory(equality)])).
% cnf(76221,plain,(frontsegP(cons(X1,X2),cons(X1,nil))|~ssItem(X1)|~ssList(X2)),inference(csr,[status(thm)],[3266,20351])).
% cnf(76253,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[76221,4747,theory(equality)])).
% cnf(76286,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[76253,7885,theory(equality)])).
% cnf(76287,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|$false|$false),inference(rw,[status(thm)],[76286,8260,theory(equality)])).
% cnf(76288,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[76287,theory(equality)])).
% cnf(76308,negated_conjecture,(~strictorderedP(cons(hd(esk51_0),nil))|~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))),inference(spm,[status(thm)],[1745,76288,theory(equality)])).
% cnf(77354,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[76308,217,theory(equality)])).
% cnf(77355,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))|$false),inference(rw,[status(thm)],[77354,7885,theory(equality)])).
% cnf(77356,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[77355,theory(equality)])).
% cnf(77357,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[77356,249,theory(equality)])).
% cnf(77359,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|$false|~ssList(nil)),inference(rw,[status(thm)],[77357,7885,theory(equality)])).
% cnf(77360,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|$false|$false),inference(rw,[status(thm)],[77359,110,theory(equality)])).
% cnf(77361,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[77360,theory(equality)])).
% cnf(77364,negated_conjecture,(nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))|~ssList(nil)),inference(spm,[status(thm)],[77361,108,theory(equality)])).
% cnf(77366,negated_conjecture,(nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))|$false),inference(rw,[status(thm)],[77364,110,theory(equality)])).
% cnf(77367,negated_conjecture,(nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[77366,theory(equality)])).
% cnf(77368,negated_conjecture,(cons(hd(esk51_0),nil)=nil|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[77367,249,theory(equality)])).
% cnf(77370,negated_conjecture,(cons(hd(esk51_0),nil)=nil|$false|~ssList(nil)),inference(rw,[status(thm)],[77368,7885,theory(equality)])).
% cnf(77371,negated_conjecture,(cons(hd(esk51_0),nil)=nil|$false|$false),inference(rw,[status(thm)],[77370,110,theory(equality)])).
% cnf(77372,negated_conjecture,(cons(hd(esk51_0),nil)=nil),inference(cn,[status(thm)],[77371,theory(equality)])).
% cnf(77375,negated_conjecture,(~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[228,77372,theory(equality)])).
% cnf(77640,negated_conjecture,($false|~ssList(nil)),inference(rw,[status(thm)],[77375,7885,theory(equality)])).
% cnf(77641,negated_conjecture,($false|$false),inference(rw,[status(thm)],[77640,110,theory(equality)])).
% cnf(77642,negated_conjecture,($false),inference(cn,[status(thm)],[77641,theory(equality)])).
% cnf(77643,negated_conjecture,($false),77642,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 6587
% # ...of these trivial                : 78
% # ...subsumed                        : 4253
% # ...remaining for further processing: 2256
% # Other redundant clauses eliminated : 952
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 65
% # Backward-rewritten                 : 424
% # Generated clauses                  : 30141
% # ...of the previous two non-trivial : 25670
% # Contextual simplify-reflections    : 2213
% # Paramodulations                    : 28897
% # Factorizations                     : 0
% # Equation resolutions               : 1244
% # Current number of processed clauses: 1761
% #    Positive orientable unit clauses: 336
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 55
% #    Non-unit-clauses                : 1370
% # Current number of unprocessed clauses: 17406
% # ...number of literals in the above : 118593
% # Clause-clause subsumption calls (NU) : 118900
% # Rec. Clause-clause subsumption calls : 71572
% # Unit Clause-clause subsumption calls : 475
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 361
% # Indexed BW rewrite successes       : 81
% # Backwards rewriting index:  1420 leaves,   1.38+/-1.122 terms/leaf
% # Paramod-from index:          594 leaves,   1.22+/-0.835 terms/leaf
% # Paramod-into index:         1160 leaves,   1.30+/-1.015 terms/leaf
% # -------------------------------------------------
% # User time              : 1.934 s
% # System time            : 0.064 s
% # Total time             : 1.998 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.12 CPU 3.43 WC
% FINAL PrfWatch: 3.12 CPU 3.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP15369/SWC021+1.tptp
% 
%------------------------------------------------------------------------------