TSTP Solution File: RNG089+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG089+1 : 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:37 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/SystemOnTPTP1255/RNG089+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1255/RNG089+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1255/RNG089+1.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 1352
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,(aIdeal0(xI)&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__870)).
% fof(9, axiom,((aElementOf0(xx,sdtpldt1(xI,xJ))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__901)).
% fof(10, axiom,((aElementOf0(xk,xI)&aElementOf0(xl,xJ))&xx=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__934)).
% fof(13, axiom,![X1]:(aIdeal0(X1)<=>(aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>(![X3]:(aElementOf0(X3,X1)=>aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(aElement0(X3)=>aElementOf0(sdtasdt0(X3,X2),X1)))))),file('/tmp/SRASS.s.p', mDefIdeal)).
% fof(30, conjecture,(aElementOf0(sdtasdt0(xz,xk),xI)&aElementOf0(sdtasdt0(xz,xl),xJ)),file('/tmp/SRASS.s.p', m__)).
% fof(31, negated_conjecture,~((aElementOf0(sdtasdt0(xz,xk),xI)&aElementOf0(sdtasdt0(xz,xl),xJ))),inference(assume_negation,[status(cth)],[30])).
% cnf(57,plain,(aIdeal0(xJ)),inference(split_conjunct,[status(thm)],[8])).
% cnf(58,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[8])).
% cnf(59,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[9])).
% cnf(63,plain,(aElementOf0(xl,xJ)),inference(split_conjunct,[status(thm)],[10])).
% cnf(64,plain,(aElementOf0(xk,xI)),inference(split_conjunct,[status(thm)],[10])).
% fof(70, plain,![X1]:((~(aIdeal0(X1))|(aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|(![X3]:(~(aElementOf0(X3,X1))|aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(~(aElement0(X3))|aElementOf0(sdtasdt0(X3,X2),X1))))))&((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&(?[X3]:(aElementOf0(X3,X1)&~(aElementOf0(sdtpldt0(X2,X3),X1)))|?[X3]:(aElement0(X3)&~(aElementOf0(sdtasdt0(X3,X2),X1))))))|aIdeal0(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(71, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|?[X8]:(aElementOf0(X8,X4)&(?[X9]:(aElementOf0(X9,X4)&~(aElementOf0(sdtpldt0(X8,X9),X4)))|?[X10]:(aElement0(X10)&~(aElementOf0(sdtasdt0(X10,X8),X4))))))|aIdeal0(X4))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|(aElementOf0(esk1_1(X4),X4)&((aElementOf0(esk2_1(X4),X4)&~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|(aElement0(esk3_1(X4))&~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))&(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4)))|~(aElementOf0(X5,X4)))&aSet0(X4))|~(aIdeal0(X4)))&((~(aSet0(X4))|(aElementOf0(esk1_1(X4),X4)&((aElementOf0(esk2_1(X4),X4)&~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|(aElement0(esk3_1(X4))&~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4)))&(((~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4))))&(aSet0(X4)|~(aIdeal0(X4))))&(((aElementOf0(esk1_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk3_1(X4))|aElementOf0(esk2_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))|aElementOf0(esk2_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk3_1(X4))|~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[73])).
% cnf(82,plain,(aElementOf0(sdtasdt0(X3,X2),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[74])).
% fof(159, negated_conjecture,(~(aElementOf0(sdtasdt0(xz,xk),xI))|~(aElementOf0(sdtasdt0(xz,xl),xJ))),inference(fof_nnf,[status(thm)],[31])).
% cnf(160,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xl),xJ)|~aElementOf0(sdtasdt0(xz,xk),xI)),inference(split_conjunct,[status(thm)],[159])).
% cnf(223,plain,(aElementOf0(sdtasdt0(X1,X2),xJ)|~aElementOf0(X2,xJ)|~aElement0(X1)),inference(spm,[status(thm)],[82,57,theory(equality)])).
% cnf(224,plain,(aElementOf0(sdtasdt0(X1,X2),xI)|~aElementOf0(X2,xI)|~aElement0(X1)),inference(spm,[status(thm)],[82,58,theory(equality)])).
% cnf(461,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)|~aElementOf0(xl,xJ)|~aElement0(xz)),inference(spm,[status(thm)],[160,223,theory(equality)])).
% cnf(479,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)|$false|~aElement0(xz)),inference(rw,[status(thm)],[461,63,theory(equality)])).
% cnf(480,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)|$false|$false),inference(rw,[status(thm)],[479,59,theory(equality)])).
% cnf(481,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)),inference(cn,[status(thm)],[480,theory(equality)])).
% cnf(546,negated_conjecture,(~aElementOf0(xk,xI)|~aElement0(xz)),inference(spm,[status(thm)],[481,224,theory(equality)])).
% cnf(566,negated_conjecture,($false|~aElement0(xz)),inference(rw,[status(thm)],[546,64,theory(equality)])).
% cnf(567,negated_conjecture,($false|$false),inference(rw,[status(thm)],[566,59,theory(equality)])).
% cnf(568,negated_conjecture,($false),inference(cn,[status(thm)],[567,theory(equality)])).
% cnf(569,negated_conjecture,($false),568,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 99
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 86
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 236
% # ...of the previous two non-trivial : 197
% # Contextual simplify-reflections : 0
% # Paramodulations : 227
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 84
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 155
% # ...number of literals in the above : 704
% # Clause-clause subsumption calls (NU) : 119
% # Rec. Clause-clause subsumption calls : 99
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 115 leaves, 1.31+/-1.122 terms/leaf
% # Paramod-from index: 52 leaves, 1.06+/-0.233 terms/leaf
% # Paramod-into index: 99 leaves, 1.12+/-0.477 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.004 s
% # Total time : 0.029 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/SystemOnTPTP1255/RNG089+1.tptp
%
%------------------------------------------------------------------------------