TSTP Solution File: RNG102+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG102+2 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 22:37:12 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP5287/RNG102+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5287/RNG102+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5287/RNG102+2.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 5383
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,((((?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xx)&aElementOf0(xx,slsdtgt0(xc)))&?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xy))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__1933)).
% fof(41, conjecture,?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xy),file('/tmp/SRASS.s.p', m__)).
% fof(42, negated_conjecture,~(?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xy)),inference(assume_negation,[status(cth)],[41])).
% fof(57, plain,((((?[X2]:(aElement0(X2)&sdtasdt0(xc,X2)=xx)&aElementOf0(xx,slsdtgt0(xc)))&?[X3]:(aElement0(X3)&sdtasdt0(xc,X3)=xy))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),inference(variable_rename,[status(thm)],[5])).
% fof(58, plain,(((((aElement0(esk1_0)&sdtasdt0(xc,esk1_0)=xx)&aElementOf0(xx,slsdtgt0(xc)))&(aElement0(esk2_0)&sdtasdt0(xc,esk2_0)=xy))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),inference(skolemize,[status(esa)],[57])).
% cnf(61,plain,(sdtasdt0(xc,esk2_0)=xy),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,plain,(aElement0(esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% fof(251, negated_conjecture,![X1]:(~(aElement0(X1))|~(sdtasdt0(xc,X1)=xy)),inference(fof_nnf,[status(thm)],[42])).
% fof(252, negated_conjecture,![X2]:(~(aElement0(X2))|~(sdtasdt0(xc,X2)=xy)),inference(variable_rename,[status(thm)],[251])).
% cnf(253,negated_conjecture,(sdtasdt0(xc,X1)!=xy|~aElement0(X1)),inference(split_conjunct,[status(thm)],[252])).
% cnf(254,negated_conjecture,(~aElement0(esk2_0)),inference(spm,[status(thm)],[253,61,theory(equality)])).
% cnf(256,negated_conjecture,($false),inference(rw,[status(thm)],[254,62,theory(equality)])).
% cnf(257,negated_conjecture,($false),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(258,negated_conjecture,($false),257,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 110
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 110
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 88
% # ...number of literals in the above : 368
% # Clause-clause subsumption calls (NU) : 198
% # Rec. Clause-clause subsumption calls : 108
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 21 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 17 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.004 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP5287/RNG102+2.tptp
%
%------------------------------------------------------------------------------