%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE051+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 : 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 07:49:49 EST 2010

% Result   : Theorem 0.88s
% Output   : Solution 0.88s
% 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/SystemOnTPTP4284/KLE051+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP4284/KLE051+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4284/KLE051+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 4380
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(18, conjecture,![X4]:addition(X4,X4)=X4,file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:addition(X4,X4)=X4),inference(assume_negation,[status(cth)],[18])).
% fof(24, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(55, negated_conjecture,?[X4]:~(addition(X4,X4)=X4),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X5]:~(addition(X5,X5)=X5),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(addition(esk1_0,esk1_0)=esk1_0),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(addition(esk1_0,esk1_0)!=esk1_0),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,($false),inference(rw,[status(thm)],[58,25,theory(equality)])).
% cnf(60,negated_conjecture,($false),inference(cn,[status(thm)],[59,theory(equality)])).
% cnf(61,negated_conjecture,($false),60,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 8
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 8
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 7
% #    Positive orientable unit clauses: 7
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 13
% # 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        : 2
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:     9 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            7 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            9 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.006 s
% # System time            : 0.006 s
% # Total time             : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.15 WC
% FINAL PrfWatch: 0.09 CPU 0.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP4284/KLE051+1.tptp
% 
%------------------------------------------------------------------------------