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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC120+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 : art04.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:23 EST 2010

% Result   : Theorem 11.31s
% Output   : Solution 11.31s
% 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/SystemOnTPTP23560/SWC120+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP23560/SWC120+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23560/SWC120+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 23656
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.52 CPU 4.01 WC
% PrfWatch: 5.18 CPU 6.02 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.17 CPU 8.02 WC
% PrfWatch: 9.16 CPU 10.03 WC
% # SZS output start CNFRefutation.
% fof(1, 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(2, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(4, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(6, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X3,X2)=app(X1,X2)=>X3=X1)))),file('/tmp/SRASS.s.p', ax79)).
% fof(16, 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(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(18, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(19, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(27, axiom,![X1]:(ssList(X1)=>(frontsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax46)).
% fof(29, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(33, 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(35, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(38, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(cons(X2,X1)=X1))),file('/tmp/SRASS.s.p', ax18)).
% fof(40, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(42, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|(neq(X1,nil)&segmentP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|(neq(X1,nil)&segmentP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|(neq(X1,nil)&segmentP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, 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)],[1])).
% fof(105, 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)],[104])).
% fof(106, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk1_2(X5,X6))&(ssList(esk2_2(X5,X6))&app(app(esk1_2(X5,X6),X6),esk2_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk1_2(X5,X6))&(ssList(esk2_2(X5,X6))&app(app(esk1_2(X5,X6),X6),esk2_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[106])).
% fof(108, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk1_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk2_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk1_2(X5,X6),X6),esk2_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[107])).
% cnf(112,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[108])).
% fof(113, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(114, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, 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)],[115])).
% cnf(117,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[116])).
% cnf(119,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(120, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(121, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(123, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(124, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[124])).
% cnf(126,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[125])).
% fof(127, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[6])).
% fof(128, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[127])).
% cnf(129,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[128])).
% fof(159, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X3,X2)=app(X1,X2))|X3=X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(160, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4)))),inference(variable_rename,[status(thm)],[159])).
% fof(161, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[160])).
% cnf(162,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X3,X2)!=app(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[161])).
% fof(167, 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)],[16])).
% fof(168, 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)],[167])).
% fof(169, 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)],[168])).
% cnf(170,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[169])).
% fof(171, 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)],[17])).
% fof(172, 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)],[171])).
% fof(173, 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)],[172])).
% fof(174, 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)],[173])).
% cnf(176,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[174])).
% cnf(177,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[174])).
% fof(178, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[18])).
% fof(179, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[178])).
% cnf(180,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[179])).
% fof(181, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(182, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[181])).
% fof(183, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[182])).
% cnf(184,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[183])).
% fof(195, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[22])).
% fof(196, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[195])).
% fof(197, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[196])).
% cnf(198,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[197])).
% fof(203, 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)],[24])).
% fof(204, 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)],[203])).
% fof(205, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk4_2(X4,X5))&app(X5,esk4_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[204])).
% fof(206, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk4_2(X4,X5))&app(X5,esk4_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[205])).
% fof(207, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk4_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk4_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[206])).
% cnf(208,plain,(app(X2,esk4_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[207])).
% cnf(209,plain,(ssList(esk4_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[207])).
% cnf(210,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[207])).
% fof(223, plain,![X1]:(~(ssList(X1))|((~(frontsegP(nil,X1))|nil=X1)&(~(nil=X1)|frontsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[27])).
% fof(224, plain,![X2]:(~(ssList(X2))|((~(frontsegP(nil,X2))|nil=X2)&(~(nil=X2)|frontsegP(nil,X2)))),inference(variable_rename,[status(thm)],[223])).
% fof(225, plain,![X2]:(((~(frontsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|frontsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[224])).
% cnf(226,plain,(frontsegP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[225])).
% fof(233, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[29])).
% fof(234, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[233])).
% cnf(235,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[234])).
% fof(251, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(frontsegP(X1,X2))|frontsegP(app(X1,X3),X2))))),inference(fof_nnf,[status(thm)],[33])).
% fof(252, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5))))),inference(variable_rename,[status(thm)],[251])).
% fof(253, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[252])).
% cnf(254,plain,(frontsegP(app(X1,X3),X2)|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[253])).
% fof(259, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[35])).
% fof(260, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[259])).
% cnf(261,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[260])).
% fof(271, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(cons(X2,X1)=X1))),inference(fof_nnf,[status(thm)],[38])).
% fof(272, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(cons(X4,X3)=X3))),inference(variable_rename,[status(thm)],[271])).
% fof(273, plain,![X3]:![X4]:((~(ssItem(X4))|~(cons(X4,X3)=X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[272])).
% cnf(274,plain,(~ssList(X1)|cons(X2,X1)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[273])).
% fof(281, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[40])).
% fof(282, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[281])).
% cnf(283,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[282])).
% fof(288, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[42])).
% fof(289, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[288])).
% cnf(290,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[289])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:((~(ssList(X5))|X4=X5)|![X6]:(((~(ssList(X6))|~(tl(X4)=X6))|~(app(X3,X6)=X5))|~(neq(nil,X4)))))&(~(neq(X1,nil))|~(segmentP(X2,X1))))|(neq(X2,nil)&~(neq(X4,nil))))))))),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)&(((neq(X8,nil)&![X11]:((~(ssList(X11))|X10=X11)|![X12]:(((~(ssList(X12))|~(tl(X10)=X12))|~(app(X9,X12)=X11))|~(neq(nil,X10)))))&(~(neq(X7,nil))|~(segmentP(X8,X7))))|(neq(X8,nil)&~(neq(X10,nil))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((esk49_0=esk51_0&esk48_0=esk50_0)&(((neq(esk49_0,nil)&![X11]:((~(ssList(X11))|esk51_0=X11)|![X12]:(((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:![X12]:((((((((((((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk51_0=X11))&neq(esk49_0,nil))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:![X12]:(((((((((neq(esk49_0,nil)|((((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk51_0=X11)))&(~(neq(esk51_0,nil))|((((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk51_0=X11))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&((neq(esk49_0,nil)|(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))&(~(neq(esk51_0,nil))|(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk51_0=X1|~ssList(X1)|~neq(nil,esk51_0)|app(esk50_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,578,theory(equality)])).
% cnf(588,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[582,578,theory(equality)])).
% cnf(592,negated_conjecture,(~segmentP(esk51_0,esk48_0)|~neq(esk48_0,nil)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,578,theory(equality)])).
% cnf(593,negated_conjecture,(~segmentP(esk51_0,esk48_0)|~neq(esk48_0,nil)|$false),inference(rw,[status(thm)],[592,588,theory(equality)])).
% cnf(594,negated_conjecture,(~segmentP(esk51_0,esk48_0)|~neq(esk48_0,nil)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(600,plain,(frontsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[226,theory(equality)])).
% cnf(601,plain,(frontsegP(nil,nil)|$false),inference(rw,[status(thm)],[600,119,theory(equality)])).
% cnf(602,plain,(frontsegP(nil,nil)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(619,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[118,theory(equality)])).
% cnf(624,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[583,577,theory(equality)])).
% cnf(625,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)|$false),inference(rw,[status(thm)],[624,588,theory(equality)])).
% cnf(626,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)),inference(cn,[status(thm)],[625,theory(equality)])).
% cnf(630,negated_conjecture,(esk48_0=nil|~segmentP(esk51_0,esk48_0)|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[594,117,theory(equality)])).
% cnf(631,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|~ssList(esk51_0)|~ssList(nil)),inference(spm,[status(thm)],[626,117,theory(equality)])).
% cnf(632,negated_conjecture,(esk48_0=nil|~segmentP(esk51_0,esk48_0)|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[630,119,theory(equality)])).
% cnf(633,negated_conjecture,(esk48_0=nil|~segmentP(esk51_0,esk48_0)|$false|$false),inference(rw,[status(thm)],[632,573,theory(equality)])).
% cnf(634,negated_conjecture,(esk48_0=nil|~segmentP(esk51_0,esk48_0)),inference(cn,[status(thm)],[633,theory(equality)])).
% cnf(635,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|$false|~ssList(nil)),inference(rw,[status(thm)],[631,585,theory(equality)])).
% cnf(636,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[635,119,theory(equality)])).
% cnf(637,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[636,theory(equality)])).
% cnf(677,plain,(ssList(esk4_2(X1,X1))|~ssList(X1)),inference(spm,[status(thm)],[209,290,theory(equality)])).
% cnf(694,plain,(nil=app(X1,X2)|ssList(app(tl(X1),X2))|nil=X1|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[122,184,theory(equality)])).
% cnf(739,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[210,theory(equality)])).
% cnf(764,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)],[235,198,theory(equality)])).
% cnf(774,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[112,129,theory(equality)])).
% cnf(777,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[774,119,theory(equality)])).
% cnf(778,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[777,theory(equality)])).
% cnf(796,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[254,261,theory(equality)])).
% cnf(798,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[796,119,theory(equality)])).
% cnf(799,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[798,theory(equality)])).
% cnf(1334,plain,(ssList(esk4_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[209,602,theory(equality)])).
% cnf(1335,plain,(app(nil,esk4_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[208,602,theory(equality)])).
% cnf(1338,plain,(ssList(esk4_2(nil,nil))|$false),inference(rw,[status(thm)],[1334,119,theory(equality)])).
% cnf(1339,plain,(ssList(esk4_2(nil,nil))),inference(cn,[status(thm)],[1338,theory(equality)])).
% cnf(1340,plain,(app(nil,esk4_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1335,119,theory(equality)])).
% cnf(1341,plain,(app(nil,esk4_2(nil,nil))=nil),inference(cn,[status(thm)],[1340,theory(equality)])).
% cnf(1365,plain,(nil=esk4_2(nil,nil)|~ssList(esk4_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[177,1341,theory(equality)])).
% cnf(1392,plain,(nil=esk4_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1365,1339,theory(equality)])).
% cnf(1393,plain,(nil=esk4_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1392,119,theory(equality)])).
% cnf(1394,plain,(nil=esk4_2(nil,nil)),inference(cn,[status(thm)],[1393,theory(equality)])).
% cnf(1406,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1341,1394,theory(equality)])).
% cnf(1409,plain,(app(nil,X1)=app(nil,app(nil,X1))|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[170,1406,theory(equality)])).
% cnf(1421,plain,(app(nil,X1)=app(nil,app(nil,X1))|~ssList(X1)|$false),inference(rw,[status(thm)],[1409,119,theory(equality)])).
% cnf(1422,plain,(app(nil,X1)=app(nil,app(nil,X1))|~ssList(X1)),inference(cn,[status(thm)],[1421,theory(equality)])).
% cnf(1777,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(tl(esk51_0))|~ssList(X1)),inference(er,[status(thm)],[637,theory(equality)])).
% cnf(1778,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[1777,122,theory(equality)])).
% cnf(1779,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[1778,585,theory(equality)])).
% cnf(1780,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)),inference(cn,[status(thm)],[1779,theory(equality)])).
% cnf(1781,negated_conjecture,(esk51_0=nil|esk51_0=app(esk48_0,tl(esk51_0))|~ssList(app(esk48_0,tl(esk51_0)))),inference(er,[status(thm)],[1780,theory(equality)])).
% cnf(1782,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[1781,126,theory(equality)])).
% cnf(1783,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[1782,573,theory(equality)])).
% cnf(1784,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[1783,theory(equality)])).
% cnf(1785,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[1784,122,theory(equality)])).
% cnf(1786,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[1785,585,theory(equality)])).
% cnf(1787,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[1786,theory(equality)])).
% cnf(1792,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(tl(esk51_0),X1))|esk51_0=nil|~ssList(X1)|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[170,1787,theory(equality)])).
% cnf(1812,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(tl(esk51_0),X1))|esk51_0=nil|~ssList(X1)|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[1792,573,theory(equality)])).
% cnf(1813,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(tl(esk51_0),X1))|esk51_0=nil|~ssList(X1)|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[1812,theory(equality)])).
% cnf(2421,negated_conjecture,(app(esk48_0,app(tl(esk51_0),X1))=app(esk51_0,X1)|esk51_0=nil|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[1813,122,theory(equality)])).
% cnf(2422,negated_conjecture,(app(esk48_0,app(tl(esk51_0),X1))=app(esk51_0,X1)|esk51_0=nil|~ssList(X1)|$false),inference(rw,[status(thm)],[2421,585,theory(equality)])).
% cnf(2423,negated_conjecture,(app(esk48_0,app(tl(esk51_0),X1))=app(esk51_0,X1)|esk51_0=nil|~ssList(X1)),inference(cn,[status(thm)],[2422,theory(equality)])).
% cnf(2439,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,nil)|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[2423,180,theory(equality)])).
% cnf(2468,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,nil)|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[2439,119,theory(equality)])).
% cnf(2469,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,nil)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2468,theory(equality)])).
% cnf(2470,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,nil)|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2469,122,theory(equality)])).
% cnf(2471,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,nil)|esk51_0=nil|$false),inference(rw,[status(thm)],[2470,585,theory(equality)])).
% cnf(2472,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,nil)|esk51_0=nil),inference(cn,[status(thm)],[2471,theory(equality)])).
% cnf(2490,negated_conjecture,(app(esk51_0,nil)=esk51_0|esk51_0=nil),inference(spm,[status(thm)],[1787,2472,theory(equality)])).
% cnf(2525,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[184,2490,theory(equality)])).
% cnf(2544,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2525,119,theory(equality)])).
% cnf(2545,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[2544,585,theory(equality)])).
% cnf(2546,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0),inference(cn,[status(thm)],[2545,theory(equality)])).
% cnf(3280,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[694,126])).
% cnf(3281,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[3280,176])).
% cnf(3291,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[3281,2546,theory(equality)])).
% cnf(3303,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[3291,119,theory(equality)])).
% cnf(3304,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|$false),inference(rw,[status(thm)],[3303,585,theory(equality)])).
% cnf(3305,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))),inference(cn,[status(thm)],[3304,theory(equality)])).
% cnf(4564,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[739,126])).
% cnf(4582,negated_conjecture,(frontsegP(tl(esk51_0),tl(esk51_0))|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[4564,2546,theory(equality)])).
% cnf(4626,negated_conjecture,(frontsegP(tl(esk51_0),tl(esk51_0))|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[4582,119,theory(equality)])).
% cnf(4627,negated_conjecture,(frontsegP(tl(esk51_0),tl(esk51_0))|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[4626,theory(equality)])).
% cnf(4839,negated_conjecture,(esk51_0=nil|frontsegP(tl(esk51_0),tl(esk51_0))),inference(csr,[status(thm)],[4627,3305])).
% cnf(4840,negated_conjecture,(ssList(esk4_2(tl(esk51_0),tl(esk51_0)))|esk51_0=nil|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[209,4839,theory(equality)])).
% cnf(4841,negated_conjecture,(app(tl(esk51_0),esk4_2(tl(esk51_0),tl(esk51_0)))=tl(esk51_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[208,4839,theory(equality)])).
% cnf(4845,negated_conjecture,(esk51_0=nil|ssList(esk4_2(tl(esk51_0),tl(esk51_0)))),inference(csr,[status(thm)],[4840,3305])).
% cnf(5054,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)],[764,126])).
% cnf(5055,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[5054,176])).
% cnf(5061,plain,(nil=X1|app(X1,X2)!=tl(app(X1,X2))|~ssItem(hd(X1))|~ssList(tl(app(X1,X2)))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[274,5055,theory(equality)])).
% cnf(5246,negated_conjecture,(app(tl(esk51_0),esk4_2(tl(esk51_0),tl(esk51_0)))=tl(esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[4841,3305])).
% cnf(5257,negated_conjecture,(X1=tl(esk51_0)|esk51_0=nil|app(X1,esk4_2(tl(esk51_0),tl(esk51_0)))!=tl(esk51_0)|~ssList(tl(esk51_0))|~ssList(esk4_2(tl(esk51_0),tl(esk51_0)))|~ssList(X1)),inference(spm,[status(thm)],[162,5246,theory(equality)])).
% cnf(5268,negated_conjecture,(app(esk48_0,tl(esk51_0))=app(esk51_0,esk4_2(tl(esk51_0),tl(esk51_0)))|esk51_0=nil|~ssList(esk4_2(tl(esk51_0),tl(esk51_0)))),inference(spm,[status(thm)],[2423,5246,theory(equality)])).
% cnf(5727,plain,(segmentP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[778,theory(equality)])).
% cnf(6852,negated_conjecture,(frontsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[799,2546,theory(equality)])).
% cnf(6915,negated_conjecture,(frontsegP(tl(esk51_0),nil)|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[6852,119,theory(equality)])).
% cnf(6916,negated_conjecture,(frontsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[6915,theory(equality)])).
% cnf(7422,negated_conjecture,(esk51_0=nil|frontsegP(tl(esk51_0),nil)),inference(csr,[status(thm)],[6916,3305])).
% cnf(7423,negated_conjecture,(ssList(esk4_2(tl(esk51_0),nil))|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[209,7422,theory(equality)])).
% cnf(7425,negated_conjecture,(app(nil,esk4_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[208,7422,theory(equality)])).
% cnf(7428,negated_conjecture,(ssList(esk4_2(tl(esk51_0),nil))|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[7423,119,theory(equality)])).
% cnf(7429,negated_conjecture,(ssList(esk4_2(tl(esk51_0),nil))|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[7428,theory(equality)])).
% cnf(7432,negated_conjecture,(app(nil,esk4_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[7425,119,theory(equality)])).
% cnf(7433,negated_conjecture,(app(nil,esk4_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[7432,theory(equality)])).
% cnf(7473,negated_conjecture,(esk51_0=nil|ssList(esk4_2(tl(esk51_0),nil))),inference(csr,[status(thm)],[7429,3305])).
% cnf(7886,negated_conjecture,(app(nil,esk4_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[7433,3305])).
% cnf(7911,negated_conjecture,(app(nil,tl(esk51_0))=tl(esk51_0)|esk51_0=nil|~ssList(esk4_2(tl(esk51_0),nil))),inference(spm,[status(thm)],[1422,7886,theory(equality)])).
% cnf(7956,negated_conjecture,(app(nil,tl(esk51_0))=tl(esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[7911,7473])).
% cnf(135836,plain,(nil=X1|tl(app(X1,X2))!=app(X1,X2)|~ssList(tl(app(X1,X2)))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[5061,283])).
% cnf(135838,negated_conjecture,(nil=esk51_0|tl(esk51_0)!=esk51_0|~ssList(tl(esk51_0))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[135836,2490,theory(equality)])).
% cnf(136067,negated_conjecture,(nil=esk51_0|tl(esk51_0)!=esk51_0|~ssList(tl(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[135838,119,theory(equality)])).
% cnf(136068,negated_conjecture,(nil=esk51_0|tl(esk51_0)!=esk51_0|~ssList(tl(esk51_0))|$false|$false),inference(rw,[status(thm)],[136067,585,theory(equality)])).
% cnf(136069,negated_conjecture,(nil=esk51_0|tl(esk51_0)!=esk51_0|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[136068,theory(equality)])).
% cnf(136417,negated_conjecture,(esk51_0=nil|tl(esk51_0)!=esk51_0),inference(csr,[status(thm)],[136069,3305])).
% cnf(158168,negated_conjecture,(X1=tl(esk51_0)|esk51_0=nil|app(X1,esk4_2(tl(esk51_0),tl(esk51_0)))!=tl(esk51_0)|~ssList(tl(esk51_0))|~ssList(X1)),inference(csr,[status(thm)],[5257,677])).
% cnf(158169,negated_conjecture,(X1=tl(esk51_0)|esk51_0=nil|app(X1,esk4_2(tl(esk51_0),tl(esk51_0)))!=tl(esk51_0)|~ssList(X1)),inference(csr,[status(thm)],[158168,3305])).
% cnf(158645,negated_conjecture,(app(esk51_0,esk4_2(tl(esk51_0),tl(esk51_0)))=app(esk48_0,tl(esk51_0))|esk51_0=nil),inference(csr,[status(thm)],[5268,4845])).
% cnf(158797,negated_conjecture,(esk51_0=tl(esk51_0)|esk51_0=nil|app(esk48_0,tl(esk51_0))!=tl(esk51_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[158169,158645,theory(equality)])).
% cnf(159117,negated_conjecture,(esk51_0=tl(esk51_0)|esk51_0=nil|app(esk48_0,tl(esk51_0))!=tl(esk51_0)|$false),inference(rw,[status(thm)],[158797,585,theory(equality)])).
% cnf(159118,negated_conjecture,(esk51_0=tl(esk51_0)|esk51_0=nil|app(esk48_0,tl(esk51_0))!=tl(esk51_0)),inference(cn,[status(thm)],[159117,theory(equality)])).
% cnf(159119,negated_conjecture,(esk51_0=nil|app(esk48_0,tl(esk51_0))!=tl(esk51_0)),inference(csr,[status(thm)],[159118,136417])).
% cnf(169354,plain,(segmentP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[5727,126])).
% cnf(169376,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[169354,1787,theory(equality)])).
% cnf(169662,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[169376,573,theory(equality)])).
% cnf(169663,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[169662,theory(equality)])).
% cnf(170077,negated_conjecture,(esk51_0=nil|segmentP(esk51_0,esk48_0)),inference(csr,[status(thm)],[169663,3305])).
% cnf(170084,negated_conjecture,(esk48_0=nil|esk51_0=nil),inference(spm,[status(thm)],[634,170077,theory(equality)])).
% cnf(170172,negated_conjecture,(esk51_0=nil|app(nil,tl(esk51_0))!=tl(esk51_0)),inference(spm,[status(thm)],[159119,170084,theory(equality)])).
% cnf(170209,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[170172,7956])).
% cnf(173854,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,170209,theory(equality)])).
% cnf(173894,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[619,173854,theory(equality)])).
% cnf(173895,negated_conjecture,($false),inference(rw,[status(thm)],[173894,119,theory(equality)])).
% cnf(173896,negated_conjecture,($false),inference(cn,[status(thm)],[173895,theory(equality)])).
% cnf(173897,negated_conjecture,($false),173896,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 12466
% # ...of these trivial                : 10
% # ...subsumed                        : 9802
% # ...remaining for further processing: 2654
% # Other redundant clauses eliminated : 825
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 881
% # Backward-rewritten                 : 1034
% # Generated clauses                  : 83790
% # ...of the previous two non-trivial : 79810
% # Contextual simplify-reflections    : 9061
% # Paramodulations                    : 82745
% # Factorizations                     : 0
% # Equation resolutions               : 1045
% # Current number of processed clauses: 733
% #    Positive orientable unit clauses: 23
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 708
% # Current number of unprocessed clauses: 13055
% # ...number of literals in the above : 120596
% # Clause-clause subsumption calls (NU) : 2043322
% # Rec. Clause-clause subsumption calls : 873406
% # Unit Clause-clause subsumption calls : 117
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 6
% # Indexed BW rewrite successes       : 6
% # Backwards rewriting index:   617 leaves,   1.69+/-1.535 terms/leaf
% # Paramod-from index:          211 leaves,   1.02+/-0.136 terms/leaf
% # Paramod-into index:          384 leaves,   1.49+/-1.379 terms/leaf
% # -------------------------------------------------
% # User time              : 6.645 s
% # System time            : 0.193 s
% # Total time             : 6.838 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.18 CPU 11.28 WC
% FINAL PrfWatch: 10.18 CPU 11.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP23560/SWC120+1.tptp
% 
%------------------------------------------------------------------------------