TSTP Solution File: SWC188+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC188+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:23:23 EST 2010
% Result : Theorem 1.59s
% Output : Solution 1.59s
% 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/SystemOnTPTP6880/SWC188+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6880/SWC188+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6880/SWC188+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 7012
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 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(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(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(21, 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(28, axiom,![X1]:(ssList(X1)=>(equalelemsP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>(app(X4,cons(X2,cons(X3,X5)))=X1=>X2=X3))))))),file('/tmp/SRASS.s.p', ax14)).
% fof(46, axiom,![X1]:(ssItem(X1)=>equalelemsP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax73)).
% fof(81, axiom,equalelemsP(nil),file('/tmp/SRASS.s.p', ax74)).
% 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)|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)|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)|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(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(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(191, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(192, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[191])).
% fof(193, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[192])).
% cnf(194,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[193])).
% fof(195, 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)],[21])).
% fof(196, 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)],[195])).
% fof(197, 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)],[196])).
% cnf(198,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[197])).
% fof(263, plain,![X1]:(~(ssList(X1))|((~(equalelemsP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|(~(app(X4,cons(X2,cons(X3,X5)))=X1)|X2=X3))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&(app(X4,cons(X2,cons(X3,X5)))=X1&~(X2=X3))))))|equalelemsP(X1)))),inference(fof_nnf,[status(thm)],[28])).
% fof(264, plain,![X6]:(~(ssList(X6))|((~(equalelemsP(X6))|![X7]:(~(ssItem(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))))))&(?[X11]:(ssItem(X11)&?[X12]:(ssItem(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(app(X13,cons(X11,cons(X12,X14)))=X6&~(X11=X12))))))|equalelemsP(X6)))),inference(variable_rename,[status(thm)],[263])).
% fof(265, plain,![X6]:(~(ssList(X6))|((~(equalelemsP(X6))|![X7]:(~(ssItem(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))))))&((ssItem(esk27_1(X6))&(ssItem(esk28_1(X6))&(ssList(esk29_1(X6))&(ssList(esk30_1(X6))&(app(esk29_1(X6),cons(esk27_1(X6),cons(esk28_1(X6),esk30_1(X6))))=X6&~(esk27_1(X6)=esk28_1(X6)))))))|equalelemsP(X6)))),inference(skolemize,[status(esa)],[264])).
% fof(266, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))|~(ssList(X9)))|~(ssItem(X8)))|~(ssItem(X7)))|~(equalelemsP(X6)))&((ssItem(esk27_1(X6))&(ssItem(esk28_1(X6))&(ssList(esk29_1(X6))&(ssList(esk30_1(X6))&(app(esk29_1(X6),cons(esk27_1(X6),cons(esk28_1(X6),esk30_1(X6))))=X6&~(esk27_1(X6)=esk28_1(X6)))))))|equalelemsP(X6)))|~(ssList(X6))),inference(shift_quantors,[status(thm)],[265])).
% fof(267, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))|~(ssList(X9)))|~(ssItem(X8)))|~(ssItem(X7)))|~(equalelemsP(X6)))|~(ssList(X6)))&(((ssItem(esk27_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssItem(esk28_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssList(esk29_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssList(esk30_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((app(esk29_1(X6),cons(esk27_1(X6),cons(esk28_1(X6),esk30_1(X6))))=X6|equalelemsP(X6))|~(ssList(X6)))&((~(esk27_1(X6)=esk28_1(X6))|equalelemsP(X6))|~(ssList(X6))))))))),inference(distribute,[status(thm)],[266])).
% cnf(274,plain,(X2=X3|~ssList(X1)|~equalelemsP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|app(X4,cons(X2,cons(X3,X5)))!=X1|~ssList(X5)),inference(split_conjunct,[status(thm)],[267])).
% fof(353, plain,![X1]:(~(ssItem(X1))|equalelemsP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[46])).
% fof(354, plain,![X2]:(~(ssItem(X2))|equalelemsP(cons(X2,nil))),inference(variable_rename,[status(thm)],[353])).
% cnf(355,plain,(equalelemsP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[354])).
% cnf(502,plain,(equalelemsP(nil)),inference(split_conjunct,[status(thm)],[81])).
% 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&~(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&~(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&~(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)))&(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)&(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&~(esk52_0=esk53_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(X20,esk56_0))))&(nil=esk50_0|(((~(ssItem(X20))|esk56_0=X20)|~(memberP(esk51_0,X20)))|~(leq(X20,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)))))&((nil=esk51_0|ssItem(esk56_0))&(nil=esk50_0|ssItem(esk56_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&~(esk52_0=esk53_0))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk52_0!=esk53_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,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(579,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk56_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(cons(esk56_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,583,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)],[578,583,theory(equality)])).
% cnf(612,negated_conjecture,(equalelemsP(esk50_0)|esk50_0=nil|~ssItem(esk56_0)),inference(spm,[status(thm)],[355,589,theory(equality)])).
% cnf(1029,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[597,198,theory(equality)])).
% cnf(1039,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1029,580,theory(equality)])).
% cnf(1040,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1039,theory(equality)])).
% cnf(1763,negated_conjecture,(esk50_0=nil|equalelemsP(esk50_0)),inference(csr,[status(thm)],[612,585])).
% cnf(1949,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1040,121,theory(equality)])).
% cnf(1950,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1949,122,theory(equality)])).
% cnf(1951,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|$false|$false),inference(rw,[status(thm)],[1950,581,theory(equality)])).
% cnf(1952,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1951,theory(equality)])).
% cnf(1953,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1952,121,theory(equality)])).
% cnf(1954,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1953,122,theory(equality)])).
% cnf(1955,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1954,582,theory(equality)])).
% cnf(1956,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0),inference(cn,[status(thm)],[1955,theory(equality)])).
% cnf(1974,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssItem(esk52_0)),inference(spm,[status(thm)],[1956,194,theory(equality)])).
% cnf(2014,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[1974,582,theory(equality)])).
% cnf(2015,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[2014,theory(equality)])).
% cnf(2016,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2015,121,theory(equality)])).
% cnf(2017,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2016,122,theory(equality)])).
% cnf(2018,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[2017,581,theory(equality)])).
% cnf(2019,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0),inference(cn,[status(thm)],[2018,theory(equality)])).
% cnf(2034,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|~ssList(esk55_0)|~ssList(cons(esk52_0,cons(esk53_0,nil)))|~ssList(esk54_0)),inference(spm,[status(thm)],[198,2019,theory(equality)])).
% cnf(2066,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|$false|~ssList(cons(esk52_0,cons(esk53_0,nil)))|~ssList(esk54_0)),inference(rw,[status(thm)],[2034,579,theory(equality)])).
% cnf(2067,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|$false|~ssList(cons(esk52_0,cons(esk53_0,nil)))|$false),inference(rw,[status(thm)],[2066,580,theory(equality)])).
% cnf(2068,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|~ssList(cons(esk52_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[2067,theory(equality)])).
% cnf(2072,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))|~ssItem(esk52_0)),inference(spm,[status(thm)],[2068,121,theory(equality)])).
% cnf(2073,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[2072,582,theory(equality)])).
% cnf(2074,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[2073,theory(equality)])).
% cnf(2075,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2074,121,theory(equality)])).
% cnf(2076,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2075,122,theory(equality)])).
% cnf(2077,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2076,581,theory(equality)])).
% cnf(2078,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0),inference(cn,[status(thm)],[2077,theory(equality)])).
% cnf(2093,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2078,151,theory(equality)])).
% cnf(2125,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2093,579,theory(equality)])).
% cnf(2126,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|$false|$false),inference(rw,[status(thm)],[2125,582,theory(equality)])).
% cnf(2127,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[2126,theory(equality)])).
% cnf(2128,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2127,121,theory(equality)])).
% cnf(2129,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2128,122,theory(equality)])).
% cnf(2130,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[2129,581,theory(equality)])).
% cnf(2131,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0),inference(cn,[status(thm)],[2130,theory(equality)])).
% cnf(2153,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|~ssList(esk55_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2131,194,theory(equality)])).
% cnf(2206,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2153,579,theory(equality)])).
% cnf(2207,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[2206,581,theory(equality)])).
% cnf(2208,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0),inference(cn,[status(thm)],[2207,theory(equality)])).
% cnf(2229,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[274,2208,theory(equality)])).
% cnf(2277,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2229,579,theory(equality)])).
% cnf(2278,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2277,580,theory(equality)])).
% cnf(2279,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2278,581,theory(equality)])).
% cnf(2280,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2279,582,theory(equality)])).
% cnf(2281,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2280,theory(equality)])).
% cnf(2282,negated_conjecture,(esk50_0!=X1|~equalelemsP(X1)|~ssList(X1)),inference(sr,[status(thm)],[2281,577,theory(equality)])).
% cnf(3844,negated_conjecture,(~equalelemsP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2282,theory(equality)])).
% cnf(3845,negated_conjecture,(~equalelemsP(esk50_0)|$false),inference(rw,[status(thm)],[3844,593,theory(equality)])).
% cnf(3846,negated_conjecture,(~equalelemsP(esk50_0)),inference(cn,[status(thm)],[3845,theory(equality)])).
% cnf(3847,negated_conjecture,(esk50_0=nil),inference(sr,[status(thm)],[1763,3846,theory(equality)])).
% cnf(3967,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3846,3847,theory(equality)]),502,theory(equality)])).
% cnf(3968,negated_conjecture,($false),inference(cn,[status(thm)],[3967,theory(equality)])).
% cnf(3969,negated_conjecture,($false),3968,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 455
% # ...of these trivial : 2
% # ...subsumed : 76
% # ...remaining for further processing: 377
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 23
% # Backward-rewritten : 127
% # Generated clauses : 1374
% # ...of the previous two non-trivial : 1259
% # Contextual simplify-reflections : 93
% # Paramodulations : 1276
% # Factorizations : 0
% # Equation resolutions : 96
% # Current number of processed clauses: 219
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 191
% # Current number of unprocessed clauses: 511
% # ...number of literals in the above : 3351
% # Clause-clause subsumption calls (NU) : 4278
% # Rec. Clause-clause subsumption calls : 2661
% # Unit Clause-clause subsumption calls : 101
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 39
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 254 leaves, 1.32+/-1.093 terms/leaf
% # Paramod-from index: 115 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 218 leaves, 1.22+/-0.936 terms/leaf
% # -------------------------------------------------
% # User time : 0.115 s
% # System time : 0.006 s
% # Total time : 0.121 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP6880/SWC188+1.tptp
%
%------------------------------------------------------------------------------