TSTP Solution File: RNG088+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG088+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:29 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP994/RNG088+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP994/RNG088+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP994/RNG088+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 1090
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(12, axiom,(((((aSet0(xI)&![X1]:(aElementOf0(X1,xI)=>(![X2]:(aElementOf0(X2,xI)=>aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X1]:(aElementOf0(X1,xJ)=>(![X2]:(aElementOf0(X2,xJ)=>aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__870)).
% fof(14, axiom,((aElementOf0(xk,xI)&aElementOf0(xl,xJ))&xx=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__934)).
% fof(15, axiom,((aElementOf0(xm,xI)&aElementOf0(xn,xJ))&xy=sdtpldt0(xm,xn)),file('/tmp/SRASS.s.p', m__967)).
% fof(29, conjecture,(aElementOf0(sdtpldt0(xk,xm),xI)&aElementOf0(sdtpldt0(xl,xn),xJ)),file('/tmp/SRASS.s.p', m__)).
% fof(30, negated_conjecture,~((aElementOf0(sdtpldt0(xk,xm),xI)&aElementOf0(sdtpldt0(xl,xn),xJ))),inference(assume_negation,[status(cth)],[29])).
% fof(95, plain,(((((aSet0(xI)&![X1]:(~(aElementOf0(X1,xI))|(![X2]:(~(aElementOf0(X2,xI))|aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X1]:(~(aElementOf0(X1,xJ))|(![X2]:(~(aElementOf0(X2,xJ))|aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),inference(fof_nnf,[status(thm)],[12])).
% fof(96, plain,(((((aSet0(xI)&![X3]:(~(aElementOf0(X3,xI))|(![X4]:(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))&![X5]:(~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X6]:(~(aElementOf0(X6,xJ))|(![X7]:(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))&![X8]:(~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ)))))&aIdeal0(xJ)),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))&(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ)))|~(aElementOf0(X6,xJ)))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))&(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI)))|~(aElementOf0(X3,xI)))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))|~(aElementOf0(X6,xJ)))&((~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))|~(aElementOf0(X6,xJ))))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))|~(aElementOf0(X3,xI)))&((~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))|~(aElementOf0(X3,xI))))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(distribute,[status(thm)],[97])).
% cnf(103,plain,(aElementOf0(sdtpldt0(X1,X2),xI)|~aElementOf0(X1,xI)|~aElementOf0(X2,xI)),inference(split_conjunct,[status(thm)],[98])).
% cnf(105,plain,(aElementOf0(sdtpldt0(X1,X2),xJ)|~aElementOf0(X1,xJ)|~aElementOf0(X2,xJ)),inference(split_conjunct,[status(thm)],[98])).
% cnf(119,plain,(aElementOf0(xl,xJ)),inference(split_conjunct,[status(thm)],[14])).
% cnf(120,plain,(aElementOf0(xk,xI)),inference(split_conjunct,[status(thm)],[14])).
% cnf(122,plain,(aElementOf0(xn,xJ)),inference(split_conjunct,[status(thm)],[15])).
% cnf(123,plain,(aElementOf0(xm,xI)),inference(split_conjunct,[status(thm)],[15])).
% fof(174, negated_conjecture,(~(aElementOf0(sdtpldt0(xk,xm),xI))|~(aElementOf0(sdtpldt0(xl,xn),xJ))),inference(fof_nnf,[status(thm)],[30])).
% cnf(175,negated_conjecture,(~aElementOf0(sdtpldt0(xl,xn),xJ)|~aElementOf0(sdtpldt0(xk,xm),xI)),inference(split_conjunct,[status(thm)],[174])).
% cnf(238,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)|~aElementOf0(xn,xJ)|~aElementOf0(xl,xJ)),inference(spm,[status(thm)],[175,105,theory(equality)])).
% cnf(249,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)|$false|~aElementOf0(xl,xJ)),inference(rw,[status(thm)],[238,122,theory(equality)])).
% cnf(250,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)|$false|$false),inference(rw,[status(thm)],[249,119,theory(equality)])).
% cnf(251,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)),inference(cn,[status(thm)],[250,theory(equality)])).
% cnf(597,negated_conjecture,(~aElementOf0(xm,xI)|~aElementOf0(xk,xI)),inference(spm,[status(thm)],[251,103,theory(equality)])).
% cnf(598,negated_conjecture,($false|~aElementOf0(xk,xI)),inference(rw,[status(thm)],[597,123,theory(equality)])).
% cnf(599,negated_conjecture,($false|$false),inference(rw,[status(thm)],[598,120,theory(equality)])).
% cnf(600,negated_conjecture,($false),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(601,negated_conjecture,($false),600,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 82
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 247
% # ...of the previous two non-trivial : 215
% # Contextual simplify-reflections : 0
% # Paramodulations : 238
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 82
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 209
% # ...number of literals in the above : 904
% # Clause-clause subsumption calls (NU) : 90
% # Rec. Clause-clause subsumption calls : 70
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 113 leaves, 1.33+/-1.132 terms/leaf
% # Paramod-from index: 54 leaves, 1.06+/-0.229 terms/leaf
% # Paramod-into index: 99 leaves, 1.12+/-0.477 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.003 s
% # Total time : 0.030 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/SystemOnTPTP994/RNG088+2.tptp
%
%------------------------------------------------------------------------------