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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC123+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 : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 07:06:51 EST 2010

% Result   : Theorem 13.96s
% Output   : Solution 13.96s
% 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/SystemOnTPTP26051/SWC123+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP26051/SWC123+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26051/SWC123+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 26147
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.50 CPU 8.02 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.14 CPU 10.03 WC
% PrfWatch: 11.14 CPU 12.03 WC
% # 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)=>equalelemsP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax73)).
% 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(38, axiom,![X1]:(ssList(X1)=>rearsegP(X1,nil)),file('/tmp/SRASS.s.p', ax51)).
% fof(42, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(43, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(50, 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(66, 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(73, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(74, 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))|~(neq(X2,nil)))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&equalelemsP(X5)))|(neq(X1,nil)&segmentP(X2,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))|~(neq(X2,nil)))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&equalelemsP(X5)))|(neq(X1,nil)&segmentP(X2,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))|~(neq(X2,nil)))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&equalelemsP(X5)))|(neq(X1,nil)&segmentP(X2,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))|equalelemsP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[26])).
% fof(216, plain,![X2]:(~(ssItem(X2))|equalelemsP(cons(X2,nil))),inference(variable_rename,[status(thm)],[215])).
% cnf(217,plain,(equalelemsP(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(264, plain,![X1]:(~(ssList(X1))|rearsegP(X1,nil)),inference(fof_nnf,[status(thm)],[38])).
% fof(265, plain,![X2]:(~(ssList(X2))|rearsegP(X2,nil)),inference(variable_rename,[status(thm)],[264])).
% cnf(266,plain,(rearsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[265])).
% fof(289, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[42])).
% fof(290, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[289])).
% fof(291, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[290])).
% cnf(292,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[291])).
% fof(293, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[43])).
% fof(294, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[293])).
% fof(295, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[294])).
% cnf(296,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[295])).
% fof(321, 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)],[50])).
% fof(322, 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)],[321])).
% fof(323, 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)],[322])).
% cnf(324,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[323])).
% fof(370, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(rearsegP(X1,X2))|rearsegP(app(X3,X1),X2))))),inference(fof_nnf,[status(thm)],[66])).
% fof(371, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5))))),inference(variable_rename,[status(thm)],[370])).
% fof(372, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[371])).
% cnf(373,plain,(rearsegP(app(X3,X1),X2)|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[372])).
% fof(392, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[73])).
% fof(393, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[392])).
% fof(394, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[393])).
% cnf(395,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[394])).
% fof(396, 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)],[74])).
% fof(397, 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)],[396])).
% fof(398, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk15_2(X4,X5))&app(esk15_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[397])).
% fof(399, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk15_2(X4,X5))&app(esk15_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[398])).
% fof(400, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk15_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk15_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[399])).
% cnf(401,plain,(app(esk15_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[400])).
% cnf(402,plain,(ssList(esk15_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[400])).
% cnf(403,plain,(rearsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X3,X2)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[400])).
% fof(479, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[81])).
% fof(480, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[479])).
% cnf(481,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[480])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((((X2=X4&X1=X3)&neq(X2,nil))&frontsegP(X4,X3))&equalelemsP(X3))&![X5]:((((~(ssList(X5))|~(neq(X3,X5)))|~(frontsegP(X4,X5)))|~(segmentP(X5,X3)))|~(equalelemsP(X5))))&(~(neq(X1,nil))|~(segmentP(X2,X1)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((((((X7=X9&X6=X8)&neq(X7,nil))&frontsegP(X9,X8))&equalelemsP(X8))&![X10]:((((~(ssList(X10))|~(neq(X8,X10)))|~(frontsegP(X9,X10)))|~(segmentP(X10,X8)))|~(equalelemsP(X10))))&(~(neq(X6,nil))|~(segmentP(X7,X6)))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))&frontsegP(esk51_0,esk50_0))&equalelemsP(esk50_0))&![X10]:((((~(ssList(X10))|~(neq(esk50_0,X10)))|~(frontsegP(esk51_0,X10)))|~(segmentP(X10,esk50_0)))|~(equalelemsP(X10))))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:((((((((((~(ssList(X10))|~(neq(esk50_0,X10)))|~(frontsegP(esk51_0,X10)))|~(segmentP(X10,esk50_0)))|~(equalelemsP(X10)))&((((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))&frontsegP(esk51_0,esk50_0))&equalelemsP(esk50_0)))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,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,(~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(equalelemsP(esk50_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,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(~equalelemsP(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,(ssList(esk50_0)),inference(rw,[status(thm)],[572,580,theory(equality)])).
% cnf(584,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,581,theory(equality)])).
% cnf(587,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[579,581,theory(equality)])).
% cnf(588,negated_conjecture,(~neq(esk50_0,nil)|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[576,580,theory(equality)])).
% cnf(589,negated_conjecture,(~neq(esk50_0,nil)|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[588,581,theory(equality)]),580,theory(equality)])).
% cnf(590,plain,(frontsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(591,plain,(frontsegP(nil,nil)|$false),inference(rw,[status(thm)],[590,110,theory(equality)])).
% cnf(592,plain,(frontsegP(nil,nil)),inference(cn,[status(thm)],[591,theory(equality)])).
% cnf(600,negated_conjecture,(~equalelemsP(esk50_0)|~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,esk50_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[582,140,theory(equality)])).
% cnf(601,negated_conjecture,($false|~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,esk50_0)|~ssList(esk50_0)),inference(rw,[status(thm)],[600,577,theory(equality)])).
% cnf(602,negated_conjecture,($false|$false|~neq(esk50_0,esk50_0)|~ssList(esk50_0)),inference(rw,[status(thm)],[601,578,theory(equality)])).
% cnf(603,negated_conjecture,($false|$false|~neq(esk50_0,esk50_0)|$false),inference(rw,[status(thm)],[602,583,theory(equality)])).
% cnf(604,negated_conjecture,(~neq(esk50_0,esk50_0)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(625,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[162,578,theory(equality)])).
% cnf(628,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[625,583,theory(equality)])).
% cnf(629,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|$false),inference(rw,[status(thm)],[628,584,theory(equality)])).
% cnf(630,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))),inference(cn,[status(thm)],[629,theory(equality)])).
% cnf(693,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[163,theory(equality)])).
% cnf(727,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[189,124,theory(equality)])).
% cnf(732,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[727,110,theory(equality)])).
% cnf(733,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[732,theory(equality)])).
% cnf(741,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)|~ssList(app(X1,X2))),inference(er,[status(thm)],[403,theory(equality)])).
% cnf(777,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)],[481,292,theory(equality)])).
% cnf(780,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(783,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[780,583,theory(equality)])).
% cnf(784,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|$false|$false),inference(rw,[status(thm)],[783,584,theory(equality)])).
% cnf(785,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0),inference(cn,[status(thm)],[784,theory(equality)])).
% cnf(801,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(804,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[801,110,theory(equality)])).
% cnf(805,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[804,theory(equality)])).
% cnf(812,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(nil)|~ssList(X2)),inference(spm,[status(thm)],[373,266,theory(equality)])).
% cnf(814,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|$false|~ssList(X2)),inference(rw,[status(thm)],[812,110,theory(equality)])).
% cnf(815,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[814,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,296,theory(equality)])).
% cnf(949,plain,(ssList(cons(X1,app(X2,X3)))|~ssList(X3)|~ssList(cons(X1,X2))|~ssItem(X1)|~ssList(X2)),inference(spm,[status(thm)],[256,324,theory(equality)])).
% cnf(1322,plain,(ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[162,592,theory(equality)])).
% cnf(1323,plain,(app(nil,esk1_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[161,592,theory(equality)])).
% cnf(1326,plain,(ssList(esk1_2(nil,nil))|$false),inference(rw,[status(thm)],[1322,110,theory(equality)])).
% cnf(1327,plain,(ssList(esk1_2(nil,nil))),inference(cn,[status(thm)],[1326,theory(equality)])).
% cnf(1328,plain,(app(nil,esk1_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1323,110,theory(equality)])).
% cnf(1329,plain,(app(nil,esk1_2(nil,nil))=nil),inference(cn,[status(thm)],[1328,theory(equality)])).
% cnf(1425,plain,(nil=esk1_2(nil,nil)|~ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[182,1329,theory(equality)])).
% cnf(1452,plain,(nil=esk1_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1425,1327,theory(equality)])).
% cnf(1453,plain,(nil=esk1_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1452,110,theory(equality)])).
% cnf(1454,plain,(nil=esk1_2(nil,nil)),inference(cn,[status(thm)],[1453,theory(equality)])).
% cnf(1466,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1329,1454,theory(equality)])).
% cnf(2138,negated_conjecture,(frontsegP(esk51_0,nil)|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[733,785,theory(equality)])).
% cnf(2163,negated_conjecture,(frontsegP(esk51_0,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[2138,630,theory(equality)])).
% cnf(2164,negated_conjecture,(frontsegP(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[2163,583,theory(equality)])).
% cnf(2165,negated_conjecture,(frontsegP(esk51_0,nil)),inference(cn,[status(thm)],[2164,theory(equality)])).
% cnf(2175,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[162,2165,theory(equality)])).
% cnf(2177,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,2165,theory(equality)])).
% cnf(2180,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2175,110,theory(equality)])).
% cnf(2181,negated_conjecture,(ssList(esk1_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[2180,584,theory(equality)])).
% cnf(2182,negated_conjecture,(ssList(esk1_2(esk51_0,nil))),inference(cn,[status(thm)],[2181,theory(equality)])).
% cnf(2186,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2177,110,theory(equality)])).
% cnf(2187,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0|$false|$false),inference(rw,[status(thm)],[2186,584,theory(equality)])).
% cnf(2188,negated_conjecture,(app(nil,esk1_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[2187,theory(equality)])).
% cnf(2209,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)|~ssList(esk1_2(esk51_0,nil))),inference(spm,[status(thm)],[175,2188,theory(equality)])).
% cnf(2253,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)|$false),inference(rw,[status(thm)],[2209,2182,theory(equality)])).
% cnf(2254,negated_conjecture,(esk51_0=esk1_2(esk51_0,nil)),inference(cn,[status(thm)],[2253,theory(equality)])).
% cnf(2261,negated_conjecture,(app(nil,esk51_0)=esk51_0),inference(rw,[status(thm)],[2188,2254,theory(equality)])).
% cnf(2273,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,2261,theory(equality)])).
% cnf(2304,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|~ssList(esk51_0)|~ssList(X1)),inference(rw,[status(thm)],[2273,110,theory(equality)])).
% cnf(2305,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[2304,584,theory(equality)])).
% cnf(2306,negated_conjecture,(segmentP(X1,esk51_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[2305,theory(equality)])).
% cnf(2520,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2306,185,theory(equality)])).
% cnf(2521,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(X1)|~ssList(esk51_0)),inference(rw,[status(thm)],[2520,110,theory(equality)])).
% cnf(2522,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2521,584,theory(equality)])).
% cnf(2523,negated_conjecture,(segmentP(X1,esk51_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2522,theory(equality)])).
% cnf(2524,negated_conjecture,(segmentP(esk51_0,esk51_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2523,theory(equality)])).
% cnf(2525,negated_conjecture,(segmentP(esk51_0,esk51_0)|$false),inference(rw,[status(thm)],[2524,584,theory(equality)])).
% cnf(2526,negated_conjecture,(segmentP(esk51_0,esk51_0)),inference(cn,[status(thm)],[2525,theory(equality)])).
% cnf(2527,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[171,2526,theory(equality)])).
% cnf(2528,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[170,2526,theory(equality)])).
% cnf(2529,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,2526,theory(equality)])).
% cnf(2532,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2527,584,theory(equality)])).
% cnf(2533,negated_conjecture,(ssList(esk2_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2532,theory(equality)])).
% cnf(2534,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[2528,584,theory(equality)])).
% cnf(2535,negated_conjecture,(ssList(esk3_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[2534,theory(equality)])).
% cnf(2536,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)],[2529,584,theory(equality)])).
% cnf(2537,negated_conjecture,(app(app(esk2_2(esk51_0,esk51_0),esk51_0),esk3_2(esk51_0,esk51_0))=esk51_0),inference(cn,[status(thm)],[2536,theory(equality)])).
% cnf(3257,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[693,256])).
% cnf(3271,plain,(frontsegP(cons(X1,X2),cons(X1,nil))|~ssList(X2)|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[3257,395,theory(equality)])).
% cnf(4166,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[741,256])).
% cnf(4183,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)],[4166,2537,theory(equality)])).
% cnf(4222,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)],[4183,2535,theory(equality)])).
% cnf(4223,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)],[4222,theory(equality)])).
% cnf(4247,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)],[4223,256,theory(equality)])).
% cnf(4252,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|$false|~ssList(esk2_2(esk51_0,esk51_0))),inference(rw,[status(thm)],[4247,584,theory(equality)])).
% cnf(4253,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))|$false|$false),inference(rw,[status(thm)],[4252,2533,theory(equality)])).
% cnf(4254,negated_conjecture,(rearsegP(esk51_0,esk3_2(esk51_0,esk51_0))),inference(cn,[status(thm)],[4253,theory(equality)])).
% cnf(4255,negated_conjecture,(ssList(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(esk3_2(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[402,4254,theory(equality)])).
% cnf(4256,negated_conjecture,(app(esk15_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)],[401,4254,theory(equality)])).
% cnf(4262,negated_conjecture,(ssList(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[4255,2535,theory(equality)])).
% cnf(4263,negated_conjecture,(ssList(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)))|$false|$false),inference(rw,[status(thm)],[4262,584,theory(equality)])).
% cnf(4264,negated_conjecture,(ssList(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)))),inference(cn,[status(thm)],[4263,theory(equality)])).
% cnf(4265,negated_conjecture,(app(esk15_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)],[4256,2535,theory(equality)])).
% cnf(4266,negated_conjecture,(app(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)),esk3_2(esk51_0,esk51_0))=esk51_0|$false|$false),inference(rw,[status(thm)],[4265,584,theory(equality)])).
% cnf(4267,negated_conjecture,(app(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)),esk3_2(esk51_0,esk51_0))=esk51_0),inference(cn,[status(thm)],[4266,theory(equality)])).
% cnf(4412,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)],[777,256])).
% cnf(4413,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[4412,181])).
% cnf(5892,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)],[805,785,theory(equality)])).
% cnf(5927,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[5892,630,theory(equality)])).
% cnf(5928,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[5927,583,theory(equality)])).
% cnf(5929,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[5928,theory(equality)])).
% cnf(5982,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[5929,theory(equality)])).
% cnf(5983,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[5982,584,theory(equality)])).
% cnf(5984,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[5983,theory(equality)])).
% cnf(5992,negated_conjecture,($false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[589,5984,theory(equality)])).
% cnf(5993,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[5992,theory(equality)])).
% cnf(6014,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[5993,108,theory(equality)])).
% cnf(6016,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[6014,110,theory(equality)])).
% cnf(6017,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[6016,583,theory(equality)])).
% cnf(6018,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[6017,theory(equality)])).
% cnf(6019,negated_conjecture,(segmentP(esk51_0,nil)),inference(rw,[status(thm)],[5984,6018,theory(equality)])).
% cnf(6111,negated_conjecture,(~neq(nil,nil)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[604,6018,theory(equality)]),6018,theory(equality)])).
% cnf(6112,negated_conjecture,(~equalelemsP(X1)|~segmentP(X1,nil)|~frontsegP(esk51_0,X1)|~neq(esk50_0,X1)|~ssList(X1)),inference(rw,[status(thm)],[582,6018,theory(equality)])).
% cnf(6113,negated_conjecture,(~equalelemsP(X1)|~segmentP(X1,nil)|~frontsegP(esk51_0,X1)|~neq(nil,X1)|~ssList(X1)),inference(rw,[status(thm)],[6112,6018,theory(equality)])).
% cnf(6120,negated_conjecture,(ssList(esk2_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[171,6019,theory(equality)])).
% cnf(6121,negated_conjecture,(ssList(esk3_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[170,6019,theory(equality)])).
% cnf(6122,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,6019,theory(equality)])).
% cnf(6128,negated_conjecture,(ssList(esk2_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6120,110,theory(equality)])).
% cnf(6129,negated_conjecture,(ssList(esk2_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[6128,584,theory(equality)])).
% cnf(6130,negated_conjecture,(ssList(esk2_2(esk51_0,nil))),inference(cn,[status(thm)],[6129,theory(equality)])).
% cnf(6131,negated_conjecture,(ssList(esk3_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6121,110,theory(equality)])).
% cnf(6132,negated_conjecture,(ssList(esk3_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[6131,584,theory(equality)])).
% cnf(6133,negated_conjecture,(ssList(esk3_2(esk51_0,nil))),inference(cn,[status(thm)],[6132,theory(equality)])).
% cnf(6134,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)],[6122,110,theory(equality)])).
% cnf(6135,negated_conjecture,(app(app(esk2_2(esk51_0,nil),nil),esk3_2(esk51_0,nil))=esk51_0|$false|$false),inference(rw,[status(thm)],[6134,584,theory(equality)])).
% cnf(6136,negated_conjecture,(app(app(esk2_2(esk51_0,nil),nil),esk3_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[6135,theory(equality)])).
% cnf(6236,negated_conjecture,(~equalelemsP(X1)|~frontsegP(esk51_0,X1)|~neq(nil,X1)|~ssList(X1)),inference(csr,[status(thm)],[6113,143])).
% cnf(6314,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)],[6136,185,theory(equality)])).
% cnf(6379,negated_conjecture,(app(esk2_2(esk51_0,nil),esk3_2(esk51_0,nil))=esk51_0|$false),inference(rw,[status(thm)],[6314,6130,theory(equality)])).
% cnf(6380,negated_conjecture,(app(esk2_2(esk51_0,nil),esk3_2(esk51_0,nil))=esk51_0),inference(cn,[status(thm)],[6379,theory(equality)])).
% cnf(6418,negated_conjecture,(rearsegP(esk51_0,nil)|~ssList(esk15_2(esk51_0,esk3_2(esk51_0,esk51_0)))|~ssList(esk3_2(esk51_0,esk51_0))),inference(spm,[status(thm)],[815,4267,theory(equality)])).
% cnf(6460,negated_conjecture,(rearsegP(esk51_0,nil)|$false|~ssList(esk3_2(esk51_0,esk51_0))),inference(rw,[status(thm)],[6418,4264,theory(equality)])).
% cnf(6461,negated_conjecture,(rearsegP(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[6460,2535,theory(equality)])).
% cnf(6462,negated_conjecture,(rearsegP(esk51_0,nil)),inference(cn,[status(thm)],[6461,theory(equality)])).
% cnf(6497,negated_conjecture,(ssList(esk15_2(esk51_0,nil))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[402,6462,theory(equality)])).
% cnf(6498,negated_conjecture,(app(esk15_2(esk51_0,nil),nil)=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[401,6462,theory(equality)])).
% cnf(6503,negated_conjecture,(ssList(esk15_2(esk51_0,nil))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6497,110,theory(equality)])).
% cnf(6504,negated_conjecture,(ssList(esk15_2(esk51_0,nil))|$false|$false),inference(rw,[status(thm)],[6503,584,theory(equality)])).
% cnf(6505,negated_conjecture,(ssList(esk15_2(esk51_0,nil))),inference(cn,[status(thm)],[6504,theory(equality)])).
% cnf(6506,negated_conjecture,(app(esk15_2(esk51_0,nil),nil)=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6498,110,theory(equality)])).
% cnf(6507,negated_conjecture,(app(esk15_2(esk51_0,nil),nil)=esk51_0|$false|$false),inference(rw,[status(thm)],[6506,584,theory(equality)])).
% cnf(6508,negated_conjecture,(app(esk15_2(esk51_0,nil),nil)=esk51_0),inference(cn,[status(thm)],[6507,theory(equality)])).
% cnf(6551,negated_conjecture,(esk51_0=esk15_2(esk51_0,nil)|~ssList(esk15_2(esk51_0,nil))),inference(spm,[status(thm)],[185,6508,theory(equality)])).
% cnf(6631,negated_conjecture,(esk51_0=esk15_2(esk51_0,nil)|$false),inference(rw,[status(thm)],[6551,6505,theory(equality)])).
% cnf(6632,negated_conjecture,(esk51_0=esk15_2(esk51_0,nil)),inference(cn,[status(thm)],[6631,theory(equality)])).
% cnf(6657,negated_conjecture,(app(esk51_0,nil)=esk51_0),inference(rw,[status(thm)],[6508,6632,theory(equality)])).
% cnf(6697,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[296,6657,theory(equality)])).
% cnf(6698,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[240,6657,theory(equality)])).
% cnf(6703,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[4413,6657,theory(equality)])).
% cnf(6744,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6697,110,theory(equality)])).
% cnf(6745,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[6744,584,theory(equality)])).
% cnf(6746,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0),inference(cn,[status(thm)],[6745,theory(equality)])).
% cnf(6747,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6698,110,theory(equality)])).
% cnf(6748,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[6747,584,theory(equality)])).
% cnf(6749,negated_conjecture,(app(esk51_0,X1)=app(esk51_0,app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[6748,theory(equality)])).
% cnf(6765,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[6703,110,theory(equality)])).
% cnf(6766,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[6765,584,theory(equality)])).
% cnf(6767,negated_conjecture,(cons(hd(esk51_0),tl(esk51_0))=esk51_0|nil=esk51_0),inference(cn,[status(thm)],[6766,theory(equality)])).
% cnf(7603,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)],[292,6380,theory(equality)])).
% cnf(7633,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)],[7603,6133,theory(equality)])).
% cnf(7634,negated_conjecture,(hd(esk51_0)=hd(esk2_2(esk51_0,nil))|nil=esk2_2(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[7633,6130,theory(equality)])).
% cnf(7635,negated_conjecture,(hd(esk51_0)=hd(esk2_2(esk51_0,nil))|nil=esk2_2(esk51_0,nil)),inference(cn,[status(thm)],[7634,theory(equality)])).
% cnf(8002,negated_conjecture,(nil=esk2_2(esk51_0,nil)|ssItem(hd(esk51_0))|~ssList(esk2_2(esk51_0,nil))),inference(spm,[status(thm)],[252,7635,theory(equality)])).
% cnf(8010,negated_conjecture,(nil=esk2_2(esk51_0,nil)|ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[8002,6130,theory(equality)])).
% cnf(8011,negated_conjecture,(nil=esk2_2(esk51_0,nil)|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[8010,theory(equality)])).
% cnf(8028,negated_conjecture,(app(app(nil,nil),esk3_2(esk51_0,nil))=esk51_0|ssItem(hd(esk51_0))),inference(spm,[status(thm)],[6136,8011,theory(equality)])).
% cnf(8049,negated_conjecture,(app(nil,esk3_2(esk51_0,nil))=esk51_0|ssItem(hd(esk51_0))),inference(rw,[status(thm)],[8028,1466,theory(equality)])).
% cnf(8411,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[840,256])).
% cnf(8412,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[8411,181])).
% cnf(8417,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[8412,6746,theory(equality)])).
% cnf(8420,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[8417,110,theory(equality)])).
% cnf(8421,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|$false),inference(rw,[status(thm)],[8420,584,theory(equality)])).
% cnf(8422,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))),inference(cn,[status(thm)],[8421,theory(equality)])).
% cnf(12421,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[256,6749,theory(equality)])).
% cnf(12476,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)],[6749,8049,theory(equality)])).
% cnf(12481,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|$false|~ssList(X1)),inference(rw,[status(thm)],[12421,584,theory(equality)])).
% cnf(12482,negated_conjecture,(ssList(app(esk51_0,X1))|~ssList(app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[12481,theory(equality)])).
% cnf(12546,negated_conjecture,(app(esk51_0,esk51_0)=app(esk51_0,esk3_2(esk51_0,nil))|ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[12476,6133,theory(equality)])).
% cnf(12547,negated_conjecture,(app(esk51_0,esk51_0)=app(esk51_0,esk3_2(esk51_0,nil))|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[12546,theory(equality)])).
% cnf(12655,negated_conjecture,(ssList(app(esk51_0,esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[12482,2261,theory(equality)])).
% cnf(12672,negated_conjecture,(ssList(app(esk51_0,esk51_0))|$false),inference(rw,[status(thm)],[12655,584,theory(equality)])).
% cnf(12673,negated_conjecture,(ssList(app(esk51_0,esk51_0))),inference(cn,[status(thm)],[12672,theory(equality)])).
% cnf(12785,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,12547,theory(equality)])).
% cnf(12787,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)],[292,12547,theory(equality)])).
% cnf(12848,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[12785,6133,theory(equality)])).
% cnf(12849,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil|$false|$false),inference(rw,[status(thm)],[12848,584,theory(equality)])).
% cnf(12850,negated_conjecture,(nil=esk51_0|ssItem(hd(esk51_0))|app(esk51_0,esk51_0)!=nil),inference(cn,[status(thm)],[12849,theory(equality)])).
% cnf(12855,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)],[12787,6133,theory(equality)])).
% cnf(12856,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|ssItem(hd(esk51_0))|$false|$false),inference(rw,[status(thm)],[12855,584,theory(equality)])).
% cnf(12857,negated_conjecture,(hd(app(esk51_0,esk51_0))=hd(esk51_0)|nil=esk51_0|ssItem(hd(esk51_0))),inference(cn,[status(thm)],[12856,theory(equality)])).
% cnf(18644,plain,(ssList(cons(X1,app(X2,X3)))|~ssItem(X1)|~ssList(X2)|~ssList(X3)),inference(csr,[status(thm)],[949,249])).
% cnf(18688,plain,(ssList(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[18644,1466,theory(equality)])).
% cnf(18775,plain,(ssList(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[18688,110,theory(equality)])).
% cnf(18776,plain,(ssList(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[18775,theory(equality)])).
% cnf(21890,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|esk51_0=nil|~ssList(app(esk51_0,esk51_0))),inference(spm,[status(thm)],[252,12857,theory(equality)])).
% cnf(21903,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|esk51_0=nil|$false),inference(rw,[status(thm)],[21890,12673,theory(equality)])).
% cnf(21904,negated_conjecture,(nil=app(esk51_0,esk51_0)|ssItem(hd(esk51_0))|esk51_0=nil),inference(cn,[status(thm)],[21903,theory(equality)])).
% cnf(21929,negated_conjecture,(esk51_0=nil|ssItem(hd(esk51_0))),inference(csr,[status(thm)],[21904,12850])).
% cnf(83104,plain,(frontsegP(cons(X1,X2),cons(X1,nil))|~ssItem(X1)|~ssList(X2)),inference(csr,[status(thm)],[3271,18776])).
% cnf(83134,negated_conjecture,(frontsegP(esk51_0,cons(hd(esk51_0),nil))|esk51_0=nil|~ssItem(hd(esk51_0))|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[83104,6767,theory(equality)])).
% cnf(321085,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))),inference(csr,[status(thm)],[83134,8422])).
% cnf(321086,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,cons(hd(esk51_0),nil))),inference(csr,[status(thm)],[321085,21929])).
% cnf(321116,negated_conjecture,(esk51_0=nil|~equalelemsP(cons(hd(esk51_0),nil))|~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))),inference(spm,[status(thm)],[6236,321086,theory(equality)])).
% cnf(321249,negated_conjecture,(esk51_0=nil|~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[321116,217,theory(equality)])).
% cnf(321250,negated_conjecture,(esk51_0=nil|~neq(nil,cons(hd(esk51_0),nil))|~ssList(cons(hd(esk51_0),nil))),inference(csr,[status(thm)],[321249,21929])).
% cnf(321251,negated_conjecture,(esk51_0=nil|~neq(nil,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[321250,249,theory(equality)])).
% cnf(321253,negated_conjecture,(esk51_0=nil|~neq(nil,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[321251,110,theory(equality)])).
% cnf(321254,negated_conjecture,(esk51_0=nil|~neq(nil,cons(hd(esk51_0),nil))|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[321253,theory(equality)])).
% cnf(321255,negated_conjecture,(esk51_0=nil|~neq(nil,cons(hd(esk51_0),nil))),inference(csr,[status(thm)],[321254,21929])).
% cnf(321256,negated_conjecture,(esk51_0=nil|nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))|~ssList(nil)),inference(spm,[status(thm)],[321255,108,theory(equality)])).
% cnf(321258,negated_conjecture,(esk51_0=nil|nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))|$false),inference(rw,[status(thm)],[321256,110,theory(equality)])).
% cnf(321259,negated_conjecture,(esk51_0=nil|nil=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))),inference(cn,[status(thm)],[321258,theory(equality)])).
% cnf(321260,negated_conjecture,(cons(hd(esk51_0),nil)=nil|esk51_0=nil|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[321259,249,theory(equality)])).
% cnf(321262,negated_conjecture,(cons(hd(esk51_0),nil)=nil|esk51_0=nil|~ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[321260,110,theory(equality)])).
% cnf(321263,negated_conjecture,(cons(hd(esk51_0),nil)=nil|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[321262,theory(equality)])).
% cnf(321264,negated_conjecture,(cons(hd(esk51_0),nil)=nil|esk51_0=nil),inference(csr,[status(thm)],[321263,21929])).
% cnf(321272,negated_conjecture,(esk51_0=nil|~ssItem(hd(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[228,321264,theory(equality)])).
% cnf(321649,negated_conjecture,(esk51_0=nil|~ssItem(hd(esk51_0))|$false),inference(rw,[status(thm)],[321272,110,theory(equality)])).
% cnf(321650,negated_conjecture,(esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[321649,theory(equality)])).
% cnf(322340,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[321650,21929])).
% cnf(325997,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[587,322340,theory(equality)])).
% cnf(325998,negated_conjecture,($false),inference(sr,[status(thm)],[325997,6111,theory(equality)])).
% cnf(325999,negated_conjecture,($false),325998,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 17510
% # ...of these trivial                : 129
% # ...subsumed                        : 13711
% # ...remaining for further processing: 3670
% # Other redundant clauses eliminated : 1564
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 235
% # Backward-rewritten                 : 2296
% # Generated clauses                  : 132882
% # ...of the previous two non-trivial : 117371
% # Contextual simplify-reflections    : 11172
% # Paramodulations                    : 130972
% # Factorizations                     : 0
% # Equation resolutions               : 1910
% # Current number of processed clauses: 1133
% #    Positive orientable unit clauses: 21
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 1109
% # Current number of unprocessed clauses: 31401
% # ...number of literals in the above : 265720
% # Clause-clause subsumption calls (NU) : 519689
% # Rec. Clause-clause subsumption calls : 232656
% # Unit Clause-clause subsumption calls : 3906
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 176
% # Indexed BW rewrite successes       : 106
% # Backwards rewriting index:   854 leaves,   1.62+/-1.458 terms/leaf
% # Paramod-from index:          314 leaves,   1.05+/-0.228 terms/leaf
% # Paramod-into index:          533 leaves,   1.48+/-1.326 terms/leaf
% # -------------------------------------------------
% # User time              : 7.510 s
% # System time            : 0.233 s
% # Total time             : 7.743 s
% # Maximum resident set size: 0 pages
% PrfWatch: 12.82 CPU 13.74 WC
% FINAL PrfWatch: 12.82 CPU 13.74 WC
% SZS output end Solution for /tmp/SystemOnTPTP26051/SWC123+1.tptp
% 
%------------------------------------------------------------------------------