TSTP Solution File: SWC077+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC077+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 06:59:49 EST 2010

% Result   : Theorem 4.18s
% Output   : Solution 4.18s
% 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/SystemOnTPTP17512/SWC077+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP17512/SWC077+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17512/SWC077+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 17608
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time     : 0.030 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(6, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(7, axiom,![X1]:(ssList(X1)=>(frontsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax46)).
% fof(10, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% 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))&segmentP(X2,X5))&segmentP(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))&segmentP(X2,X5))&segmentP(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))&segmentP(X2,X5))&segmentP(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(122, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[6])).
% fof(123, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[122])).
% cnf(124,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[123])).
% 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(138, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(139, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[138])).
% cnf(140,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[139])).
% 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])).
% cnf(432,plain,(rearsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X3,X2)!=X1|~ssList(X3)),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)))|~(segmentP(X2,X5)))|~(segmentP(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)))|~(segmentP(X8,X11)))|~(segmentP(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)))|~(segmentP(esk49_0,X11)))|~(segmentP(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)))|~(segmentP(esk49_0,X11)))|~(segmentP(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,(~segmentP(esk48_0,X1)|~segmentP(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)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[581,579,theory(equality)])).
% cnf(596,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[595,580,theory(equality)])).
% cnf(598,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[596,140,theory(equality)])).
% cnf(602,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[598,585,theory(equality)])).
% cnf(603,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(636,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[162,578,theory(equality)])).
% cnf(639,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[636,585,theory(equality)])).
% cnf(640,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|$false),inference(rw,[status(thm)],[639,586,theory(equality)])).
% cnf(641,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))),inference(cn,[status(thm)],[640,theory(equality)])).
% cnf(702,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[163,theory(equality)])).
% cnf(737,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[189,124,theory(equality)])).
% cnf(742,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[737,110,theory(equality)])).
% cnf(743,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[742,theory(equality)])).
% cnf(749,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)|~ssList(app(X1,X2))),inference(er,[status(thm)],[432,theory(equality)])).
% cnf(785,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(788,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,578,theory(equality)])).
% cnf(791,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[788,585,theory(equality)])).
% cnf(792,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|$false|$false),inference(rw,[status(thm)],[791,586,theory(equality)])).
% cnf(793,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0),inference(cn,[status(thm)],[792,theory(equality)])).
% cnf(809,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[172,175,theory(equality)])).
% cnf(812,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[809,110,theory(equality)])).
% cnf(813,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[812,theory(equality)])).
% cnf(822,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(nil)|~ssList(X2)),inference(spm,[status(thm)],[402,274,theory(equality)])).
% cnf(824,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|$false|~ssList(X2)),inference(rw,[status(thm)],[822,110,theory(equality)])).
% cnf(825,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[824,theory(equality)])).
% cnf(840,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(957,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(1330,plain,(ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[162,591,theory(equality)])).
% cnf(1331,plain,(app(nil,esk1_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[161,591,theory(equality)])).
% cnf(1334,plain,(ssList(esk1_2(nil,nil))|$false),inference(rw,[status(thm)],[1330,110,theory(equality)])).
% cnf(1335,plain,(ssList(esk1_2(nil,nil))),inference(cn,[status(thm)],[1334,theory(equality)])).
% cnf(1336,plain,(app(nil,esk1_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1331,110,theory(equality)])).
% cnf(1337,plain,(app(nil,esk1_2(nil,nil))=nil),inference(cn,[status(thm)],[1336,theory(equality)])).
% cnf(1372,negated_conjecture,(nil=esk50_0|esk51_0!=nil|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[181,793,theory(equality)])).
% cnf(1386,negated_conjecture,(nil=esk50_0|esk51_0!=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[1372,641,theory(equality)])).
% cnf(1387,negated_conjecture,(nil=esk50_0|esk51_0!=nil|$false|$false),inference(rw,[status(thm)],[1386,585,theory(equality)])).
% cnf(1388,negated_conjecture,(nil=esk50_0|esk51_0!=nil),inference(cn,[status(thm)],[1387,theory(equality)])).
% cnf(1429,negated_conjecture,(esk51_0!=nil),inference(csr,[status(thm)],[1388,584])).
% cnf(1437,plain,(nil=esk1_2(nil,nil)|~ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[182,1337,theory(equality)])).
% cnf(1464,plain,(nil=esk1_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1437,1335,theory(equality)])).
% cnf(1465,plain,(nil=esk1_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1464,110,theory(equality)])).
% cnf(1466,plain,(nil=esk1_2(nil,nil)),inference(cn,[status(thm)],[1465,theory(equality)])).
% cnf(1478,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1337,1466,theory(equality)])).
% cnf(2151,negated_conjecture,(frontsegP(esk51_0,nil)|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[743,793,theory(equality)])).
% cnf(2176,negated_conjecture,(frontsegP(esk51_0,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[2151,641,theory(equality)])).
% cnf(2177,negated_conjecture,(frontsegP(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[2176,585,theory(equality)])).
% cnf(2178,negated_conjecture,(frontsegP(esk51_0,nil)),inference(cn,[status(thm)],[2177,theory(equality)])).
% cnf(2188,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[162,2178,theory(equality)])).
% cnf(2190,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,2178,theory(equality)])).
% cnf(2193,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2188,110,theory(equality)])).
% cnf(2194,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[2193,586,theory(equality)])).
% cnf(2195,negated_conjecture,(ssList(esk1_2(esk51_0,nil))),inference(cn,[status(thm)],[2194,theory(equality)])).
% cnf(2200,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2190,110,theory(equality)])).
% cnf(2201,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|$false|$false),inference(rw,[status(thm)],[2200,586,theory(equality)])).
% cnf(2202,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[2201,theory(equality)])).
% cnf(2222,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)|~ssList(esk1_2(esk51_0,nil))),inference(spm,[status(thm)],[175,2202,theory(equality)])).
% cnf(2266,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)|$false),inference(rw,[status(thm)],[2222,2195,theory(equality)])).
% cnf(2267,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)),inference(cn,[status(thm)],[2266,theory(equality)])).
% cnf(2274,negated_conjecture,(app(nil,esk51_0)=esk51_0),inference(rw,[status(thm)],[2202,2267,theory(equality)])).
% cnf(2286,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,2274,theory(equality)])).
% cnf(2317,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|~ssList(esk51_0)|~ssList(X1)),inference(rw,[status(thm)],[2286,110,theory(equality)])).
% cnf(2318,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[2317,586,theory(equality)])).
% cnf(2319,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[2318,theory(equality)])).
% cnf(2534,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2319,185,theory(equality)])).
% cnf(2535,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(X1)|~ssList(esk51_0)),inference(rw,[status(thm)],[2534,110,theory(equality)])).
% cnf(2536,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2535,586,theory(equality)])).
% cnf(2537,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2536,theory(equality)])).
% cnf(2539,negated_conjecture,(segmentP(esk51_0,esk51_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2537,theory(equality)])).
% cnf(2540,negated_conjecture,(segmentP(esk51_0,esk51_0)|$false),inference(rw,[status(thm)],[2539,586,theory(equality)])).
% cnf(2541,negated_conjecture,(segmentP(esk51_0,esk51_0)),inference(cn,[status(thm)],[2540,theory(equality)])).
% cnf(2542,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[171,2541,theory(equality)])).
% cnf(2543,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[170,2541,theory(equality)])).
% cnf(2544,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,2541,theory(equality)])).
% cnf(2547,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2542,586,theory(equality)])).
% cnf(2548,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2547,theory(equality)])).
% cnf(2549,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2543,586,theory(equality)])).
% cnf(2550,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2549,theory(equality)])).
% cnf(2551,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)],[2544,586,theory(equality)])).
% cnf(2552,negated_conjecture,(app(app(esk2_2(esk51_0,esk51_0),esk51_0),esk3_2(esk51_0,esk51_0))=esk51_0),inference(cn,[status(thm)],[2551,theory(equality)])).
% cnf(3397,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[702,256])).
% cnf(3412,plain,(frontsegP(cons(X1,X2),cons(X1,nil))|~ssList(X2)|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[3397,424,theory(equality)])).
% cnf(4185,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[749,256])).
% cnf(4202,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|~ssList(app(esk2_2(esk51_0,esk51_0),esk51_0))|~ssList(esk3_2(esk51_0,esk51_0))),inference(spm,[status(thm)],[4185,2552,theory(equality)])).
% cnf(4241,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|~ssList(app(esk2_2(esk51_0,esk51_0),esk51_0))|$false),inference(rw,[status(thm)],[4202,2550,theory(equality)])).
% cnf(4242,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|~ssList(app(esk2_2(esk51_0,esk51_0),esk51_0))),inference(cn,[status(thm)],[4241,theory(equality)])).
% cnf(4266,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)|~ssList(esk2_2(esk51_0,esk51_0))),inference(spm,[status(thm)],[4242,256,theory(equality)])).
% cnf(4271,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|$false|~ssList(esk2_2(esk51_0,esk51_0))),inference(rw,[status(thm)],[4266,586,theory(equality)])).
% cnf(4272,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|$false|$false),inference(rw,[status(thm)],[4271,2548,theory(equality)])).
% cnf(4273,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[4272,theory(equality)])).
% cnf(4274,negated_conjecture,(ssList(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[431,4273,theory(equality)])).
% cnf(4275,negated_conjecture,(app(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)),esk3_2(esk51_0,esk51_0))=esk51_0|~ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[430,4273,theory(equality)])).
% cnf(4281,negated_conjecture,(ssList(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[4274,2550,theory(equality)])).
% cnf(4282,negated_conjecture,(ssList(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|$false),inference(rw,[status(thm)],[4281,586,theory(equality)])).
% cnf(4283,negated_conjecture,(ssList(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)))),inference(cn,[status(thm)],[4282,theory(equality)])).
% cnf(4284,negated_conjecture,(app(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)),esk3_2(esk51_0,esk51_0))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[4275,2550,theory(equality)])).
% cnf(4285,negated_conjecture,(app(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)),esk3_2(esk51_0,esk51_0))=esk51_0|$false|$false),inference(rw,[status(thm)],[4284,586,theory(equality)])).
% cnf(4286,negated_conjecture,(app(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)),esk3_2(esk51_0,esk51_0))=esk51_0),inference(cn,[status(thm)],[4285,theory(equality)])).
% cnf(4439,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)],[785,256])).
% cnf(4440,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[4439,181])).
% cnf(5989,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[813,793,theory(equality)])).
% cnf(6025,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[5989,641,theory(equality)])).
% cnf(6026,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[6025,585,theory(equality)])).
% cnf(6027,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[6026,theory(equality)])).
% cnf(6082,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[6027,theory(equality)])).
% cnf(6083,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[6082,586,theory(equality)])).
% cnf(6084,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[6083,theory(equality)])).
% cnf(6092,negated_conjecture,($false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[603,6084,theory(equality)])).
% cnf(6093,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[6092,theory(equality)])).
% cnf(6114,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[6093,108,theory(equality)])).
% cnf(6116,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[6114,110,theory(equality)])).
% cnf(6117,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[6116,585,theory(equality)])).
% cnf(6118,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[6117,theory(equality)])).
% cnf(6119,negated_conjecture,(segmentP(esk51_0,nil)),inference(rw,[status(thm)],[6084,6118,theory(equality)])).
% cnf(6216,negated_conjecture,(~strictorderedP(X1)|~segmentP(X1,nil)|~frontsegP(esk51_0,X1)|~neq(esk50_0,X1)|~ssList(X1)),inference(rw,[status(thm)],[582,6118,theory(equality)])).
% cnf(6217,negated_conjecture,(~strictorderedP(X1)|~segmentP(X1,nil)|~frontsegP(esk51_0,X1)|~neq(nil,X1)|~ssList(X1)),inference(rw,[status(thm)],[6216,6118,theory(equality)])).
% cnf(6229,negated_conjecture,(ssList(esk2_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[171,6119,theory(equality)])).
% cnf(6230,negated_conjecture,(ssList(esk3_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[170,6119,theory(equality)])).
% cnf(6231,negated_conjecture,(app(app(esk2_2(esk51_0,nil),nil),esk3_2(esk51_0,nil))=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[169,6119,theory(equality)])).
% cnf(6240,negated_conjecture,(ssList(esk2_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6229,110,theory(equality)])).
% cnf(6241,negated_conjecture,(ssList(esk2_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[6240,586,theory(equality)])).
% cnf(6242,negated_conjecture,(ssList(esk2_2(esk51_0,nil))),inference(cn,[status(thm)],[6241,theory(equality)])).
% cnf(6243,negated_conjecture,(ssList(esk3_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6230,110,theory(equality)])).
% cnf(6244,negated_conjecture,(ssList(esk3_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[6243,586,theory(equality)])).
% cnf(6245,negated_conjecture,(ssList(esk3_2(esk51_0,nil))),inference(cn,[status(thm)],[6244,theory(equality)])).
% cnf(6246,negated_conjecture,(app(app(esk2_2(esk51_0,nil),nil),esk3_2(esk51_0,nil))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6231,110,theory(equality)])).
% cnf(6247,negated_conjecture,(app(app(esk2_2(esk51_0,nil),nil),esk3_2(esk51_0,nil))=esk51_0|$false|$false),inference(rw,[status(thm)],[6246,586,theory(equality)])).
% cnf(6248,negated_conjecture,(app(app(esk2_2(esk51_0,nil),nil),esk3_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[6247,theory(equality)])).
% cnf(6363,negated_conjecture,(~strictorderedP(X1)|~frontsegP(esk51_0,X1)|~neq(nil,X1)|~ssList(X1)),inference(csr,[status(thm)],[6217,143])).
% cnf(6438,negated_conjecture,(app(esk2_2(esk51_0,nil),esk3_2(esk51_0,nil))=esk51_0|~ssList(esk2_2(esk51_0,nil))),inference(spm,[status(thm)],[6248,185,theory(equality)])).
% cnf(6503,negated_conjecture,(app(esk2_2(esk51_0,nil),esk3_2(esk51_0,nil))=esk51_0|$false),inference(rw,[status(thm)],[6438,6242,theory(equality)])).
% cnf(6504,negated_conjecture,(app(esk2_2(esk51_0,nil),esk3_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[6503,theory(equality)])).
% cnf(6640,negated_conjecture,(rearsegP(esk51_0,nil)|~ssList(esk16_2(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(esk3_2(esk51_0,esk51_0))),inference(spm,[status(thm)],[825,4286,theory(equality)])).
% cnf(6682,negated_conjecture,(rearsegP(esk51_0,nil)|$false|~ssList(esk3_2(esk51_0,esk51_0))),inference(rw,[status(thm)],[6640,4283,theory(equality)])).
% cnf(6683,negated_conjecture,(rearsegP(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[6682,2550,theory(equality)])).
% cnf(6684,negated_conjecture,(rearsegP(esk51_0,nil)),inference(cn,[status(thm)],[6683,theory(equality)])).
% cnf(6721,negated_conjecture,(ssList(esk16_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[431,6684,theory(equality)])).
% cnf(6722,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[430,6684,theory(equality)])).
% cnf(6727,negated_conjecture,(ssList(esk16_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6721,110,theory(equality)])).
% cnf(6728,negated_conjecture,(ssList(esk16_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[6727,586,theory(equality)])).
% cnf(6729,negated_conjecture,(ssList(esk16_2(esk51_0,nil))),inference(cn,[status(thm)],[6728,theory(equality)])).
% cnf(6730,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6722,110,theory(equality)])).
% cnf(6731,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0|$false|$false),inference(rw,[status(thm)],[6730,586,theory(equality)])).
% cnf(6732,negated_conjecture,(app(esk16_2(esk51_0,nil),nil)=esk51_0),inference(cn,[status(thm)],[6731,theory(equality)])).
% cnf(6776,negated_conjecture,(esk51_0=esk16_2(esk51_0,nil)|~ssList(esk16_2(esk51_0,nil))),inference(spm,[status(thm)],[185,6732,theory(equality)])).
% cnf(6856,negated_conjecture,(esk51_0=esk16_2(esk51_0,nil)|$false),inference(rw,[status(thm)],[6776,6729,theory(equality)])).
% cnf(6857,negated_conjecture,(esk51_0=esk16_2(esk51_0,nil)),inference(cn,[status(thm)],[6856,theory(equality)])).
% cnf(6879,negated_conjecture,(app(esk51_0,nil)=esk51_0),inference(rw,[status(thm)],[6732,6857,theory(equality)])).
% cnf(6922,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[295,6879,theory(equality)])).
% cnf(6923,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[240,6879,theory(equality)])).
% cnf(6928,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[4440,6879,theory(equality)])).
% cnf(6963,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6922,110,theory(equality)])).
% cnf(6964,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[6963,586,theory(equality)])).
% cnf(6965,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0),inference(cn,[status(thm)],[6964,theory(equality)])).
% cnf(6966,negated_conjecture,(app(tl(esk51_0),nil)=tl(esk51_0)),inference(sr,[status(thm)],[6965,1429,theory(equality)])).
% cnf(6967,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6923,110,theory(equality)])).
% cnf(6968,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[6967,586,theory(equality)])).
% cnf(6969,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[6968,theory(equality)])).
% cnf(6985,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6928,110,theory(equality)])).
% cnf(6986,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[6985,586,theory(equality)])).
% cnf(6987,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0),inference(cn,[status(thm)],[6986,theory(equality)])).
% cnf(6988,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0),inference(sr,[status(thm)],[6987,1429,theory(equality)])).
% cnf(7772,negated_conjecture,(hd(esk51_0)=hd(esk2_2(esk51_0,nil))|nil=esk2_2(esk51_0,nil)|~ssList(esk3_2(esk51_0,nil))|~ssList(esk2_2(esk51_0,nil))),inference(spm,[status(thm)],[291,6504,theory(equality)])).
% cnf(7802,negated_conjecture,(hd(esk51_0)=hd(esk2_2(esk51_0,nil))|nil=esk2_2(esk51_0,nil)|$false|~ssList(esk2_2(esk51_0,nil))),inference(rw,[status(thm)],[7772,6245,theory(equality)])).
% cnf(7803,negated_conjecture,(hd(esk51_0)=hd(esk2_2(esk51_0,nil))|nil=esk2_2(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[7802,6242,theory(equality)])).
% cnf(7804,negated_conjecture,(hd(esk51_0)=hd(esk2_2(esk51_0,nil))|nil=esk2_2(esk51_0,nil)),inference(cn,[status(thm)],[7803,theory(equality)])).
% cnf(8016,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[840,256])).
% cnf(8017,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[8016,181])).
% cnf(8022,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[8017,6966,theory(equality)])).
% cnf(8025,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[8022,110,theory(equality)])).
% cnf(8026,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|$false),inference(rw,[status(thm)],[8025,586,theory(equality)])).
% cnf(8027,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))),inference(cn,[status(thm)],[8026,theory(equality)])).
% cnf(8028,negated_conjecture,(ssList(tl(esk51_0))),inference(sr,[status(thm)],[8027,1429,theory(equality)])).
% cnf(8298,negated_conjecture,(nil=esk2_2(esk51_0,nil)|ssItem(hd(esk51_0))|~ssList(esk2_2(esk51_0,nil))),inference(spm,[status(thm)],[252,7804,theory(equality)])).
% cnf(8307,negated_conjecture,(nil=esk2_2(esk51_0,nil)|ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[8298,6242,theory(equality)])).
% cnf(8308,negated_conjecture,(nil=esk2_2(esk51_0,nil)|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[8307,theory(equality)])).
% cnf(8326,negated_conjecture,(app(app(nil,nil),esk3_2(esk51_0,nil))=esk51_0|ssItem(hd(esk51_0))),inference(spm,[status(thm)],[6248,8308,theory(equality)])).
% cnf(8347,negated_conjecture,(app(nil,esk3_2(esk51_0,nil))=esk51_0|ssItem(hd(esk51_0))),inference(rw,[status(thm)],[8326,1478,theory(equality)])).
% cnf(13496,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[256,6969,theory(equality)])).
% cnf(13552,negated_conjecture,(app(esk51_0,esk51_0)=app(esk51_0,esk3_2(esk51_0,nil))|ssItem(hd(esk51_0))|~ssList(esk3_2(esk51_0,nil))),inference(spm,[status(thm)],[6969,8347,theory(equality)])).
% cnf(13558,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|$false|~ssList(X1)),inference(rw,[status(thm)],[13496,586,theory(equality)])).
% cnf(13559,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[13558,theory(equality)])).
% cnf(13628,negated_conjecture,(app(esk51_0,esk51_0)=app(esk51_0,esk3_2(esk51_0,nil))|ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[13552,6245,theory(equality)])).
% cnf(13629,negated_conjecture,(app(esk51_0,esk51_0)=app(esk51_0,esk3_2(esk51_0,nil))|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[13628,theory(equality)])).
% cnf(13753,negated_conjecture,(ssList(app(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[13559,2274,theory(equality)])).
% cnf(13771,negated_conjecture,(ssList(app(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[13753,586,theory(equality)])).
% cnf(13772,negated_conjecture,(ssList(app(esk51_0,esk51_0))),inference(cn,[status(thm)],[13771,theory(equality)])).
% cnf(13896,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil|~ssList(esk3_2(esk51_0,nil))|~ssList(esk51_0)),inference(spm,[status(thm)],[181,13629,theory(equality)])).
% cnf(13898,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|ssItem(hd(esk51_0))|~ssList(esk3_2(esk51_0,nil))|~ssList(esk51_0)),inference(spm,[status(thm)],[291,13629,theory(equality)])).
% cnf(13959,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[13896,6245,theory(equality)])).
% cnf(13960,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil|$false|$false),inference(rw,[status(thm)],[13959,586,theory(equality)])).
% cnf(13961,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil),inference(cn,[status(thm)],[13960,theory(equality)])).
% cnf(13962,negated_conjecture,(ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil),inference(sr,[status(thm)],[13961,1429,theory(equality)])).
% cnf(13967,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|ssItem(hd(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[13898,6245,theory(equality)])).
% cnf(13968,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|ssItem(hd(esk51_0))|$false|$false),inference(rw,[status(thm)],[13967,586,theory(equality)])).
% cnf(13969,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[13968,theory(equality)])).
% cnf(13970,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|ssItem(hd(esk51_0))),inference(sr,[status(thm)],[13969,1429,theory(equality)])).
% cnf(18844,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[252,13970,theory(equality)])).
% cnf(18856,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[18844,13772,theory(equality)])).
% cnf(18857,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[18856,theory(equality)])).
% cnf(18881,negated_conjecture,(ssItem(hd(esk51_0))),inference(csr,[status(thm)],[18857,13962])).
% cnf(19087,plain,(ssList(cons(X1,app(X2,X3)))|~ssItem(X1)|~ssList(X2)|~ssList(X3)),inference(csr,[status(thm)],[957,249])).
% cnf(19120,plain,(ssList(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[19087,1478,theory(equality)])).
% cnf(19179,plain,(ssList(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[19120,110,theory(equality)])).
% cnf(19180,plain,(ssList(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[19179,theory(equality)])).
% cnf(74412,plain,(frontsegP(cons(X1,X2),cons(X1,nil))|~ssItem(X1)|~ssList(X2)),inference(csr,[status(thm)],[3412,19180])).
% cnf(74442,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[74412,6988,theory(equality)])).
% cnf(74474,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[74442,18881,theory(equality)])).
% cnf(74475,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|$false|$false),inference(rw,[status(thm)],[74474,8028,theory(equality)])).
% cnf(74476,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[74475,theory(equality)])).
% cnf(74493,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)],[6363,74476,theory(equality)])).
% cnf(74954,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[74493,217,theory(equality)])).
% cnf(74955,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))|$false),inference(rw,[status(thm)],[74954,18881,theory(equality)])).
% cnf(74956,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[74955,theory(equality)])).
% cnf(74957,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[74956,249,theory(equality)])).
% cnf(74959,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|$false|~ssList(nil)),inference(rw,[status(thm)],[74957,18881,theory(equality)])).
% cnf(74960,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))|$false|$false),inference(rw,[status(thm)],[74959,110,theory(equality)])).
% cnf(74961,negated_conjecture,(~neq(nil,cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[74960,theory(equality)])).
% cnf(74964,negated_conjecture,(nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))|~ssList(nil)),inference(spm,[status(thm)],[74961,108,theory(equality)])).
% cnf(74966,negated_conjecture,(nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))|$false),inference(rw,[status(thm)],[74964,110,theory(equality)])).
% cnf(74967,negated_conjecture,(nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[74966,theory(equality)])).
% cnf(74968,negated_conjecture,(cons(hd(esk51_0),nil)=nil|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[74967,249,theory(equality)])).
% cnf(74970,negated_conjecture,(cons(hd(esk51_0),nil)=nil|$false|~ssList(nil)),inference(rw,[status(thm)],[74968,18881,theory(equality)])).
% cnf(74971,negated_conjecture,(cons(hd(esk51_0),nil)=nil|$false|$false),inference(rw,[status(thm)],[74970,110,theory(equality)])).
% cnf(74972,negated_conjecture,(cons(hd(esk51_0),nil)=nil),inference(cn,[status(thm)],[74971,theory(equality)])).
% cnf(74975,negated_conjecture,(~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[228,74972,theory(equality)])).
% cnf(75239,negated_conjecture,($false|~ssList(nil)),inference(rw,[status(thm)],[74975,18881,theory(equality)])).
% cnf(75240,negated_conjecture,($false|$false),inference(rw,[status(thm)],[75239,110,theory(equality)])).
% cnf(75241,negated_conjecture,($false),inference(cn,[status(thm)],[75240,theory(equality)])).
% cnf(75242,negated_conjecture,($false),75241,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 6449
% # ...of these trivial                : 88
% # ...subsumed                        : 4152
% # ...remaining for further processing: 2209
% # Other redundant clauses eliminated : 936
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 85
% # Backward-rewritten                 : 484
% # Generated clauses                  : 29245
% # ...of the previous two non-trivial : 24909
% # Contextual simplify-reflections    : 2310
% # Paramodulations                    : 28023
% # Factorizations                     : 0
% # Equation resolutions               : 1222
% # Current number of processed clauses: 1634
% #    Positive orientable unit clauses: 281
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 49
% #    Non-unit-clauses                : 1304
% # Current number of unprocessed clauses: 16185
% # ...number of literals in the above : 112663
% # Clause-clause subsumption calls (NU) : 115087
% # Rec. Clause-clause subsumption calls : 67950
% # Unit Clause-clause subsumption calls : 657
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 259
% # Indexed BW rewrite successes       : 104
% # Backwards rewriting index:  1288 leaves,   1.38+/-1.115 terms/leaf
% # Paramod-from index:          544 leaves,   1.19+/-0.731 terms/leaf
% # Paramod-into index:         1031 leaves,   1.29+/-0.988 terms/leaf
% # -------------------------------------------------
% # User time              : 1.855 s
% # System time            : 0.055 s
% # Total time             : 1.910 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.04 CPU 3.41 WC
% FINAL PrfWatch: 3.04 CPU 3.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP17512/SWC077+1.tptp
% 
%------------------------------------------------------------------------------