TSTP Solution File: KLE008+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE008+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:30:41 EST 2010
% Result : Theorem 4.93s
% Output : Solution 4.93s
% 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/SystemOnTPTP18512/KLE008+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18512/KLE008+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18512/KLE008+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 18608
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.91 CPU 4.02 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X2]:multiplication(zero,X2)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(4, axiom,![X2]:![X3]:![X4]:multiplication(X2,multiplication(X3,X4))=multiplication(multiplication(X2,X3),X4),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(5, axiom,![X1]:![X5]:(test(X1)=>(c(X1)=X5<=>complement(X1,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(6, axiom,![X2]:![X3]:(leq(X2,X3)<=>addition(X2,X3)=X3),file('/tmp/SRASS.s.p', order)).
% fof(7, axiom,![X2]:addition(X2,zero)=X2,file('/tmp/SRASS.s.p', additive_identity)).
% fof(8, axiom,![X2]:![X3]:addition(X2,X3)=addition(X3,X2),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(9, axiom,![X4]:![X3]:![X2]:addition(X2,addition(X3,X4))=addition(addition(X2,X3),X4),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(10, axiom,![X2]:addition(X2,X2)=X2,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(11, axiom,![X1]:(test(X1)<=>?[X5]:complement(X5,X1)),file('/tmp/SRASS.s.p', test_1)).
% fof(12, axiom,![X2]:![X3]:![X4]:multiplication(X2,addition(X3,X4))=addition(multiplication(X2,X3),multiplication(X2,X4)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(13, axiom,![X2]:![X3]:![X4]:multiplication(addition(X2,X3),X4)=addition(multiplication(X2,X4),multiplication(X3,X4)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(14, axiom,![X2]:multiplication(X2,one)=X2,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(15, axiom,![X2]:multiplication(one,X2)=X2,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X1]:![X5]:(complement(X5,X1)<=>((multiplication(X1,X5)=zero&multiplication(X5,X1)=zero)&addition(X1,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(17, conjecture,![X1]:![X5]:![X6]:(test(X6)=>(leq(X1,multiplication(X6,X5))<=>(leq(X1,X5)&leq(multiplication(c(X6),X1),zero)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X5]:![X6]:(test(X6)=>(leq(X1,multiplication(X6,X5))<=>(leq(X1,X5)&leq(multiplication(c(X6),X1),zero))))),inference(assume_negation,[status(cth)],[17])).
% fof(25, plain,![X3]:multiplication(zero,X3)=zero,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:multiplication(X5,multiplication(X6,X7))=multiplication(multiplication(X5,X6),X7),inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X1]:![X5]:(~(test(X1))|((~(c(X1)=X5)|complement(X1,X5))&(~(complement(X1,X5))|c(X1)=X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[30])).
% cnf(33,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[31])).
% fof(34, plain,![X2]:![X3]:((~(leq(X2,X3))|addition(X2,X3)=X3)&(~(addition(X2,X3)=X3)|leq(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(35, plain,![X4]:![X5]:((~(leq(X4,X5))|addition(X4,X5)=X5)&(~(addition(X4,X5)=X5)|leq(X4,X5))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(38, plain,![X3]:addition(X3,zero)=X3,inference(variable_rename,[status(thm)],[7])).
% cnf(39,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:addition(X4,X5)=addition(X5,X4),inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X5]:![X6]:![X7]:addition(X7,addition(X6,X5))=addition(addition(X7,X6),X5),inference(variable_rename,[status(thm)],[9])).
% cnf(43,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X3]:addition(X3,X3)=X3,inference(variable_rename,[status(thm)],[10])).
% cnf(45,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X1]:((~(test(X1))|?[X5]:complement(X5,X1))&(![X5]:~(complement(X5,X1))|test(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(47, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(52, plain,![X5]:![X6]:![X7]:multiplication(X5,addition(X6,X7))=addition(multiplication(X5,X6),multiplication(X5,X7)),inference(variable_rename,[status(thm)],[12])).
% cnf(53,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X5]:![X6]:![X7]:multiplication(addition(X5,X6),X7)=addition(multiplication(X5,X7),multiplication(X6,X7)),inference(variable_rename,[status(thm)],[13])).
% cnf(55,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X3]:multiplication(X3,one)=X3,inference(variable_rename,[status(thm)],[14])).
% cnf(57,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X3]:multiplication(one,X3)=X3,inference(variable_rename,[status(thm)],[15])).
% cnf(59,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X1]:![X5]:((~(complement(X5,X1))|((multiplication(X1,X5)=zero&multiplication(X5,X1)=zero)&addition(X1,X5)=one))&(((~(multiplication(X1,X5)=zero)|~(multiplication(X5,X1)=zero))|~(addition(X1,X5)=one))|complement(X5,X1))),inference(fof_nnf,[status(thm)],[16])).
% fof(61, plain,![X6]:![X7]:((~(complement(X7,X6))|((multiplication(X6,X7)=zero&multiplication(X7,X6)=zero)&addition(X6,X7)=one))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X6]:![X7]:((((multiplication(X6,X7)=zero|~(complement(X7,X6)))&(multiplication(X7,X6)=zero|~(complement(X7,X6))))&(addition(X6,X7)=one|~(complement(X7,X6))))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, negated_conjecture,?[X1]:?[X5]:?[X6]:(test(X6)&((~(leq(X1,multiplication(X6,X5)))|(~(leq(X1,X5))|~(leq(multiplication(c(X6),X1),zero))))&(leq(X1,multiplication(X6,X5))|(leq(X1,X5)&leq(multiplication(c(X6),X1),zero))))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X7]:?[X8]:?[X9]:(test(X9)&((~(leq(X7,multiplication(X9,X8)))|(~(leq(X7,X8))|~(leq(multiplication(c(X9),X7),zero))))&(leq(X7,multiplication(X9,X8))|(leq(X7,X8)&leq(multiplication(c(X9),X7),zero))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,(test(esk4_0)&((~(leq(esk2_0,multiplication(esk4_0,esk3_0)))|(~(leq(esk2_0,esk3_0))|~(leq(multiplication(c(esk4_0),esk2_0),zero))))&(leq(esk2_0,multiplication(esk4_0,esk3_0))|(leq(esk2_0,esk3_0)&leq(multiplication(c(esk4_0),esk2_0),zero))))),inference(skolemize,[status(esa)],[68])).
% fof(70, negated_conjecture,(test(esk4_0)&((~(leq(esk2_0,multiplication(esk4_0,esk3_0)))|(~(leq(esk2_0,esk3_0))|~(leq(multiplication(c(esk4_0),esk2_0),zero))))&((leq(esk2_0,esk3_0)|leq(esk2_0,multiplication(esk4_0,esk3_0)))&(leq(multiplication(c(esk4_0),esk2_0),zero)|leq(esk2_0,multiplication(esk4_0,esk3_0)))))),inference(distribute,[status(thm)],[69])).
% cnf(71,negated_conjecture,(leq(esk2_0,multiplication(esk4_0,esk3_0))|leq(multiplication(c(esk4_0),esk2_0),zero)),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,negated_conjecture,(leq(esk2_0,multiplication(esk4_0,esk3_0))|leq(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(73,negated_conjecture,(~leq(multiplication(c(esk4_0),esk2_0),zero)|~leq(esk2_0,esk3_0)|~leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(split_conjunct,[status(thm)],[70])).
% cnf(74,negated_conjecture,(test(esk4_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(75,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[39,41,theory(equality)])).
% cnf(85,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(88,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[66,50,theory(equality)])).
% cnf(89,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[64,50,theory(equality)])).
% cnf(90,plain,(multiplication(esk1_1(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[65,50,theory(equality)])).
% cnf(105,negated_conjecture,(addition(esk2_0,multiplication(esk4_0,esk3_0))=multiplication(esk4_0,esk3_0)|leq(esk2_0,esk3_0)),inference(spm,[status(thm)],[37,72,theory(equality)])).
% cnf(131,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[43,45,theory(equality)])).
% cnf(139,negated_conjecture,(addition(multiplication(c(esk4_0),esk2_0),zero)=zero|leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(spm,[status(thm)],[37,71,theory(equality)])).
% cnf(141,negated_conjecture,(multiplication(c(esk4_0),esk2_0)=zero|leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(rw,[status(thm)],[139,39,theory(equality)])).
% cnf(146,plain,(leq(multiplication(X1,X2),multiplication(X1,X3))|multiplication(X1,addition(X2,X3))!=multiplication(X1,X3)),inference(spm,[status(thm)],[36,53,theory(equality)])).
% cnf(182,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[55,59,theory(equality)])).
% cnf(210,plain,(leq(zero,X1)),inference(spm,[status(thm)],[36,75,theory(equality)])).
% cnf(219,negated_conjecture,(addition(esk2_0,esk3_0)=esk3_0|addition(esk2_0,multiplication(esk4_0,esk3_0))=multiplication(esk4_0,esk3_0)),inference(spm,[status(thm)],[37,105,theory(equality)])).
% cnf(222,plain,(multiplication(c(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[66,85,theory(equality)])).
% cnf(223,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[64,85,theory(equality)])).
% cnf(229,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[36,131,theory(equality)])).
% cnf(259,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[229,41,theory(equality)])).
% cnf(318,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[28,88,theory(equality)])).
% cnf(323,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[53,88,theory(equality)])).
% cnf(324,plain,(addition(multiplication(X1,esk1_1(X2)),zero)=multiplication(addition(X1,X2),esk1_1(X2))|~test(X2)),inference(spm,[status(thm)],[55,88,theory(equality)])).
% cnf(330,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[323,39,theory(equality)])).
% cnf(331,plain,(multiplication(X1,esk1_1(X2))=multiplication(addition(X1,X2),esk1_1(X2))|~test(X2)),inference(rw,[status(thm)],[324,39,theory(equality)])).
% cnf(343,plain,(leq(X1,addition(X2,addition(X3,X1)))),inference(spm,[status(thm)],[259,43,theory(equality)])).
% cnf(417,plain,(leq(X1,addition(X2,addition(X1,X3)))),inference(spm,[status(thm)],[343,41,theory(equality)])).
% cnf(511,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[182,41,theory(equality)])).
% cnf(549,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[131,89,theory(equality)])).
% cnf(664,negated_conjecture,(addition(esk4_0,one)=one),inference(spm,[status(thm)],[549,74,theory(equality)])).
% cnf(716,plain,(multiplication(zero,X2)=multiplication(esk1_1(X1),multiplication(X1,X2))|~test(X1)),inference(spm,[status(thm)],[28,90,theory(equality)])).
% cnf(728,plain,(zero=multiplication(esk1_1(X1),multiplication(X1,X2))|~test(X1)),inference(rw,[status(thm)],[716,26,theory(equality)])).
% cnf(1326,negated_conjecture,(addition(zero,multiplication(X1,esk2_0))=multiplication(addition(c(esk4_0),X1),esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(spm,[status(thm)],[55,141,theory(equality)])).
% cnf(1336,negated_conjecture,(multiplication(X1,esk2_0)=multiplication(addition(c(esk4_0),X1),esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(rw,[status(thm)],[1326,75,theory(equality)])).
% cnf(1386,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[223,41,theory(equality)])).
% cnf(1537,negated_conjecture,(leq(esk2_0,addition(X1,multiplication(esk4_0,esk3_0)))|addition(esk2_0,esk3_0)=esk3_0),inference(spm,[status(thm)],[417,219,theory(equality)])).
% cnf(4760,negated_conjecture,(addition(esk2_0,esk3_0)=esk3_0|leq(esk2_0,multiplication(addition(esk4_0,one),esk3_0))),inference(spm,[status(thm)],[1537,511,theory(equality)])).
% cnf(4761,negated_conjecture,(addition(esk2_0,esk3_0)=esk3_0|leq(esk2_0,esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4760,664,theory(equality)]),59,theory(equality)])).
% cnf(4762,negated_conjecture,(addition(esk2_0,esk3_0)=esk3_0),inference(csr,[status(thm)],[4761,37])).
% cnf(4763,negated_conjecture,(leq(esk2_0,esk3_0)),inference(spm,[status(thm)],[36,4762,theory(equality)])).
% cnf(4783,negated_conjecture,(leq(multiplication(X1,esk2_0),multiplication(X1,esk3_0))),inference(spm,[status(thm)],[146,4762,theory(equality)])).
% cnf(4810,negated_conjecture,(~leq(multiplication(c(esk4_0),esk2_0),zero)|~leq(esk2_0,multiplication(esk4_0,esk3_0))|$false),inference(rw,[status(thm)],[73,4763,theory(equality)])).
% cnf(4811,negated_conjecture,(~leq(multiplication(c(esk4_0),esk2_0),zero)|~leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(cn,[status(thm)],[4810,theory(equality)])).
% cnf(9869,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[330,89,theory(equality)])).
% cnf(9909,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[9869,57,theory(equality)])).
% cnf(10080,negated_conjecture,(multiplication(esk4_0,esk4_0)=esk4_0),inference(spm,[status(thm)],[9909,74,theory(equality)])).
% cnf(10119,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,multiplication(esk4_0,X1))),inference(spm,[status(thm)],[28,10080,theory(equality)])).
% cnf(10128,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero|~test(esk4_0)),inference(spm,[status(thm)],[318,10080,theory(equality)])).
% cnf(10154,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero|$false),inference(rw,[status(thm)],[10128,74,theory(equality)])).
% cnf(10155,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero),inference(cn,[status(thm)],[10154,theory(equality)])).
% cnf(10249,negated_conjecture,(multiplication(esk4_0,esk1_1(esk4_0))=zero),inference(rw,[status(thm)],[10155,10119,theory(equality)])).
% cnf(10253,negated_conjecture,(addition(zero,multiplication(esk4_0,X1))=multiplication(esk4_0,addition(esk1_1(esk4_0),X1))),inference(spm,[status(thm)],[53,10249,theory(equality)])).
% cnf(10254,negated_conjecture,(addition(zero,multiplication(X1,esk1_1(esk4_0)))=multiplication(addition(esk4_0,X1),esk1_1(esk4_0))),inference(spm,[status(thm)],[55,10249,theory(equality)])).
% cnf(10280,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,addition(esk1_1(esk4_0),X1))),inference(rw,[status(thm)],[10253,75,theory(equality)])).
% cnf(10281,negated_conjecture,(multiplication(X1,esk1_1(esk4_0))=multiplication(addition(esk4_0,X1),esk1_1(esk4_0))),inference(rw,[status(thm)],[10254,75,theory(equality)])).
% cnf(11444,negated_conjecture,(multiplication(one,esk1_1(esk4_0))=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[10281,1386,theory(equality)])).
% cnf(11486,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[11444,59,theory(equality)])).
% cnf(11487,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|$false),inference(rw,[status(thm)],[11486,74,theory(equality)])).
% cnf(11488,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))),inference(cn,[status(thm)],[11487,theory(equality)])).
% cnf(11536,negated_conjecture,(addition(esk1_1(esk4_0),multiplication(c(esk4_0),X1))=multiplication(c(esk4_0),addition(esk1_1(esk4_0),X1))),inference(spm,[status(thm)],[53,11488,theory(equality)])).
% cnf(14484,negated_conjecture,(addition(esk1_1(esk4_0),zero)=multiplication(c(esk4_0),addition(esk1_1(esk4_0),esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[11536,222,theory(equality)])).
% cnf(14525,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),addition(esk1_1(esk4_0),esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[14484,39,theory(equality)])).
% cnf(14526,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),addition(esk4_0,esk1_1(esk4_0)))|~test(esk4_0)),inference(rw,[status(thm)],[14525,41,theory(equality)])).
% cnf(14527,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),addition(esk4_0,esk1_1(esk4_0)))|$false),inference(rw,[status(thm)],[14526,74,theory(equality)])).
% cnf(14528,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),addition(esk4_0,esk1_1(esk4_0)))),inference(cn,[status(thm)],[14527,theory(equality)])).
% cnf(14561,negated_conjecture,(multiplication(c(esk4_0),one)=esk1_1(esk4_0)|~test(esk4_0)),inference(spm,[status(thm)],[14528,89,theory(equality)])).
% cnf(14580,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)|~test(esk4_0)),inference(rw,[status(thm)],[14561,57,theory(equality)])).
% cnf(14581,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)|$false),inference(rw,[status(thm)],[14580,74,theory(equality)])).
% cnf(14582,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)),inference(cn,[status(thm)],[14581,theory(equality)])).
% cnf(14588,negated_conjecture,(addition(esk4_0,c(esk4_0))=one|~test(esk4_0)),inference(spm,[status(thm)],[89,14582,theory(equality)])).
% cnf(14589,negated_conjecture,(multiplication(c(esk4_0),esk4_0)=zero|~test(esk4_0)),inference(spm,[status(thm)],[90,14582,theory(equality)])).
% cnf(14642,negated_conjecture,(multiplication(esk4_0,addition(c(esk4_0),X1))=multiplication(esk4_0,X1)),inference(rw,[status(thm)],[10280,14582,theory(equality)])).
% cnf(14648,negated_conjecture,(multiplication(esk4_0,c(esk4_0))=zero),inference(rw,[status(thm)],[10249,14582,theory(equality)])).
% cnf(14673,negated_conjecture,(addition(esk4_0,c(esk4_0))=one|$false),inference(rw,[status(thm)],[14588,74,theory(equality)])).
% cnf(14674,negated_conjecture,(addition(esk4_0,c(esk4_0))=one),inference(cn,[status(thm)],[14673,theory(equality)])).
% cnf(14675,negated_conjecture,(multiplication(c(esk4_0),esk4_0)=zero|$false),inference(rw,[status(thm)],[14589,74,theory(equality)])).
% cnf(14676,negated_conjecture,(multiplication(c(esk4_0),esk4_0)=zero),inference(cn,[status(thm)],[14675,theory(equality)])).
% cnf(14901,negated_conjecture,(multiplication(one,esk1_1(c(esk4_0)))=multiplication(esk4_0,esk1_1(c(esk4_0)))|~test(c(esk4_0))),inference(spm,[status(thm)],[331,14674,theory(equality)])).
% cnf(14957,negated_conjecture,(esk1_1(c(esk4_0))=multiplication(esk4_0,esk1_1(c(esk4_0)))|~test(c(esk4_0))),inference(rw,[status(thm)],[14901,59,theory(equality)])).
% cnf(15001,negated_conjecture,(complement(esk4_0,c(esk4_0))|multiplication(esk4_0,c(esk4_0))!=zero|addition(c(esk4_0),esk4_0)!=one),inference(spm,[status(thm)],[63,14676,theory(equality)])).
% cnf(15003,negated_conjecture,(multiplication(zero,X1)=multiplication(c(esk4_0),multiplication(esk4_0,X1))),inference(spm,[status(thm)],[28,14676,theory(equality)])).
% cnf(15031,negated_conjecture,(complement(esk4_0,c(esk4_0))|$false|addition(c(esk4_0),esk4_0)!=one),inference(rw,[status(thm)],[15001,14648,theory(equality)])).
% cnf(15032,negated_conjecture,(complement(esk4_0,c(esk4_0))|$false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[15031,41,theory(equality)]),14674,theory(equality)])).
% cnf(15033,negated_conjecture,(complement(esk4_0,c(esk4_0))),inference(cn,[status(thm)],[15032,theory(equality)])).
% cnf(15036,negated_conjecture,(zero=multiplication(c(esk4_0),multiplication(esk4_0,X1))),inference(rw,[status(thm)],[15003,26,theory(equality)])).
% cnf(15068,negated_conjecture,(test(c(esk4_0))),inference(spm,[status(thm)],[51,15033,theory(equality)])).
% cnf(15438,negated_conjecture,(addition(multiplication(c(esk4_0),X1),zero)=multiplication(c(esk4_0),addition(X1,multiplication(esk4_0,X2)))),inference(spm,[status(thm)],[53,15036,theory(equality)])).
% cnf(15488,negated_conjecture,(multiplication(c(esk4_0),X1)=multiplication(c(esk4_0),addition(X1,multiplication(esk4_0,X2)))),inference(rw,[status(thm)],[15438,39,theory(equality)])).
% cnf(15840,negated_conjecture,(multiplication(esk4_0,one)=multiplication(esk4_0,esk1_1(c(esk4_0)))|~test(c(esk4_0))),inference(spm,[status(thm)],[14642,89,theory(equality)])).
% cnf(15893,negated_conjecture,(esk4_0=multiplication(esk4_0,esk1_1(c(esk4_0)))|~test(c(esk4_0))),inference(rw,[status(thm)],[15840,57,theory(equality)])).
% cnf(15894,negated_conjecture,(esk4_0=multiplication(esk4_0,esk1_1(c(esk4_0)))|$false),inference(rw,[status(thm)],[15893,15068,theory(equality)])).
% cnf(15895,negated_conjecture,(esk4_0=multiplication(esk4_0,esk1_1(c(esk4_0)))),inference(cn,[status(thm)],[15894,theory(equality)])).
% cnf(21961,negated_conjecture,(esk4_0=esk1_1(c(esk4_0))|~test(c(esk4_0))),inference(rw,[status(thm)],[14957,15895,theory(equality)])).
% cnf(21962,negated_conjecture,(esk4_0=esk1_1(c(esk4_0))|$false),inference(rw,[status(thm)],[21961,15068,theory(equality)])).
% cnf(21963,negated_conjecture,(esk4_0=esk1_1(c(esk4_0))),inference(cn,[status(thm)],[21962,theory(equality)])).
% cnf(86828,negated_conjecture,(multiplication(one,esk2_0)=multiplication(esk1_1(c(esk4_0)),esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))|~test(c(esk4_0))),inference(spm,[status(thm)],[1336,89,theory(equality)])).
% cnf(86916,negated_conjecture,(esk2_0=multiplication(esk1_1(c(esk4_0)),esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))|~test(c(esk4_0))),inference(rw,[status(thm)],[86828,59,theory(equality)])).
% cnf(86917,negated_conjecture,(esk2_0=multiplication(esk4_0,esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))|~test(c(esk4_0))),inference(rw,[status(thm)],[86916,21963,theory(equality)])).
% cnf(86918,negated_conjecture,(esk2_0=multiplication(esk4_0,esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))|$false),inference(rw,[status(thm)],[86917,15068,theory(equality)])).
% cnf(86919,negated_conjecture,(esk2_0=multiplication(esk4_0,esk2_0)|leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(cn,[status(thm)],[86918,theory(equality)])).
% cnf(86946,negated_conjecture,(addition(esk2_0,multiplication(esk4_0,esk3_0))=multiplication(esk4_0,esk3_0)|multiplication(esk4_0,esk2_0)=esk2_0),inference(spm,[status(thm)],[37,86919,theory(equality)])).
% cnf(86947,negated_conjecture,(multiplication(esk4_0,esk2_0)=esk2_0|~leq(multiplication(c(esk4_0),esk2_0),zero)),inference(spm,[status(thm)],[4811,86919,theory(equality)])).
% cnf(154223,negated_conjecture,(multiplication(c(esk4_0),multiplication(esk4_0,esk3_0))=multiplication(c(esk4_0),esk2_0)|multiplication(esk4_0,esk2_0)=esk2_0),inference(spm,[status(thm)],[15488,86946,theory(equality)])).
% cnf(154451,negated_conjecture,(zero=multiplication(c(esk4_0),esk2_0)|multiplication(esk4_0,esk2_0)=esk2_0),inference(rw,[status(thm)],[154223,15036,theory(equality)])).
% cnf(154570,negated_conjecture,(multiplication(esk4_0,esk2_0)=esk2_0|~leq(zero,zero)),inference(spm,[status(thm)],[86947,154451,theory(equality)])).
% cnf(154690,negated_conjecture,(multiplication(esk4_0,esk2_0)=esk2_0|$false),inference(rw,[status(thm)],[154570,210,theory(equality)])).
% cnf(154691,negated_conjecture,(multiplication(esk4_0,esk2_0)=esk2_0),inference(cn,[status(thm)],[154690,theory(equality)])).
% cnf(154723,negated_conjecture,(multiplication(esk1_1(esk4_0),esk2_0)=zero|~test(esk4_0)),inference(spm,[status(thm)],[728,154691,theory(equality)])).
% cnf(154749,negated_conjecture,(leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(spm,[status(thm)],[4783,154691,theory(equality)])).
% cnf(154844,negated_conjecture,(multiplication(c(esk4_0),esk2_0)=zero|~test(esk4_0)),inference(rw,[status(thm)],[154723,14582,theory(equality)])).
% cnf(154845,negated_conjecture,(multiplication(c(esk4_0),esk2_0)=zero|$false),inference(rw,[status(thm)],[154844,74,theory(equality)])).
% cnf(154846,negated_conjecture,(multiplication(c(esk4_0),esk2_0)=zero),inference(cn,[status(thm)],[154845,theory(equality)])).
% cnf(154963,negated_conjecture,($false|~leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4811,154846,theory(equality)]),210,theory(equality)])).
% cnf(154964,negated_conjecture,(~leq(esk2_0,multiplication(esk4_0,esk3_0))),inference(cn,[status(thm)],[154963,theory(equality)])).
% cnf(155087,negated_conjecture,($false),inference(sr,[status(thm)],[154749,154964,theory(equality)])).
% cnf(155088,negated_conjecture,($false),155087,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6064
% # ...of these trivial : 1174
% # ...subsumed : 3613
% # ...remaining for further processing: 1277
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 18
% # Backward-rewritten : 189
% # Generated clauses : 79510
% # ...of the previous two non-trivial : 52556
% # Contextual simplify-reflections : 327
% # Paramodulations : 79484
% # Factorizations : 0
% # Equation resolutions : 20
% # Current number of processed clauses: 1063
% # Positive orientable unit clauses: 453
% # Positive unorientable unit clauses: 8
% # Negative unit clauses : 1
% # Non-unit-clauses : 601
% # Current number of unprocessed clauses: 40063
% # ...number of literals in the above : 66874
% # Clause-clause subsumption calls (NU) : 31108
% # Rec. Clause-clause subsumption calls : 30980
% # Unit Clause-clause subsumption calls : 403
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1292
% # Indexed BW rewrite successes : 414
% # Backwards rewriting index: 987 leaves, 1.61+/-1.414 terms/leaf
% # Paramod-from index: 374 leaves, 1.55+/-1.068 terms/leaf
% # Paramod-into index: 578 leaves, 1.68+/-1.466 terms/leaf
% # -------------------------------------------------
% # User time : 2.147 s
% # System time : 0.088 s
% # Total time : 2.235 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.12 CPU 4.25 WC
% FINAL PrfWatch: 4.12 CPU 4.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP18512/KLE008+1.tptp
%
%------------------------------------------------------------------------------