TSTP Solution File: RNG123+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG123+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 : art07.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:48:34 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP16714/RNG123+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16714/RNG123+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16714/RNG123+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 16810
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(23, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(33, axiom,aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),file('/tmp/SRASS.s.p', m__2690)).
% fof(34, axiom,aElementOf0(xb,xI),file('/tmp/SRASS.s.p', m__2699)).
% fof(35, axiom,xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),file('/tmp/SRASS.s.p', m__2718)).
% fof(36, 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(55, conjecture,aElementOf0(xr,xI),file('/tmp/SRASS.s.p', m__)).
% fof(56, negated_conjecture,~(aElementOf0(xr,xI)),inference(assume_negation,[status(cth)],[55])).
% fof(64, negated_conjecture,~(aElementOf0(xr,xI)),inference(fof_simplification,[status(thm)],[56,theory(equality)])).
% cnf(155,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[23])).
% cnf(184,plain,(aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(split_conjunct,[status(thm)],[33])).
% cnf(185,plain,(aElementOf0(xb,xI)),inference(split_conjunct,[status(thm)],[34])).
% cnf(186,plain,(xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)),inference(split_conjunct,[status(thm)],[35])).
% fof(187, 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)],[36])).
% fof(188, 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)],[187])).
% fof(189, 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(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[188])).
% fof(190, 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(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[189])).
% fof(191, 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(esk8_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk10_1(X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk10_1(X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[190])).
% cnf(198,plain,(aElementOf0(sdtpldt0(X2,X3),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElementOf0(X3,X1)),inference(split_conjunct,[status(thm)],[191])).
% cnf(297,negated_conjecture,(~aElementOf0(xr,xI)),inference(split_conjunct,[status(thm)],[64])).
% cnf(500,plain,(aElementOf0(xr,X1)|~aElementOf0(xb,X1)|~aElementOf0(smndt0(sdtasdt0(xq,xu)),X1)|~aIdeal0(X1)),inference(spm,[status(thm)],[198,186,theory(equality)])).
% cnf(2209,plain,(aElementOf0(xr,xI)|~aElementOf0(xb,xI)|~aIdeal0(xI)),inference(spm,[status(thm)],[500,184,theory(equality)])).
% cnf(2223,plain,(aElementOf0(xr,xI)|$false|~aIdeal0(xI)),inference(rw,[status(thm)],[2209,185,theory(equality)])).
% cnf(2224,plain,(aElementOf0(xr,xI)|$false|$false),inference(rw,[status(thm)],[2223,155,theory(equality)])).
% cnf(2225,plain,(aElementOf0(xr,xI)),inference(cn,[status(thm)],[2224,theory(equality)])).
% cnf(2226,plain,($false),inference(sr,[status(thm)],[2225,297,theory(equality)])).
% cnf(2227,plain,($false),2226,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 360
% # ...of these trivial : 12
% # ...subsumed : 107
% # ...remaining for further processing: 241
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 4
% # Generated clauses : 1043
% # ...of the previous two non-trivial : 864
% # Contextual simplify-reflections : 45
% # Paramodulations : 998
% # Factorizations : 0
% # Equation resolutions : 45
% # Current number of processed clauses: 226
% # Positive orientable unit clauses: 41
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 177
% # Current number of unprocessed clauses: 547
% # ...number of literals in the above : 2840
% # Clause-clause subsumption calls (NU) : 907
% # Rec. Clause-clause subsumption calls : 702
% # Unit Clause-clause subsumption calls : 37
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 239 leaves, 1.28+/-0.989 terms/leaf
% # Paramod-from index: 120 leaves, 1.09+/-0.289 terms/leaf
% # Paramod-into index: 217 leaves, 1.18+/-0.551 terms/leaf
% # -------------------------------------------------
% # User time : 0.071 s
% # System time : 0.004 s
% # Total time : 0.075 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP16714/RNG123+1.tptp
%
%------------------------------------------------------------------------------