TSTP Solution File: KLE139+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE139+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 08:10:53 EST 2010
% Result : Theorem 11.93s
% Output : Solution 11.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/SystemOnTPTP16471/KLE139+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16471/KLE139+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16471/KLE139+2.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 16567
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.91 CPU 4.04 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.87 CPU 6.04 WC
% PrfWatch: 7.86 CPU 8.05 WC
% PrfWatch: 9.86 CPU 10.06 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(3, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(4, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(5, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(9, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X3,X1),X2),X3)=>leq(multiplication(X2,star(X1)),X3)),file('/tmp/SRASS.s.p', star_induction2)).
% fof(10, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(11, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(12, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(13, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(14, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(15, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(16, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(17, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(18, axiom,![X1]:strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero)),file('/tmp/SRASS.s.p', isolation)).
% fof(19, conjecture,![X4]:(leq(strong_iteration(X4),addition(multiplication(strong_iteration(X4),X4),one))&leq(addition(multiplication(strong_iteration(X4),X4),one),strong_iteration(X4))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:(leq(strong_iteration(X4),addition(multiplication(strong_iteration(X4),X4),one))&leq(addition(multiplication(strong_iteration(X4),X4),one),strong_iteration(X4)))),inference(assume_negation,[status(cth)],[19])).
% fof(24, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[6])).
% 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)],[7])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(41, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X3,X1),X2),X3))|leq(multiplication(X2,star(X1)),X3)),inference(fof_nnf,[status(thm)],[9])).
% fof(42, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X6,X4),X5),X6))|leq(multiplication(X5,star(X4)),X6)),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[10])).
% cnf(45,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[11])).
% cnf(47,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[13])).
% cnf(51,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[14])).
% cnf(53,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(55,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(57,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[17])).
% cnf(59,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X2]:strong_iteration(X2)=addition(star(X2),multiplication(strong_iteration(X2),zero)),inference(variable_rename,[status(thm)],[18])).
% cnf(61,plain,(strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero))),inference(split_conjunct,[status(thm)],[60])).
% fof(62, negated_conjecture,?[X4]:(~(leq(strong_iteration(X4),addition(multiplication(strong_iteration(X4),X4),one)))|~(leq(addition(multiplication(strong_iteration(X4),X4),one),strong_iteration(X4)))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:(~(leq(strong_iteration(X5),addition(multiplication(strong_iteration(X5),X5),one)))|~(leq(addition(multiplication(strong_iteration(X5),X5),one),strong_iteration(X5)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(leq(strong_iteration(esk1_0),addition(multiplication(strong_iteration(esk1_0),esk1_0),one)))|~(leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0)))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0))|~leq(strong_iteration(esk1_0),addition(multiplication(strong_iteration(esk1_0),esk1_0),one))),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[55,51,theory(equality)])).
% cnf(70,negated_conjecture,(~leq(strong_iteration(esk1_0),addition(one,multiplication(strong_iteration(esk1_0),esk1_0)))|~leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0))),inference(rw,[status(thm)],[65,51,theory(equality)])).
% cnf(71,negated_conjecture,(~leq(strong_iteration(esk1_0),addition(one,multiplication(strong_iteration(esk1_0),esk1_0)))|~leq(addition(one,multiplication(strong_iteration(esk1_0),esk1_0)),strong_iteration(esk1_0))),inference(rw,[status(thm)],[70,51,theory(equality)])).
% cnf(78,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[25,51,theory(equality)])).
% cnf(86,plain,(leq(X1,X1)),inference(spm,[status(thm)],[32,57,theory(equality)])).
% cnf(109,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(star(X1),X1),X2))),inference(spm,[status(thm)],[53,49,theory(equality)])).
% cnf(110,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(X1,star(X1)),X2))),inference(spm,[status(thm)],[53,47,theory(equality)])).
% cnf(113,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,57,theory(equality)])).
% cnf(134,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[43,57,theory(equality)])).
% cnf(138,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[134,45,theory(equality)])).
% cnf(148,plain,(addition(strong_iteration(X1),X2)=addition(star(X1),addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[53,61,theory(equality)])).
% cnf(155,plain,(leq(multiplication(multiplication(X1,X2),star(X3)),X1)|~leq(multiplication(X1,addition(X3,X2)),X1)),inference(spm,[status(thm)],[43,35,theory(equality)])).
% cnf(160,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[35,27,theory(equality)])).
% cnf(168,plain,(leq(multiplication(X1,multiplication(X2,star(X3))),X1)|~leq(multiplication(X1,addition(X3,X2)),X1)),inference(rw,[status(thm)],[155,45,theory(equality)])).
% cnf(191,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[37,29,theory(equality)])).
% cnf(192,plain,(addition(multiplication(X1,X2),multiplication(X3,multiplication(X4,X2)))=multiplication(addition(X1,multiplication(X3,X4)),X2)),inference(spm,[status(thm)],[37,45,theory(equality)])).
% cnf(196,plain,(addition(multiplication(X1,multiplication(X2,X3)),multiplication(X4,X3))=multiplication(addition(multiplication(X1,X2),X4),X3)),inference(spm,[status(thm)],[37,45,theory(equality)])).
% cnf(254,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[113,49,theory(equality)])).
% cnf(462,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[160,51,theory(equality)])).
% cnf(634,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[191,51,theory(equality)])).
% cnf(635,plain,(multiplication(addition(X1,one),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[66,634,theory(equality)])).
% cnf(652,plain,(multiplication(addition(X1,one),X1)=multiplication(X1,addition(X1,one))),inference(spm,[status(thm)],[462,634,theory(equality)])).
% cnf(679,plain,(multiplication(addition(one,X1),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[635,51,theory(equality)])).
% cnf(715,plain,(multiplication(strong_iteration(X1),zero)=multiplication(multiplication(X1,strong_iteration(X1)),zero)),inference(spm,[status(thm)],[679,78,theory(equality)])).
% cnf(741,plain,(multiplication(strong_iteration(X1),zero)=multiplication(X1,multiplication(strong_iteration(X1),zero))),inference(rw,[status(thm)],[715,45,theory(equality)])).
% cnf(953,plain,(multiplication(addition(one,X1),X1)=multiplication(X1,addition(one,X1))),inference(spm,[status(thm)],[652,51,theory(equality)])).
% cnf(987,plain,(multiplication(star(X1),multiplication(star(X1),X1))=multiplication(multiplication(star(X1),X1),star(X1))),inference(spm,[status(thm)],[953,49,theory(equality)])).
% cnf(988,plain,(multiplication(star(X1),multiplication(X1,star(X1)))=multiplication(multiplication(X1,star(X1)),star(X1))),inference(spm,[status(thm)],[953,47,theory(equality)])).
% cnf(1009,plain,(multiplication(star(X1),multiplication(star(X1),X1))=multiplication(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[987,45,theory(equality)])).
% cnf(1010,plain,(multiplication(star(X1),multiplication(X1,star(X1)))=multiplication(X1,multiplication(star(X1),star(X1)))),inference(rw,[status(thm)],[988,45,theory(equality)])).
% cnf(1774,plain,(addition(multiplication(strong_iteration(X1),zero),multiplication(X1,X2))=multiplication(X1,addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[35,741,theory(equality)])).
% cnf(2473,plain,(addition(one,multiplication(star(X1),X1))=addition(star(X1),multiplication(star(X1),X1))),inference(spm,[status(thm)],[109,57,theory(equality)])).
% cnf(2504,plain,(star(X1)=addition(star(X1),multiplication(star(X1),X1))),inference(rw,[status(thm)],[2473,49,theory(equality)])).
% cnf(2505,plain,(star(X1)=multiplication(star(X1),addition(X1,one))),inference(rw,[status(thm)],[2504,462,theory(equality)])).
% cnf(2517,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(spm,[status(thm)],[634,2505,theory(equality)])).
% cnf(2535,plain,(addition(X1,star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2517,53,theory(equality)]),254,theory(equality)])).
% cnf(2536,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2535,51,theory(equality)]),254,theory(equality)]),2505,theory(equality)])).
% cnf(2838,plain,(addition(one,multiplication(X1,star(X1)))=addition(star(X1),multiplication(X1,star(X1)))),inference(spm,[status(thm)],[110,57,theory(equality)])).
% cnf(2874,plain,(star(X1)=addition(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[2838,47,theory(equality)])).
% cnf(2875,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[2874,634,theory(equality)])).
% cnf(4091,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[2875,51,theory(equality)])).
% cnf(7365,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[4091,254,theory(equality)])).
% cnf(19246,plain,(addition(star(X1),multiplication(strong_iteration(X1),addition(zero,X2)))=addition(strong_iteration(X1),multiplication(strong_iteration(X1),X2))),inference(spm,[status(thm)],[148,35,theory(equality)])).
% cnf(19350,plain,(addition(star(X1),multiplication(strong_iteration(X1),X2))=addition(strong_iteration(X1),multiplication(strong_iteration(X1),X2))),inference(rw,[status(thm)],[19246,66,theory(equality)])).
% cnf(19351,plain,(addition(star(X1),multiplication(strong_iteration(X1),X2))=multiplication(strong_iteration(X1),addition(X2,one))),inference(rw,[status(thm)],[19350,462,theory(equality)])).
% cnf(22662,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[168,2505,theory(equality)])).
% cnf(22708,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[22662,29,theory(equality)])).
% cnf(22709,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[22708,86,theory(equality)])).
% cnf(22710,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[22709,theory(equality)])).
% cnf(24378,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[138,22710,theory(equality)])).
% cnf(24399,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24378,7365,theory(equality)]),7365,theory(equality)])).
% cnf(24409,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[33,24399,theory(equality)])).
% cnf(24429,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24409,51,theory(equality)]),2536,theory(equality)])).
% cnf(24542,plain,(multiplication(star(X1),star(X1))=star(star(X1))),inference(rw,[status(thm)],[7365,24429,theory(equality)])).
% cnf(24543,plain,(multiplication(star(X1),star(X1))=star(X1)),inference(rw,[status(thm)],[24542,24429,theory(equality)])).
% cnf(24667,plain,(multiplication(star(X1),X2)=multiplication(star(X1),multiplication(star(X1),X2))),inference(spm,[status(thm)],[45,24543,theory(equality)])).
% cnf(28867,plain,(multiplication(star(X1),multiplication(X1,star(X1)))=multiplication(X1,star(X1))),inference(rw,[status(thm)],[1010,24543,theory(equality)])).
% cnf(28934,plain,(multiplication(star(X1),multiplication(star(X1),X1))=multiplication(X1,star(X1))),inference(rw,[status(thm)],[1009,28867,theory(equality)])).
% cnf(29087,plain,(addition(multiplication(X1,X2),multiplication(X3,zero))=multiplication(addition(X1,multiplication(X3,zero)),X2)),inference(spm,[status(thm)],[192,59,theory(equality)])).
% cnf(30355,plain,(addition(multiplication(X1,zero),multiplication(X3,X2))=multiplication(addition(multiplication(X1,zero),X3),X2)),inference(spm,[status(thm)],[196,59,theory(equality)])).
% cnf(84311,plain,(multiplication(X1,star(X1))=multiplication(star(X1),X1)),inference(spm,[status(thm)],[24667,28934,theory(equality)])).
% cnf(86348,plain,(addition(multiplication(X1,star(X1)),multiplication(X2,zero))=multiplication(addition(star(X1),multiplication(X2,zero)),X1)),inference(spm,[status(thm)],[29087,84311,theory(equality)])).
% cnf(86473,plain,(multiplication(addition(X1,multiplication(X2,zero)),star(X1))=multiplication(addition(star(X1),multiplication(X2,zero)),X1)),inference(rw,[status(thm)],[86348,29087,theory(equality)])).
% cnf(160605,plain,(multiplication(addition(X1,multiplication(strong_iteration(X1),zero)),X2)=multiplication(X1,addition(multiplication(strong_iteration(X1),zero),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1774,30355,theory(equality)]),51,theory(equality)])).
% cnf(460564,plain,(multiplication(multiplication(strong_iteration(X1),addition(zero,one)),X1)=multiplication(addition(X1,multiplication(strong_iteration(X1),zero)),star(X1))),inference(spm,[status(thm)],[86473,19351,theory(equality)])).
% cnf(461113,plain,(multiplication(strong_iteration(X1),X1)=multiplication(addition(X1,multiplication(strong_iteration(X1),zero)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[460564,66,theory(equality)]),27,theory(equality)])).
% cnf(461114,plain,(multiplication(strong_iteration(X1),X1)=multiplication(X1,strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[461113,160605,theory(equality)]),51,theory(equality)]),19351,theory(equality)]),66,theory(equality)]),27,theory(equality)])).
% cnf(461726,negated_conjecture,($false|~leq(addition(one,multiplication(strong_iteration(esk1_0),esk1_0)),strong_iteration(esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[71,461114,theory(equality)]),78,theory(equality)]),86,theory(equality)])).
% cnf(461727,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[461726,461114,theory(equality)]),78,theory(equality)]),86,theory(equality)])).
% cnf(461728,negated_conjecture,($false),inference(cn,[status(thm)],[461727,theory(equality)])).
% cnf(461729,negated_conjecture,($false),461728,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 9124
% # ...of these trivial : 2638
% # ...subsumed : 4859
% # ...remaining for further processing: 1627
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 250
% # Generated clauses : 235694
% # ...of the previous two non-trivial : 105304
% # Contextual simplify-reflections : 0
% # Paramodulations : 235692
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 1368
% # Positive orientable unit clauses: 1062
% # Positive unorientable unit clauses: 12
% # Negative unit clauses : 0
% # Non-unit-clauses : 294
% # Current number of unprocessed clauses: 89810
% # ...number of literals in the above : 122481
% # Clause-clause subsumption calls (NU) : 25023
% # Rec. Clause-clause subsumption calls : 25023
% # Unit Clause-clause subsumption calls : 645
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6258
% # Indexed BW rewrite successes : 442
% # Backwards rewriting index: 780 leaves, 2.66+/-2.754 terms/leaf
% # Paramod-from index: 477 leaves, 2.27+/-2.716 terms/leaf
% # Paramod-into index: 664 leaves, 2.70+/-2.839 terms/leaf
% # -------------------------------------------------
% # User time : 5.331 s
% # System time : 0.245 s
% # Total time : 5.576 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.94 CPU 11.15 WC
% FINAL PrfWatch: 10.94 CPU 11.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP16471/KLE139+2.tptp
%
%------------------------------------------------------------------------------