TSTP Solution File: KLE081+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE081+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 07:58:33 EST 2010
% Result : Theorem 1.84s
% Output : Solution 1.84s
% 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/SystemOnTPTP21964/KLE081+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21964/KLE081+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21964/KLE081+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 22096
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 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(4, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% 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)=>multiplication(antidomain(X4),X4)=zero),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:(![X5]:(addition(domain(X5),antidomain(X5))=one&multiplication(domain(X5),antidomain(X5))=zero)=>multiplication(antidomain(X4),X4)=zero)),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(26, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% 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)&~(multiplication(antidomain(X4),X4)=zero)),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X6]:(![X7]:(addition(domain(X7),antidomain(X7))=one&multiplication(domain(X7),antidomain(X7))=zero)&~(multiplication(antidomain(X6),X6)=zero)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(![X7]:(addition(domain(X7),antidomain(X7))=one&multiplication(domain(X7),antidomain(X7))=zero)&~(multiplication(antidomain(esk1_0),esk1_0)=zero)),inference(skolemize,[status(esa)],[56])).
% fof(58, negated_conjecture,![X7]:((addition(domain(X7),antidomain(X7))=one&multiplication(domain(X7),antidomain(X7))=zero)&~(multiplication(antidomain(esk1_0),esk1_0)=zero)),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,negated_conjecture,(multiplication(antidomain(esk1_0),esk1_0)!=zero),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(74,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[47,21,theory(equality)])).
% cnf(87,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,27,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(146,plain,(addition(one,domain(one))=domain(one)),inference(spm,[status(thm)],[43,31,theory(equality)])).
% cnf(160,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[35,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(192,negated_conjecture,(addition(multiplication(X1,antidomain(X2)),zero)=multiplication(addition(X1,domain(X2)),antidomain(X2))),inference(spm,[status(thm)],[37,60,theory(equality)])).
% cnf(193,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[37,33,theory(equality)])).
% cnf(198,negated_conjecture,(addition(zero,multiplication(X2,antidomain(X1)))=multiplication(addition(domain(X1),X2),antidomain(X1))),inference(spm,[status(thm)],[37,60,theory(equality)])).
% cnf(209,negated_conjecture,(multiplication(X1,antidomain(X2))=multiplication(addition(X1,domain(X2)),antidomain(X2))),inference(rw,[status(thm)],[192,25,theory(equality)])).
% cnf(242,negated_conjecture,(addition(domain(X1),antidomain(domain(X1)))=one),inference(spm,[status(thm)],[61,137,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(270,plain,(addition(domain(X1),one)=domain(addition(X1,one))),inference(spm,[status(thm)],[50,263,theory(equality)])).
% cnf(277,plain,(one=domain(addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[270,21,theory(equality)]),74,theory(equality)])).
% cnf(319,plain,(domain(multiplication(X1,one))=domain(multiplication(X1,addition(X2,one)))),inference(spm,[status(thm)],[45,277,theory(equality)])).
% cnf(333,plain,(domain(X1)=domain(multiplication(X1,addition(X2,one)))),inference(rw,[status(thm)],[319,31,theory(equality)])).
% cnf(476,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,87,theory(equality)])).
% cnf(532,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[476,21,theory(equality)])).
% cnf(544,negated_conjecture,(leq(antidomain(X1),one)),inference(spm,[status(thm)],[532,61,theory(equality)])).
% cnf(617,negated_conjecture,(addition(antidomain(X1),one)=one),inference(spm,[status(thm)],[54,544,theory(equality)])).
% cnf(626,negated_conjecture,(addition(one,antidomain(X1))=one),inference(rw,[status(thm)],[617,21,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(1301,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[160,21,theory(equality)])).
% cnf(1584,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[193,21,theory(equality)])).
% cnf(1617,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[43,1584,theory(equality)]),21,theory(equality)]),74,theory(equality)]),33,theory(equality)])).
% cnf(1646,plain,(addition(domain(X1),X1)=multiplication(domain(X1),addition(X1,one))),inference(spm,[status(thm)],[1301,1617,theory(equality)])).
% cnf(3195,plain,(multiplication(domain(X1),addition(X1,one))=addition(X1,domain(X1))),inference(rw,[status(thm)],[1646,21,theory(equality)])).
% cnf(3209,plain,(multiplication(domain(X1),addition(one,X1))=addition(X1,domain(X1))),inference(spm,[status(thm)],[3195,21,theory(equality)])).
% cnf(3581,negated_conjecture,(addition(domain(X1),one)=addition(domain(addition(X1,X2)),antidomain(X2))),inference(spm,[status(thm)],[117,61,theory(equality)])).
% cnf(3651,negated_conjecture,(one=addition(domain(addition(X1,X2)),antidomain(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3581,21,theory(equality)]),74,theory(equality)])).
% cnf(4213,negated_conjecture,(multiplication(domain(antidomain(X1)),one)=addition(antidomain(X1),domain(antidomain(X1)))),inference(spm,[status(thm)],[3209,626,theory(equality)])).
% cnf(4269,negated_conjecture,(domain(antidomain(X1))=addition(antidomain(X1),domain(antidomain(X1)))),inference(rw,[status(thm)],[4213,31,theory(equality)])).
% cnf(7332,negated_conjecture,(addition(domain(multiplication(X1,addition(X2,one))),antidomain(multiplication(X1,X2)))=one),inference(spm,[status(thm)],[3651,1301,theory(equality)])).
% cnf(7404,negated_conjecture,(addition(domain(X1),antidomain(multiplication(X1,X2)))=one),inference(rw,[status(thm)],[7332,333,theory(equality)])).
% cnf(9373,negated_conjecture,(multiplication(domain(X1),addition(antidomain(X1),X2))=multiplication(domain(X1),X2)),inference(rw,[status(thm)],[162,68,theory(equality)])).
% cnf(9561,negated_conjecture,(multiplication(domain(antidomain(X1)),antidomain(antidomain(X1)))=multiplication(antidomain(X1),antidomain(antidomain(X1)))),inference(spm,[status(thm)],[209,4269,theory(equality)])).
% cnf(9562,negated_conjecture,(multiplication(domain(addition(X1,X2)),antidomain(X2))=multiplication(domain(X1),antidomain(X2))),inference(spm,[status(thm)],[209,50,theory(equality)])).
% cnf(9627,negated_conjecture,(zero=multiplication(antidomain(X1),antidomain(antidomain(X1)))),inference(rw,[status(thm)],[9561,60,theory(equality)])).
% cnf(10083,negated_conjecture,(multiplication(addition(domain(X1),X2),antidomain(X1))=multiplication(X2,antidomain(X1))),inference(rw,[status(thm)],[198,68,theory(equality)])).
% cnf(10146,negated_conjecture,(multiplication(one,antidomain(X1))=multiplication(antidomain(domain(X1)),antidomain(X1))),inference(spm,[status(thm)],[10083,242,theory(equality)])).
% cnf(10226,negated_conjecture,(antidomain(X1)=multiplication(antidomain(domain(X1)),antidomain(X1))),inference(rw,[status(thm)],[10146,33,theory(equality)])).
% cnf(10309,negated_conjecture,(addition(antidomain(domain(X1)),antidomain(X1))=multiplication(antidomain(domain(X1)),addition(antidomain(X1),one))),inference(spm,[status(thm)],[1301,10226,theory(equality)])).
% cnf(10352,negated_conjecture,(addition(antidomain(domain(X1)),antidomain(X1))=antidomain(domain(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[10309,21,theory(equality)]),626,theory(equality)]),31,theory(equality)])).
% cnf(10696,negated_conjecture,(addition(antidomain(X1),antidomain(domain(X1)))=antidomain(domain(X1))),inference(rw,[status(thm)],[10352,21,theory(equality)])).
% cnf(11576,negated_conjecture,(multiplication(one,antidomain(X1))=multiplication(antidomain(multiplication(X1,X2)),antidomain(X1))),inference(spm,[status(thm)],[10083,7404,theory(equality)])).
% cnf(11661,negated_conjecture,(antidomain(X1)=multiplication(antidomain(multiplication(X1,X2)),antidomain(X1))),inference(rw,[status(thm)],[11576,33,theory(equality)])).
% cnf(16397,negated_conjecture,(domain(multiplication(domain(X1),antidomain(antidomain(X1))))=domain(domain(X1))),inference(spm,[status(thm)],[994,9373,theory(equality)])).
% cnf(16475,negated_conjecture,(domain(multiplication(domain(X1),antidomain(antidomain(X1))))=domain(X1)),inference(rw,[status(thm)],[16397,137,theory(equality)])).
% cnf(17907,negated_conjecture,(multiplication(antidomain(X1),antidomain(domain(X1)))=antidomain(domain(X1))),inference(spm,[status(thm)],[11661,1617,theory(equality)])).
% cnf(18139,negated_conjecture,(addition(antidomain(X1),antidomain(domain(X1)))=multiplication(antidomain(X1),addition(antidomain(domain(X1)),one))),inference(spm,[status(thm)],[1301,17907,theory(equality)])).
% cnf(18204,negated_conjecture,(antidomain(domain(X1))=multiplication(antidomain(X1),addition(antidomain(domain(X1)),one))),inference(rw,[status(thm)],[18139,10696,theory(equality)])).
% cnf(18205,negated_conjecture,(antidomain(domain(X1))=antidomain(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[18204,21,theory(equality)]),626,theory(equality)]),31,theory(equality)])).
% cnf(18326,negated_conjecture,(antidomain(domain(X1))=antidomain(multiplication(domain(X1),antidomain(antidomain(X1))))),inference(spm,[status(thm)],[18205,16475,theory(equality)])).
% cnf(18425,negated_conjecture,(antidomain(X1)=antidomain(multiplication(domain(X1),antidomain(antidomain(X1))))),inference(rw,[status(thm)],[18326,18205,theory(equality)])).
% cnf(33127,negated_conjecture,(multiplication(domain(one),antidomain(antidomain(X1)))=multiplication(domain(domain(X1)),antidomain(antidomain(X1)))),inference(spm,[status(thm)],[9562,61,theory(equality)])).
% cnf(33252,negated_conjecture,(antidomain(antidomain(X1))=multiplication(domain(domain(X1)),antidomain(antidomain(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[33127,263,theory(equality)]),33,theory(equality)])).
% cnf(33253,negated_conjecture,(antidomain(antidomain(X1))=multiplication(domain(X1),antidomain(antidomain(X1)))),inference(rw,[status(thm)],[33252,137,theory(equality)])).
% cnf(33411,negated_conjecture,(domain(antidomain(antidomain(X1)))=domain(X1)),inference(rw,[status(thm)],[16475,33253,theory(equality)])).
% cnf(33412,negated_conjecture,(antidomain(antidomain(antidomain(X1)))=antidomain(X1)),inference(rw,[status(thm)],[18425,33253,theory(equality)])).
% cnf(33583,negated_conjecture,(domain(multiplication(X1,domain(X2)))=domain(multiplication(X1,antidomain(antidomain(X2))))),inference(spm,[status(thm)],[45,33411,theory(equality)])).
% cnf(33667,negated_conjecture,(domain(multiplication(X1,X2))=domain(multiplication(X1,antidomain(antidomain(X2))))),inference(rw,[status(thm)],[33583,45,theory(equality)])).
% cnf(33803,negated_conjecture,(multiplication(antidomain(antidomain(X1)),antidomain(X1))=zero),inference(spm,[status(thm)],[9627,33412,theory(equality)])).
% cnf(36589,negated_conjecture,(domain(zero)=domain(multiplication(antidomain(antidomain(antidomain(X1))),X1))),inference(spm,[status(thm)],[33667,33803,theory(equality)])).
% cnf(36700,negated_conjecture,(zero=domain(multiplication(antidomain(antidomain(antidomain(X1))),X1))),inference(rw,[status(thm)],[36589,48,theory(equality)])).
% cnf(36701,negated_conjecture,(zero=domain(multiplication(antidomain(X1),X1))),inference(rw,[status(thm)],[36700,33412,theory(equality)])).
% cnf(36739,negated_conjecture,(multiplication(zero,multiplication(antidomain(X1),X1))=multiplication(antidomain(X1),X1)),inference(spm,[status(thm)],[1617,36701,theory(equality)])).
% cnf(36872,negated_conjecture,(zero=multiplication(antidomain(X1),X1)),inference(rw,[status(thm)],[36739,41,theory(equality)])).
% cnf(37103,negated_conjecture,($false),inference(rw,[status(thm)],[59,36872,theory(equality)])).
% cnf(37104,negated_conjecture,($false),inference(cn,[status(thm)],[37103,theory(equality)])).
% cnf(37105,negated_conjecture,($false),37104,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1611
% # ...of these trivial : 406
% # ...subsumed : 880
% # ...remaining for further processing: 325
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 36
% # Generated clauses : 19572
% # ...of the previous two non-trivial : 9609
% # Contextual simplify-reflections : 0
% # Paramodulations : 19571
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 289
% # Positive orientable unit clauses: 224
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 62
% # Current number of unprocessed clauses: 6751
% # ...number of literals in the above : 8414
% # Clause-clause subsumption calls (NU) : 2736
% # Rec. Clause-clause subsumption calls : 2736
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 287
% # Indexed BW rewrite successes : 53
% # Backwards rewriting index: 252 leaves, 1.70+/-1.443 terms/leaf
% # Paramod-from index: 155 leaves, 1.48+/-1.103 terms/leaf
% # Paramod-into index: 214 leaves, 1.70+/-1.455 terms/leaf
% # -------------------------------------------------
% # User time : 0.352 s
% # System time : 0.022 s
% # Total time : 0.374 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.82 CPU 0.90 WC
% FINAL PrfWatch: 0.82 CPU 0.90 WC
% SZS output end Solution for /tmp/SystemOnTPTP21964/KLE081+1.tptp
%
%------------------------------------------------------------------------------