TSTP Solution File: SWC295+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC295+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 : art06.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:42:28 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP6532/SWC295+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6532/SWC295+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6532/SWC295+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 6628
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(8, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(10, 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(11, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(19, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(21, 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(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(23, 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(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(25, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(39, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(40, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(41, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>tl(cons(X2,X1))=X1)),file('/tmp/SRASS.s.p', ax25)).
% fof(57, 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))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|![X8]:(ssItem(X8)=>((~(memberP(X6,X8))|lt(X8,X5))&(~(memberP(X7,X8))|lt(X5,X8)))))))))|(![X9]:(ssItem(X9)=>((~(cons(X9,nil)=X3)|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X9,X10))))&(~(nil=X4)|~(nil=X3)))))))),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))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|![X8]:(ssItem(X8)=>((~(memberP(X6,X8))|lt(X8,X5))&(~(memberP(X7,X8))|lt(X5,X8)))))))))|(![X9]:(ssItem(X9)=>((~(cons(X9,nil)=X3)|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X9,X10))))&(~(nil=X4)|~(nil=X3))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|![X8]:(ssItem(X8)=>((~(memberP(X6,X8))|lt(X8,X5))&(~(memberP(X7,X8))|lt(X5,X8)))))))))|(![X9]:(ssItem(X9)=>((~(cons(X9,nil)=X3)|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X9,X10))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[119])).
% cnf(121,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(140, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(141, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[140])).
% fof(142, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[141])).
% cnf(143,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[142])).
% fof(144, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(145, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[144])).
% fof(146, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[145])).
% cnf(147,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[146])).
% fof(148, 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)],[10])).
% fof(149, 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)],[148])).
% fof(150, 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)],[149])).
% cnf(151,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[150])).
% fof(152, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[11])).
% fof(153, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[152])).
% cnf(154,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[153])).
% fof(188, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(189, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[188])).
% cnf(190,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[189])).
% fof(195, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X2,X3)=app(X2,X1))|X3=X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(196, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4)))),inference(variable_rename,[status(thm)],[195])).
% fof(197, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[196])).
% cnf(198,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X2,X3)!=app(X2,X1)|~ssList(X3)),inference(split_conjunct,[status(thm)],[197])).
% fof(199, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(200, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[200])).
% cnf(202,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[201])).
% fof(203, 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)],[23])).
% fof(204, 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)],[203])).
% fof(205, 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)],[204])).
% cnf(206,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[205])).
% fof(207, 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)],[24])).
% fof(208, 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)],[207])).
% fof(209, 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)],[208])).
% fof(210, 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)],[209])).
% cnf(212,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[210])).
% cnf(213,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[210])).
% fof(214, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[25])).
% fof(215, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[214])).
% cnf(216,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[215])).
% fof(340, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(341, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[340])).
% fof(342, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[341])).
% cnf(343,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[342])).
% fof(344, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[40])).
% fof(345, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[344])).
% fof(346, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[345])).
% cnf(347,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[346])).
% fof(348, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|tl(cons(X2,X1))=X1)),inference(fof_nnf,[status(thm)],[41])).
% fof(349, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|tl(cons(X4,X3))=X3)),inference(variable_rename,[status(thm)],[348])).
% fof(350, plain,![X3]:![X4]:((~(ssItem(X4))|tl(cons(X4,X3))=X3)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[349])).
% cnf(351,plain,(tl(cons(X2,X1))=X1|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[350])).
% fof(432, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[57])).
% fof(433, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[432])).
% cnf(434,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[433])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&(app(app(X6,cons(X5,nil)),X7)=X1&?[X8]:(ssItem(X8)&((memberP(X6,X8)&~(lt(X8,X5)))|(memberP(X7,X8)&~(lt(X5,X8))))))))))&(?[X9]:(ssItem(X9)&((cons(X9,nil)=X3&memberP(X4,X9))&![X10]:(((~(ssItem(X10))|X9=X10)|~(memberP(X4,X10)))|~(leq(X9,X10)))))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(((X12=X14&X11=X13)&?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(app(app(X16,cons(X15,nil)),X17)=X11&?[X18]:(ssItem(X18)&((memberP(X16,X18)&~(lt(X18,X15)))|(memberP(X17,X18)&~(lt(X15,X18))))))))))&(?[X19]:(ssItem(X19)&((cons(X19,nil)=X13&memberP(X14,X19))&![X20]:(((~(ssItem(X20))|X19=X20)|~(memberP(X14,X20)))|~(leq(X19,X20)))))|(nil=X14&nil=X13))))))),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)&(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)&~(lt(esk55_0,esk52_0)))|(memberP(esk54_0,esk55_0)&~(lt(esk52_0,esk55_0))))))))))&((ssItem(esk56_0)&((cons(esk56_0,nil)=esk50_0&memberP(esk51_0,esk56_0))&![X20]:(((~(ssItem(X20))|esk56_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk56_0,X20)))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X20]:(((((((((((~(ssItem(X20))|esk56_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk56_0,X20)))&(cons(esk56_0,nil)=esk50_0&memberP(esk51_0,esk56_0)))&ssItem(esk56_0))|(nil=esk51_0&nil=esk50_0))&((esk49_0=esk51_0&esk48_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)&~(lt(esk55_0,esk52_0)))|(memberP(esk54_0,esk55_0)&~(lt(esk52_0,esk55_0)))))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X20]:(((((((((nil=esk51_0|(((~(ssItem(X20))|esk56_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk56_0,X20))))&(nil=esk50_0|(((~(ssItem(X20))|esk56_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk56_0,X20)))))&(((nil=esk51_0|cons(esk56_0,nil)=esk50_0)&(nil=esk50_0|cons(esk56_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk56_0))&(nil=esk50_0|memberP(esk51_0,esk56_0)))))&((nil=esk51_0|ssItem(esk56_0))&(nil=esk50_0|ssItem(esk56_0))))&((esk49_0=esk51_0&esk48_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))&(~(lt(esk52_0,esk55_0))|memberP(esk53_0,esk55_0)))&((memberP(esk54_0,esk55_0)|~(lt(esk55_0,esk52_0)))&(~(lt(esk52_0,esk55_0))|~(lt(esk55_0,esk52_0))))))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(580,negated_conjecture,(memberP(esk53_0,esk55_0)|memberP(esk54_0,esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(ssItem(esk56_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(cons(esk56_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(600,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk50_0),inference(rw,[status(thm)],[582,586,theory(equality)])).
% cnf(703,negated_conjecture,(hd(esk50_0)=esk56_0|esk50_0=nil|~ssList(nil)|~ssItem(esk56_0)),inference(spm,[status(thm)],[347,592,theory(equality)])).
% cnf(706,negated_conjecture,(hd(esk50_0)=esk56_0|esk50_0=nil|$false|~ssItem(esk56_0)),inference(rw,[status(thm)],[703,122,theory(equality)])).
% cnf(707,negated_conjecture,(hd(esk50_0)=esk56_0|esk50_0=nil|~ssItem(esk56_0)),inference(cn,[status(thm)],[706,theory(equality)])).
% cnf(713,negated_conjecture,(tl(esk50_0)=nil|esk50_0=nil|~ssList(nil)|~ssItem(esk56_0)),inference(spm,[status(thm)],[351,592,theory(equality)])).
% cnf(716,negated_conjecture,(tl(esk50_0)=nil|esk50_0=nil|$false|~ssItem(esk56_0)),inference(rw,[status(thm)],[713,122,theory(equality)])).
% cnf(717,negated_conjecture,(tl(esk50_0)=nil|esk50_0=nil|~ssItem(esk56_0)),inference(cn,[status(thm)],[716,theory(equality)])).
% cnf(1067,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)],[600,206,theory(equality)])).
% cnf(1075,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)],[1067,583,theory(equality)])).
% cnf(1076,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)],[1075,584,theory(equality)])).
% cnf(1077,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1076,theory(equality)])).
% cnf(1643,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1077,121,theory(equality)])).
% cnf(1644,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1643,122,theory(equality)])).
% cnf(1645,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[1644,585,theory(equality)])).
% cnf(1646,negated_conjecture,(app(esk53_0,app(cons(esk52_0,nil),esk54_0))=esk50_0),inference(cn,[status(thm)],[1645,theory(equality)])).
% cnf(1662,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0|~ssList(esk54_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1646,202,theory(equality)])).
% cnf(1697,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1662,583,theory(equality)])).
% cnf(1698,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[1697,585,theory(equality)])).
% cnf(1699,negated_conjecture,(app(esk53_0,cons(esk52_0,esk54_0))=esk50_0),inference(cn,[status(thm)],[1698,theory(equality)])).
% cnf(1700,negated_conjecture,(nil=esk53_0|esk50_0!=nil|~ssList(cons(esk52_0,esk54_0))|~ssList(esk53_0)),inference(spm,[status(thm)],[212,1699,theory(equality)])).
% cnf(1703,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)],[343,1699,theory(equality)])).
% cnf(1708,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)],[198,1699,theory(equality)])).
% cnf(1720,negated_conjecture,(nil=esk53_0|esk50_0!=nil|~ssList(cons(esk52_0,esk54_0))|$false),inference(rw,[status(thm)],[1700,584,theory(equality)])).
% cnf(1721,negated_conjecture,(nil=esk53_0|esk50_0!=nil|~ssList(cons(esk52_0,esk54_0))),inference(cn,[status(thm)],[1720,theory(equality)])).
% cnf(1727,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)],[1703,584,theory(equality)])).
% cnf(1728,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)],[1727,theory(equality)])).
% cnf(1737,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)],[1708,584,theory(equality)])).
% cnf(1738,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)],[1737,theory(equality)])).
% cnf(1996,negated_conjecture,(hd(esk50_0)=esk56_0|esk50_0=nil),inference(csr,[status(thm)],[707,588])).
% cnf(2035,negated_conjecture,(tl(esk50_0)=nil|esk50_0=nil),inference(csr,[status(thm)],[717,588])).
% cnf(3235,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)],[1738,121,theory(equality)])).
% cnf(3236,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3235,583,theory(equality)])).
% cnf(3237,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[3236,585,theory(equality)])).
% cnf(3238,negated_conjecture,(X1=cons(esk52_0,esk54_0)|app(esk53_0,X1)!=esk50_0|~ssList(X1)),inference(cn,[status(thm)],[3237,theory(equality)])).
% cnf(3239,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0!=esk50_0|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[3238,216,theory(equality)])).
% cnf(3240,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)],[3238,1646,theory(equality)])).
% cnf(3242,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0!=esk50_0|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[3239,122,theory(equality)])).
% cnf(3243,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0!=esk50_0|$false|$false),inference(rw,[status(thm)],[3242,584,theory(equality)])).
% cnf(3244,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0!=esk50_0),inference(cn,[status(thm)],[3243,theory(equality)])).
% cnf(3246,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)],[3240,147,theory(equality)])).
% cnf(3251,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|$false|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[3246,583,theory(equality)])).
% cnf(3252,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[3251,theory(equality)])).
% cnf(3253,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3252,121,theory(equality)])).
% cnf(3254,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3253,122,theory(equality)])).
% cnf(3255,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[3254,585,theory(equality)])).
% cnf(3256,negated_conjecture,(app(cons(esk52_0,nil),esk54_0)=cons(esk52_0,esk54_0)),inference(cn,[status(thm)],[3255,theory(equality)])).
% cnf(3258,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|~ssList(esk54_0)|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[147,3256,theory(equality)])).
% cnf(3265,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|~ssList(esk54_0)|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(spm,[status(thm)],[198,3256,theory(equality)])).
% cnf(3272,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)],[151,3256,theory(equality)])).
% cnf(3282,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|$false|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[3258,583,theory(equality)])).
% cnf(3283,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[3282,theory(equality)])).
% cnf(3296,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|$false|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(rw,[status(thm)],[3265,583,theory(equality)])).
% cnf(3297,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|~ssList(cons(esk52_0,nil))|~ssList(X1)),inference(cn,[status(thm)],[3296,theory(equality)])).
% cnf(3308,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)],[3272,122,theory(equality)])).
% cnf(3309,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3308,583,theory(equality)])).
% cnf(3310,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))|$false|$false|$false),inference(rw,[status(thm)],[3309,585,theory(equality)])).
% cnf(3311,negated_conjecture,(cons(esk52_0,esk54_0)=cons(esk52_0,app(nil,esk54_0))),inference(cn,[status(thm)],[3310,theory(equality)])).
% cnf(3319,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3283,121,theory(equality)])).
% cnf(3320,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3319,122,theory(equality)])).
% cnf(3321,negated_conjecture,(ssList(cons(esk52_0,esk54_0))|$false|$false),inference(rw,[status(thm)],[3320,585,theory(equality)])).
% cnf(3322,negated_conjecture,(ssList(cons(esk52_0,esk54_0))),inference(cn,[status(thm)],[3321,theory(equality)])).
% cnf(3326,negated_conjecture,(esk53_0=nil|esk50_0!=nil|$false),inference(rw,[status(thm)],[1721,3322,theory(equality)])).
% cnf(3327,negated_conjecture,(esk53_0=nil|esk50_0!=nil),inference(cn,[status(thm)],[3326,theory(equality)])).
% cnf(3334,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|~ssList(app(nil,esk54_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[143,3311,theory(equality)])).
% cnf(3337,negated_conjecture,(hd(cons(esk52_0,esk54_0))=esk52_0|~ssList(app(nil,esk54_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[347,3311,theory(equality)])).
% cnf(3338,negated_conjecture,(tl(cons(esk52_0,esk54_0))=app(nil,esk54_0)|~ssList(app(nil,esk54_0))|~ssItem(esk52_0)),inference(spm,[status(thm)],[351,3311,theory(equality)])).
% cnf(3373,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|~ssList(app(nil,esk54_0))|$false),inference(rw,[status(thm)],[3334,585,theory(equality)])).
% cnf(3374,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|~ssList(app(nil,esk54_0))),inference(cn,[status(thm)],[3373,theory(equality)])).
% cnf(3380,negated_conjecture,(hd(cons(esk52_0,esk54_0))=esk52_0|~ssList(app(nil,esk54_0))|$false),inference(rw,[status(thm)],[3337,585,theory(equality)])).
% cnf(3381,negated_conjecture,(hd(cons(esk52_0,esk54_0))=esk52_0|~ssList(app(nil,esk54_0))),inference(cn,[status(thm)],[3380,theory(equality)])).
% cnf(3382,negated_conjecture,(tl(cons(esk52_0,esk54_0))=app(nil,esk54_0)|~ssList(app(nil,esk54_0))|$false),inference(rw,[status(thm)],[3338,585,theory(equality)])).
% cnf(3383,negated_conjecture,(tl(cons(esk52_0,esk54_0))=app(nil,esk54_0)|~ssList(app(nil,esk54_0))),inference(cn,[status(thm)],[3382,theory(equality)])).
% cnf(3479,negated_conjecture,(hd(cons(esk52_0,esk54_0))=esk52_0|~ssList(esk54_0)),inference(spm,[status(thm)],[3381,154,theory(equality)])).
% cnf(3481,negated_conjecture,(hd(cons(esk52_0,esk54_0))=esk52_0|$false),inference(rw,[status(thm)],[3479,583,theory(equality)])).
% cnf(3482,negated_conjecture,(hd(cons(esk52_0,esk54_0))=esk52_0),inference(cn,[status(thm)],[3481,theory(equality)])).
% cnf(3506,negated_conjecture,(tl(cons(esk52_0,esk54_0))=esk54_0|~ssList(esk54_0)),inference(spm,[status(thm)],[3383,154,theory(equality)])).
% cnf(3508,negated_conjecture,(tl(cons(esk52_0,esk54_0))=esk54_0|$false),inference(rw,[status(thm)],[3506,583,theory(equality)])).
% cnf(3509,negated_conjecture,(tl(cons(esk52_0,esk54_0))=esk54_0),inference(cn,[status(thm)],[3508,theory(equality)])).
% cnf(3515,negated_conjecture,(esk54_0=app(nil,esk54_0)|~ssList(app(nil,esk54_0))),inference(rw,[status(thm)],[3383,3509,theory(equality)])).
% cnf(3522,negated_conjecture,(app(nil,esk54_0)=esk54_0|~ssList(esk54_0)|~ssList(nil)),inference(spm,[status(thm)],[3515,147,theory(equality)])).
% cnf(3523,negated_conjecture,(app(nil,esk54_0)=esk54_0|$false|~ssList(nil)),inference(rw,[status(thm)],[3522,583,theory(equality)])).
% cnf(3524,negated_conjecture,(app(nil,esk54_0)=esk54_0|$false|$false),inference(rw,[status(thm)],[3523,122,theory(equality)])).
% cnf(3525,negated_conjecture,(app(nil,esk54_0)=esk54_0),inference(cn,[status(thm)],[3524,theory(equality)])).
% cnf(3546,negated_conjecture,(cons(esk52_0,esk54_0)!=nil|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3374,3525,theory(equality)]),583,theory(equality)])).
% cnf(3547,negated_conjecture,(cons(esk52_0,esk54_0)!=nil),inference(cn,[status(thm)],[3546,theory(equality)])).
% cnf(3928,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|~ssList(X1)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3297,121,theory(equality)])).
% cnf(3929,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3928,122,theory(equality)])).
% cnf(3930,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[3929,585,theory(equality)])).
% cnf(3931,negated_conjecture,(X1=esk54_0|app(cons(esk52_0,nil),X1)!=cons(esk52_0,esk54_0)|~ssList(X1)),inference(cn,[status(thm)],[3930,theory(equality)])).
% cnf(3933,negated_conjecture,(X1=esk54_0|cons(esk52_0,app(nil,X1))!=cons(esk52_0,esk54_0)|~ssList(X1)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3931,151,theory(equality)])).
% cnf(3937,negated_conjecture,(X1=esk54_0|cons(esk52_0,app(nil,X1))!=cons(esk52_0,esk54_0)|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3933,122,theory(equality)])).
% cnf(3938,negated_conjecture,(X1=esk54_0|cons(esk52_0,app(nil,X1))!=cons(esk52_0,esk54_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[3937,585,theory(equality)])).
% cnf(3939,negated_conjecture,(X1=esk54_0|cons(esk52_0,app(nil,X1))!=cons(esk52_0,esk54_0)|~ssList(X1)),inference(cn,[status(thm)],[3938,theory(equality)])).
% cnf(3945,negated_conjecture,(nil=esk54_0|cons(esk52_0,nil)!=cons(esk52_0,esk54_0)|~ssList(nil)),inference(spm,[status(thm)],[3939,216,theory(equality)])).
% cnf(3948,negated_conjecture,(nil=esk54_0|cons(esk52_0,nil)!=cons(esk52_0,esk54_0)|$false),inference(rw,[status(thm)],[3945,122,theory(equality)])).
% cnf(3949,negated_conjecture,(nil=esk54_0|cons(esk52_0,nil)!=cons(esk52_0,esk54_0)),inference(cn,[status(thm)],[3948,theory(equality)])).
% cnf(3957,negated_conjecture,(app(tl(esk53_0),cons(esk52_0,esk54_0))=tl(esk50_0)|esk53_0=nil|$false),inference(rw,[status(thm)],[1728,3322,theory(equality)])).
% cnf(3958,negated_conjecture,(app(tl(esk53_0),cons(esk52_0,esk54_0))=tl(esk50_0)|esk53_0=nil),inference(cn,[status(thm)],[3957,theory(equality)])).
% cnf(3969,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)],[213,3958,theory(equality)])).
% cnf(4001,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0=nil|tl(esk50_0)!=nil|$false|~ssList(tl(esk53_0))),inference(rw,[status(thm)],[3969,3322,theory(equality)])).
% cnf(4002,negated_conjecture,(nil=cons(esk52_0,esk54_0)|esk53_0=nil|tl(esk50_0)!=nil|~ssList(tl(esk53_0))),inference(cn,[status(thm)],[4001,theory(equality)])).
% cnf(4003,negated_conjecture,(esk53_0=nil|tl(esk50_0)!=nil|~ssList(tl(esk53_0))),inference(sr,[status(thm)],[4002,3547,theory(equality)])).
% cnf(4028,negated_conjecture,(esk53_0=nil|esk50_0=nil|~ssList(tl(esk53_0))),inference(spm,[status(thm)],[4003,2035,theory(equality)])).
% cnf(4030,negated_conjecture,(esk53_0=nil|~ssList(tl(esk53_0))),inference(csr,[status(thm)],[4028,3327])).
% cnf(4031,negated_conjecture,(esk53_0=nil|~ssList(esk53_0)),inference(spm,[status(thm)],[4030,434,theory(equality)])).
% cnf(4032,negated_conjecture,(esk53_0=nil|$false),inference(rw,[status(thm)],[4031,584,theory(equality)])).
% cnf(4033,negated_conjecture,(esk53_0=nil),inference(cn,[status(thm)],[4032,theory(equality)])).
% cnf(4061,negated_conjecture,(cons(esk52_0,esk54_0)=nil|nil!=esk50_0),inference(rw,[status(thm)],[3244,4033,theory(equality)])).
% cnf(4062,negated_conjecture,(esk50_0!=nil),inference(sr,[status(thm)],[4061,3547,theory(equality)])).
% cnf(4065,negated_conjecture,(app(nil,cons(esk52_0,esk54_0))=esk50_0),inference(rw,[status(thm)],[1699,4033,theory(equality)])).
% cnf(4081,negated_conjecture,(memberP(esk54_0,esk55_0)|memberP(nil,esk55_0)),inference(rw,[status(thm)],[580,4033,theory(equality)])).
% cnf(4084,negated_conjecture,(cons(esk56_0,nil)=esk50_0),inference(sr,[status(thm)],[592,4062,theory(equality)])).
% cnf(4093,negated_conjecture,(hd(esk50_0)=esk56_0),inference(sr,[status(thm)],[1996,4062,theory(equality)])).
% cnf(4285,negated_conjecture,(esk50_0=cons(esk52_0,esk54_0)|~ssList(cons(esk52_0,esk54_0))),inference(spm,[status(thm)],[154,4065,theory(equality)])).
% cnf(4348,negated_conjecture,(esk50_0=cons(esk52_0,esk54_0)|$false),inference(rw,[status(thm)],[4285,3322,theory(equality)])).
% cnf(4349,negated_conjecture,(esk50_0=cons(esk52_0,esk54_0)),inference(cn,[status(thm)],[4348,theory(equality)])).
% cnf(4393,negated_conjecture,(hd(esk50_0)=esk52_0),inference(rw,[status(thm)],[3482,4349,theory(equality)])).
% cnf(4402,negated_conjecture,(esk54_0=nil|esk50_0!=cons(esk52_0,nil)),inference(rw,[status(thm)],[3949,4349,theory(equality)])).
% cnf(4863,negated_conjecture,(esk56_0=esk52_0),inference(rw,[status(thm)],[4393,4093,theory(equality)])).
% cnf(4882,negated_conjecture,(esk54_0=nil|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4402,4863,theory(equality)]),4084,theory(equality)])).
% cnf(4883,negated_conjecture,(esk54_0=nil),inference(cn,[status(thm)],[4882,theory(equality)])).
% cnf(4900,negated_conjecture,(memberP(nil,esk55_0)|memberP(nil,esk55_0)),inference(rw,[status(thm)],[4081,4883,theory(equality)])).
% cnf(4901,negated_conjecture,(memberP(nil,esk55_0)),inference(cn,[status(thm)],[4900,theory(equality)])).
% cnf(4909,negated_conjecture,(~ssItem(esk55_0)),inference(spm,[status(thm)],[190,4901,theory(equality)])).
% cnf(4928,negated_conjecture,($false),inference(rw,[status(thm)],[4909,581,theory(equality)])).
% cnf(4929,negated_conjecture,($false),inference(cn,[status(thm)],[4928,theory(equality)])).
% cnf(4930,negated_conjecture,($false),4929,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 569
% # ...of these trivial : 22
% # ...subsumed : 122
% # ...remaining for further processing: 425
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 30
% # Backward-rewritten : 118
% # Generated clauses : 1712
% # ...of the previous two non-trivial : 1595
% # Contextual simplify-reflections : 113
% # Paramodulations : 1597
% # Factorizations : 0
% # Equation resolutions : 98
% # Current number of processed clauses: 254
% # Positive orientable unit clauses: 47
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 203
% # Current number of unprocessed clauses: 637
% # ...number of literals in the above : 4093
% # Clause-clause subsumption calls (NU) : 2619
% # Rec. Clause-clause subsumption calls : 1618
% # Unit Clause-clause subsumption calls : 425
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 32
% # Backwards rewriting index: 283 leaves, 1.29+/-1.040 terms/leaf
% # Paramod-from index: 138 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 245 leaves, 1.19+/-0.885 terms/leaf
% # -------------------------------------------------
% # User time : 0.141 s
% # System time : 0.005 s
% # Total time : 0.146 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.31 CPU 0.39 WC
% FINAL PrfWatch: 0.31 CPU 0.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP6532/SWC295+1.tptp
%
%------------------------------------------------------------------------------