%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC253+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:29:26 EST 2010
% Result : Theorem 1.46s
% Output : Solution 1.46s
% 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/SystemOnTPTP8143/SWC253+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8143/SWC253+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8143/SWC253+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 8239
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(3, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(5, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(8, 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(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(12, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(13, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(17, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(19, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(26, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(30, 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(31, 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(33, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(35, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(36, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(cons(X2,X1)=X1))),file('/tmp/SRASS.s.p', ax18)).
% fof(38, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(43, axiom,![X1]:(ssList(X1)=>rearsegP(X1,nil)),file('/tmp/SRASS.s.p', ax51)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|singletonP(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))))|singletonP(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))))|singletonP(X1))&(~(neq(X2,nil))|neq(X4,nil))))))))),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(109,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(111, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(112, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(114, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(115, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[115])).
% cnf(117,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[116])).
% fof(118, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[5])).
% fof(119, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[118])).
% cnf(120,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[119])).
% fof(128, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X3,X2)=app(X1,X2))|X3=X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(129, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4)))),inference(variable_rename,[status(thm)],[128])).
% fof(130, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[129])).
% cnf(131,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X3,X2)!=app(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[130])).
% fof(140, 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)],[11])).
% fof(141, 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)],[140])).
% fof(142, 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)],[141])).
% fof(143, 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)],[142])).
% cnf(145,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[143])).
% fof(147, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(148, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[147])).
% cnf(149,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(150, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(151, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[151])).
% cnf(153,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[152])).
% fof(168, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[17])).
% fof(169, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[168])).
% fof(170, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk2_1(X3))&cons(esk2_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[169])).
% fof(171, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk2_1(X3))&cons(esk2_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[170])).
% fof(172, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk2_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk2_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[171])).
% cnf(175,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[172])).
% fof(180, 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)],[19])).
% fof(181, 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)],[180])).
% fof(182, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[181])).
% fof(183, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[182])).
% fof(184, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk3_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk3_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[183])).
% cnf(185,plain,(app(X2,esk3_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[184])).
% cnf(186,plain,(ssList(esk3_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[184])).
% fof(188, 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)],[20])).
% fof(189, 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)],[188])).
% fof(190, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk4_2(X4,X5))&app(esk4_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[189])).
% fof(191, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk4_2(X4,X5))&app(esk4_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[190])).
% fof(192, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk4_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk4_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[191])).
% cnf(193,plain,(app(esk4_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[192])).
% cnf(194,plain,(ssList(esk4_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[192])).
% cnf(195,plain,(rearsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X3,X2)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[192])).
% fof(224, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[26])).
% fof(225, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[224])).
% cnf(226,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[225])).
% fof(242, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(frontsegP(X1,X2))|frontsegP(app(X1,X3),X2))))),inference(fof_nnf,[status(thm)],[30])).
% fof(243, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5))))),inference(variable_rename,[status(thm)],[242])).
% fof(244, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(frontsegP(X4,X5))|frontsegP(app(X4,X6),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[243])).
% cnf(245,plain,(frontsegP(app(X1,X3),X2)|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[244])).
% fof(246, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(rearsegP(X1,X2))|rearsegP(app(X3,X1),X2))))),inference(fof_nnf,[status(thm)],[31])).
% fof(247, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5))))),inference(variable_rename,[status(thm)],[246])).
% fof(248, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(rearsegP(X4,X5))|rearsegP(app(X6,X4),X5)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[247])).
% cnf(249,plain,(rearsegP(app(X3,X1),X2)|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[248])).
% fof(254, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[33])).
% fof(255, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[254])).
% cnf(256,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[255])).
% fof(262, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[35])).
% fof(263, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[262])).
% fof(264, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[263])).
% cnf(265,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[264])).
% fof(266, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(cons(X2,X1)=X1))),inference(fof_nnf,[status(thm)],[36])).
% fof(267, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(cons(X4,X3)=X3))),inference(variable_rename,[status(thm)],[266])).
% fof(268, plain,![X3]:![X4]:((~(ssItem(X4))|~(cons(X4,X3)=X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[267])).
% cnf(269,plain,(~ssList(X1)|cons(X2,X1)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[268])).
% fof(276, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[38])).
% fof(277, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[276])).
% cnf(278,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[277])).
% fof(293, plain,![X1]:(~(ssList(X1))|rearsegP(X1,nil)),inference(fof_nnf,[status(thm)],[43])).
% fof(294, plain,![X2]:(~(ssList(X2))|rearsegP(X2,nil)),inference(variable_rename,[status(thm)],[293])).
% cnf(295,plain,(rearsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[294])).
% 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)))))&~(singletonP(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)))))&~(singletonP(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)))))&~(singletonP(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))&~(singletonP(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)|~(singletonP(esk48_0)))&(~(neq(esk51_0,nil))|~(singletonP(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,(~singletonP(esk48_0)|~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(589,negated_conjecture,(~singletonP(esk48_0)|$false),inference(rw,[status(thm)],[579,588,theory(equality)])).
% cnf(590,negated_conjecture,(~singletonP(esk48_0)),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(617,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(622,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(cons(X1,nil))),inference(er,[status(thm)],[175,theory(equality)])).
% cnf(623,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(624,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)],[623,588,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)),inference(cn,[status(thm)],[624,theory(equality)])).
% cnf(647,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)],[625,108,theory(equality)])).
% cnf(648,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)],[647,585,theory(equality)])).
% cnf(649,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)],[648,110,theory(equality)])).
% cnf(650,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)],[649,theory(equality)])).
% cnf(658,plain,(ssList(esk3_2(X1,nil))|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[186,256,theory(equality)])).
% cnf(660,plain,(ssList(esk3_2(X1,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[658,110,theory(equality)])).
% cnf(661,plain,(ssList(esk3_2(X1,nil))|~ssList(X1)),inference(cn,[status(thm)],[660,theory(equality)])).
% cnf(662,plain,(ssList(esk4_2(X1,nil))|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[194,295,theory(equality)])).
% cnf(664,plain,(ssList(esk4_2(X1,nil))|$false|~ssList(X1)),inference(rw,[status(thm)],[662,110,theory(equality)])).
% cnf(665,plain,(ssList(esk4_2(X1,nil))|~ssList(X1)),inference(cn,[status(thm)],[664,theory(equality)])).
% cnf(675,plain,(nil=X1|X1!=tl(X1)|~ssItem(hd(X1))|~ssList(tl(X1))|~ssList(X1)),inference(spm,[status(thm)],[269,226,theory(equality)])).
% cnf(684,plain,(nil=app(X1,X2)|ssList(app(tl(X1),X2))|nil=X1|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[113,153,theory(equality)])).
% cnf(708,plain,(X1=nil|app(X1,X2)!=X2|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[131,120,theory(equality)])).
% cnf(712,plain,(X1=nil|app(X1,X2)!=X2|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[708,110,theory(equality)])).
% cnf(713,plain,(X1=nil|app(X1,X2)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[712,theory(equality)])).
% cnf(734,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)|~ssList(app(X1,X2))),inference(er,[status(thm)],[195,theory(equality)])).
% cnf(774,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[245,256,theory(equality)])).
% cnf(776,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|$false|~ssList(X1)),inference(rw,[status(thm)],[774,110,theory(equality)])).
% cnf(777,plain,(frontsegP(app(X1,X2),nil)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[776,theory(equality)])).
% cnf(778,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(nil)|~ssList(X2)),inference(spm,[status(thm)],[249,295,theory(equality)])).
% cnf(780,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|$false|~ssList(X2)),inference(rw,[status(thm)],[778,110,theory(equality)])).
% cnf(781,plain,(rearsegP(app(X1,X2),nil)|~ssList(X1)|~ssList(X2)),inference(cn,[status(thm)],[780,theory(equality)])).
% cnf(782,plain,(app(nil,esk3_2(X1,nil))=X1|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[185,256,theory(equality)])).
% cnf(784,plain,(app(nil,esk3_2(X1,nil))=X1|$false|~ssList(X1)),inference(rw,[status(thm)],[782,110,theory(equality)])).
% cnf(785,plain,(app(nil,esk3_2(X1,nil))=X1|~ssList(X1)),inference(cn,[status(thm)],[784,theory(equality)])).
% cnf(786,plain,(app(esk4_2(X1,nil),nil)=X1|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[193,295,theory(equality)])).
% cnf(788,plain,(app(esk4_2(X1,nil),nil)=X1|$false|~ssList(X1)),inference(rw,[status(thm)],[786,110,theory(equality)])).
% cnf(789,plain,(app(esk4_2(X1,nil),nil)=X1|~ssList(X1)),inference(cn,[status(thm)],[788,theory(equality)])).
% cnf(1802,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[622,265,theory(equality)])).
% cnf(1803,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1802,110,theory(equality)])).
% cnf(1804,plain,(singletonP(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[1803,theory(equality)])).
% cnf(1860,plain,(X1=esk3_2(X1,nil)|~ssList(esk3_2(X1,nil))|~ssList(X1)),inference(spm,[status(thm)],[120,785,theory(equality)])).
% cnf(1912,plain,(X1=esk4_2(X1,nil)|~ssList(esk4_2(X1,nil))|~ssList(X1)),inference(spm,[status(thm)],[149,789,theory(equality)])).
% cnf(2015,plain,(esk3_2(X1,nil)=X1|~ssList(X1)),inference(csr,[status(thm)],[1860,661])).
% cnf(2022,plain,(esk4_2(X1,nil)=X1|~ssList(X1)),inference(csr,[status(thm)],[1912,665])).
% cnf(2097,plain,(nil=X1|tl(X1)!=X1|~ssItem(hd(X1))|~ssList(X1)),inference(csr,[status(thm)],[675,113])).
% cnf(2098,plain,(nil=X1|tl(X1)!=X1|~ssList(X1)),inference(csr,[status(thm)],[2097,278])).
% cnf(2210,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)],[650,theory(equality)])).
% cnf(2211,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2210,113,theory(equality)])).
% cnf(2212,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[2211,585,theory(equality)])).
% cnf(2213,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)),inference(cn,[status(thm)],[2212,theory(equality)])).
% cnf(2214,negated_conjecture,(esk51_0=nil|esk51_0=app(esk48_0,tl(esk51_0))|~ssList(app(esk48_0,tl(esk51_0)))),inference(er,[status(thm)],[2213,theory(equality)])).
% cnf(2215,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[2214,117,theory(equality)])).
% cnf(2216,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[2215,573,theory(equality)])).
% cnf(2217,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2216,theory(equality)])).
% cnf(2218,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2217,113,theory(equality)])).
% cnf(2219,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2218,585,theory(equality)])).
% cnf(2220,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[2219,theory(equality)])).
% cnf(2224,negated_conjecture,(tl(esk51_0)=app(tl(esk48_0),tl(esk51_0))|nil=esk48_0|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[153,2220,theory(equality)])).
% cnf(2228,negated_conjecture,(rearsegP(esk51_0,nil)|esk51_0=nil|~ssList(esk48_0)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[781,2220,theory(equality)])).
% cnf(2247,negated_conjecture,(tl(esk51_0)=app(tl(esk48_0),tl(esk51_0))|nil=esk48_0|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[2224,573,theory(equality)])).
% cnf(2248,negated_conjecture,(tl(esk51_0)=app(tl(esk48_0),tl(esk51_0))|nil=esk48_0|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2247,theory(equality)])).
% cnf(2255,negated_conjecture,(rearsegP(esk51_0,nil)|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[2228,573,theory(equality)])).
% cnf(2256,negated_conjecture,(rearsegP(esk51_0,nil)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2255,theory(equality)])).
% cnf(2279,negated_conjecture,(app(tl(esk48_0),tl(esk51_0))=tl(esk51_0)|esk51_0=nil|esk48_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2248,113,theory(equality)])).
% cnf(2280,negated_conjecture,(app(tl(esk48_0),tl(esk51_0))=tl(esk51_0)|esk51_0=nil|esk48_0=nil|$false),inference(rw,[status(thm)],[2279,585,theory(equality)])).
% cnf(2281,negated_conjecture,(app(tl(esk48_0),tl(esk51_0))=tl(esk51_0)|esk51_0=nil|esk48_0=nil),inference(cn,[status(thm)],[2280,theory(equality)])).
% cnf(2287,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(tl(esk48_0))),inference(spm,[status(thm)],[713,2281,theory(equality)])).
% cnf(2300,negated_conjecture,(tl(esk48_0)=nil|esk51_0=nil|esk48_0=nil|~ssList(tl(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[2287,113,theory(equality)])).
% cnf(2301,negated_conjecture,(tl(esk48_0)=nil|esk51_0=nil|esk48_0=nil|~ssList(tl(esk48_0))|$false),inference(rw,[status(thm)],[2300,585,theory(equality)])).
% cnf(2302,negated_conjecture,(tl(esk48_0)=nil|esk51_0=nil|esk48_0=nil|~ssList(tl(esk48_0))),inference(cn,[status(thm)],[2301,theory(equality)])).
% cnf(2303,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[2302,113,theory(equality)])).
% cnf(2304,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil|$false),inference(rw,[status(thm)],[2303,573,theory(equality)])).
% cnf(2305,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil),inference(cn,[status(thm)],[2304,theory(equality)])).
% cnf(2307,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|nil=esk48_0|esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[226,2305,theory(equality)])).
% cnf(2316,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|nil=esk48_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2307,573,theory(equality)])).
% cnf(2317,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|nil=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[2316,theory(equality)])).
% cnf(2527,negated_conjecture,(esk51_0=nil|rearsegP(esk51_0,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[2256,113,theory(equality)])).
% cnf(2528,negated_conjecture,(esk51_0=nil|rearsegP(esk51_0,nil)|$false),inference(rw,[status(thm)],[2527,585,theory(equality)])).
% cnf(2529,negated_conjecture,(esk51_0=nil|rearsegP(esk51_0,nil)),inference(cn,[status(thm)],[2528,theory(equality)])).
% cnf(2531,negated_conjecture,(app(esk4_2(esk51_0,nil),nil)=esk51_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[193,2529,theory(equality)])).
% cnf(2538,negated_conjecture,(app(esk4_2(esk51_0,nil),nil)=esk51_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2531,110,theory(equality)])).
% cnf(2539,negated_conjecture,(app(esk4_2(esk51_0,nil),nil)=esk51_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[2538,585,theory(equality)])).
% cnf(2540,negated_conjecture,(app(esk4_2(esk51_0,nil),nil)=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[2539,theory(equality)])).
% cnf(2576,negated_conjecture,(app(esk51_0,nil)=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2540,2022,theory(equality)])).
% cnf(2610,negated_conjecture,(app(esk51_0,nil)=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2576,585,theory(equality)])).
% cnf(2611,negated_conjecture,(app(esk51_0,nil)=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[2610,theory(equality)])).
% cnf(2614,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[153,2611,theory(equality)])).
% cnf(2637,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2614,110,theory(equality)])).
% cnf(2638,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0|$false|$false),inference(rw,[status(thm)],[2637,585,theory(equality)])).
% cnf(2639,negated_conjecture,(tl(esk51_0)=app(tl(esk51_0),nil)|nil=esk51_0),inference(cn,[status(thm)],[2638,theory(equality)])).
% cnf(2829,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[684,117])).
% cnf(2830,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[2829,145])).
% cnf(2837,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[2830,2639,theory(equality)])).
% cnf(2845,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[2837,110,theory(equality)])).
% cnf(2846,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))|$false|$false),inference(rw,[status(thm)],[2845,585,theory(equality)])).
% cnf(2847,negated_conjecture,(nil=esk51_0|ssList(tl(esk51_0))),inference(cn,[status(thm)],[2846,theory(equality)])).
% cnf(3522,plain,(rearsegP(app(X1,X2),X2)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[734,117])).
% cnf(3547,negated_conjecture,(rearsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(nil)),inference(spm,[status(thm)],[3522,2639,theory(equality)])).
% cnf(3573,negated_conjecture,(rearsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[3547,110,theory(equality)])).
% cnf(3574,negated_conjecture,(rearsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[3573,theory(equality)])).
% cnf(3694,negated_conjecture,(esk51_0=nil|rearsegP(tl(esk51_0),nil)),inference(csr,[status(thm)],[3574,2847])).
% cnf(3695,negated_conjecture,(ssList(esk4_2(tl(esk51_0),nil))|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[194,3694,theory(equality)])).
% cnf(3696,negated_conjecture,(app(esk4_2(tl(esk51_0),nil),nil)=tl(esk51_0)|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[193,3694,theory(equality)])).
% cnf(3700,negated_conjecture,(ssList(esk4_2(tl(esk51_0),nil))|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[3695,110,theory(equality)])).
% cnf(3701,negated_conjecture,(ssList(esk4_2(tl(esk51_0),nil))|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[3700,theory(equality)])).
% cnf(3702,negated_conjecture,(app(esk4_2(tl(esk51_0),nil),nil)=tl(esk51_0)|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[3696,110,theory(equality)])).
% cnf(3703,negated_conjecture,(app(esk4_2(tl(esk51_0),nil),nil)=tl(esk51_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[3702,theory(equality)])).
% cnf(3715,negated_conjecture,(esk51_0=nil|ssList(esk4_2(tl(esk51_0),nil))),inference(csr,[status(thm)],[3701,2847])).
% cnf(3823,negated_conjecture,(app(esk4_2(tl(esk51_0),nil),nil)=tl(esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[3703,2847])).
% cnf(3834,negated_conjecture,(frontsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(nil)|~ssList(esk4_2(tl(esk51_0),nil))),inference(spm,[status(thm)],[777,3823,theory(equality)])).
% cnf(3870,negated_conjecture,(frontsegP(tl(esk51_0),nil)|esk51_0=nil|$false|~ssList(esk4_2(tl(esk51_0),nil))),inference(rw,[status(thm)],[3834,110,theory(equality)])).
% cnf(3871,negated_conjecture,(frontsegP(tl(esk51_0),nil)|esk51_0=nil|~ssList(esk4_2(tl(esk51_0),nil))),inference(cn,[status(thm)],[3870,theory(equality)])).
% cnf(3919,negated_conjecture,(esk51_0=nil|frontsegP(tl(esk51_0),nil)),inference(csr,[status(thm)],[3871,3715])).
% cnf(3922,negated_conjecture,(app(nil,esk3_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil|~ssList(nil)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[185,3919,theory(equality)])).
% cnf(3929,negated_conjecture,(app(nil,esk3_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[3922,110,theory(equality)])).
% cnf(3930,negated_conjecture,(app(nil,esk3_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[3929,theory(equality)])).
% cnf(3945,negated_conjecture,(app(nil,esk3_2(tl(esk51_0),nil))=tl(esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[3930,2847])).
% cnf(3968,negated_conjecture,(app(nil,tl(esk51_0))=tl(esk51_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[3945,2015,theory(equality)])).
% cnf(4002,negated_conjecture,(app(nil,tl(esk51_0))=tl(esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[3968,2847])).
% cnf(4751,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil|esk48_0=nil|~ssItem(hd(esk48_0))),inference(spm,[status(thm)],[1804,2317,theory(equality)])).
% cnf(4823,negated_conjecture,(esk51_0=nil|esk48_0=nil|~ssItem(hd(esk48_0))),inference(sr,[status(thm)],[4751,590,theory(equality)])).
% cnf(4829,negated_conjecture,(esk48_0=nil|esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[4823,278,theory(equality)])).
% cnf(4830,negated_conjecture,(esk48_0=nil|esk51_0=nil|$false),inference(rw,[status(thm)],[4829,573,theory(equality)])).
% cnf(4831,negated_conjecture,(esk48_0=nil|esk51_0=nil),inference(cn,[status(thm)],[4830,theory(equality)])).
% cnf(4835,negated_conjecture,(app(nil,tl(esk51_0))=esk51_0|esk51_0=nil),inference(spm,[status(thm)],[2220,4831,theory(equality)])).
% cnf(4867,negated_conjecture,(esk51_0=tl(esk51_0)|esk51_0=nil),inference(spm,[status(thm)],[4002,4835,theory(equality)])).
% cnf(4908,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)),inference(spm,[status(thm)],[2098,4867,theory(equality)])).
% cnf(4966,negated_conjecture,(nil=esk51_0|$false),inference(rw,[status(thm)],[4908,585,theory(equality)])).
% cnf(4967,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[4966,theory(equality)])).
% cnf(5216,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,4967,theory(equality)])).
% cnf(5220,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[617,5216,theory(equality)])).
% cnf(5221,negated_conjecture,($false),inference(rw,[status(thm)],[5220,110,theory(equality)])).
% cnf(5222,negated_conjecture,($false),inference(cn,[status(thm)],[5221,theory(equality)])).
% cnf(5223,negated_conjecture,($false),5222,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 666
% # ...of these trivial : 5
% # ...subsumed : 252
% # ...remaining for further processing: 409
% # Other redundant clauses eliminated : 81
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 51
% # Backward-rewritten : 93
% # Generated clauses : 2107
% # ...of the previous two non-trivial : 1776
% # Contextual simplify-reflections : 376
% # Paramodulations : 1994
% # Factorizations : 0
% # Equation resolutions : 113
% # Current number of processed clauses: 259
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 233
% # Current number of unprocessed clauses: 771
% # ...number of literals in the above : 5437
% # Clause-clause subsumption calls (NU) : 10148
% # Rec. Clause-clause subsumption calls : 3845
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 265 leaves, 1.36+/-1.121 terms/leaf
% # Paramod-from index: 142 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 239 leaves, 1.21+/-0.947 terms/leaf
% # -------------------------------------------------
% # User time : 0.158 s
% # System time : 0.009 s
% # Total time : 0.167 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.33 CPU 0.44 WC
% FINAL PrfWatch: 0.33 CPU 0.44 WC
% SZS output end Solution for /tmp/SystemOnTPTP8143/SWC253+1.tptp
%
%------------------------------------------------------------------------------