TSTP Solution File: KLE147+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE147+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 : 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:13:32 EST 2010
% Result : Theorem 31.41s
% Output : Solution 31.41s
% 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/SystemOnTPTP18106/KLE147+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18106/KLE147+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18106/KLE147+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 18202
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.92 CPU 2.02 WC
% PrfWatch: 3.90 CPU 4.02 WC
% PrfWatch: 5.89 CPU 6.03 WC
% PrfWatch: 7.86 CPU 8.04 WC
% PrfWatch: 9.85 CPU 10.04 WC
% PrfWatch: 11.84 CPU 12.05 WC
% PrfWatch: 13.81 CPU 14.06 WC
% PrfWatch: 15.80 CPU 16.06 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 17.79 CPU 18.07 WC
% PrfWatch: 19.78 CPU 20.08 WC
% PrfWatch: 21.77 CPU 22.09 WC
% PrfWatch: 23.76 CPU 24.09 WC
% PrfWatch: 25.75 CPU 26.10 WC
% PrfWatch: 27.73 CPU 28.11 WC
% PrfWatch: 29.72 CPU 30.11 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(3, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(4, axiom,![X1]:strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero)),file('/tmp/SRASS.s.p', isolation)).
% fof(5, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(6, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(7, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(8, axiom,![X1]:![X2]:![X3]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(9, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(10, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(11, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(12, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(13, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(15, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(16, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X3),X2),X3)=>leq(multiplication(star(X1),X2),X3)),file('/tmp/SRASS.s.p', star_induction1)).
% fof(17, 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(18, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(19, conjecture,![X4]:![X5]:strong_iteration(multiplication(star(X4),X5))=multiplication(star(X5),strong_iteration(multiplication(star(X4),X5))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:strong_iteration(multiplication(star(X4),X5))=multiplication(star(X5),strong_iteration(multiplication(star(X4),X5)))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:strong_iteration(X2)=addition(star(X2),multiplication(strong_iteration(X2),zero)),inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[6])).
% cnf(32,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(36, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(39,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[10])).
% cnf(41,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(43,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(45,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(47,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(49,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[15])).
% cnf(51,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X3),X2),X3))|leq(multiplication(star(X1),X2),X3)),inference(fof_nnf,[status(thm)],[16])).
% fof(53, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X6),X5),X6))|leq(multiplication(star(X4),X5),X6)),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X3,X1),X2),X3))|leq(multiplication(X2,star(X1)),X3)),inference(fof_nnf,[status(thm)],[17])).
% fof(56, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X6,X4),X5),X6))|leq(multiplication(X5,star(X4)),X6)),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(59, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[59])).
% fof(62, negated_conjecture,?[X4]:?[X5]:~(strong_iteration(multiplication(star(X4),X5))=multiplication(star(X5),strong_iteration(multiplication(star(X4),X5)))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X6]:?[X7]:~(strong_iteration(multiplication(star(X6),X7))=multiplication(star(X7),strong_iteration(multiplication(star(X6),X7)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(strong_iteration(multiplication(star(esk1_0),esk2_0))=multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0)))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(strong_iteration(multiplication(star(esk1_0),esk2_0))!=multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0)))),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[43,39,theory(equality)])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[30,39,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[60,45,theory(equality)])).
% cnf(89,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[57,47,theory(equality)])).
% cnf(91,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[57,45,theory(equality)])).
% cnf(103,plain,(addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2)))))=star(multiplication(X1,X2))),inference(spm,[status(thm)],[32,22,theory(equality)])).
% cnf(125,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(X1,star(X1)),X2))),inference(spm,[status(thm)],[41,32,theory(equality)])).
% cnf(126,plain,(addition(strong_iteration(X1),X2)=addition(one,addition(multiplication(X1,strong_iteration(X1)),X2))),inference(spm,[status(thm)],[41,76,theory(equality)])).
% cnf(128,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[41,45,theory(equality)])).
% cnf(142,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(X3,multiplication(X2,X1)))),inference(spm,[status(thm)],[37,39,theory(equality)])).
% cnf(145,plain,(addition(strong_iteration(X1),X2)=addition(star(X1),addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[41,28,theory(equality)])).
% cnf(152,plain,(leq(multiplication(multiplication(X1,X2),star(X3)),X1)|~leq(multiplication(X1,addition(X3,X2)),X1)),inference(spm,[status(thm)],[57,24,theory(equality)])).
% cnf(157,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[24,47,theory(equality)])).
% cnf(165,plain,(leq(multiplication(X1,multiplication(X2,star(X3))),X1)|~leq(multiplication(X1,addition(X3,X2)),X1)),inference(rw,[status(thm)],[152,22,theory(equality)])).
% cnf(185,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[54,26,theory(equality)])).
% cnf(187,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[26,49,theory(equality)])).
% cnf(189,plain,(addition(multiplication(X1,X2),multiplication(X3,multiplication(X4,X2)))=multiplication(addition(X1,multiplication(X3,X4)),X2)),inference(spm,[status(thm)],[26,22,theory(equality)])).
% cnf(244,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[60,128,theory(equality)])).
% cnf(249,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[128,34,theory(equality)])).
% cnf(251,plain,(addition(one,strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[128,76,theory(equality)])).
% cnf(259,plain,(addition(X1,addition(X2,X1))=addition(X2,X1)),inference(spm,[status(thm)],[128,39,theory(equality)])).
% cnf(288,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[244,39,theory(equality)])).
% cnf(389,plain,(leq(X1,addition(X2,addition(X3,X1)))),inference(spm,[status(thm)],[288,41,theory(equality)])).
% cnf(442,plain,(addition(multiplication(star(X1),X1),star(X1))=star(X1)),inference(spm,[status(thm)],[259,34,theory(equality)])).
% cnf(506,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[157,39,theory(equality)])).
% cnf(611,plain,(leq(X1,addition(X2,addition(X1,X3)))),inference(spm,[status(thm)],[389,39,theory(equality)])).
% cnf(671,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[187,39,theory(equality)])).
% cnf(673,plain,(multiplication(addition(X1,one),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[66,671,theory(equality)])).
% cnf(682,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[244,671,theory(equality)])).
% cnf(693,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(multiplication(X2,X3),one),X1)),inference(spm,[status(thm)],[671,22,theory(equality)])).
% cnf(717,plain,(multiplication(addition(one,X1),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[673,39,theory(equality)])).
% cnf(805,plain,(leq(one,addition(X1,star(X2)))),inference(spm,[status(thm)],[611,249,theory(equality)])).
% cnf(819,plain,(leq(X1,addition(X2,multiplication(X1,addition(X3,one))))),inference(spm,[status(thm)],[611,506,theory(equality)])).
% cnf(845,plain,(leq(one,multiplication(strong_iteration(X1),star(X2)))),inference(spm,[status(thm)],[37,805,theory(equality)])).
% cnf(851,plain,(leq(one,addition(star(X2),X1))),inference(spm,[status(thm)],[805,39,theory(equality)])).
% cnf(1056,plain,(leq(one,multiplication(star(X1),addition(X2,one)))),inference(spm,[status(thm)],[851,506,theory(equality)])).
% cnf(1382,plain,(addition(one,multiplication(strong_iteration(X1),star(X2)))=multiplication(strong_iteration(X1),star(X2))),inference(spm,[status(thm)],[61,845,theory(equality)])).
% cnf(1575,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[89,45,theory(equality)])).
% cnf(1589,plain,(leq(multiplication(X1,star(one)),X1)|$false),inference(rw,[status(thm)],[1575,84,theory(equality)])).
% cnf(1590,plain,(leq(multiplication(X1,star(one)),X1)),inference(cn,[status(thm)],[1589,theory(equality)])).
% cnf(1593,plain,(leq(star(one),one)),inference(spm,[status(thm)],[1590,49,theory(equality)])).
% cnf(1602,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[61,1593,theory(equality)])).
% cnf(1603,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1602,39,theory(equality)]),249,theory(equality)])).
% cnf(1988,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[91,22,theory(equality)])).
% cnf(2408,plain,(leq(one,multiplication(star(X1),addition(one,X2)))),inference(spm,[status(thm)],[1056,39,theory(equality)])).
% cnf(3319,plain,(multiplication(strong_iteration(X1),star(strong_iteration(X1)))=star(strong_iteration(X1))),inference(spm,[status(thm)],[32,1382,theory(equality)])).
% cnf(3356,plain,(addition(one,multiplication(star(X1),addition(one,X2)))=multiplication(star(X1),addition(one,X2))),inference(spm,[status(thm)],[61,2408,theory(equality)])).
% cnf(5209,plain,(multiplication(star(X1),addition(X1,one))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[442,39,theory(equality)]),506,theory(equality)])).
% cnf(5221,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(spm,[status(thm)],[671,5209,theory(equality)])).
% cnf(5248,plain,(addition(X1,star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5221,41,theory(equality)]),249,theory(equality)])).
% cnf(5249,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[5248,39,theory(equality)]),249,theory(equality)]),5209,theory(equality)])).
% cnf(5317,plain,(leq(X1,addition(X2,star(X1)))),inference(spm,[status(thm)],[611,5249,theory(equality)])).
% cnf(5724,plain,(addition(one,multiplication(addition(one,X1),multiplication(zero,star(multiplication(X1,zero)))))=star(multiplication(X1,zero))),inference(spm,[status(thm)],[103,717,theory(equality)])).
% cnf(5771,plain,(addition(one,multiplication(X1,zero))=star(multiplication(X1,zero))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5724,51,theory(equality)]),717,theory(equality)])).
% cnf(5816,plain,(leq(X1,addition(star(X1),X2))),inference(spm,[status(thm)],[5317,39,theory(equality)])).
% cnf(5893,plain,(leq(X1,multiplication(star(X1),addition(X2,one)))),inference(spm,[status(thm)],[5816,506,theory(equality)])).
% cnf(10109,plain,(addition(one,multiplication(X1,star(X1)))=addition(star(X1),multiplication(X1,star(X1)))),inference(spm,[status(thm)],[125,45,theory(equality)])).
% cnf(10110,plain,(addition(one,addition(X2,multiplication(X1,star(X1))))=addition(star(X1),X2)),inference(spm,[status(thm)],[125,39,theory(equality)])).
% cnf(10113,plain,(addition(one,multiplication(addition(X1,X2),star(X1)))=addition(star(X1),multiplication(X2,star(X1)))),inference(spm,[status(thm)],[125,26,theory(equality)])).
% cnf(10177,plain,(star(X1)=addition(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[10109,32,theory(equality)])).
% cnf(10178,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[10177,671,theory(equality)])).
% cnf(10179,plain,(addition(one,multiplication(addition(X1,X2),star(X1)))=multiplication(addition(X2,one),star(X1))),inference(rw,[status(thm)],[10113,671,theory(equality)])).
% cnf(10194,plain,(addition(multiplication(X1,star(X2)),star(X2))=multiplication(addition(X1,addition(X2,one)),star(X2))),inference(spm,[status(thm)],[26,10178,theory(equality)])).
% cnf(10219,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[10178,39,theory(equality)])).
% cnf(10311,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[10219,249,theory(equality)])).
% cnf(10420,plain,(leq(X1,multiplication(star(X1),addition(one,X2)))),inference(spm,[status(thm)],[5893,39,theory(equality)])).
% cnf(11190,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1)))),inference(spm,[status(thm)],[126,45,theory(equality)])).
% cnf(11258,plain,(strong_iteration(X1)=addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1)))),inference(rw,[status(thm)],[11190,76,theory(equality)])).
% cnf(11259,plain,(strong_iteration(X1)=multiplication(addition(X1,one),strong_iteration(X1))),inference(rw,[status(thm)],[11258,671,theory(equality)])).
% cnf(19143,plain,(leq(X1,multiplication(star(X1),star(X2)))),inference(spm,[status(thm)],[10420,249,theory(equality)])).
% cnf(19195,plain,(addition(X1,multiplication(star(X1),star(X2)))=multiplication(star(X1),star(X2))),inference(spm,[status(thm)],[61,19143,theory(equality)])).
% cnf(25822,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[165,5209,theory(equality)])).
% cnf(25871,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[25822,49,theory(equality)])).
% cnf(25872,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[25871,84,theory(equality)])).
% cnf(25873,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[25872,theory(equality)])).
% cnf(27366,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[1988,25873,theory(equality)])).
% cnf(27387,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[27366,10311,theory(equality)]),10311,theory(equality)])).
% cnf(27397,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[61,27387,theory(equality)])).
% cnf(27462,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[27397,39,theory(equality)]),5249,theory(equality)])).
% cnf(30359,plain,(leq(multiplication(star(X1),multiplication(one,strong_iteration(X1))),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(spm,[status(thm)],[185,11259,theory(equality)])).
% cnf(30450,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[30359,49,theory(equality)])).
% cnf(30451,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))|$false),inference(rw,[status(thm)],[30450,84,theory(equality)])).
% cnf(30452,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))),inference(cn,[status(thm)],[30451,theory(equality)])).
% cnf(30466,plain,(addition(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[61,30452,theory(equality)])).
% cnf(31785,plain,(addition(multiplication(X1,X2),multiplication(X3,zero))=multiplication(addition(X1,multiplication(X3,zero)),X2)),inference(spm,[status(thm)],[189,51,theory(equality)])).
% cnf(48003,plain,(leq(X1,addition(X2,multiplication(X1,addition(one,X3))))),inference(spm,[status(thm)],[819,39,theory(equality)])).
% cnf(91281,plain,(addition(X1,multiplication(X2,zero))=multiplication(addition(one,multiplication(X2,zero)),X1)),inference(spm,[status(thm)],[31785,49,theory(equality)])).
% cnf(106397,plain,(leq(X1,addition(X2,multiplication(X1,multiplication(star(one),star(X3)))))),inference(spm,[status(thm)],[48003,19195,theory(equality)])).
% cnf(106494,plain,(leq(X1,addition(X2,multiplication(X1,star(X3))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[106397,1603,theory(equality)]),49,theory(equality)])).
% cnf(106590,plain,(leq(X1,addition(multiplication(X1,star(X3)),X2))),inference(spm,[status(thm)],[106494,39,theory(equality)])).
% cnf(108018,plain,(leq(X1,star(multiplication(X1,star(X2))))),inference(spm,[status(thm)],[106590,5249,theory(equality)])).
% cnf(108098,plain,(addition(X1,star(multiplication(X1,star(X2))))=star(multiplication(X1,star(X2)))),inference(spm,[status(thm)],[61,108018,theory(equality)])).
% cnf(109624,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(one,multiplication(X2,X3)),X1)),inference(rw,[status(thm)],[693,39,theory(equality)])).
% cnf(109915,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(multiplication(X2,X1),one))),inference(spm,[status(thm)],[506,109624,theory(equality)])).
% cnf(139146,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(one,multiplication(X2,X1)))),inference(rw,[status(thm)],[109915,39,theory(equality)])).
% cnf(210659,plain,(addition(one,multiplication(addition(X1,X2),star(X2)))=addition(star(X2),multiplication(X1,star(X2)))),inference(spm,[status(thm)],[10110,26,theory(equality)])).
% cnf(210939,plain,(addition(one,multiplication(addition(X1,X2),star(X2)))=multiplication(addition(X1,one),star(X2))),inference(rw,[status(thm)],[210659,671,theory(equality)])).
% cnf(216674,plain,(leq(star(X1),multiplication(strong_iteration(addition(X1,X2)),one))|~leq(star(X1),multiplication(addition(X2,one),star(X1)))),inference(spm,[status(thm)],[142,10179,theory(equality)])).
% cnf(217089,plain,(leq(star(X1),strong_iteration(addition(X1,X2)))|~leq(star(X1),multiplication(addition(X2,one),star(X1)))),inference(rw,[status(thm)],[216674,47,theory(equality)])).
% cnf(217090,plain,(leq(star(X1),strong_iteration(addition(X1,X2)))|$false),inference(rw,[status(thm)],[217089,682,theory(equality)])).
% cnf(217091,plain,(leq(star(X1),strong_iteration(addition(X1,X2)))),inference(cn,[status(thm)],[217090,theory(equality)])).
% cnf(217801,plain,(leq(star(X1),strong_iteration(multiplication(addition(X2,one),X1)))),inference(spm,[status(thm)],[217091,671,theory(equality)])).
% cnf(244815,plain,(multiplication(addition(X1,one),star(X2))=multiplication(addition(X1,addition(X2,one)),star(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[10194,39,theory(equality)]),671,theory(equality)])).
% cnf(245002,plain,(multiplication(addition(strong_iteration(X1),one),star(multiplication(strong_iteration(X1),zero)))=multiplication(addition(star(X1),one),star(multiplication(strong_iteration(X1),zero)))),inference(spm,[status(thm)],[244815,145,theory(equality)])).
% cnf(245223,plain,(multiplication(strong_iteration(X1),addition(one,multiplication(strong_iteration(X1),zero)))=multiplication(addition(star(X1),one),star(multiplication(strong_iteration(X1),zero)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[245002,39,theory(equality)]),251,theory(equality)]),5771,theory(equality)])).
% cnf(245224,plain,(multiplication(strong_iteration(X1),addition(one,multiplication(strong_iteration(X1),zero)))=multiplication(star(X1),addition(one,multiplication(strong_iteration(X1),zero)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[245223,39,theory(equality)]),249,theory(equality)]),5771,theory(equality)])).
% cnf(273128,plain,(leq(star(X1),strong_iteration(multiplication(addition(one,X2),X1)))),inference(spm,[status(thm)],[217801,39,theory(equality)])).
% cnf(337531,plain,(leq(star(X1),strong_iteration(multiplication(star(multiplication(one,star(X2))),X1)))),inference(spm,[status(thm)],[273128,108098,theory(equality)])).
% cnf(337722,plain,(leq(star(X1),strong_iteration(multiplication(star(X2),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[337531,49,theory(equality)]),27462,theory(equality)])).
% cnf(337878,plain,(addition(star(X1),strong_iteration(multiplication(star(X2),X1)))=strong_iteration(multiplication(star(X2),X1))),inference(spm,[status(thm)],[61,337722,theory(equality)])).
% cnf(338021,plain,(multiplication(star(X1),strong_iteration(X1))=strong_iteration(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[30466,39,theory(equality)]),671,theory(equality)]),39,theory(equality)]),249,theory(equality)])).
% cnf(714075,plain,(multiplication(addition(one,multiplication(star(X1),addition(one,multiplication(strong_iteration(X1),zero)))),strong_iteration(X1))=multiplication(strong_iteration(X1),addition(one,multiplication(addition(one,multiplication(strong_iteration(X1),zero)),strong_iteration(X1))))),inference(spm,[status(thm)],[139146,245224,theory(equality)])).
% cnf(714429,plain,(strong_iteration(X1)=multiplication(strong_iteration(X1),addition(one,multiplication(addition(one,multiplication(strong_iteration(X1),zero)),strong_iteration(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[714075,3356,theory(equality)]),22,theory(equality)]),91281,theory(equality)]),506,theory(equality)]),66,theory(equality)]),47,theory(equality)]),338021,theory(equality)])).
% cnf(714430,plain,(strong_iteration(X1)=multiplication(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[714429,91281,theory(equality)]),506,theory(equality)]),66,theory(equality)]),47,theory(equality)]),251,theory(equality)])).
% cnf(714834,plain,(leq(multiplication(strong_iteration(X1),multiplication(strong_iteration(X1),star(strong_iteration(X1)))),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(spm,[status(thm)],[1988,714430,theory(equality)])).
% cnf(715265,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[714834,3319,theory(equality)]),3319,theory(equality)])).
% cnf(715266,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))|$false),inference(rw,[status(thm)],[715265,84,theory(equality)])).
% cnf(715267,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))),inference(cn,[status(thm)],[715266,theory(equality)])).
% cnf(715725,plain,(addition(star(strong_iteration(X1)),strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[61,715267,theory(equality)])).
% cnf(715849,plain,(star(strong_iteration(X1))=strong_iteration(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[715725,39,theory(equality)]),5249,theory(equality)])).
% cnf(910786,plain,(addition(one,multiplication(strong_iteration(multiplication(star(X2),X1)),star(strong_iteration(multiplication(star(X2),X1)))))=multiplication(addition(star(X1),one),star(strong_iteration(multiplication(star(X2),X1))))),inference(spm,[status(thm)],[210939,337878,theory(equality)])).
% cnf(911555,plain,(strong_iteration(multiplication(star(X2),X1))=multiplication(addition(star(X1),one),star(strong_iteration(multiplication(star(X2),X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[910786,3319,theory(equality)]),715849,theory(equality)]),251,theory(equality)])).
% cnf(911556,plain,(strong_iteration(multiplication(star(X2),X1))=multiplication(star(X1),strong_iteration(multiplication(star(X2),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[911555,39,theory(equality)]),249,theory(equality)]),715849,theory(equality)])).
% cnf(1227422,negated_conjecture,($false),inference(rw,[status(thm)],[65,911556,theory(equality)])).
% cnf(1227423,negated_conjecture,($false),inference(cn,[status(thm)],[1227422,theory(equality)])).
% cnf(1227424,negated_conjecture,($false),1227423,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18377
% # ...of these trivial : 5906
% # ...subsumed : 9551
% # ...remaining for further processing: 2920
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 559
% # Generated clauses : 620294
% # ...of the previous two non-trivial : 254022
% # Contextual simplify-reflections : 0
% # Paramodulations : 620292
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 2350
% # Positive orientable unit clauses: 1832
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 0
% # Non-unit-clauses : 509
% # Current number of unprocessed clauses: 204540
% # ...number of literals in the above : 280243
% # Clause-clause subsumption calls (NU) : 51355
% # Rec. Clause-clause subsumption calls : 51355
% # Unit Clause-clause subsumption calls : 1665
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 23851
% # Indexed BW rewrite successes : 392
% # Backwards rewriting index: 1005 leaves, 3.69+/-4.822 terms/leaf
% # Paramod-from index: 586 leaves, 3.15+/-5.193 terms/leaf
% # Paramod-into index: 881 leaves, 3.68+/-4.942 terms/leaf
% # -------------------------------------------------
% # User time : 15.104 s
% # System time : 0.662 s
% # Total time : 15.766 s
% # Maximum resident set size: 0 pages
% PrfWatch: 30.35 CPU 30.76 WC
% FINAL PrfWatch: 30.35 CPU 30.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP18106/KLE147+1.tptp
%
%------------------------------------------------------------------------------