TSTP Solution File: RNG087+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG087+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:29:07 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/SystemOnTPTP474/RNG087+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP474/RNG087+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP474/RNG087+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 572
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(13, axiom,((((?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&sdtpldt0(X1,X2)=xx)&aElementOf0(xx,sdtpldt1(xI,xJ)))&?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&sdtpldt0(X1,X2)=xy))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__901)).
% fof(28, conjecture,?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&xy=sdtpldt0(X1,X2)),file('/tmp/SRASS.s.p', m__)).
% fof(29, negated_conjecture,~(?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&xy=sdtpldt0(X1,X2))),inference(assume_negation,[status(cth)],[28])).
% fof(106, plain,((((?[X3]:?[X4]:((aElementOf0(X3,xI)&aElementOf0(X4,xJ))&sdtpldt0(X3,X4)=xx)&aElementOf0(xx,sdtpldt1(xI,xJ)))&?[X5]:?[X6]:((aElementOf0(X5,xI)&aElementOf0(X6,xJ))&sdtpldt0(X5,X6)=xy))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),inference(variable_rename,[status(thm)],[13])).
% fof(107, plain,((((((aElementOf0(esk11_0,xI)&aElementOf0(esk12_0,xJ))&sdtpldt0(esk11_0,esk12_0)=xx)&aElementOf0(xx,sdtpldt1(xI,xJ)))&((aElementOf0(esk13_0,xI)&aElementOf0(esk14_0,xJ))&sdtpldt0(esk13_0,esk14_0)=xy))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),inference(skolemize,[status(esa)],[106])).
% cnf(110,plain,(sdtpldt0(esk13_0,esk14_0)=xy),inference(split_conjunct,[status(thm)],[107])).
% cnf(111,plain,(aElementOf0(esk14_0,xJ)),inference(split_conjunct,[status(thm)],[107])).
% cnf(112,plain,(aElementOf0(esk13_0,xI)),inference(split_conjunct,[status(thm)],[107])).
% fof(170, negated_conjecture,![X1]:![X2]:((~(aElementOf0(X1,xI))|~(aElementOf0(X2,xJ)))|~(xy=sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[29])).
% fof(171, negated_conjecture,![X3]:![X4]:((~(aElementOf0(X3,xI))|~(aElementOf0(X4,xJ)))|~(xy=sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[170])).
% cnf(172,negated_conjecture,(xy!=sdtpldt0(X1,X2)|~aElementOf0(X2,xJ)|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[171])).
% cnf(177,negated_conjecture,(~aElementOf0(esk14_0,xJ)|~aElementOf0(esk13_0,xI)),inference(spm,[status(thm)],[172,110,theory(equality)])).
% cnf(178,negated_conjecture,($false|~aElementOf0(esk13_0,xI)),inference(rw,[status(thm)],[177,111,theory(equality)])).
% cnf(179,negated_conjecture,($false|$false),inference(rw,[status(thm)],[178,112,theory(equality)])).
% cnf(180,negated_conjecture,($false),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(181,negated_conjecture,($false),180,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 57
% # ...number of literals in the above : 213
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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: 31 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 26 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.005 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP474/RNG087+2.tptp
%
%------------------------------------------------------------------------------