TSTP Solution File: RNG121+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG121+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:00 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP17070/RNG121+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17070/RNG121+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17070/RNG121+4.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 17166
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.027 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:(aElement0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(25, axiom,(aElement0(xa)&aElement0(xb)),file('/tmp/SRASS.s.p', m__2091)).
% fof(29, axiom,(((((((?[X1]:(aElement0(X1)&sdtasdt0(xa,X1)=sz00)&aElementOf0(sz00,slsdtgt0(xa)))&?[X1]:(aElement0(X1)&sdtasdt0(xa,X1)=xa))&aElementOf0(xa,slsdtgt0(xa)))&?[X1]:(aElement0(X1)&sdtasdt0(xb,X1)=sz00))&aElementOf0(sz00,slsdtgt0(xb)))&?[X1]:(aElement0(X1)&sdtasdt0(xb,X1)=xb))&aElementOf0(xb,slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2203)).
% fof(53, conjecture,((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb)|?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb))|aElementOf0(xb,xI)),file('/tmp/SRASS.s.p', m__)).
% fof(54, negated_conjecture,~(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb)|?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb))|aElementOf0(xb,xI))),inference(assume_negation,[status(cth)],[53])).
% fof(60, negated_conjecture,~((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb)|aElementOf0(xb,xI))),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(77, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(78, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aElement0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(X1=sdtpldt0(sz00,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[79])).
% cnf(197,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[25])).
% fof(263, plain,(((((((?[X2]:(aElement0(X2)&sdtasdt0(xa,X2)=sz00)&aElementOf0(sz00,slsdtgt0(xa)))&?[X3]:(aElement0(X3)&sdtasdt0(xa,X3)=xa))&aElementOf0(xa,slsdtgt0(xa)))&?[X4]:(aElement0(X4)&sdtasdt0(xb,X4)=sz00))&aElementOf0(sz00,slsdtgt0(xb)))&?[X5]:(aElement0(X5)&sdtasdt0(xb,X5)=xb))&aElementOf0(xb,slsdtgt0(xb))),inference(variable_rename,[status(thm)],[29])).
% fof(264, plain,((((((((aElement0(esk25_0)&sdtasdt0(xa,esk25_0)=sz00)&aElementOf0(sz00,slsdtgt0(xa)))&(aElement0(esk26_0)&sdtasdt0(xa,esk26_0)=xa))&aElementOf0(xa,slsdtgt0(xa)))&(aElement0(esk27_0)&sdtasdt0(xb,esk27_0)=sz00))&aElementOf0(sz00,slsdtgt0(xb)))&(aElement0(esk28_0)&sdtasdt0(xb,esk28_0)=xb))&aElementOf0(xb,slsdtgt0(xb))),inference(skolemize,[status(esa)],[263])).
% cnf(265,plain,(aElementOf0(xb,slsdtgt0(xb))),inference(split_conjunct,[status(thm)],[264])).
% cnf(274,plain,(aElementOf0(sz00,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[264])).
% fof(404, negated_conjecture,(![X1]:![X2]:((~(aElementOf0(X1,slsdtgt0(xa)))|~(aElementOf0(X2,slsdtgt0(xb))))|~(sdtpldt0(X1,X2)=xb))&~(aElementOf0(xb,xI))),inference(fof_nnf,[status(thm)],[60])).
% fof(405, negated_conjecture,(![X3]:![X4]:((~(aElementOf0(X3,slsdtgt0(xa)))|~(aElementOf0(X4,slsdtgt0(xb))))|~(sdtpldt0(X3,X4)=xb))&~(aElementOf0(xb,xI))),inference(variable_rename,[status(thm)],[404])).
% fof(406, negated_conjecture,![X3]:![X4]:(((~(aElementOf0(X3,slsdtgt0(xa)))|~(aElementOf0(X4,slsdtgt0(xb))))|~(sdtpldt0(X3,X4)=xb))&~(aElementOf0(xb,xI))),inference(shift_quantors,[status(thm)],[405])).
% cnf(408,negated_conjecture,(sdtpldt0(X1,X2)!=xb|~aElementOf0(X2,slsdtgt0(xb))|~aElementOf0(X1,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[406])).
% cnf(436,negated_conjecture,(X1!=xb|~aElementOf0(X1,slsdtgt0(xb))|~aElementOf0(sz00,slsdtgt0(xa))|~aElement0(X1)),inference(spm,[status(thm)],[408,80,theory(equality)])).
% cnf(437,negated_conjecture,(X1!=xb|~aElementOf0(X1,slsdtgt0(xb))|$false|~aElement0(X1)),inference(rw,[status(thm)],[436,274,theory(equality)])).
% cnf(438,negated_conjecture,(X1!=xb|~aElementOf0(X1,slsdtgt0(xb))|~aElement0(X1)),inference(cn,[status(thm)],[437,theory(equality)])).
% cnf(2625,negated_conjecture,(~aElement0(xb)),inference(spm,[status(thm)],[438,265,theory(equality)])).
% cnf(2629,negated_conjecture,($false),inference(rw,[status(thm)],[2625,197,theory(equality)])).
% cnf(2630,negated_conjecture,($false),inference(cn,[status(thm)],[2629,theory(equality)])).
% cnf(2631,negated_conjecture,($false),2630,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 423
% # ...of these trivial : 4
% # ...subsumed : 13
% # ...remaining for further processing: 406
% # Other redundant clauses eliminated : 34
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 1049
% # ...of the previous two non-trivial : 927
% # Contextual simplify-reflections : 4
% # Paramodulations : 1002
% # Factorizations : 0
% # Equation resolutions : 46
% # Current number of processed clauses: 207
% # Positive orientable unit clauses: 55
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 138
% # Current number of unprocessed clauses: 878
% # ...number of literals in the above : 3992
% # Clause-clause subsumption calls (NU) : 665
% # Rec. Clause-clause subsumption calls : 292
% # Unit Clause-clause subsumption calls : 85
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 231 leaves, 1.24+/-0.931 terms/leaf
% # Paramod-from index: 117 leaves, 1.04+/-0.202 terms/leaf
% # Paramod-into index: 211 leaves, 1.12+/-0.477 terms/leaf
% # -------------------------------------------------
% # User time : 0.085 s
% # System time : 0.007 s
% # Total time : 0.092 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP17070/RNG121+4.tptp
%
%------------------------------------------------------------------------------