MAYBE Problem: a(b(x1)) -> b(c(a(x1))) b(c(x1)) -> c(b(b(x1))) c(a(x1)) -> a(c(x1)) Proof: Complexity Transformation Processor: strict: a(b(x1)) -> b(c(a(x1))) b(c(x1)) -> c(b(b(x1))) c(a(x1)) -> a(c(x1)) weak: Bounds Processor: bound: 2 enrichment: match automaton: final states: {3,2,1} transitions: b1(117) -> 118* b1(7) -> 8* b1(114) -> 115* b1(301) -> 302* b1(303) -> 304* b1(138) -> 139* b1(113) -> 114* c1(459) -> 460* c1(197) -> 198* c1(167) -> 168* c1(199) -> 200* c1(383) -> 384* c1(6) -> 7* c1(589) -> 590* c1(170) -> 171* c1(115) -> 116* a1(5) -> 6* a1(384) -> 385* a1(67) -> 68* a1(37) -> 38* a1(39) -> 40* a1(460) -> 461* a1(168) -> 169* a2(247) -> 248* a2(355) -> 356* a2(63) -> 64* a2(484) -> 485* a0(2) -> 1* a0(1) -> 1* a0(3) -> 1* c2(354) -> 355* c2(142) -> 143* c2(483) -> 484* c2(64) -> 65* c2(251) -> 252* c2(246) -> 247* c2(567) -> 568* c2(280) -> 281* c2(407) -> 408* c2(90) -> 91* b0(2) -> 2* b0(1) -> 2* b0(3) -> 2* b2(65) -> 66* b2(279) -> 280* b2(249) -> 250* b2(431) -> 432* b2(406) -> 407* b2(89) -> 90* b2(276) -> 277* b2(141) -> 142* b2(278) -> 279* b2(405) -> 406* b2(88) -> 89* b2(250) -> 251* b2(140) -> 141* b2(529) -> 530* c0(2) -> 3* c0(1) -> 3* c0(3) -> 3* 1 -> 3,117,37 2 -> 113,5 3 -> 138,39 5 -> 167* 6 -> 88* 7 -> 67,63 8 -> 6,1 37 -> 197* 38 -> 6* 39 -> 199* 40 -> 6* 63 -> 246* 64 -> 140* 66 -> 40,38 67 -> 170* 68 -> 6* 90 -> 301,276 91 -> 8* 115 -> 303,278 116 -> 139,2 118 -> 114* 139 -> 114* 142 -> 249* 143 -> 66* 168 -> 383,354 169 -> 198,200,7 171 -> 168* 198 -> 168* 200 -> 168* 248 -> 65* 251 -> 405* 252 -> 118,139,89 277 -> 250* 280 -> 431* 281 -> 115,114 302 -> 114* 304 -> 114* 356 -> 355,247 384 -> 483,459 385 -> 384,171 407 -> 529* 408 -> 530,407,432,406,251,280,277,302,304,279,115,90 432 -> 406* 460 -> 589,567 461 -> 590,460,384 485 -> 568,484,355 530 -> 406* 568 -> 484* 590 -> 460* problem: strict: b(c(x1)) -> c(b(b(x1))) c(a(x1)) -> a(c(x1)) weak: a(b(x1)) -> b(c(a(x1))) Open