%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM395+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 : art07.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 18:50:00 EST 2010

% Result   : Theorem 0.91s
% Output   : Solution 0.91s
% 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/SystemOnTPTP17044/NUM395+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP17044/NUM395+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17044/NUM395+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 17140
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:((epsilon_transitive(X1)&epsilon_connected(X1))=>ordinal(X1)),file('/tmp/SRASS.s.p', cc2_ordinal1)).
% fof(11, axiom,(epsilon_transitive(empty_set)&epsilon_connected(empty_set)),file('/tmp/SRASS.s.p', l18_ordinal1)).
% fof(29, conjecture,ordinal(empty_set),file('/tmp/SRASS.s.p', t27_ordinal1)).
% fof(30, negated_conjecture,~(ordinal(empty_set)),inference(assume_negation,[status(cth)],[29])).
% fof(34, negated_conjecture,~(ordinal(empty_set)),inference(fof_simplification,[status(thm)],[30,theory(equality)])).
% fof(49, plain,![X1]:((~(epsilon_transitive(X1))|~(epsilon_connected(X1)))|ordinal(X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(50, plain,![X2]:((~(epsilon_transitive(X2))|~(epsilon_connected(X2)))|ordinal(X2)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(69,plain,(epsilon_connected(empty_set)),inference(split_conjunct,[status(thm)],[11])).
% cnf(70,plain,(epsilon_transitive(empty_set)),inference(split_conjunct,[status(thm)],[11])).
% cnf(137,negated_conjecture,(~ordinal(empty_set)),inference(split_conjunct,[status(thm)],[34])).
% cnf(147,plain,(ordinal(empty_set)|~epsilon_transitive(empty_set)),inference(spm,[status(thm)],[51,69,theory(equality)])).
% cnf(152,plain,(ordinal(empty_set)|$false),inference(rw,[status(thm)],[147,70,theory(equality)])).
% cnf(153,plain,(ordinal(empty_set)),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(154,plain,($false),inference(sr,[status(thm)],[153,137,theory(equality)])).
% cnf(155,plain,($false),154,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 84
% # ...of these trivial                : 3
% # ...subsumed                        : 3
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 6
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 6
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 34
% #    Positive orientable unit clauses: 26
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 5
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 22
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # 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:    47 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:           29 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           45 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.011 s
% # System time            : 0.004 s
% # Total time             : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP17044/NUM395+1.tptp
% 
%------------------------------------------------------------------------------