TSTP Solution File: RNG124+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG124+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 : art03.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:49:06 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP21595/RNG124+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21595/RNG124+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21595/RNG124+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 21691
% 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(31, axiom,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)|aElementOf0(X1,xI))&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(36, axiom,(((aElement0(xq)&aElement0(xr))&xb=sdtpldt0(sdtasdt0(xq,xu),xr))&(xr=sz00|iLess0(sbrdtbr0(xr),sbrdtbr0(xu)))),file('/tmp/SRASS.s.p', m__2666)).
% fof(37, axiom,~(xr=sz00),file('/tmp/SRASS.s.p', m__2673)).
% fof(41, axiom,(?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xr)&aElementOf0(xr,xI)),file('/tmp/SRASS.s.p', m__2729)).
% fof(58, plain,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)|aElementOf0(X1,xI))&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[31,theory(equality)])).
% fof(297, plain,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((![X2]:![X3]:((~(aElementOf0(X2,slsdtgt0(xa)))|~(aElementOf0(X3,slsdtgt0(xb))))|~(sdtpldt0(X2,X3)=X1))&~(aElementOf0(X1,xI)))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[58])).
% fof(298, plain,(((?[X4]:?[X5]:((aElementOf0(X4,slsdtgt0(xa))&aElementOf0(X5,slsdtgt0(xb)))&sdtpldt0(X4,X5)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X6]:(((![X7]:![X8]:((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[297])).
% fof(299, plain,(((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X6]:(((![X7]:![X8]:((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))),inference(skolemize,[status(esa)],[298])).
% fof(300, plain,![X6]:![X7]:![X8]:((((((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))&((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))),inference(shift_quantors,[status(thm)],[299])).
% fof(301, plain,![X6]:![X7]:![X8]:((((((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))&((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu)))))&((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))),inference(distribute,[status(thm)],[300])).
% cnf(307,plain,(X1=sz00|~iLess0(sbrdtbr0(X1),sbrdtbr0(xu))|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[301])).
% cnf(338,plain,(iLess0(sbrdtbr0(xr),sbrdtbr0(xu))|xr=sz00),inference(split_conjunct,[status(thm)],[36])).
% cnf(342,plain,(xr!=sz00),inference(split_conjunct,[status(thm)],[37])).
% fof(356, plain,(?[X3]:?[X4]:((aElementOf0(X3,slsdtgt0(xa))&aElementOf0(X4,slsdtgt0(xb)))&sdtpldt0(X3,X4)=xr)&aElementOf0(xr,xI)),inference(variable_rename,[status(thm)],[41])).
% fof(357, plain,(((aElementOf0(esk43_0,slsdtgt0(xa))&aElementOf0(esk44_0,slsdtgt0(xb)))&sdtpldt0(esk43_0,esk44_0)=xr)&aElementOf0(xr,xI)),inference(skolemize,[status(esa)],[356])).
% cnf(358,plain,(aElementOf0(xr,xI)),inference(split_conjunct,[status(thm)],[357])).
% cnf(429,plain,(iLess0(sbrdtbr0(xr),sbrdtbr0(xu))),inference(sr,[status(thm)],[338,342,theory(equality)])).
% cnf(1020,plain,(sz00=xr|~aElementOf0(xr,xI)),inference(spm,[status(thm)],[307,429,theory(equality)])).
% cnf(1021,plain,(sz00=xr|$false),inference(rw,[status(thm)],[1020,358,theory(equality)])).
% cnf(1022,plain,(sz00=xr),inference(cn,[status(thm)],[1021,theory(equality)])).
% cnf(1023,plain,($false),inference(sr,[status(thm)],[1022,342,theory(equality)])).
% cnf(1024,plain,($false),1023,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 350
% # ...of these trivial : 1
% # ...subsumed : 10
% # ...remaining for further processing: 339
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 275
% # ...of the previous two non-trivial : 206
% # Contextual simplify-reflections : 4
% # Paramodulations : 253
% # Factorizations : 0
% # Equation resolutions : 22
% # Current number of processed clauses: 136
% # Positive orientable unit clauses: 60
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 70
% # Current number of unprocessed clauses: 267
% # ...number of literals in the above : 1000
% # Clause-clause subsumption calls (NU) : 383
% # Rec. Clause-clause subsumption calls : 190
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 185 leaves, 1.09+/-0.399 terms/leaf
% # Paramod-from index: 105 leaves, 1.02+/-0.137 terms/leaf
% # Paramod-into index: 172 leaves, 1.05+/-0.237 terms/leaf
% # -------------------------------------------------
% # User time : 0.054 s
% # System time : 0.006 s
% # Total time : 0.060 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.25 WC
% FINAL PrfWatch: 0.17 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP21595/RNG124+4.tptp
%
%------------------------------------------------------------------------------