%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC285+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 07:40:25 EST 2010
% Result : Theorem 1.45s
% Output : Solution 1.45s
% 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/SystemOnTPTP15793/SWC285+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15793/SWC285+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15793/SWC285+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 15889
% 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(4, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(6, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(8, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(13, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(14, 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(15, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(18, axiom,![X1]:(ssItem(X1)=>leq(X1,X1)),file('/tmp/SRASS.s.p', ax31)).
% fof(19, axiom,![X1]:(ssItem(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(memberP(app(X2,X3),X1)<=>(memberP(X2,X1)|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax36)).
% fof(20, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% fof(21, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>((segmentP(X1,X2)&segmentP(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax54)).
% fof(27, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(30, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X2,X3)=app(X2,X1)=>X3=X1)))),file('/tmp/SRASS.s.p', ax80)).
% fof(31, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(32, 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]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(41, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(43, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>tl(cons(X2,X1))=X1)),file('/tmp/SRASS.s.p', ax25)).
% fof(59, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|![X8]:(ssItem(X8)=>((~(memberP(X6,X8))|leq(X8,X5))&(~(memberP(X7,X8))|leq(X5,X8)))))))))|(~(singletonP(X3))&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))|~(segmentP(X4,X3)))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|![X8]:(ssItem(X8)=>((~(memberP(X6,X8))|leq(X8,X5))&(~(memberP(X7,X8))|leq(X5,X8)))))))))|(~(singletonP(X3))&neq(X4,nil)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|![X8]:(ssItem(X8)=>((~(memberP(X6,X8))|leq(X8,X5))&(~(memberP(X7,X8))|leq(X5,X8)))))))))|(~(singletonP(X3))&neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(124, 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)],[4])).
% fof(125, 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)],[124])).
% fof(126, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk5_1(X3))&cons(esk5_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk5_1(X3))&cons(esk5_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[126])).
% fof(128, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk5_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk5_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[127])).
% cnf(129,plain,(cons(esk5_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[128])).
% cnf(130,plain,(ssItem(esk5_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[128])).
% fof(141, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[6])).
% fof(142, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[141])).
% fof(143, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[142])).
% fof(144, 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)],[143])).
% cnf(145,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[144])).
% fof(147, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(148, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[147])).
% fof(149, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[148])).
% cnf(150,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[149])).
% cnf(151,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[8])).
% fof(169, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(170, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[169])).
% fof(171, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[170])).
% cnf(172,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[171])).
% fof(173, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(174, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[173])).
% fof(175, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[174])).
% cnf(176,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[175])).
% fof(177, 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)],[14])).
% fof(178, 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)],[177])).
% fof(179, 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)],[178])).
% cnf(180,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[179])).
% fof(181, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[15])).
% fof(182, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[181])).
% cnf(183,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(192, plain,![X1]:(~(ssItem(X1))|leq(X1,X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(193, plain,![X2]:(~(ssItem(X2))|leq(X2,X2)),inference(variable_rename,[status(thm)],[192])).
% cnf(194,plain,(leq(X1,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[193])).
% fof(195, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(memberP(app(X2,X3),X1))|(memberP(X2,X1)|memberP(X3,X1)))&((~(memberP(X2,X1))&~(memberP(X3,X1)))|memberP(app(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[19])).
% fof(196, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[195])).
% fof(197, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4))))|~(ssList(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[196])).
% fof(198, plain,![X4]:![X5]:![X6]:(((((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&(((((~(memberP(X5,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[197])).
% cnf(199,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X3,X1)),inference(split_conjunct,[status(thm)],[198])).
% cnf(200,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X2,X1)),inference(split_conjunct,[status(thm)],[198])).
% fof(202, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[20])).
% fof(203, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[202])).
% fof(204, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[203])).
% fof(205, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[204])).
% cnf(208,plain,(memberP(X3,X1)|X1=X2|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~memberP(cons(X2,X3),X1)),inference(split_conjunct,[status(thm)],[205])).
% fof(209, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(210, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[209])).
% cnf(211,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[210])).
% fof(217, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|~(segmentP(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(218, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[217])).
% fof(219, plain,![X3]:![X4]:((~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[218])).
% cnf(220,plain,(X1=X2|~ssList(X1)|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)),inference(split_conjunct,[status(thm)],[219])).
% fof(228, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[27])).
% fof(229, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[228])).
% cnf(230,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[229])).
% fof(240, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X2,X3)=app(X2,X1))|X3=X1)))),inference(fof_nnf,[status(thm)],[30])).
% fof(241, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4)))),inference(variable_rename,[status(thm)],[240])).
% fof(242, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[241])).
% cnf(243,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X2,X3)!=app(X2,X1)|~ssList(X3)),inference(split_conjunct,[status(thm)],[242])).
% fof(244, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[31])).
% fof(245, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[244])).
% fof(246, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[245])).
% cnf(247,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[246])).
% fof(248, 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)],[32])).
% fof(249, 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)],[248])).
% fof(250, 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)],[249])).
% cnf(251,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[250])).
% fof(252, 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)],[33])).
% fof(253, 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)],[252])).
% fof(254, 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)],[253])).
% fof(255, 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)],[254])).
% cnf(258,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[255])).
% fof(332, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(333, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[332])).
% fof(334, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[333])).
% cnf(335,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[334])).
% fof(340, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|tl(cons(X2,X1))=X1)),inference(fof_nnf,[status(thm)],[43])).
% fof(341, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|tl(cons(X4,X3))=X3)),inference(variable_rename,[status(thm)],[340])).
% fof(342, plain,![X3]:![X4]:((~(ssItem(X4))|tl(cons(X4,X3))=X3)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[341])).
% cnf(343,plain,(tl(cons(X2,X1))=X1|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[342])).
% fof(417, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[59])).
% fof(418, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[417])).
% cnf(419,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[418])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&segmentP(X4,X3))&?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&(app(app(X6,cons(X5,nil)),X7)=X1&?[X8]:(ssItem(X8)&((memberP(X6,X8)&~(leq(X8,X5)))|(memberP(X7,X8)&~(leq(X5,X8))))))))))&(singletonP(X3)|~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&((((X10=X12&X9=X11)&segmentP(X12,X11))&?[X13]:(ssItem(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&(app(app(X14,cons(X13,nil)),X15)=X9&?[X16]:(ssItem(X16)&((memberP(X14,X16)&~(leq(X16,X13)))|(memberP(X15,X16)&~(leq(X13,X16))))))))))&(singletonP(X11)|~(neq(X12,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)&segmentP(esk51_0,esk50_0))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(ssItem(esk55_0)&((memberP(esk53_0,esk55_0)&~(leq(esk55_0,esk52_0)))|(memberP(esk54_0,esk55_0)&~(leq(esk52_0,esk55_0))))))))))&(singletonP(esk50_0)|~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&segmentP(esk51_0,esk50_0))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(ssItem(esk55_0)&(((memberP(esk54_0,esk55_0)|memberP(esk53_0,esk55_0))&(~(leq(esk52_0,esk55_0))|memberP(esk53_0,esk55_0)))&((memberP(esk54_0,esk55_0)|~(leq(esk55_0,esk52_0)))&(~(leq(esk52_0,esk55_0))|~(leq(esk55_0,esk52_0)))))))))))&(singletonP(esk50_0)|~(neq(esk51_0,nil)))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(singletonP(esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(~leq(esk55_0,esk52_0)|~leq(esk52_0,esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(memberP(esk53_0,esk55_0)|memberP(esk54_0,esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(ssItem(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(588,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(589,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[588,583,theory(equality)])).
% cnf(590,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[587,584,theory(equality)])).
% cnf(593,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk50_0),inference(rw,[status(thm)],[578,583,theory(equality)])).
% cnf(664,plain,(tl(X1)=nil|~ssList(nil)|~ssItem(esk5_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[343,129,theory(equality)])).
% cnf(665,plain,(tl(X1)=nil|$false|~ssItem(esk5_1(X1))|~singletonP(X1)|~ssList(X1)),inference(rw,[status(thm)],[664,151,theory(equality)])).
% cnf(666,plain,(tl(X1)=nil|~ssItem(esk5_1(X1))|~singletonP(X1)|~ssList(X1)),inference(cn,[status(thm)],[665,theory(equality)])).
% cnf(668,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[572,145,theory(equality)])).
% cnf(669,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[668,151,theory(equality)])).
% cnf(670,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[669,590,theory(equality)])).
% cnf(671,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(707,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|~ssList(esk51_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[220,582,theory(equality)])).
% cnf(709,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[707,590,theory(equality)])).
% cnf(710,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[709,589,theory(equality)])).
% cnf(711,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)),inference(cn,[status(thm)],[710,theory(equality)])).
% cnf(740,negated_conjecture,(memberP(app(X1,esk54_0),esk55_0)|memberP(esk53_0,esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk55_0)),inference(spm,[status(thm)],[199,576,theory(equality)])).
% cnf(741,negated_conjecture,(memberP(app(X1,esk54_0),esk55_0)|memberP(esk53_0,esk55_0)|$false|~ssList(X1)|~ssItem(esk55_0)),inference(rw,[status(thm)],[740,579,theory(equality)])).
% cnf(742,negated_conjecture,(memberP(app(X1,esk54_0),esk55_0)|memberP(esk53_0,esk55_0)|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[741,577,theory(equality)])).
% cnf(743,negated_conjecture,(memberP(app(X1,esk54_0),esk55_0)|memberP(esk53_0,esk55_0)|~ssList(X1)),inference(cn,[status(thm)],[742,theory(equality)])).
% cnf(961,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|~ssList(esk54_0)|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[593,251,theory(equality)])).
% cnf(970,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|$false|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(rw,[status(thm)],[961,579,theory(equality)])).
% cnf(971,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|$false|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[970,580,theory(equality)])).
% cnf(972,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[971,theory(equality)])).
% cnf(1446,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[972,150,theory(equality)])).
% cnf(1447,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1446,151,theory(equality)])).
% cnf(1448,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[1447,581,theory(equality)])).
% cnf(1449,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0),inference(cn,[status(thm)],[1448,theory(equality)])).
% cnf(1465,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0|~ssList(esk54_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1449,247,theory(equality)])).
% cnf(1500,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1465,579,theory(equality)])).
% cnf(1501,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[1500,581,theory(equality)])).
% cnf(1502,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0),inference(cn,[status(thm)],[1501,theory(equality)])).
% cnf(1506,negated_conjecture,(tl(esk50_0)=app(tl(esk53_0),cons(esk52_0,esk54_0))|nil=esk53_0|~ssList(cons(esk52_0,esk54_0))|~ssList(esk53_0)),inference(spm,[status(thm)],[335,1502,theory(equality)])).
% cnf(1511,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(cons(esk52_0,esk54_0))|~ssList(esk53_0)|~ssList(X1)),inference(spm,[status(thm)],[243,1502,theory(equality)])).
% cnf(1513,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk50_0!=nil|~ssList(cons(esk52_0,esk54_0))|~ssList(esk53_0)),inference(spm,[status(thm)],[258,1502,theory(equality)])).
% cnf(1530,negated_conjecture,(tl(esk50_0)=app(tl(esk53_0),cons(esk52_0,esk54_0))|nil=esk53_0|~ssList(cons(esk52_0,esk54_0))|$false),inference(rw,[status(thm)],[1506,580,theory(equality)])).
% cnf(1531,negated_conjecture,(tl(esk50_0)=app(tl(esk53_0),cons(esk52_0,esk54_0))|nil=esk53_0|~ssList(cons(esk52_0,esk54_0))),inference(cn,[status(thm)],[1530,theory(equality)])).
% cnf(1540,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(cons(esk52_0,esk54_0))|$false|~ssList(X1)),inference(rw,[status(thm)],[1511,580,theory(equality)])).
% cnf(1541,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(cons(esk52_0,esk54_0))|~ssList(X1)),inference(cn,[status(thm)],[1540,theory(equality)])).
% cnf(1544,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk50_0!=nil|~ssList(cons(esk52_0,esk54_0))|$false),inference(rw,[status(thm)],[1513,580,theory(equality)])).
% cnf(1545,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk50_0!=nil|~ssList(cons(esk52_0,esk54_0))),inference(cn,[status(thm)],[1544,theory(equality)])).
% cnf(2126,negated_conjecture,(memberP(esk50_0,esk55_0)|memberP(esk53_0,esk55_0)|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(spm,[status(thm)],[743,593,theory(equality)])).
% cnf(2153,negated_conjecture,(memberP(esk53_0,esk55_0)|memberP(esk50_0,esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[2126,176,theory(equality)])).
% cnf(2154,negated_conjecture,(memberP(esk53_0,esk55_0)|memberP(esk50_0,esk55_0)|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[2153,580,theory(equality)])).
% cnf(2155,negated_conjecture,(memberP(esk53_0,esk55_0)|memberP(esk50_0,esk55_0)|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[2154,theory(equality)])).
% cnf(2156,negated_conjecture,(memberP(esk50_0,esk55_0)|memberP(esk53_0,esk55_0)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2155,150,theory(equality)])).
% cnf(2157,negated_conjecture,(memberP(esk50_0,esk55_0)|memberP(esk53_0,esk55_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2156,151,theory(equality)])).
% cnf(2158,negated_conjecture,(memberP(esk50_0,esk55_0)|memberP(esk53_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[2157,581,theory(equality)])).
% cnf(2159,negated_conjecture,(memberP(esk50_0,esk55_0)|memberP(esk53_0,esk55_0)),inference(cn,[status(thm)],[2158,theory(equality)])).
% cnf(2165,negated_conjecture,(memberP(app(esk53_0,X1),esk55_0)|memberP(esk50_0,esk55_0)|~ssList(X1)|~ssList(esk53_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[200,2159,theory(equality)])).
% cnf(2181,negated_conjecture,(memberP(app(esk53_0,X1),esk55_0)|memberP(esk50_0,esk55_0)|~ssList(X1)|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[2165,580,theory(equality)])).
% cnf(2182,negated_conjecture,(memberP(app(esk53_0,X1),esk55_0)|memberP(esk50_0,esk55_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2181,577,theory(equality)])).
% cnf(2183,negated_conjecture,(memberP(app(esk53_0,X1),esk55_0)|memberP(esk50_0,esk55_0)|~ssList(X1)),inference(cn,[status(thm)],[2182,theory(equality)])).
% cnf(2316,negated_conjecture,(memberP(esk50_0,esk55_0)|~ssList(cons(esk52_0,esk54_0))),inference(spm,[status(thm)],[2183,1502,theory(equality)])).
% cnf(2336,negated_conjecture,(memberP(esk50_0,esk55_0)|~ssList(esk54_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2316,150,theory(equality)])).
% cnf(2337,negated_conjecture,(memberP(esk50_0,esk55_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2336,579,theory(equality)])).
% cnf(2338,negated_conjecture,(memberP(esk50_0,esk55_0)|$false|$false),inference(rw,[status(thm)],[2337,581,theory(equality)])).
% cnf(2339,negated_conjecture,(memberP(esk50_0,esk55_0)),inference(cn,[status(thm)],[2338,theory(equality)])).
% cnf(2345,negated_conjecture,(memberP(app(esk50_0,X1),esk55_0)|~ssList(X1)|~ssList(esk50_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[200,2339,theory(equality)])).
% cnf(2369,negated_conjecture,(memberP(app(esk50_0,X1),esk55_0)|~ssList(X1)|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[2345,589,theory(equality)])).
% cnf(2370,negated_conjecture,(memberP(app(esk50_0,X1),esk55_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2369,577,theory(equality)])).
% cnf(2371,negated_conjecture,(memberP(app(esk50_0,X1),esk55_0)|~ssList(X1)),inference(cn,[status(thm)],[2370,theory(equality)])).
% cnf(2773,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)|~ssList(esk54_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1541,150,theory(equality)])).
% cnf(2774,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2773,579,theory(equality)])).
% cnf(2775,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2774,581,theory(equality)])).
% cnf(2776,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)),inference(cn,[status(thm)],[2775,theory(equality)])).
% cnf(2778,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|~ssList(app(cons(esk52_0,nil),esk54_0))),inference(spm,[status(thm)],[2776,1449,theory(equality)])).
% cnf(2784,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|~ssList(esk54_0)|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[2778,176,theory(equality)])).
% cnf(2789,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|$false|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[2784,579,theory(equality)])).
% cnf(2790,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[2789,theory(equality)])).
% cnf(2791,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2790,150,theory(equality)])).
% cnf(2792,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2791,151,theory(equality)])).
% cnf(2793,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[2792,581,theory(equality)])).
% cnf(2794,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)),inference(cn,[status(thm)],[2793,theory(equality)])).
% cnf(2796,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|~ssList(esk54_0)|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[176,2794,theory(equality)])).
% cnf(2810,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))|~ssList(nil)|~ssList(esk54_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[180,2794,theory(equality)])).
% cnf(2820,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|$false|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[2796,579,theory(equality)])).
% cnf(2821,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[2820,theory(equality)])).
% cnf(2846,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))|$false|~ssList(esk54_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2810,151,theory(equality)])).
% cnf(2847,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2846,579,theory(equality)])).
% cnf(2848,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))|$false|$false|$false),inference(rw,[status(thm)],[2847,581,theory(equality)])).
% cnf(2849,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))),inference(cn,[status(thm)],[2848,theory(equality)])).
% cnf(2855,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2821,150,theory(equality)])).
% cnf(2856,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2855,151,theory(equality)])).
% cnf(2857,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|$false|$false),inference(rw,[status(thm)],[2856,581,theory(equality)])).
% cnf(2858,negated_conjecture,(ssList(cons(esk52_0,esk54_0))),inference(cn,[status(thm)],[2857,theory(equality)])).
% cnf(2861,negated_conjecture,(cons(esk52_0,esk54_0)=nil|esk50_0!=nil|$false),inference(rw,[status(thm)],[1545,2858,theory(equality)])).
% cnf(2862,negated_conjecture,(cons(esk52_0,esk54_0)=nil|esk50_0!=nil),inference(cn,[status(thm)],[2861,theory(equality)])).
% cnf(2870,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|~ssList(app(nil,esk54_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[172,2849,theory(equality)])).
% cnf(2874,negated_conjecture,(tl(cons(esk52_0,esk54_0))=app(nil,esk54_0)|~ssList(app(nil,esk54_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[343,2849,theory(equality)])).
% cnf(2909,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|~ssList(app(nil,esk54_0))|$false),inference(rw,[status(thm)],[2870,581,theory(equality)])).
% cnf(2910,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|~ssList(app(nil,esk54_0))),inference(cn,[status(thm)],[2909,theory(equality)])).
% cnf(2918,negated_conjecture,(tl(cons(esk52_0,esk54_0))=app(nil,esk54_0)|~ssList(app(nil,esk54_0))|$false),inference(rw,[status(thm)],[2874,581,theory(equality)])).
% cnf(2919,negated_conjecture,(tl(cons(esk52_0,esk54_0))=app(nil,esk54_0)|~ssList(app(nil,esk54_0))),inference(cn,[status(thm)],[2918,theory(equality)])).
% cnf(3033,negated_conjecture,(tl(cons(esk52_0,esk54_0))=esk54_0|~ssList(esk54_0)),inference(spm,[status(thm)],[2919,183,theory(equality)])).
% cnf(3035,negated_conjecture,(tl(cons(esk52_0,esk54_0))=esk54_0|$false),inference(rw,[status(thm)],[3033,579,theory(equality)])).
% cnf(3036,negated_conjecture,(tl(cons(esk52_0,esk54_0))=esk54_0),inference(cn,[status(thm)],[3035,theory(equality)])).
% cnf(3042,negated_conjecture,(esk54_0=app(nil,esk54_0)|~ssList(app(nil,esk54_0))),inference(rw,[status(thm)],[2919,3036,theory(equality)])).
% cnf(3049,negated_conjecture,(app(nil,esk54_0)=esk54_0|~ssList(esk54_0)|~ssList(nil)),inference(spm,[status(thm)],[3042,176,theory(equality)])).
% cnf(3050,negated_conjecture,(app(nil,esk54_0)=esk54_0|$false|~ssList(nil)),inference(rw,[status(thm)],[3049,579,theory(equality)])).
% cnf(3051,negated_conjecture,(app(nil,esk54_0)=esk54_0|$false|$false),inference(rw,[status(thm)],[3050,151,theory(equality)])).
% cnf(3052,negated_conjecture,(app(nil,esk54_0)=esk54_0),inference(cn,[status(thm)],[3051,theory(equality)])).
% cnf(3073,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2910,3052,theory(equality)]),579,theory(equality)])).
% cnf(3074,negated_conjecture,(cons(esk52_0,esk54_0)!=nil),inference(cn,[status(thm)],[3073,theory(equality)])).
% cnf(3372,negated_conjecture,(app(tl(esk53_0),cons(esk52_0,esk54_0))=tl(esk50_0)|esk53_0=nil|$false),inference(rw,[status(thm)],[1531,2858,theory(equality)])).
% cnf(3373,negated_conjecture,(app(tl(esk53_0),cons(esk52_0,esk54_0))=tl(esk50_0)|esk53_0=nil),inference(cn,[status(thm)],[3372,theory(equality)])).
% cnf(3384,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0=nil|tl(esk50_0)!=nil|~ssList(cons(esk52_0,esk54_0))|~ssList(tl(esk53_0))),inference(spm,[status(thm)],[258,3373,theory(equality)])).
% cnf(3416,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0=nil|tl(esk50_0)!=nil|$false|~ssList(tl(esk53_0))),inference(rw,[status(thm)],[3384,2858,theory(equality)])).
% cnf(3417,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0=nil|tl(esk50_0)!=nil|~ssList(tl(esk53_0))),inference(cn,[status(thm)],[3416,theory(equality)])).
% cnf(3418,negated_conjecture,(esk53_0=nil|tl(esk50_0)!=nil|~ssList(tl(esk53_0))),inference(sr,[status(thm)],[3417,3074,theory(equality)])).
% cnf(3448,plain,(tl(X1)=nil|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[666,130])).
% cnf(3449,negated_conjecture,(tl(esk50_0)=nil|esk51_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[3448,671,theory(equality)])).
% cnf(3451,negated_conjecture,(tl(esk50_0)=nil|esk51_0=nil|$false),inference(rw,[status(thm)],[3449,589,theory(equality)])).
% cnf(3452,negated_conjecture,(tl(esk50_0)=nil|esk51_0=nil),inference(cn,[status(thm)],[3451,theory(equality)])).
% cnf(3455,negated_conjecture,(esk53_0=nil|esk51_0=nil|~ssList(tl(esk53_0))),inference(spm,[status(thm)],[3418,3452,theory(equality)])).
% cnf(3464,negated_conjecture,(esk51_0=nil|esk53_0=nil|~ssList(esk53_0)),inference(spm,[status(thm)],[3455,419,theory(equality)])).
% cnf(3465,negated_conjecture,(esk51_0=nil|esk53_0=nil|$false),inference(rw,[status(thm)],[3464,580,theory(equality)])).
% cnf(3466,negated_conjecture,(esk51_0=nil|esk53_0=nil),inference(cn,[status(thm)],[3465,theory(equality)])).
% cnf(3469,negated_conjecture,(app(nil,cons(esk52_0,esk54_0))=esk50_0|esk51_0=nil),inference(spm,[status(thm)],[1502,3466,theory(equality)])).
% cnf(3493,negated_conjecture,(esk50_0=cons(esk52_0,esk54_0)|esk51_0=nil|~ssList(cons(esk52_0,esk54_0))),inference(spm,[status(thm)],[183,3469,theory(equality)])).
% cnf(3561,negated_conjecture,(esk50_0=cons(esk52_0,esk54_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[3493,2858,theory(equality)])).
% cnf(3562,negated_conjecture,(esk50_0=cons(esk52_0,esk54_0)|esk51_0=nil),inference(cn,[status(thm)],[3561,theory(equality)])).
% cnf(3580,negated_conjecture,(tl(esk50_0)=esk54_0|esk51_0=nil|~ssList(esk54_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[343,3562,theory(equality)])).
% cnf(3652,negated_conjecture,(tl(esk50_0)=esk54_0|esk51_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3580,579,theory(equality)])).
% cnf(3653,negated_conjecture,(tl(esk50_0)=esk54_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[3652,581,theory(equality)])).
% cnf(3654,negated_conjecture,(tl(esk50_0)=esk54_0|esk51_0=nil),inference(cn,[status(thm)],[3653,theory(equality)])).
% cnf(4114,negated_conjecture,(esk54_0=nil|esk51_0=nil),inference(spm,[status(thm)],[3452,3654,theory(equality)])).
% cnf(4160,negated_conjecture,(cons(esk52_0,nil)=esk50_0|esk51_0=nil),inference(spm,[status(thm)],[3562,4114,theory(equality)])).
% cnf(4284,negated_conjecture,(app(esk50_0,esk54_0)=cons(esk52_0,esk54_0)|esk51_0=nil),inference(spm,[status(thm)],[2794,4160,theory(equality)])).
% cnf(4413,negated_conjecture,(memberP(cons(esk52_0,esk54_0),esk55_0)|esk51_0=nil|~ssList(esk54_0)),inference(spm,[status(thm)],[2371,4284,theory(equality)])).
% cnf(4467,negated_conjecture,(memberP(cons(esk52_0,esk54_0),esk55_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[4413,579,theory(equality)])).
% cnf(4468,negated_conjecture,(memberP(cons(esk52_0,esk54_0),esk55_0)|esk51_0=nil),inference(cn,[status(thm)],[4467,theory(equality)])).
% cnf(4967,negated_conjecture,(esk55_0=esk52_0|memberP(esk54_0,esk55_0)|esk51_0=nil|~ssList(esk54_0)|~ssItem(esk52_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[208,4468,theory(equality)])).
% cnf(4988,negated_conjecture,(esk55_0=esk52_0|memberP(esk54_0,esk55_0)|esk51_0=nil|$false|~ssItem(esk52_0)|~ssItem(esk55_0)),inference(rw,[status(thm)],[4967,579,theory(equality)])).
% cnf(4989,negated_conjecture,(esk55_0=esk52_0|memberP(esk54_0,esk55_0)|esk51_0=nil|$false|$false|~ssItem(esk55_0)),inference(rw,[status(thm)],[4988,581,theory(equality)])).
% cnf(4990,negated_conjecture,(esk55_0=esk52_0|memberP(esk54_0,esk55_0)|esk51_0=nil|$false|$false|$false),inference(rw,[status(thm)],[4989,577,theory(equality)])).
% cnf(4991,negated_conjecture,(esk55_0=esk52_0|memberP(esk54_0,esk55_0)|esk51_0=nil),inference(cn,[status(thm)],[4990,theory(equality)])).
% cnf(4999,negated_conjecture,(esk51_0=nil|esk52_0=esk55_0|memberP(nil,esk55_0)),inference(spm,[status(thm)],[4991,4114,theory(equality)])).
% cnf(5024,negated_conjecture,(esk52_0=esk55_0|esk51_0=nil|~ssItem(esk55_0)),inference(spm,[status(thm)],[211,4999,theory(equality)])).
% cnf(5043,negated_conjecture,(esk52_0=esk55_0|esk51_0=nil|$false),inference(rw,[status(thm)],[5024,577,theory(equality)])).
% cnf(5044,negated_conjecture,(esk52_0=esk55_0|esk51_0=nil),inference(cn,[status(thm)],[5043,theory(equality)])).
% cnf(5051,negated_conjecture,(esk50_0=nil|esk52_0=esk55_0|~segmentP(esk50_0,nil)),inference(spm,[status(thm)],[711,5044,theory(equality)])).
% cnf(5057,negated_conjecture,(esk52_0=esk55_0|esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[5051,230,theory(equality)])).
% cnf(5058,negated_conjecture,(esk52_0=esk55_0|esk50_0=nil|$false),inference(rw,[status(thm)],[5057,589,theory(equality)])).
% cnf(5059,negated_conjecture,(esk52_0=esk55_0|esk50_0=nil),inference(cn,[status(thm)],[5058,theory(equality)])).
% cnf(5073,negated_conjecture,(cons(esk52_0,esk54_0)=nil|esk52_0=esk55_0),inference(spm,[status(thm)],[2862,5059,theory(equality)])).
% cnf(5121,negated_conjecture,(esk52_0=esk55_0),inference(sr,[status(thm)],[5073,3074,theory(equality)])).
% cnf(5222,negated_conjecture,(~leq(esk55_0,esk55_0)|~leq(esk55_0,esk52_0)),inference(rw,[status(thm)],[573,5121,theory(equality)])).
% cnf(5223,negated_conjecture,(~leq(esk55_0,esk55_0)|~leq(esk55_0,esk55_0)),inference(rw,[status(thm)],[5222,5121,theory(equality)])).
% cnf(5224,negated_conjecture,(~leq(esk55_0,esk55_0)),inference(cn,[status(thm)],[5223,theory(equality)])).
% cnf(5234,negated_conjecture,(~ssItem(esk55_0)),inference(spm,[status(thm)],[5224,194,theory(equality)])).
% cnf(5235,negated_conjecture,($false),inference(rw,[status(thm)],[5234,577,theory(equality)])).
% cnf(5236,negated_conjecture,($false),inference(cn,[status(thm)],[5235,theory(equality)])).
% cnf(5237,negated_conjecture,($false),5236,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 520
% # ...of these trivial : 3
% # ...subsumed : 110
% # ...remaining for further processing: 407
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 103
% # Generated clauses : 1819
% # ...of the previous two non-trivial : 1651
% # Contextual simplify-reflections : 76
% # Paramodulations : 1722
% # Factorizations : 0
% # Equation resolutions : 97
% # Current number of processed clauses: 279
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 239
% # Current number of unprocessed clauses: 736
% # ...number of literals in the above : 4587
% # Clause-clause subsumption calls (NU) : 2614
% # Rec. Clause-clause subsumption calls : 1689
% # Unit Clause-clause subsumption calls : 112
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 310 leaves, 1.27+/-1.000 terms/leaf
% # Paramod-from index: 156 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 274 leaves, 1.17+/-0.839 terms/leaf
% # -------------------------------------------------
% # User time : 0.135 s
% # System time : 0.009 s
% # Total time : 0.144 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.42 WC
% FINAL PrfWatch: 0.32 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP15793/SWC285+1.tptp
%
%------------------------------------------------------------------------------