%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE056+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 : 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 07:50:57 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/SystemOnTPTP29421/KLE056+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29421/KLE056+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29421/KLE056+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 29517
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(11, axiom,![X2]:addition(X2,multiplication(domain(X2),X2))=multiplication(domain(X2),X2),file('/tmp/SRASS.s.p', domain1)).
% fof(18, conjecture,![X2]:(domain(X2)=zero=>X2=zero),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X2]:(domain(X2)=zero=>X2=zero)),inference(assume_negation,[status(cth)],[18])).
% fof(21, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[21])).
% fof(27, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[27])).
% fof(39, plain,![X3]:addition(X3,multiplication(domain(X3),X3))=multiplication(domain(X3),X3),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(55, negated_conjecture,?[X2]:(domain(X2)=zero&~(X2=zero)),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X3]:(domain(X3)=zero&~(X3=zero)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(domain(esk1_0)=zero&~(esk1_0=zero)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(esk1_0!=zero),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(domain(esk1_0)=zero),inference(split_conjunct,[status(thm)],[57])).
% cnf(139,negated_conjecture,(addition(esk1_0,multiplication(zero,esk1_0))=multiplication(zero,esk1_0)),inference(spm,[status(thm)],[40,59,theory(equality)])).
% cnf(144,negated_conjecture,(esk1_0=multiplication(zero,esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[139,28,theory(equality)]),22,theory(equality)])).
% cnf(145,negated_conjecture,(esk1_0=zero),inference(rw,[status(thm)],[144,28,theory(equality)])).
% cnf(146,negated_conjecture,($false),inference(sr,[status(thm)],[145,58,theory(equality)])).
% cnf(147,negated_conjecture,($false),146,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 52
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 0
% # Paramodulations : 52
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 33
% # ...number of literals in the above : 38
% # 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 : 9
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 26 leaves, 1.19+/-0.621 terms/leaf
% # Paramod-from index: 13 leaves, 1.15+/-0.533 terms/leaf
% # Paramod-into index: 21 leaves, 1.14+/-0.467 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.005 s
% # Total time : 0.013 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/SystemOnTPTP29421/KLE056+1.tptp
%
%------------------------------------------------------------------------------