%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM531+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 : art01.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 19:56:20 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP18479/NUM531+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18479/NUM531+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18479/NUM531+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 18575
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),file('/tmp/SRASS.s.p', mCountNFin)).
% fof(4, axiom,isFinite0(slcrc0),file('/tmp/SRASS.s.p', mEmpFin)).
% fof(9, conjecture,![X1]:((aSet0(X1)&isCountable0(X1))=>~(X1=slcrc0)),file('/tmp/SRASS.s.p', m__)).
% fof(10, negated_conjecture,~(![X1]:((aSet0(X1)&isCountable0(X1))=>~(X1=slcrc0))),inference(assume_negation,[status(cth)],[9])).
% fof(12, plain,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(26, plain,![X1]:((~(aSet0(X1))|~(isCountable0(X1)))|~(isFinite0(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(27, plain,![X2]:((~(aSet0(X2))|~(isCountable0(X2)))|~(isFinite0(X2))),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(~isFinite0(X1)|~isCountable0(X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(isFinite0(slcrc0)),inference(split_conjunct,[status(thm)],[4])).
% fof(40, negated_conjecture,?[X1]:((aSet0(X1)&isCountable0(X1))&X1=slcrc0),inference(fof_nnf,[status(thm)],[10])).
% fof(41, negated_conjecture,?[X2]:((aSet0(X2)&isCountable0(X2))&X2=slcrc0),inference(variable_rename,[status(thm)],[40])).
% fof(42, negated_conjecture,((aSet0(esk2_0)&isCountable0(esk2_0))&esk2_0=slcrc0),inference(skolemize,[status(esa)],[41])).
% cnf(43,negated_conjecture,(esk2_0=slcrc0),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,negated_conjecture,(isCountable0(esk2_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,negated_conjecture,(aSet0(esk2_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(46,negated_conjecture,(aSet0(slcrc0)),inference(rw,[status(thm)],[45,43,theory(equality)])).
% cnf(47,negated_conjecture,(isCountable0(slcrc0)),inference(rw,[status(thm)],[44,43,theory(equality)])).
% cnf(49,negated_conjecture,(~isFinite0(slcrc0)|~aSet0(slcrc0)),inference(spm,[status(thm)],[28,47,theory(equality)])).
% cnf(50,negated_conjecture,($false|~aSet0(slcrc0)),inference(rw,[status(thm)],[49,29,theory(equality)])).
% cnf(51,negated_conjecture,($false|$false),inference(rw,[status(thm)],[50,46,theory(equality)])).
% cnf(52,negated_conjecture,($false),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(53,negated_conjecture,($false),52,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 17
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP18479/NUM531+1.tptp
%
%------------------------------------------------------------------------------