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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : RNG116+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.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 : Wed Dec 29 22:44:55 EST 2010

% Result   : Theorem 1.27s
% Output   : Solution 1.27s
% 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/SystemOnTPTP7353/RNG116+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP7353/RNG116+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7353/RNG116+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 7449
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.028 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(31, axiom,((((?[X1]:(aElement0(X1)&sdtasdt0(xa,X1)=xk)&aElementOf0(xk,slsdtgt0(xa)))&?[X1]:(aElement0(X1)&sdtasdt0(xb,X1)=xl))&aElementOf0(xl,slsdtgt0(xb)))&xu=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__2456)).
% fof(48, conjecture,?[X1]:?[X2]:((aElement0(X1)&aElement0(X2))&xu=sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))),file('/tmp/SRASS.s.p', m__)).
% fof(49, negated_conjecture,~(?[X1]:?[X2]:((aElement0(X1)&aElement0(X2))&xu=sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)))),inference(assume_negation,[status(cth)],[48])).
% fof(304, plain,((((?[X2]:(aElement0(X2)&sdtasdt0(xa,X2)=xk)&aElementOf0(xk,slsdtgt0(xa)))&?[X3]:(aElement0(X3)&sdtasdt0(xb,X3)=xl))&aElementOf0(xl,slsdtgt0(xb)))&xu=sdtpldt0(xk,xl)),inference(variable_rename,[status(thm)],[31])).
% fof(305, plain,(((((aElement0(esk36_0)&sdtasdt0(xa,esk36_0)=xk)&aElementOf0(xk,slsdtgt0(xa)))&(aElement0(esk37_0)&sdtasdt0(xb,esk37_0)=xl))&aElementOf0(xl,slsdtgt0(xb)))&xu=sdtpldt0(xk,xl)),inference(skolemize,[status(esa)],[304])).
% cnf(306,plain,(xu=sdtpldt0(xk,xl)),inference(split_conjunct,[status(thm)],[305])).
% cnf(308,plain,(sdtasdt0(xb,esk37_0)=xl),inference(split_conjunct,[status(thm)],[305])).
% cnf(309,plain,(aElement0(esk37_0)),inference(split_conjunct,[status(thm)],[305])).
% cnf(311,plain,(sdtasdt0(xa,esk36_0)=xk),inference(split_conjunct,[status(thm)],[305])).
% cnf(312,plain,(aElement0(esk36_0)),inference(split_conjunct,[status(thm)],[305])).
% fof(380, negated_conjecture,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|~(xu=sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)))),inference(fof_nnf,[status(thm)],[49])).
% fof(381, negated_conjecture,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|~(xu=sdtpldt0(sdtasdt0(xa,X3),sdtasdt0(xb,X4)))),inference(variable_rename,[status(thm)],[380])).
% cnf(382,negated_conjecture,(xu!=sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[381])).
% cnf(399,negated_conjecture,(sdtpldt0(xk,sdtasdt0(xb,X1))!=xu|~aElement0(X1)|~aElement0(esk36_0)),inference(spm,[status(thm)],[382,311,theory(equality)])).
% cnf(400,negated_conjecture,(sdtpldt0(xk,sdtasdt0(xb,X1))!=xu|~aElement0(X1)|$false),inference(rw,[status(thm)],[399,312,theory(equality)])).
% cnf(401,negated_conjecture,(sdtpldt0(xk,sdtasdt0(xb,X1))!=xu|~aElement0(X1)),inference(cn,[status(thm)],[400,theory(equality)])).
% cnf(2765,negated_conjecture,(sdtpldt0(xk,xl)!=xu|~aElement0(esk37_0)),inference(spm,[status(thm)],[401,308,theory(equality)])).
% cnf(2790,negated_conjecture,($false|~aElement0(esk37_0)),inference(rw,[status(thm)],[2765,306,theory(equality)])).
% cnf(2791,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2790,309,theory(equality)])).
% cnf(2792,negated_conjecture,($false),inference(cn,[status(thm)],[2791,theory(equality)])).
% cnf(2793,negated_conjecture,($false),2792,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 414
% # ...of these trivial                : 5
% # ...subsumed                        : 9
% # ...remaining for further processing: 400
% # Other redundant clauses eliminated : 29
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 1091
% # ...of the previous two non-trivial : 977
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 1048
% # Factorizations                     : 0
% # Equation resolutions               : 40
% # Current number of processed clauses: 208
% #    Positive orientable unit clauses: 50
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 9
% #    Non-unit-clauses                : 149
% # Current number of unprocessed clauses: 946
% # ...number of literals in the above : 4151
% # Clause-clause subsumption calls (NU) : 700
% # Rec. Clause-clause subsumption calls : 303
% # Unit Clause-clause subsumption calls : 51
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   228 leaves,   1.25+/-0.934 terms/leaf
% # Paramod-from index:          110 leaves,   1.05+/-0.208 terms/leaf
% # Paramod-into index:          206 leaves,   1.13+/-0.466 terms/leaf
% # -------------------------------------------------
% # User time              : 0.087 s
% # System time            : 0.006 s
% # Total time             : 0.093 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.30 WC
% FINAL PrfWatch: 0.24 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP7353/RNG116+4.tptp
% 
%------------------------------------------------------------------------------