TSTP Solution File: RNG088+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG088+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:15 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/SystemOnTPTP735/RNG088+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP735/RNG088+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP735/RNG088+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 831
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,(aIdeal0(xI)&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__870)).
% fof(6, axiom,((aElementOf0(xk,xI)&aElementOf0(xl,xJ))&xx=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__934)).
% fof(7, axiom,((aElementOf0(xm,xI)&aElementOf0(xn,xJ))&xy=sdtpldt0(xm,xn)),file('/tmp/SRASS.s.p', m__967)).
% fof(10, 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(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])).
% cnf(42,plain,(aIdeal0(xJ)),inference(split_conjunct,[status(thm)],[4])).
% cnf(43,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[4])).
% cnf(48,plain,(aElementOf0(xl,xJ)),inference(split_conjunct,[status(thm)],[6])).
% cnf(49,plain,(aElementOf0(xk,xI)),inference(split_conjunct,[status(thm)],[6])).
% cnf(51,plain,(aElementOf0(xn,xJ)),inference(split_conjunct,[status(thm)],[7])).
% cnf(52,plain,(aElementOf0(xm,xI)),inference(split_conjunct,[status(thm)],[7])).
% fof(72, 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)],[10])).
% fof(73, 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)],[72])).
% fof(74, 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(esk6_1(X4),X4)&((aElementOf0(esk7_1(X4),X4)&~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|(aElement0(esk8_1(X4))&~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[73])).
% fof(75, 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(esk6_1(X4),X4)&((aElementOf0(esk7_1(X4),X4)&~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|(aElement0(esk8_1(X4))&~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[74])).
% fof(76, 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(esk6_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk8_1(X4))|aElementOf0(esk7_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))|aElementOf0(esk7_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk8_1(X4))|~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[75])).
% cnf(83,plain,(aElementOf0(sdtpldt0(X2,X3),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElementOf0(X3,X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(156, negated_conjecture,(~(aElementOf0(sdtpldt0(xk,xm),xI))|~(aElementOf0(sdtpldt0(xl,xn),xJ))),inference(fof_nnf,[status(thm)],[30])).
% cnf(157,negated_conjecture,(~aElementOf0(sdtpldt0(xl,xn),xJ)|~aElementOf0(sdtpldt0(xk,xm),xI)),inference(split_conjunct,[status(thm)],[156])).
% cnf(200,plain,(aElementOf0(sdtpldt0(X1,X2),xJ)|~aElementOf0(X2,xJ)|~aElementOf0(X1,xJ)),inference(spm,[status(thm)],[83,42,theory(equality)])).
% cnf(201,plain,(aElementOf0(sdtpldt0(X1,X2),xI)|~aElementOf0(X2,xI)|~aElementOf0(X1,xI)),inference(spm,[status(thm)],[83,43,theory(equality)])).
% cnf(449,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)|~aElementOf0(xn,xJ)|~aElementOf0(xl,xJ)),inference(spm,[status(thm)],[157,200,theory(equality)])).
% cnf(468,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)|$false|~aElementOf0(xl,xJ)),inference(rw,[status(thm)],[449,51,theory(equality)])).
% cnf(469,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)|$false|$false),inference(rw,[status(thm)],[468,48,theory(equality)])).
% cnf(470,negated_conjecture,(~aElementOf0(sdtpldt0(xk,xm),xI)),inference(cn,[status(thm)],[469,theory(equality)])).
% cnf(483,negated_conjecture,(~aElementOf0(xm,xI)|~aElementOf0(xk,xI)),inference(spm,[status(thm)],[470,201,theory(equality)])).
% cnf(502,negated_conjecture,($false|~aElementOf0(xk,xI)),inference(rw,[status(thm)],[483,52,theory(equality)])).
% cnf(503,negated_conjecture,($false|$false),inference(rw,[status(thm)],[502,49,theory(equality)])).
% cnf(504,negated_conjecture,($false),inference(cn,[status(thm)],[503,theory(equality)])).
% cnf(505,negated_conjecture,($false),504,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 83
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 211
% # ...of the previous two non-trivial : 178
% # Contextual simplify-reflections : 0
% # Paramodulations : 202
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 79
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 159
% # ...number of literals in the above : 728
% # Clause-clause subsumption calls (NU) : 96
% # Rec. Clause-clause subsumption calls : 76
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 107 leaves, 1.35+/-1.161 terms/leaf
% # Paramod-from index: 49 leaves, 1.06+/-0.240 terms/leaf
% # Paramod-into index: 91 leaves, 1.13+/-0.496 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.007 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP735/RNG088+1.tptp
%
%------------------------------------------------------------------------------