%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE078+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 : art05.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:53:29 EST 2010

% Result   : Theorem 1.46s
% Output   : Solution 1.46s
% 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/SystemOnTPTP16304/KLE078+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP16304/KLE078+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16304/KLE078+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 16400
% 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]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(6, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(7, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(8, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(9, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(11, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(12, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(13, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(14, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(15, axiom,domain(zero)=zero,file('/tmp/SRASS.s.p', domain4)).
% fof(16, axiom,![X4]:![X5]:domain(addition(X4,X5))=addition(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', domain5)).
% fof(17, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(18, conjecture,![X4]:(![X5]:(addition(domain(X5),antidomain(X5))=one&multiplication(domain(X5),antidomain(X5))=zero)=>domain(antidomain(X4))=antidomain(X4)),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:(![X5]:(addition(domain(X5),antidomain(X5))=one&multiplication(domain(X5),antidomain(X5))=zero)=>domain(antidomain(X4))=antidomain(X4))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(30, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(35,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[11])).
% cnf(41,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[12])).
% cnf(43,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[13])).
% cnf(45,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[14])).
% cnf(47,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(domain(zero)=zero),inference(split_conjunct,[status(thm)],[15])).
% fof(49, plain,![X6]:![X7]:domain(addition(X6,X7))=addition(domain(X6),domain(X7)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(domain(addition(X1,X2))=addition(domain(X1),domain(X2))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(52, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, negated_conjecture,?[X4]:(![X5]:(addition(domain(X5),antidomain(X5))=one&multiplication(domain(X5),antidomain(X5))=zero)&~(domain(antidomain(X4))=antidomain(X4))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X6]:(![X7]:(addition(domain(X7),antidomain(X7))=one&multiplication(domain(X7),antidomain(X7))=zero)&~(domain(antidomain(X6))=antidomain(X6))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(![X7]:(addition(domain(X7),antidomain(X7))=one&multiplication(domain(X7),antidomain(X7))=zero)&~(domain(antidomain(esk1_0))=antidomain(esk1_0))),inference(skolemize,[status(esa)],[56])).
% fof(58, negated_conjecture,![X7]:((addition(domain(X7),antidomain(X7))=one&multiplication(domain(X7),antidomain(X7))=zero)&~(domain(antidomain(esk1_0))=antidomain(esk1_0))),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,negated_conjecture,(domain(antidomain(esk1_0))!=antidomain(esk1_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(multiplication(domain(X1),antidomain(X1))=zero),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(addition(domain(X1),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[58])).
% cnf(68,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[25,21,theory(equality)])).
% cnf(70,plain,(leq(X1,X2)|addition(X2,X1)!=X2),inference(spm,[status(thm)],[53,21,theory(equality)])).
% cnf(74,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[47,21,theory(equality)])).
% cnf(117,plain,(addition(domain(addition(X1,X2)),X3)=addition(domain(X1),addition(domain(X2),X3))),inference(spm,[status(thm)],[23,50,theory(equality)])).
% cnf(131,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[45,33,theory(equality)])).
% cnf(137,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[131,33,theory(equality)])).
% cnf(144,plain,(addition(multiplication(X1,domain(X2)),multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))))=multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2)))),inference(spm,[status(thm)],[43,45,theory(equality)])).
% cnf(146,plain,(addition(one,domain(one))=domain(one)),inference(spm,[status(thm)],[43,31,theory(equality)])).
% cnf(162,negated_conjecture,(addition(zero,multiplication(domain(X1),X2))=multiplication(domain(X1),addition(antidomain(X1),X2))),inference(spm,[status(thm)],[35,60,theory(equality)])).
% cnf(166,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(one,X2))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(193,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[37,33,theory(equality)])).
% cnf(244,plain,(addition(domain(X1),domain(X2))=domain(addition(domain(X1),X2))),inference(spm,[status(thm)],[50,137,theory(equality)])).
% cnf(250,plain,(domain(addition(X1,X2))=domain(addition(domain(X1),X2))),inference(rw,[status(thm)],[244,50,theory(equality)])).
% cnf(263,plain,(one=domain(one)),inference(rw,[status(thm)],[146,74,theory(equality)])).
% cnf(341,plain,(leq(domain(X1),domain(X2))|domain(addition(X2,X1))!=domain(X2)),inference(spm,[status(thm)],[70,50,theory(equality)])).
% cnf(866,negated_conjecture,(domain(one)=domain(addition(X1,antidomain(X1)))),inference(spm,[status(thm)],[250,61,theory(equality)])).
% cnf(893,negated_conjecture,(one=domain(addition(X1,antidomain(X1)))),inference(rw,[status(thm)],[866,263,theory(equality)])).
% cnf(967,negated_conjecture,(domain(multiplication(X1,one))=domain(multiplication(X1,addition(X2,antidomain(X2))))),inference(spm,[status(thm)],[45,893,theory(equality)])).
% cnf(994,negated_conjecture,(domain(X1)=domain(multiplication(X1,addition(X2,antidomain(X2))))),inference(rw,[status(thm)],[967,31,theory(equality)])).
% cnf(3143,negated_conjecture,(addition(domain(X1),one)=addition(domain(addition(X1,X2)),antidomain(X2))),inference(spm,[status(thm)],[117,61,theory(equality)])).
% cnf(3215,negated_conjecture,(one=addition(domain(addition(X1,X2)),antidomain(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3143,21,theory(equality)]),74,theory(equality)])).
% cnf(5651,negated_conjecture,(multiplication(domain(X1),addition(antidomain(X1),X2))=multiplication(domain(X1),X2)),inference(rw,[status(thm)],[162,68,theory(equality)])).
% cnf(6489,negated_conjecture,(addition(domain(addition(X2,X1)),antidomain(X2))=one),inference(spm,[status(thm)],[3215,21,theory(equality)])).
% cnf(6732,negated_conjecture,(addition(multiplication(domain(X1),domain(antidomain(X1))),multiplication(domain(zero),multiplication(domain(X1),domain(antidomain(X1)))))=multiplication(domain(zero),multiplication(domain(X1),domain(antidomain(X1))))),inference(spm,[status(thm)],[144,60,theory(equality)])).
% cnf(6828,negated_conjecture,(multiplication(domain(X1),domain(antidomain(X1)))=multiplication(domain(zero),multiplication(domain(X1),domain(antidomain(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[6732,48,theory(equality)]),41,theory(equality)]),25,theory(equality)])).
% cnf(6829,negated_conjecture,(multiplication(domain(X1),domain(antidomain(X1)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[6828,48,theory(equality)]),41,theory(equality)])).
% cnf(10507,plain,(addition(X1,multiplication(X1,domain(X2)))=multiplication(X1,one)),inference(spm,[status(thm)],[166,74,theory(equality)])).
% cnf(10600,plain,(addition(X1,multiplication(X1,domain(X2)))=X1),inference(rw,[status(thm)],[10507,31,theory(equality)])).
% cnf(14137,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[193,21,theory(equality)])).
% cnf(14193,plain,(leq(multiplication(X1,X2),X2)|multiplication(addition(X1,one),X2)!=X2),inference(spm,[status(thm)],[70,14137,theory(equality)])).
% cnf(14218,plain,(multiplication(addition(domain(X1),one),X1)=multiplication(domain(X1),X1)),inference(spm,[status(thm)],[43,14137,theory(equality)])).
% cnf(14287,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[14218,21,theory(equality)]),74,theory(equality)]),33,theory(equality)])).
% cnf(14353,plain,(addition(X1,multiplication(domain(X1),X2))=multiplication(domain(X1),addition(X1,X2))),inference(spm,[status(thm)],[35,14287,theory(equality)])).
% cnf(14884,plain,(leq(multiplication(X1,X2),X2)|multiplication(addition(one,X1),X2)!=X2),inference(spm,[status(thm)],[14193,21,theory(equality)])).
% cnf(14902,plain,(leq(multiplication(multiplication(one,domain(X1)),X2),X2)|multiplication(one,X2)!=X2),inference(spm,[status(thm)],[14884,10600,theory(equality)])).
% cnf(14930,plain,(leq(multiplication(domain(X1),X2),X2)|multiplication(one,X2)!=X2),inference(rw,[status(thm)],[14902,33,theory(equality)])).
% cnf(14931,plain,(leq(multiplication(domain(X1),X2),X2)|$false),inference(rw,[status(thm)],[14930,33,theory(equality)])).
% cnf(14932,plain,(leq(multiplication(domain(X1),X2),X2)),inference(cn,[status(thm)],[14931,theory(equality)])).
% cnf(15429,plain,(addition(multiplication(domain(X1),X2),X2)=X2),inference(spm,[status(thm)],[54,14932,theory(equality)])).
% cnf(15706,plain,(addition(X2,multiplication(domain(X1),X2))=X2),inference(rw,[status(thm)],[15429,21,theory(equality)])).
% cnf(15766,plain,(leq(domain(multiplication(domain(X1),X2)),domain(X2))),inference(spm,[status(thm)],[341,15706,theory(equality)])).
% cnf(25007,negated_conjecture,(domain(multiplication(domain(X1),antidomain(antidomain(X1))))=domain(domain(X1))),inference(spm,[status(thm)],[994,5651,theory(equality)])).
% cnf(25109,negated_conjecture,(domain(multiplication(domain(X1),antidomain(antidomain(X1))))=domain(X1)),inference(rw,[status(thm)],[25007,137,theory(equality)])).
% cnf(25931,negated_conjecture,(leq(domain(X1),domain(antidomain(antidomain(X1))))),inference(spm,[status(thm)],[15766,25109,theory(equality)])).
% cnf(26079,negated_conjecture,(addition(domain(X1),domain(antidomain(antidomain(X1))))=domain(antidomain(antidomain(X1)))),inference(spm,[status(thm)],[54,25931,theory(equality)])).
% cnf(26123,negated_conjecture,(domain(addition(X1,antidomain(antidomain(X1))))=domain(antidomain(antidomain(X1)))),inference(rw,[status(thm)],[26079,50,theory(equality)])).
% cnf(26257,negated_conjecture,(addition(domain(antidomain(antidomain(X1))),antidomain(X1))=one),inference(spm,[status(thm)],[6489,26123,theory(equality)])).
% cnf(26864,negated_conjecture,(addition(antidomain(X1),domain(antidomain(antidomain(X1))))=one),inference(rw,[status(thm)],[26257,21,theory(equality)])).
% cnf(26881,negated_conjecture,(multiplication(domain(antidomain(X1)),one)=addition(antidomain(X1),multiplication(domain(antidomain(X1)),domain(antidomain(antidomain(X1)))))),inference(spm,[status(thm)],[14353,26864,theory(equality)])).
% cnf(26992,negated_conjecture,(domain(antidomain(X1))=addition(antidomain(X1),multiplication(domain(antidomain(X1)),domain(antidomain(antidomain(X1)))))),inference(rw,[status(thm)],[26881,31,theory(equality)])).
% cnf(26993,negated_conjecture,(domain(antidomain(X1))=antidomain(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[26992,6829,theory(equality)]),25,theory(equality)])).
% cnf(27205,negated_conjecture,($false),inference(rw,[status(thm)],[59,26993,theory(equality)])).
% cnf(27206,negated_conjecture,($false),inference(cn,[status(thm)],[27205,theory(equality)])).
% cnf(27207,negated_conjecture,($false),27206,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1174
% # ...of these trivial                : 288
% # ...subsumed                        : 606
% # ...remaining for further processing: 280
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 45
% # Generated clauses                  : 14493
% # ...of the previous two non-trivial : 7298
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 14492
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 235
% #    Positive orientable unit clauses: 175
% #    Positive unorientable unit clauses: 7
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 53
% # Current number of unprocessed clauses: 4806
% # ...number of literals in the above : 6120
% # Clause-clause subsumption calls (NU) : 1833
% # Rec. Clause-clause subsumption calls : 1833
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 271
% # Indexed BW rewrite successes       : 68
% # Backwards rewriting index:   211 leaves,   1.59+/-1.226 terms/leaf
% # Paramod-from index:          133 leaves,   1.40+/-0.917 terms/leaf
% # Paramod-into index:          179 leaves,   1.58+/-1.148 terms/leaf
% # -------------------------------------------------
% # User time              : 0.280 s
% # System time            : 0.020 s
% # Total time             : 0.300 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.67 CPU 0.76 WC
% FINAL PrfWatch: 0.67 CPU 0.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP16304/KLE078+1.tptp
% 
%------------------------------------------------------------------------------