0.00/0.13 YES 0.00/0.14 Input TRS: 0.00/0.14 1: a(c(a(x1))) -> b(a(c(x1))) 0.00/0.14 2: a(b(b(x1))) -> a(a(c(x1))) 0.00/0.14 3: b(a(c(x1))) -> c(c(a(x1))) 0.00/0.14 4: a(c(a(x1))) ->= a(c(c(x1))) 0.00/0.14 5: a(b(b(x1))) ->= a(b(b(x1))) 0.00/0.14 6: a(b(b(x1))) ->= a(b(a(x1))) 0.00/0.14 7: b(c(c(x1))) ->= c(b(c(x1))) 0.00/0.14 Removing trivial weak rule 5. 0.00/0.14 Number of strict rules: 3 0.00/0.14 Direct POLO(bPol) ... removes: 4 3 2 0.00/0.14 a w: x1 + 2 0.00/0.14 b w: x1 + 2 0.00/0.14 c w: x1 + 1 0.00/0.14 Number of strict rules: 1 0.00/0.14 Direct POLO(bPol) ... failed. 0.00/0.14 Uncurrying ... failed. 0.00/0.14 Dependency Pairs: 0.00/0.14 #1: #a(b(b(x1))) ->? #a(b(a(x1))) 0.00/0.14 #2: #a(b(b(x1))) ->? #a(x1) 0.00/0.14 #3: #a(c(a(x1))) -> #a(c(x1)) 0.00/0.14 Number of SCCs: 2, DPs: 3 0.00/0.14 SCC { #3 } 0.00/0.14 POLO(Sum)... succeeded. 0.00/0.14 a w: x1 + 1 0.00/0.14 b w: 0 0.00/0.14 c w: x1 + 1 0.00/0.14 #a w: x1 0.00/0.14 USABLE RULES: { } 0.00/0.14 Removed DPs: #3 0.00/0.14 Number of SCCs: 1, DPs: 2 0.00/0.14 SCC { #1 #2 } 0.00/0.14 POLO(Sum)... succeeded. 0.00/0.14 a w: x1 + 1 0.00/0.14 b w: x1 + 1 0.00/0.14 c w: x1 + 1 0.00/0.14 #a w: x1 0.00/0.14 USABLE RULES: { 1 6 7 } 0.00/0.14 Removed DPs: #2 0.00/0.14 Number of SCCs: 1, DPs: 1 0.00/0.14 SCC { #1 } 0.00/0.14 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded. 0.00/0.14 a w: x1 + [2;1] 0.00/0.14 b w: [0,1;0,1] * x1 + [1;2] 0.00/0.14 c w: [1,0;1,0] * x1 + [1;1] 0.00/0.14 #a w: [0,1;0,0] * x1 0.00/0.14 USABLE RULES: { 1 6 7 } 0.00/0.14 Removed DPs: #1 0.00/0.14 Number of SCCs: 0, DPs: 0 0.00/0.14 EOF