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

% Computer : art06.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 09:30:01 EST 2010

% Result   : Theorem 0.86s
% Output   : Solution 0.86s
% 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/SystemOnTPTP11784/SYN409+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP11784/SYN409+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11784/SYN409+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 11880
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time   : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:f(X1)<=>![X2]:![X3]:(f(X2)&f(X3))),file('/tmp/SRASS.s.p', kalish246)).
% fof(2, negated_conjecture,~((![X1]:f(X1)<=>![X2]:![X3]:(f(X2)&f(X3)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((?[X1]:~(f(X1))|?[X2]:?[X3]:(~(f(X2))|~(f(X3))))&(![X1]:f(X1)|![X2]:![X3]:(f(X2)&f(X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((?[X4]:~(f(X4))|?[X5]:?[X6]:(~(f(X5))|~(f(X6))))&(![X7]:f(X7)|![X8]:![X9]:(f(X8)&f(X9)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((~(f(esk1_0))|(~(f(esk2_0))|~(f(esk3_0))))&(![X7]:f(X7)|![X8]:![X9]:(f(X8)&f(X9)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X7]:![X8]:![X9]:(((f(X8)&f(X9))|f(X7))&(~(f(esk1_0))|(~(f(esk2_0))|~(f(esk3_0))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X7]:![X8]:![X9]:(((f(X8)|f(X7))&(f(X9)|f(X7)))&(~(f(esk1_0))|(~(f(esk2_0))|~(f(esk3_0))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~f(esk3_0)|~f(esk2_0)|~f(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(f(X1)|f(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(f(X3)),inference(ef,[status(thm)],[9,theory(equality)])).
% cnf(15,negated_conjecture,($false|~f(esk2_0)|~f(esk3_0)),inference(rw,[status(thm)],[8,11,theory(equality)])).
% cnf(16,negated_conjecture,($false|$false|~f(esk3_0)),inference(rw,[status(thm)],[15,11,theory(equality)])).
% cnf(17,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[16,11,theory(equality)])).
% cnf(18,negated_conjecture,($false),inference(cn,[status(thm)],[17,theory(equality)])).
% cnf(19,negated_conjecture,($false),18,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 6
% # ...of these trivial              : 0
% # ...subsumed                      : 1
% # ...remaining for further processing: 5
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 1
% # Backward-rewritten               : 1
% # Generated clauses                : 4
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections  : 0
% # Paramodulations                  : 2
% # Factorizations                   : 2
% # Equation resolutions             : 0
% # Current number of processed clauses: 1
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 0
% #    Non-unit-clauses              : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 5
% # Indexed BW rewrite successes     : 5
% # Backwards rewriting index:     2 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            1 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            1 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.007 s
% # System time          : 0.004 s
% # Total time           : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP11784/SYN409+1.tptp
% 
%------------------------------------------------------------------------------