TSTP Solution File: SWC164+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC164+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:15:14 EST 2010
% Result : Theorem 1.38s
% Output : Solution 1.38s
% 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/SystemOnTPTP20238/SWC164+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20238/SWC164+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20238/SWC164+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 20334
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax1)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(16, axiom,![X1]:(ssItem(X1)=>leq(X1,X1)),file('/tmp/SRASS.s.p', ax31)).
% 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(26, axiom,![X1]:(ssList(X1)=>(cyclefreeP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1=>~((leq(X2,X3)&leq(X3,X2))))))))))),file('/tmp/SRASS.s.p', ax8)).
% fof(42, axiom,![X1]:(ssItem(X1)=>cyclefreeP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax59)).
% fof(77, axiom,cyclefreeP(nil),file('/tmp/SRASS.s.p', ax60)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:((~(ssList(X8))|~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1))|neq(X5,X6))))))|(![X9]:(((~(ssItem(X9))|~(cons(X9,nil)=X3))|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X10,X9)))&(~(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]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:((~(ssList(X8))|~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1))|neq(X5,X6))))))|(![X9]:(((~(ssItem(X9))|~(cons(X9,nil)=X3))|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X10,X9)))&(~(nil=X4)|~(nil=X3)))))))),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))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:((~(ssList(X8))|~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1))|neq(X5,X6))))))|(![X9]:(((~(ssItem(X9))|~(cons(X9,nil)=X3))|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X10,X9)))&(~(nil=X4)|~(nil=X3)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssItem(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssItem(X4)))|~(ssItem(X3)))&(((X3=X4|neq(X3,X4))|~(ssItem(X4)))|~(ssItem(X3)))),inference(distribute,[status(thm)],[106])).
% cnf(108,plain,(neq(X1,X2)|X1=X2|~ssItem(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[107])).
% fof(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(131, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[131])).
% cnf(133,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(156, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(157, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[156])).
% fof(158, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[157])).
% cnf(159,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[158])).
% fof(175, plain,![X1]:(~(ssItem(X1))|leq(X1,X1)),inference(fof_nnf,[status(thm)],[16])).
% fof(176, plain,![X2]:(~(ssItem(X2))|leq(X2,X2)),inference(variable_rename,[status(thm)],[175])).
% cnf(177,plain,(leq(X1,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[176])).
% fof(203, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(204, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[203])).
% fof(205, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[204])).
% cnf(206,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[205])).
% fof(207, 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(208, 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)],[207])).
% fof(209, 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)],[208])).
% cnf(210,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[209])).
% fof(221, plain,![X1]:(~(ssList(X1))|((~(cyclefreeP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1)|(~(leq(X2,X3))|~(leq(X3,X2))))))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1&(leq(X2,X3)&leq(X3,X2))))))))|cyclefreeP(X1)))),inference(fof_nnf,[status(thm)],[26])).
% fof(222, plain,![X7]:(~(ssList(X7))|((~(cyclefreeP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|(~(leq(X8,X9))|~(leq(X9,X8))))))))))&(?[X13]:(ssItem(X13)&?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(app(app(X15,cons(X13,X16)),cons(X14,X17))=X7&(leq(X13,X14)&leq(X14,X13))))))))|cyclefreeP(X7)))),inference(variable_rename,[status(thm)],[221])).
% fof(223, plain,![X7]:(~(ssList(X7))|((~(cyclefreeP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|(~(leq(X8,X9))|~(leq(X9,X8))))))))))&((ssItem(esk7_1(X7))&(ssItem(esk8_1(X7))&(ssList(esk9_1(X7))&(ssList(esk10_1(X7))&(ssList(esk11_1(X7))&(app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7)))=X7&(leq(esk7_1(X7),esk8_1(X7))&leq(esk8_1(X7),esk7_1(X7)))))))))|cyclefreeP(X7)))),inference(skolemize,[status(esa)],[222])).
% fof(224, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|(~(leq(X8,X9))|~(leq(X9,X8)))))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(cyclefreeP(X7)))&((ssItem(esk7_1(X7))&(ssItem(esk8_1(X7))&(ssList(esk9_1(X7))&(ssList(esk10_1(X7))&(ssList(esk11_1(X7))&(app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7)))=X7&(leq(esk7_1(X7),esk8_1(X7))&leq(esk8_1(X7),esk7_1(X7)))))))))|cyclefreeP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[223])).
% fof(225, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|(~(leq(X8,X9))|~(leq(X9,X8)))))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(cyclefreeP(X7)))|~(ssList(X7)))&(((ssItem(esk7_1(X7))|cyclefreeP(X7))|~(ssList(X7)))&(((ssItem(esk8_1(X7))|cyclefreeP(X7))|~(ssList(X7)))&(((ssList(esk9_1(X7))|cyclefreeP(X7))|~(ssList(X7)))&(((ssList(esk10_1(X7))|cyclefreeP(X7))|~(ssList(X7)))&(((ssList(esk11_1(X7))|cyclefreeP(X7))|~(ssList(X7)))&(((app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7)))=X7|cyclefreeP(X7))|~(ssList(X7)))&(((leq(esk7_1(X7),esk8_1(X7))|cyclefreeP(X7))|~(ssList(X7)))&((leq(esk8_1(X7),esk7_1(X7))|cyclefreeP(X7))|~(ssList(X7))))))))))),inference(distribute,[status(thm)],[224])).
% cnf(234,plain,(~ssList(X1)|~cyclefreeP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|~ssList(X5)|~leq(X3,X2)|~leq(X2,X3)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssList(X6)),inference(split_conjunct,[status(thm)],[225])).
% fof(347, plain,![X1]:(~(ssItem(X1))|cyclefreeP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[42])).
% fof(348, plain,![X2]:(~(ssItem(X2))|cyclefreeP(cons(X2,nil))),inference(variable_rename,[status(thm)],[347])).
% cnf(349,plain,(cyclefreeP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[348])).
% cnf(508,plain,(cyclefreeP(nil)),inference(split_conjunct,[status(thm)],[77])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:((ssList(X8)&app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1)&~(neq(X5,X6)))))))&(?[X9]:(((ssItem(X9)&cons(X9,nil)=X3)&memberP(X4,X9))&![X10]:(((~(ssItem(X10))|X9=X10)|~(memberP(X4,X10)))|~(leq(X10,X9))))|(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]:(ssItem(X16)&?[X17]:(ssList(X17)&?[X18]:((ssList(X18)&app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18)=X11)&~(neq(X15,X16)))))))&(?[X19]:(((ssItem(X19)&cons(X19,nil)=X13)&memberP(X14,X19))&![X20]:(((~(ssItem(X20))|X19=X20)|~(memberP(X14,X20)))|~(leq(X20,X19))))|(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)&(ssItem(esk53_0)&(ssList(esk54_0)&((ssList(esk55_0)&app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0)&~(neq(esk52_0,esk53_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(X20,esk56_0))))|(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(X20,esk56_0)))&((ssItem(esk56_0)&cons(esk56_0,nil)=esk50_0)&memberP(esk51_0,esk56_0)))|(nil=esk51_0&nil=esk50_0))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&((ssList(esk55_0)&app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0)&~(neq(esk52_0,esk53_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(X20,esk56_0))))&(nil=esk50_0|(((~(ssItem(X20))|esk56_0=X20)|~(memberP(esk51_0,X20)))|~(leq(X20,esk56_0)))))&((((nil=esk51_0|ssItem(esk56_0))&(nil=esk50_0|ssItem(esk56_0)))&((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)))))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&((ssList(esk55_0)&app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0)&~(neq(esk52_0,esk53_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(576,negated_conjecture,(~neq(esk52_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(cons(esk56_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(ssItem(esk56_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,582,theory(equality)])).
% cnf(597,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(604,negated_conjecture,(cyclefreeP(esk50_0)|esk50_0=nil|~ssItem(esk56_0)),inference(spm,[status(thm)],[349,587,theory(equality)])).
% cnf(719,negated_conjecture,(esk52_0=esk53_0|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[576,108,theory(equality)])).
% cnf(720,negated_conjecture,(esk52_0=esk53_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[719,580,theory(equality)])).
% cnf(721,negated_conjecture,(esk52_0=esk53_0|$false|$false),inference(rw,[status(thm)],[720,581,theory(equality)])).
% cnf(722,negated_conjecture,(esk52_0=esk53_0),inference(cn,[status(thm)],[721,theory(equality)])).
% cnf(1581,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[597,722,theory(equality)])).
% cnf(1624,negated_conjecture,(esk50_0=nil|cyclefreeP(esk50_0)),inference(csr,[status(thm)],[604,589])).
% cnf(1778,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))|~ssList(esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(spm,[status(thm)],[210,1581,theory(equality)])).
% cnf(1810,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))|$false|~ssList(cons(esk52_0,nil))|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(rw,[status(thm)],[1778,578,theory(equality)])).
% cnf(1811,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))|~ssList(cons(esk52_0,nil))|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(cn,[status(thm)],[1810,theory(equality)])).
% cnf(3086,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1811,133,theory(equality)])).
% cnf(3087,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3086,134,theory(equality)])).
% cnf(3088,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))|$false|$false),inference(rw,[status(thm)],[3087,581,theory(equality)])).
% cnf(3089,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(cn,[status(thm)],[3088,theory(equality)])).
% cnf(3090,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[3089,159,theory(equality)])).
% cnf(3091,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[3090,579,theory(equality)])).
% cnf(3092,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[3091,theory(equality)])).
% cnf(3093,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3092,133,theory(equality)])).
% cnf(3094,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3093,134,theory(equality)])).
% cnf(3095,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[3094,581,theory(equality)])).
% cnf(3096,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0),inference(cn,[status(thm)],[3095,theory(equality)])).
% cnf(3114,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3096,206,theory(equality)])).
% cnf(3127,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3114,578,theory(equality)])).
% cnf(3128,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[3127,581,theory(equality)])).
% cnf(3129,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0),inference(cn,[status(thm)],[3128,theory(equality)])).
% cnf(3156,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~leq(esk52_0,esk52_0)|~ssList(esk55_0)|~ssList(nil)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[234,3129,theory(equality)])).
% cnf(3201,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~leq(esk52_0,esk52_0)|$false|~ssList(nil)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[3156,578,theory(equality)])).
% cnf(3202,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~leq(esk52_0,esk52_0)|$false|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[3201,134,theory(equality)])).
% cnf(3203,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~leq(esk52_0,esk52_0)|$false|$false|$false|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[3202,579,theory(equality)])).
% cnf(3204,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~leq(esk52_0,esk52_0)|$false|$false|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[3203,581,theory(equality)])).
% cnf(3205,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~leq(esk52_0,esk52_0)|~ssList(X1)),inference(cn,[status(thm)],[3204,theory(equality)])).
% cnf(4196,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3205,177,theory(equality)])).
% cnf(4197,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~ssList(X1)|$false),inference(rw,[status(thm)],[4196,581,theory(equality)])).
% cnf(4198,negated_conjecture,(esk50_0!=X1|~cyclefreeP(X1)|~ssList(X1)),inference(cn,[status(thm)],[4197,theory(equality)])).
% cnf(4199,negated_conjecture,(~cyclefreeP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[4198,theory(equality)])).
% cnf(4200,negated_conjecture,(~cyclefreeP(esk50_0)|$false),inference(rw,[status(thm)],[4199,593,theory(equality)])).
% cnf(4201,negated_conjecture,(~cyclefreeP(esk50_0)),inference(cn,[status(thm)],[4200,theory(equality)])).
% cnf(4202,negated_conjecture,(esk50_0=nil),inference(sr,[status(thm)],[1624,4201,theory(equality)])).
% cnf(4205,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4201,4202,theory(equality)]),508,theory(equality)])).
% cnf(4206,negated_conjecture,($false),inference(cn,[status(thm)],[4205,theory(equality)])).
% cnf(4207,negated_conjecture,($false),4206,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 481
% # ...of these trivial : 5
% # ...subsumed : 79
% # ...remaining for further processing: 397
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 25
% # Backward-rewritten : 142
% # Generated clauses : 1547
% # ...of the previous two non-trivial : 1366
% # Contextual simplify-reflections : 99
% # Paramodulations : 1448
% # Factorizations : 0
% # Equation resolutions : 97
% # Current number of processed clauses: 222
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 194
% # Current number of unprocessed clauses: 482
% # ...number of literals in the above : 3512
% # Clause-clause subsumption calls (NU) : 4231
% # Rec. Clause-clause subsumption calls : 2611
% # Unit Clause-clause subsumption calls : 136
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 258 leaves, 1.31+/-1.085 terms/leaf
% # Paramod-from index: 117 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 221 leaves, 1.21+/-0.930 terms/leaf
% # -------------------------------------------------
% # User time : 0.129 s
% # System time : 0.008 s
% # Total time : 0.137 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.29 CPU 0.37 WC
% FINAL PrfWatch: 0.29 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP20238/SWC164+1.tptp
%
%------------------------------------------------------------------------------