TSTP Solution File: NUM548+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM548+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art09.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 20:03:00 EST 2010

% Result   : Theorem 1.07s
% Output   : Solution 1.07s
% 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/SystemOnTPTP31555/NUM548+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP31555/NUM548+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31555/NUM548+3.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 31651
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.027 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:(aSet0(X1)=>(aElementOf0(sbrdtbr0(X1),szNzAzT0)<=>isFinite0(X1))),file('/tmp/SRASS.s.p', mCardNum)).
% fof(14, axiom,aElementOf0(xk,szNzAzT0),file('/tmp/SRASS.s.p', m__2202)).
% fof(18, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),file('/tmp/SRASS.s.p', m__2270)).
% fof(66, conjecture,isFinite0(xQ),file('/tmp/SRASS.s.p', m__)).
% fof(67, negated_conjecture,~(isFinite0(xQ)),inference(assume_negation,[status(cth)],[66])).
% fof(79, negated_conjecture,~(isFinite0(xQ)),inference(fof_simplification,[status(thm)],[67,theory(equality)])).
% fof(112, plain,![X1]:(~(aSet0(X1))|((~(aElementOf0(sbrdtbr0(X1),szNzAzT0))|isFinite0(X1))&(~(isFinite0(X1))|aElementOf0(sbrdtbr0(X1),szNzAzT0)))),inference(fof_nnf,[status(thm)],[9])).
% fof(113, plain,![X2]:(~(aSet0(X2))|((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))&(~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0)))),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,![X2]:(((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))|~(aSet0(X2)))&((~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0))|~(aSet0(X2)))),inference(distribute,[status(thm)],[113])).
% cnf(116,plain,(isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0)),inference(split_conjunct,[status(thm)],[114])).
% cnf(142,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[14])).
% fof(179, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(fof_nnf,[status(thm)],[18])).
% fof(180, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xS))&aSet0(xQ))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(shift_quantors,[status(thm)],[180])).
% cnf(183,plain,(sbrdtbr0(xQ)=xk),inference(split_conjunct,[status(thm)],[181])).
% cnf(185,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[181])).
% cnf(390,negated_conjecture,(~isFinite0(xQ)),inference(split_conjunct,[status(thm)],[79])).
% cnf(452,negated_conjecture,(~aElementOf0(sbrdtbr0(xQ),szNzAzT0)|~aSet0(xQ)),inference(spm,[status(thm)],[390,116,theory(equality)])).
% cnf(454,negated_conjecture,($false|~aSet0(xQ)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[452,183,theory(equality)]),142,theory(equality)])).
% cnf(455,negated_conjecture,($false|$false),inference(rw,[status(thm)],[454,185,theory(equality)])).
% cnf(456,negated_conjecture,($false),inference(cn,[status(thm)],[455,theory(equality)])).
% cnf(457,negated_conjecture,($false),456,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 183
% # ...of these trivial                : 0
% # ...subsumed                        : 5
% # ...remaining for further processing: 178
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 27
% # ...of the previous two non-trivial : 21
% # Contextual simplify-reflections    : 19
% # Paramodulations                    : 23
% # Factorizations                     : 0
% # Equation resolutions               : 4
% # Current number of processed clauses: 38
% #    Positive orientable unit clauses: 16
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 19
% # Current number of unprocessed clauses: 117
% # ...number of literals in the above : 443
% # Clause-clause subsumption calls (NU) : 294
% # Rec. Clause-clause subsumption calls : 145
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    48 leaves,   1.06+/-0.242 terms/leaf
% # Paramod-from index:           24 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           43 leaves,   1.02+/-0.151 terms/leaf
% # -------------------------------------------------
% # User time              : 0.037 s
% # System time            : 0.006 s
% # Total time             : 0.043 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP31555/NUM548+3.tptp
% 
%------------------------------------------------------------------------------