TSTP Solution File: RNG124+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG124+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 : 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:48:53 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP21336/RNG124+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21336/RNG124+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21336/RNG124+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 21432
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(26, axiom,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(31, 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(32, axiom,~(xr=sz00),file('/tmp/SRASS.s.p', m__2673)).
% fof(36, axiom,aElementOf0(xr,xI),file('/tmp/SRASS.s.p', m__2729)).
% fof(58, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(165, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[58])).
% fof(166, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X2]:((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[165])).
% fof(167, plain,![X2]:(((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))&(aElementOf0(xu,xI)&~(xu=sz00))),inference(shift_quantors,[status(thm)],[166])).
% cnf(170,plain,(X1=sz00|~iLess0(sbrdtbr0(X1),sbrdtbr0(xu))|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[167])).
% cnf(180,plain,(iLess0(sbrdtbr0(xr),sbrdtbr0(xu))|xr=sz00),inference(split_conjunct,[status(thm)],[31])).
% cnf(184,plain,(xr!=sz00),inference(split_conjunct,[status(thm)],[32])).
% cnf(188,plain,(aElementOf0(xr,xI)),inference(split_conjunct,[status(thm)],[36])).
% cnf(410,plain,(iLess0(sbrdtbr0(xr),sbrdtbr0(xu))),inference(sr,[status(thm)],[180,184,theory(equality)])).
% cnf(540,plain,(sz00=xr|~aElementOf0(xr,xI)),inference(spm,[status(thm)],[170,410,theory(equality)])).
% cnf(541,plain,(sz00=xr|$false),inference(rw,[status(thm)],[540,188,theory(equality)])).
% cnf(542,plain,(sz00=xr),inference(cn,[status(thm)],[541,theory(equality)])).
% cnf(543,plain,($false),inference(sr,[status(thm)],[542,184,theory(equality)])).
% cnf(544,plain,($false),543,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 75
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 132
% # ...of the previous two non-trivial : 97
% # Contextual simplify-reflections : 0
% # Paramodulations : 117
% # Factorizations : 0
% # Equation resolutions : 15
% # Current number of processed clauses: 75
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 49
% # Current number of unprocessed clauses: 141
% # ...number of literals in the above : 566
% # Clause-clause subsumption calls (NU) : 24
% # Rec. Clause-clause subsumption calls : 22
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 96 leaves, 1.22+/-0.710 terms/leaf
% # Paramod-from index: 51 leaves, 1.04+/-0.194 terms/leaf
% # Paramod-into index: 88 leaves, 1.10+/-0.427 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.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP21336/RNG124+1.tptp
%
%------------------------------------------------------------------------------