%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE053+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:50:17 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/SystemOnTPTP4802/KLE053+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP4802/KLE053+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4802/KLE053+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 4898
% 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(2, axiom,![X1]:![X2]:domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2))),file('/tmp/SRASS.s.p', domain2)).
% fof(16, axiom,![X3]:multiplication(one,X3)=X3,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(18, conjecture,![X1]:domain(domain(X1))=domain(X1),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X1]:domain(domain(X1))=domain(X1)),inference(assume_negation,[status(cth)],[18])).
% fof(22, plain,![X3]:![X4]:domain(multiplication(X3,X4))=domain(multiplication(X3,domain(X4))),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[22])).
% fof(49, plain,![X4]:multiplication(one,X4)=X4,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[49])).
% fof(55, negated_conjecture,?[X1]:~(domain(domain(X1))=domain(X1)),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X2]:~(domain(domain(X2))=domain(X2)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(domain(domain(esk1_0))=domain(esk1_0)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(domain(domain(esk1_0))!=domain(esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(118,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[23,50,theory(equality)])).
% cnf(124,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[118,50,theory(equality)])).
% cnf(218,negated_conjecture,($false),inference(rw,[status(thm)],[58,124,theory(equality)])).
% cnf(219,negated_conjecture,($false),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(220,negated_conjecture,($false),219,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 24
% # ...of these trivial                : 1
% # ...subsumed                        : 0
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 2
% # Generated clauses                  : 89
% # ...of the previous two non-trivial : 49
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 88
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 21
% #    Positive orientable unit clauses: 17
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 3
% # Current number of unprocessed clauses: 43
% # ...number of literals in the above : 49
% # 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       : 7
% # Backwards rewriting index:    31 leaves,   1.29+/-0.887 terms/leaf
% # Paramod-from index:           16 leaves,   1.19+/-0.527 terms/leaf
% # Paramod-into index:           23 leaves,   1.26+/-0.606 terms/leaf
% # -------------------------------------------------
% # User time              : 0.010 s
% # System time            : 0.003 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/SystemOnTPTP4802/KLE053+1.tptp
% 
%------------------------------------------------------------------------------