%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE093+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 : 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 : Wed Dec 29 07:55:29 EST 2010
% Result : Theorem 1.35s
% Output : Solution 1.35s
% 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/SystemOnTPTP24488/KLE093+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24488/KLE093+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24488/KLE093+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 24584
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:addition(domain(X1),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(2, axiom,![X1]:![X2]:domain(addition(X1,X2))=addition(domain(X1),domain(X2)),file('/tmp/SRASS.s.p', domain5)).
% fof(3, axiom,![X3]:multiplication(X3,one)=X3,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(4, axiom,![X3]:multiplication(one,X3)=X3,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(6, axiom,![X1]:addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1),file('/tmp/SRASS.s.p', domain1)).
% fof(8, axiom,![X3]:leq(addition(one,multiplication(X3,star(X3))),star(X3)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(10, axiom,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X5]:![X4]:![X3]:addition(X3,addition(X4,X5))=addition(addition(X3,X4),X5),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(14, axiom,![X3]:![X4]:(leq(X3,X4)<=>addition(X3,X4)=X4),file('/tmp/SRASS.s.p', order)).
% fof(21, axiom,![X3]:![X4]:![X5]:multiplication(addition(X3,X4),X5)=addition(multiplication(X3,X5),multiplication(X4,X5)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(22, conjecture,![X1]:domain(star(X1))=one,file('/tmp/SRASS.s.p', goals)).
% fof(23, negated_conjecture,~(![X1]:domain(star(X1))=one),inference(assume_negation,[status(cth)],[22])).
% fof(24, plain,![X2]:addition(domain(X2),one)=one,inference(variable_rename,[status(thm)],[1])).
% cnf(25,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:domain(addition(X3,X4))=addition(domain(X3),domain(X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(27,plain,(domain(addition(X1,X2))=addition(domain(X1),domain(X2))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:multiplication(X4,one)=X4,inference(variable_rename,[status(thm)],[3])).
% cnf(29,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:multiplication(one,X4)=X4,inference(variable_rename,[status(thm)],[4])).
% cnf(31,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(34, plain,![X2]:addition(X2,multiplication(domain(X2),X2))=multiplication(domain(X2),X2),inference(variable_rename,[status(thm)],[6])).
% cnf(35,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(37, plain,![X4]:leq(addition(one,multiplication(X4,star(X4))),star(X4)),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[10])).
% cnf(42,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:![X8]:addition(X8,addition(X7,X6))=addition(addition(X8,X7),X6),inference(variable_rename,[status(thm)],[11])).
% cnf(44,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(49, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(fof_nnf,[status(thm)],[14])).
% fof(50, plain,![X5]:![X6]:((~(leq(X5,X6))|addition(X5,X6)=X6)&(~(addition(X5,X6)=X6)|leq(X5,X6))),inference(variable_rename,[status(thm)],[49])).
% cnf(52,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(67, plain,![X6]:![X7]:![X8]:multiplication(addition(X6,X7),X8)=addition(multiplication(X6,X8),multiplication(X7,X8)),inference(variable_rename,[status(thm)],[21])).
% cnf(68,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[67])).
% fof(69, negated_conjecture,?[X1]:~(domain(star(X1))=one),inference(fof_nnf,[status(thm)],[23])).
% fof(70, negated_conjecture,?[X2]:~(domain(star(X2))=one),inference(variable_rename,[status(thm)],[69])).
% fof(71, negated_conjecture,~(domain(star(esk1_0))=one),inference(skolemize,[status(esa)],[70])).
% cnf(72,negated_conjecture,(domain(star(esk1_0))!=one),inference(split_conjunct,[status(thm)],[71])).
% cnf(78,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[25,42,theory(equality)])).
% cnf(221,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[68,31,theory(equality)])).
% cnf(245,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[52,38,theory(equality)])).
% cnf(249,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[245,44,theory(equality)])).
% cnf(3196,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[221,42,theory(equality)])).
% cnf(3245,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[35,3196,theory(equality)]),42,theory(equality)]),78,theory(equality)]),31,theory(equality)])).
% cnf(3402,plain,(addition(X1,multiplication(X2,X1))=multiplication(addition(domain(X1),X2),X1)),inference(spm,[status(thm)],[68,3245,theory(equality)])).
% cnf(3438,plain,(multiplication(addition(X2,one),X1)=multiplication(addition(domain(X1),X2),X1)),inference(rw,[status(thm)],[3402,3196,theory(equality)])).
% cnf(7576,plain,(multiplication(domain(addition(X1,X2)),X1)=multiplication(addition(domain(X2),one),X1)),inference(spm,[status(thm)],[3438,27,theory(equality)])).
% cnf(7634,plain,(multiplication(domain(addition(X1,X2)),X1)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[7576,42,theory(equality)]),78,theory(equality)]),31,theory(equality)])).
% cnf(21469,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[249,42,theory(equality)]),3196,theory(equality)])).
% cnf(21484,plain,(multiplication(domain(star(X1)),one)=one),inference(spm,[status(thm)],[7634,21469,theory(equality)])).
% cnf(21598,plain,(domain(star(X1))=one),inference(rw,[status(thm)],[21484,29,theory(equality)])).
% cnf(21726,negated_conjecture,($false),inference(rw,[status(thm)],[72,21598,theory(equality)])).
% cnf(21727,negated_conjecture,($false),inference(cn,[status(thm)],[21726,theory(equality)])).
% cnf(21728,negated_conjecture,($false),21727,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1172
% # ...of these trivial : 338
% # ...subsumed : 548
% # ...remaining for further processing: 286
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 71
% # Generated clauses : 11790
% # ...of the previous two non-trivial : 6403
% # Contextual simplify-reflections : 0
% # Paramodulations : 11789
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 214
% # Positive orientable unit clauses: 143
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 4503
% # ...number of literals in the above : 6177
% # Clause-clause subsumption calls (NU) : 2154
% # Rec. Clause-clause subsumption calls : 2154
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 44
% # Backwards rewriting index: 182 leaves, 1.95+/-1.556 terms/leaf
% # Paramod-from index: 96 leaves, 1.54+/-1.050 terms/leaf
% # Paramod-into index: 157 leaves, 1.89+/-1.535 terms/leaf
% # -------------------------------------------------
% # User time : 0.248 s
% # System time : 0.011 s
% # Total time : 0.259 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.55 CPU 0.64 WC
% FINAL PrfWatch: 0.55 CPU 0.64 WC
% SZS output end Solution for /tmp/SystemOnTPTP24488/KLE093+1.tptp
%
%------------------------------------------------------------------------------