TSTP Solution File: SET803+4 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET803+4 : TPTP v5.0.0. Released v3.2.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 00:09:40 EST 2010

% Result   : Theorem 0.93s
% Output   : Solution 0.93s
% 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/SystemOnTPTP30509/SET803+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP30509/SET803+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30509/SET803+4.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 30605
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X6]:(greatest(X6,X1,X2)<=>(member(X6,X2)&![X3]:(member(X3,X2)=>apply(X1,X3,X6)))),file('/tmp/SRASS.s.p', greatest)).
% fof(3, axiom,![X1]:![X2]:![X6]:(max(X6,X1,X2)<=>(member(X6,X2)&![X3]:((member(X3,X2)&apply(X1,X6,X3))=>X6=X3))),file('/tmp/SRASS.s.p', max)).
% fof(11, conjecture,![X1]:![X2]:(order(X1,X2)=>![X8]:![X9]:(((max(X8,X1,X2)&max(X9,X1,X2))&~(X8=X9))=>~(?[X6]:greatest(X6,X1,X2)))),file('/tmp/SRASS.s.p', thIV15)).
% fof(12, negated_conjecture,~(![X1]:![X2]:(order(X1,X2)=>![X8]:![X9]:(((max(X8,X1,X2)&max(X9,X1,X2))&~(X8=X9))=>~(?[X6]:greatest(X6,X1,X2))))),inference(assume_negation,[status(cth)],[11])).
% fof(19, plain,![X1]:![X2]:![X6]:((~(greatest(X6,X1,X2))|(member(X6,X2)&![X3]:(~(member(X3,X2))|apply(X1,X3,X6))))&((~(member(X6,X2))|?[X3]:(member(X3,X2)&~(apply(X1,X3,X6))))|greatest(X6,X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(20, plain,![X7]:![X8]:![X9]:((~(greatest(X9,X7,X8))|(member(X9,X8)&![X10]:(~(member(X10,X8))|apply(X7,X10,X9))))&((~(member(X9,X8))|?[X11]:(member(X11,X8)&~(apply(X7,X11,X9))))|greatest(X9,X7,X8))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X7]:![X8]:![X9]:((~(greatest(X9,X7,X8))|(member(X9,X8)&![X10]:(~(member(X10,X8))|apply(X7,X10,X9))))&((~(member(X9,X8))|(member(esk1_3(X7,X8,X9),X8)&~(apply(X7,esk1_3(X7,X8,X9),X9))))|greatest(X9,X7,X8))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X7]:![X8]:![X9]:![X10]:((((~(member(X10,X8))|apply(X7,X10,X9))&member(X9,X8))|~(greatest(X9,X7,X8)))&((~(member(X9,X8))|(member(esk1_3(X7,X8,X9),X8)&~(apply(X7,esk1_3(X7,X8,X9),X9))))|greatest(X9,X7,X8))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X7]:![X8]:![X9]:![X10]:((((~(member(X10,X8))|apply(X7,X10,X9))|~(greatest(X9,X7,X8)))&(member(X9,X8)|~(greatest(X9,X7,X8))))&(((member(esk1_3(X7,X8,X9),X8)|~(member(X9,X8)))|greatest(X9,X7,X8))&((~(apply(X7,esk1_3(X7,X8,X9),X9))|~(member(X9,X8)))|greatest(X9,X7,X8)))),inference(distribute,[status(thm)],[22])).
% cnf(26,plain,(member(X1,X3)|~greatest(X1,X2,X3)),inference(split_conjunct,[status(thm)],[23])).
% cnf(27,plain,(apply(X2,X4,X1)|~greatest(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(28, plain,![X1]:![X2]:![X6]:((~(max(X6,X1,X2))|(member(X6,X2)&![X3]:((~(member(X3,X2))|~(apply(X1,X6,X3)))|X6=X3)))&((~(member(X6,X2))|?[X3]:((member(X3,X2)&apply(X1,X6,X3))&~(X6=X3)))|max(X6,X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X7]:![X8]:![X9]:((~(max(X9,X7,X8))|(member(X9,X8)&![X10]:((~(member(X10,X8))|~(apply(X7,X9,X10)))|X9=X10)))&((~(member(X9,X8))|?[X11]:((member(X11,X8)&apply(X7,X9,X11))&~(X9=X11)))|max(X9,X7,X8))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X7]:![X8]:![X9]:((~(max(X9,X7,X8))|(member(X9,X8)&![X10]:((~(member(X10,X8))|~(apply(X7,X9,X10)))|X9=X10)))&((~(member(X9,X8))|((member(esk2_3(X7,X8,X9),X8)&apply(X7,X9,esk2_3(X7,X8,X9)))&~(X9=esk2_3(X7,X8,X9))))|max(X9,X7,X8))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X7]:![X8]:![X9]:![X10]:(((((~(member(X10,X8))|~(apply(X7,X9,X10)))|X9=X10)&member(X9,X8))|~(max(X9,X7,X8)))&((~(member(X9,X8))|((member(esk2_3(X7,X8,X9),X8)&apply(X7,X9,esk2_3(X7,X8,X9)))&~(X9=esk2_3(X7,X8,X9))))|max(X9,X7,X8))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X7]:![X8]:![X9]:![X10]:(((((~(member(X10,X8))|~(apply(X7,X9,X10)))|X9=X10)|~(max(X9,X7,X8)))&(member(X9,X8)|~(max(X9,X7,X8))))&((((member(esk2_3(X7,X8,X9),X8)|~(member(X9,X8)))|max(X9,X7,X8))&((apply(X7,X9,esk2_3(X7,X8,X9))|~(member(X9,X8)))|max(X9,X7,X8)))&((~(X9=esk2_3(X7,X8,X9))|~(member(X9,X8)))|max(X9,X7,X8)))),inference(distribute,[status(thm)],[31])).
% cnf(36,plain,(member(X1,X3)|~max(X1,X2,X3)),inference(split_conjunct,[status(thm)],[32])).
% cnf(37,plain,(X1=X4|~max(X1,X2,X3)|~apply(X2,X1,X4)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(106, negated_conjecture,?[X1]:?[X2]:(order(X1,X2)&?[X8]:?[X9]:(((max(X8,X1,X2)&max(X9,X1,X2))&~(X8=X9))&?[X6]:greatest(X6,X1,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(107, negated_conjecture,?[X10]:?[X11]:(order(X10,X11)&?[X12]:?[X13]:(((max(X12,X10,X11)&max(X13,X10,X11))&~(X12=X13))&?[X14]:greatest(X14,X10,X11))),inference(variable_rename,[status(thm)],[106])).
% fof(108, negated_conjecture,(order(esk11_0,esk12_0)&(((max(esk13_0,esk11_0,esk12_0)&max(esk14_0,esk11_0,esk12_0))&~(esk13_0=esk14_0))&greatest(esk15_0,esk11_0,esk12_0))),inference(skolemize,[status(esa)],[107])).
% cnf(109,negated_conjecture,(greatest(esk15_0,esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[108])).
% cnf(110,negated_conjecture,(esk13_0!=esk14_0),inference(split_conjunct,[status(thm)],[108])).
% cnf(111,negated_conjecture,(max(esk14_0,esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[108])).
% cnf(112,negated_conjecture,(max(esk13_0,esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[108])).
% cnf(184,negated_conjecture,(member(esk15_0,esk12_0)),inference(spm,[status(thm)],[26,109,theory(equality)])).
% cnf(185,negated_conjecture,(member(esk14_0,esk12_0)),inference(spm,[status(thm)],[36,111,theory(equality)])).
% cnf(186,negated_conjecture,(member(esk13_0,esk12_0)),inference(spm,[status(thm)],[36,112,theory(equality)])).
% cnf(187,negated_conjecture,(apply(esk11_0,X1,esk15_0)|~member(X1,esk12_0)),inference(spm,[status(thm)],[27,109,theory(equality)])).
% cnf(188,negated_conjecture,(esk14_0=X1|~apply(esk11_0,esk14_0,X1)|~member(X1,esk12_0)),inference(spm,[status(thm)],[37,111,theory(equality)])).
% cnf(189,negated_conjecture,(esk13_0=X1|~apply(esk11_0,esk13_0,X1)|~member(X1,esk12_0)),inference(spm,[status(thm)],[37,112,theory(equality)])).
% cnf(277,negated_conjecture,(esk14_0=esk15_0|~member(esk15_0,esk12_0)|~member(esk14_0,esk12_0)),inference(spm,[status(thm)],[188,187,theory(equality)])).
% cnf(278,negated_conjecture,(esk14_0=esk15_0|$false|~member(esk14_0,esk12_0)),inference(rw,[status(thm)],[277,184,theory(equality)])).
% cnf(279,negated_conjecture,(esk14_0=esk15_0|$false|$false),inference(rw,[status(thm)],[278,185,theory(equality)])).
% cnf(280,negated_conjecture,(esk14_0=esk15_0),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(281,negated_conjecture,(apply(esk11_0,X1,esk14_0)|~member(X1,esk12_0)),inference(rw,[status(thm)],[187,280,theory(equality)])).
% cnf(293,negated_conjecture,(esk13_0=esk14_0|~member(esk14_0,esk12_0)|~member(esk13_0,esk12_0)),inference(spm,[status(thm)],[189,281,theory(equality)])).
% cnf(294,negated_conjecture,(esk13_0=esk14_0|$false|~member(esk13_0,esk12_0)),inference(rw,[status(thm)],[293,185,theory(equality)])).
% cnf(295,negated_conjecture,(esk13_0=esk14_0|$false|$false),inference(rw,[status(thm)],[294,186,theory(equality)])).
% cnf(296,negated_conjecture,(esk13_0=esk14_0),inference(cn,[status(thm)],[295,theory(equality)])).
% cnf(297,negated_conjecture,($false),inference(sr,[status(thm)],[296,110,theory(equality)])).
% cnf(298,negated_conjecture,($false),297,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 236
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 235
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 3
% # Generated clauses                  : 105
% # ...of the previous two non-trivial : 103
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 105
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 120
% #    Positive orientable unit clauses: 8
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 111
% # Current number of unprocessed clauses: 86
% # ...number of literals in the above : 650
% # Clause-clause subsumption calls (NU) : 223
% # Rec. Clause-clause subsumption calls : 109
% # Unit Clause-clause subsumption calls : 109
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    75 leaves,   1.53+/-1.578 terms/leaf
% # Paramod-from index:           31 leaves,   1.03+/-0.177 terms/leaf
% # Paramod-into index:           69 leaves,   1.23+/-0.725 terms/leaf
% # -------------------------------------------------
% # User time              : 0.043 s
% # System time            : 0.001 s
% # Total time             : 0.044 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP30509/SET803+4.tptp
% 
%------------------------------------------------------------------------------