%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU116+1 : TPTP v5.0.0. Released v3.2.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 : Thu Dec 30 01:08:53 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP8225/SEU116+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8225/SEU116+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8225/SEU116+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 8321
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(element(X2,finite_subsets(X1))=>finite(X2)),file('/tmp/SRASS.s.p', cc3_finsub_1)).
% fof(31, conjecture,![X1]:![X2]:(element(X2,finite_subsets(X1))=>finite(X2)),file('/tmp/SRASS.s.p', t30_finsub_1)).
% fof(32, negated_conjecture,~(![X1]:![X2]:(element(X2,finite_subsets(X1))=>finite(X2))),inference(assume_negation,[status(cth)],[31])).
% fof(46, plain,![X1]:![X2]:(~(element(X2,finite_subsets(X1)))|finite(X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(47, plain,![X3]:![X4]:(~(element(X4,finite_subsets(X3)))|finite(X4)),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(finite(X1)|~element(X1,finite_subsets(X2))),inference(split_conjunct,[status(thm)],[47])).
% fof(162, negated_conjecture,?[X1]:?[X2]:(element(X2,finite_subsets(X1))&~(finite(X2))),inference(fof_nnf,[status(thm)],[32])).
% fof(163, negated_conjecture,?[X3]:?[X4]:(element(X4,finite_subsets(X3))&~(finite(X4))),inference(variable_rename,[status(thm)],[162])).
% fof(164, negated_conjecture,(element(esk12_0,finite_subsets(esk11_0))&~(finite(esk12_0))),inference(skolemize,[status(esa)],[163])).
% cnf(165,negated_conjecture,(~finite(esk12_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(166,negated_conjecture,(element(esk12_0,finite_subsets(esk11_0))),inference(split_conjunct,[status(thm)],[164])).
% cnf(169,negated_conjecture,(finite(esk12_0)),inference(spm,[status(thm)],[48,166,theory(equality)])).
% cnf(170,negated_conjecture,($false),inference(sr,[status(thm)],[169,165,theory(equality)])).
% cnf(171,negated_conjecture,($false),170,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 78
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 76
% # 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 : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 69
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # 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: 29 leaves, 1.03+/-0.182 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 27 leaves, 1.04+/-0.189 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP8225/SEU116+1.tptp
%
%------------------------------------------------------------------------------