TSTP Solution File: SWC098+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC098+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 : art05.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:03:29 EST 2010

% Result   : Theorem 1.30s
% Output   : Solution 1.30s
% 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/SystemOnTPTP23635/SWC098+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP23635/SWC098+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23635/SWC098+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 23731
% 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(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(((ssItem(X5)&cons(X5,nil)=X1)&![X6]:(ssItem(X6)=>((~(memberP(X2,X6))|~(leq(X5,X6)))|X5=X6)))&memberP(X2,X5)))|(nil=X2&nil=X1))|(![X7]:(ssItem(X7)=>((~(cons(X7,nil)=X3)|~(memberP(X4,X7)))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X4,X8))&leq(X7,X8))))&(~(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)&cons(X5,nil)=X1)&![X6]:(ssItem(X6)=>((~(memberP(X2,X6))|~(leq(X5,X6)))|X5=X6)))&memberP(X2,X5)))|(nil=X2&nil=X1))|(![X7]:(ssItem(X7)=>((~(cons(X7,nil)=X3)|~(memberP(X4,X7)))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X4,X8))&leq(X7,X8))))&(~(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)&cons(X5,nil)=X1)&![X6]:(ssItem(X6)=>((~(memberP(X2,X6))|~(leq(X5,X6)))|X5=X6)))&memberP(X2,X5)))|(nil=X2&nil=X1))|(![X7]:(ssItem(X7)=>((~(cons(X7,nil)=X3)|~(memberP(X4,X7)))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X4,X8))&leq(X7,X8))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(113,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(131, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(132, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[132])).
% cnf(134,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[133])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&![X5]:(((~(ssItem(X5))|~(cons(X5,nil)=X1))|?[X6]:(ssItem(X6)&((memberP(X2,X6)&leq(X5,X6))&~(X5=X6))))|~(memberP(X2,X5))))&(~(nil=X2)|~(nil=X1)))&(?[X7]:(ssItem(X7)&((cons(X7,nil)=X3&memberP(X4,X7))&![X8]:(((~(ssItem(X8))|X7=X8)|~(memberP(X4,X8)))|~(leq(X7,X8)))))|(nil=X4&nil=X3))))))),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)&![X13]:(((~(ssItem(X13))|~(cons(X13,nil)=X9))|?[X14]:(ssItem(X14)&((memberP(X10,X14)&leq(X13,X14))&~(X13=X14))))|~(memberP(X10,X13))))&(~(nil=X10)|~(nil=X9)))&(?[X15]:(ssItem(X15)&((cons(X15,nil)=X11&memberP(X12,X15))&![X16]:(((~(ssItem(X16))|X15=X16)|~(memberP(X12,X16)))|~(leq(X15,X16)))))|(nil=X12&nil=X11))))))),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)&![X13]:(((~(ssItem(X13))|~(cons(X13,nil)=esk48_0))|(ssItem(esk52_1(X13))&((memberP(esk49_0,esk52_1(X13))&leq(X13,esk52_1(X13)))&~(X13=esk52_1(X13)))))|~(memberP(esk49_0,X13))))&(~(nil=esk49_0)|~(nil=esk48_0)))&((ssItem(esk53_0)&((cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0))&![X16]:(((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16)))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X16]:(((((((((((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16)))&(cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0)))&ssItem(esk53_0))|(nil=esk51_0&nil=esk50_0))&(((((~(ssItem(X13))|~(cons(X13,nil)=esk48_0))|(ssItem(esk52_1(X13))&((memberP(esk49_0,esk52_1(X13))&leq(X13,esk52_1(X13)))&~(X13=esk52_1(X13)))))|~(memberP(esk49_0,X13)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(~(nil=esk49_0)|~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X13]:![X16]:(((((((((nil=esk51_0|(((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16))))&(nil=esk50_0|(((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16)))))&(((nil=esk51_0|cons(esk53_0,nil)=esk50_0)&(nil=esk50_0|cons(esk53_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk53_0))&(nil=esk50_0|memberP(esk51_0,esk53_0)))))&((nil=esk51_0|ssItem(esk53_0))&(nil=esk50_0|ssItem(esk53_0))))&(((((ssItem(esk52_1(X13))|(~(ssItem(X13))|~(cons(X13,nil)=esk48_0)))|~(memberP(esk49_0,X13)))&((((memberP(esk49_0,esk52_1(X13))|(~(ssItem(X13))|~(cons(X13,nil)=esk48_0)))|~(memberP(esk49_0,X13)))&((leq(X13,esk52_1(X13))|(~(ssItem(X13))|~(cons(X13,nil)=esk48_0)))|~(memberP(esk49_0,X13))))&((~(X13=esk52_1(X13))|(~(ssItem(X13))|~(cons(X13,nil)=esk48_0)))|~(memberP(esk49_0,X13)))))&(esk49_0=esk51_0&esk48_0=esk50_0))&(~(nil=esk49_0)|~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)|X1!=esk52_1(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(leq(X1,esk52_1(X1))|~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(memberP(esk49_0,esk52_1(X1))|~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssItem(esk52_1(X1))|~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssItem(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk53_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(memberP(esk51_0,esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(cons(esk53_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(cons(esk53_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(esk53_0=X1|nil=esk50_0|~leq(esk53_0,X1)|~memberP(esk51_0,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[577,578,theory(equality)])).
% cnf(593,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[592,579,theory(equality)])).
% cnf(599,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[134,589,theory(equality)])).
% cnf(602,negated_conjecture,(esk51_0=nil|esk50_0!=nil|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[599,113,theory(equality)])).
% cnf(603,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssItem(esk53_0)),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(633,negated_conjecture,(ssItem(esk52_1(X1))|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(rw,[status(thm)],[583,578,theory(equality)])).
% cnf(634,negated_conjecture,(ssItem(esk52_1(X1))|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[633,579,theory(equality)])).
% cnf(645,negated_conjecture,(esk52_1(X1)!=X1|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(646,negated_conjecture,(esk52_1(X1)!=X1|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[645,579,theory(equality)])).
% cnf(647,negated_conjecture,(memberP(esk51_0,esk52_1(X1))|cons(X1,nil)!=esk48_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(rw,[status(thm)],[582,579,theory(equality)])).
% cnf(648,negated_conjecture,(memberP(esk51_0,esk52_1(X1))|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(rw,[status(thm)],[647,578,theory(equality)])).
% cnf(649,negated_conjecture,(memberP(esk51_0,esk52_1(X1))|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[648,579,theory(equality)])).
% cnf(666,negated_conjecture,(leq(X1,esk52_1(X1))|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(667,negated_conjecture,(leq(X1,esk52_1(X1))|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[666,579,theory(equality)])).
% cnf(1541,negated_conjecture,(esk51_0=nil|esk50_0!=nil),inference(csr,[status(thm)],[603,585])).
% cnf(1542,negated_conjecture,(esk50_0!=nil),inference(csr,[status(thm)],[1541,593])).
% cnf(1543,negated_conjecture,(ssItem(esk53_0)),inference(sr,[status(thm)],[584,1542,theory(equality)])).
% cnf(1544,negated_conjecture,(cons(esk53_0,nil)=esk50_0),inference(sr,[status(thm)],[588,1542,theory(equality)])).
% cnf(1545,negated_conjecture,(memberP(esk51_0,esk53_0)),inference(sr,[status(thm)],[586,1542,theory(equality)])).
% cnf(1584,negated_conjecture,(ssItem(esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[634,1544,theory(equality)])).
% cnf(1586,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[649,1544,theory(equality)])).
% cnf(1587,negated_conjecture,(leq(esk53_0,esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[667,1544,theory(equality)])).
% cnf(1685,negated_conjecture,(ssItem(esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[1584,1543,theory(equality)])).
% cnf(1686,negated_conjecture,(ssItem(esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[1685,theory(equality)])).
% cnf(1689,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[1586,1543,theory(equality)])).
% cnf(1690,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[1689,theory(equality)])).
% cnf(1691,negated_conjecture,(leq(esk53_0,esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[1587,1543,theory(equality)])).
% cnf(1692,negated_conjecture,(leq(esk53_0,esk52_1(esk53_0))|~memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[1691,theory(equality)])).
% cnf(1719,negated_conjecture,(ssItem(esk52_1(esk53_0))|$false),inference(rw,[status(thm)],[1686,1545,theory(equality)])).
% cnf(1720,negated_conjecture,(ssItem(esk52_1(esk53_0))),inference(cn,[status(thm)],[1719,theory(equality)])).
% cnf(1721,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|$false),inference(rw,[status(thm)],[1690,1545,theory(equality)])).
% cnf(1722,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))),inference(cn,[status(thm)],[1721,theory(equality)])).
% cnf(1729,negated_conjecture,(esk50_0=nil|esk53_0=esk52_1(esk53_0)|~leq(esk53_0,esk52_1(esk53_0))|~ssItem(esk52_1(esk53_0))),inference(spm,[status(thm)],[590,1722,theory(equality)])).
% cnf(1749,negated_conjecture,(esk50_0=nil|esk53_0=esk52_1(esk53_0)|~leq(esk53_0,esk52_1(esk53_0))|$false),inference(rw,[status(thm)],[1729,1720,theory(equality)])).
% cnf(1750,negated_conjecture,(esk50_0=nil|esk53_0=esk52_1(esk53_0)|~leq(esk53_0,esk52_1(esk53_0))),inference(cn,[status(thm)],[1749,theory(equality)])).
% cnf(1751,negated_conjecture,(esk52_1(esk53_0)=esk53_0|~leq(esk53_0,esk52_1(esk53_0))),inference(sr,[status(thm)],[1750,1542,theory(equality)])).
% cnf(1767,negated_conjecture,(leq(esk53_0,esk52_1(esk53_0))|$false),inference(rw,[status(thm)],[1692,1545,theory(equality)])).
% cnf(1768,negated_conjecture,(leq(esk53_0,esk52_1(esk53_0))),inference(cn,[status(thm)],[1767,theory(equality)])).
% cnf(1774,negated_conjecture,(esk52_1(esk53_0)=esk53_0|$false),inference(rw,[status(thm)],[1751,1768,theory(equality)])).
% cnf(1775,negated_conjecture,(esk52_1(esk53_0)=esk53_0),inference(cn,[status(thm)],[1774,theory(equality)])).
% cnf(1791,negated_conjecture,(cons(esk53_0,nil)!=esk50_0|~memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[646,1775,theory(equality)])).
% cnf(1795,negated_conjecture,($false|~memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(rw,[status(thm)],[1791,1544,theory(equality)])).
% cnf(1796,negated_conjecture,($false|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1795,1545,theory(equality)])).
% cnf(1797,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[1796,1543,theory(equality)])).
% cnf(1798,negated_conjecture,($false),inference(cn,[status(thm)],[1797,theory(equality)])).
% cnf(1799,negated_conjecture,($false),1798,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 222
% # ...of these trivial                : 2
% # ...subsumed                        : 5
% # ...remaining for further processing: 215
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 3
% # Backward-rewritten                 : 4
% # Generated clauses                  : 698
% # ...of the previous two non-trivial : 592
% # Contextual simplify-reflections    : 7
% # Paramodulations                    : 604
% # Factorizations                     : 0
% # Equation resolutions               : 91
% # Current number of processed clauses: 199
% #    Positive orientable unit clauses: 19
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 177
% # Current number of unprocessed clauses: 483
% # ...number of literals in the above : 3324
% # Clause-clause subsumption calls (NU) : 888
% # Rec. Clause-clause subsumption calls : 172
% # Unit Clause-clause subsumption calls : 34
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 5
% # Backwards rewriting index:   236 leaves,   1.34+/-1.129 terms/leaf
% # Paramod-from index:          103 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          197 leaves,   1.23+/-0.980 terms/leaf
% # -------------------------------------------------
% # User time              : 0.073 s
% # System time            : 0.005 s
% # Total time             : 0.078 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP23635/SWC098+1.tptp
% 
%------------------------------------------------------------------------------