YES (ignored inputs)COMMENT R7 of \cite{AT2012} Rewrite Rules: [ +(?x,0) -> ?x, +(?x,s(?y)) -> s(+(?x,?y)), +(0,?y) -> ?y, +(s(?x),?y) -> s(+(?x,?y)), dbl(?x) -> +(?x,?x), +(+(?x,?y),?z) -> +(?x,+(?y,?z)), +(?x,?y) -> +(?y,?x), s(?x) -> s(s(?x)), s(s(?x)) -> s(?x) ] Apply Direct Methods... Inner CPs: [ +(?x_1,s(s(?x_7))) = s(+(?x_1,?x_7)), +(?x_1,s(?x_8)) = s(+(?x_1,s(?x_8))), +(s(s(?x_7)),?y_3) = s(+(?x_7,?y_3)), +(s(?x_8),?y_3) = s(+(s(?x_8),?y_3)), +(?x,?z_5) = +(?x,+(0,?z_5)), +(s(+(?x_1,?y_1)),?z_5) = +(?x_1,+(s(?y_1),?z_5)), +(?y_2,?z_5) = +(0,+(?y_2,?z_5)), +(s(+(?x_3,?y_3)),?z_5) = +(s(?x_3),+(?y_3,?z_5)), +(+(?y_6,?x_6),?z_5) = +(?x_6,+(?y_6,?z_5)), s(s(s(?x_7))) = s(?x_7), +(+(?x,+(?y,?z)),?z_1) = +(+(?x,?y),+(?z,?z_1)), s(s(?x)) = s(s(?x)) ] Outer CPs: [ 0 = 0, s(?x_3) = s(+(?x_3,0)), +(?x_5,?y_5) = +(?x_5,+(?y_5,0)), ?x = +(0,?x), s(+(0,?y_1)) = s(?y_1), s(+(s(?x_3),?y_1)) = s(+(?x_3,s(?y_1))), s(+(+(?x_5,?y_5),?y_1)) = +(?x_5,+(?y_5,s(?y_1))), s(+(?x_1,?y_1)) = +(s(?y_1),?x_1), ?y_2 = +(?y_2,0), s(+(?x_3,?y_3)) = +(?y_3,s(?x_3)), +(?x_5,+(?y_5,?z_5)) = +(?z_5,+(?x_5,?y_5)), s(s(s(?x_8))) = s(?x_8) ] not Overlay, check Termination... unknown/not Terminating unknown Knuth & Bendix Left-Linear, not Right-Linear unknown Development Closed unknown Weakly-Non-Overlapping & Non-Collapsing & Shallow unknown Upside-Parallel-Closed/Outside-Closed (inner) Parallel CPs: (not computed) unknown Toyama (Parallel CPs) Simultaneous CPs: [ 0 = 0, s(+(?x_3,0)) = s(?x_3), +(?x_5,+(?y_5,0)) = +(?x_5,?y_5), +(0,?x) = ?x, +(?x,+(0,?z_6)) = +(?x,?z_6), s(s(?y)) = s(+(0,?y)), s(?x_9) = s(+(0,s(?x_9))), s(+(?x_3,s(s(?y)))) = s(+(s(?x_3),?y)), s(+(?x_3,s(?x_12))) = s(+(s(?x_3),s(?x_12))), +(?x_5,+(?y_5,s(s(?y)))) = s(+(+(?x_5,?y_5),?y)), +(?x_5,+(?y_5,s(?x_14))) = s(+(+(?x_5,?y_5),s(?x_14))), +(s(s(?y)),?x) = s(+(?x,?y)), +(s(?x_9),?x) = s(+(?x,s(?x_9))), s(?y) = s(+(0,?y)), s(+(?x_3,s(?y))) = s(+(s(?x_3),?y)), +(?x_5,+(?y_5,s(?y))) = s(+(+(?x_5,?y_5),?y)), +(s(?y),?x) = s(+(?x,?y)), +(?x,s(s(?y))) = s(+(?x,?y)), +(?x,s(?x_9)) = s(+(?x,s(?x_9))), +(?x,+(s(s(?y)),?z_6)) = +(s(+(?x,?y)),?z_6), +(?x,+(s(?x_15),?z_6)) = +(s(+(?x,s(?x_15))),?z_6), +(?x,+(s(?y),?z_6)) = +(s(+(?x,?y)),?z_6), s(+(0,?y_2)) = s(?y_2), +(?y,0) = ?y, +(0,+(?y,?z_6)) = +(?y,?z_6), s(s(?x)) = s(+(?x,0)), s(?x_9) = s(+(s(?x_9),0)), s(+(s(s(?x)),?y_2)) = s(+(?x,s(?y_2))), s(+(s(?x_11),?y_2)) = s(+(s(?x_11),s(?y_2))), +(?y,s(s(?x))) = s(+(?x,?y)), +(?y,s(?x_9)) = s(+(s(?x_9),?y)), s(?x) = s(+(?x,0)), s(+(s(?x),?y_2)) = s(+(?x,s(?y_2))), +(?y,s(?x)) = s(+(?x,?y)), +(s(s(?x)),?y) = s(+(?x,?y)), +(s(?x_9),?y) = s(+(s(?x_9),?y)), +(s(s(?x)),+(?y,?z_6)) = +(s(+(?x,?y)),?z_6), +(s(?x_15),+(?y,?z_6)) = +(s(+(s(?x_15),?y)),?z_6), +(s(?x),+(?y,?z_6)) = +(s(+(?x,?y)),?z_6), +(?x_1,+(?y_1,?y)) = +(+(?x_1,?y_1),+(?y,0)), ?x = +(?x,+(0,0)), s(+(?x,?y_3)) = +(?x,+(s(?y_3),0)), ?y = +(0,+(?y,0)), s(+(?x_5,?y)) = +(s(?x_5),+(?y,0)), +(?y,?x) = +(?x,+(?y,0)), s(+(+(?x_3,+(?y_3,?y)),?y_2)) = +(+(?x_3,?y_3),+(?y,s(?y_2))), s(+(?x,?y_2)) = +(?x,+(0,s(?y_2))), s(+(s(+(?x,?y_5)),?y_2)) = +(?x,+(s(?y_5),s(?y_2))), s(+(?y,?y_2)) = +(0,+(?y,s(?y_2))), s(+(s(+(?x_7,?y)),?y_2)) = +(s(?x_7),+(?y,s(?y_2))), s(+(+(?y,?x),?y_2)) = +(?x,+(?y,s(?y_2))), +(?z,+(?x_1,+(?y_1,?y))) = +(+(?x_1,?y_1),+(?y,?z)), +(?z,?x) = +(?x,+(0,?z)), +(?z,s(+(?x,?y_3))) = +(?x,+(s(?y_3),?z)), +(?z,?y) = +(0,+(?y,?z)), +(?z,s(+(?x_5,?y))) = +(s(?x_5),+(?y,?z)), +(?z,+(?y,?x)) = +(?x,+(?y,?z)), +(?x,?y) = +(?x,+(?y,0)), s(+(+(?x,?y),?y_2)) = +(?x,+(?y,s(?y_2))), +(?z,+(?x,?y)) = +(?x,+(?y,?z)), +(+(?x_1,+(?y_1,?y)),?z) = +(+(?x_1,?y_1),+(?y,?z)), +(?x,?z) = +(?x,+(0,?z)), +(s(+(?x,?y_3)),?z) = +(?x,+(s(?y_3),?z)), +(?y,?z) = +(0,+(?y,?z)), +(s(+(?x_5,?y)),?z) = +(s(?x_5),+(?y,?z)), +(+(?y,?x),?z) = +(?x,+(?y,?z)), +(+(?x_2,+(?y_2,?y)),+(?z,?z_1)) = +(+(+(?x_2,?y_2),+(?y,?z)),?z_1), +(?x,+(?z,?z_1)) = +(+(?x,+(0,?z)),?z_1), +(s(+(?x,?y_4)),+(?z,?z_1)) = +(+(?x,+(s(?y_4),?z)),?z_1), +(?y,+(?z,?z_1)) = +(+(0,+(?y,?z)),?z_1), +(s(+(?x_6,?y)),+(?z,?z_1)) = +(+(s(?x_6),+(?y,?z)),?z_1), +(+(?y,?x),+(?z,?z_1)) = +(+(?x,+(?y,?z)),?z_1), +(+(?x,?y),+(?z,?z_1)) = +(+(?x,+(?y,?z)),?z_1), ?x = +(0,?x), s(+(?x,?y_2)) = +(s(?y_2),?x), ?y = +(?y,0), s(+(?x_4,?y)) = +(?y,s(?x_4)), +(?x_6,+(?y_6,?y)) = +(?y,+(?x_6,?y_6)), +(?x,+(?y,?z_7)) = +(+(?y,?x),?z_7), s(?x_8) = s(s(s(?x_8))), s(+(?x_3,?x)) = +(?x_3,s(s(?x))), s(+(?x,?y_5)) = +(s(s(?x)),?y_5), s(s(s(?x_1))) = s(s(?x_1)), s(s(s(s(?x)))) = s(?x), s(s(s(?x))) = s(?x), s(s(?x_1)) = s(s(?x_1)), s(s(?x_1)) = s(s(s(?x_1))), s(+(?x_3,s(?x_4))) = +(?x_3,s(s(?x_4))), s(+(?x_3,s(s(?x)))) = +(?x_3,s(?x)), s(+(s(?x_6),?y_5)) = +(s(s(?x_6)),?y_5), s(+(s(s(?x)),?y_5)) = +(s(?x),?y_5), s(+(?x_3,s(?x))) = +(?x_3,s(?x)), s(+(s(?x),?y_5)) = +(s(?x),?y_5) ] unknown Okui (Simultaneous CPs) unknown Strongly Depth-Preserving & Root-E-Closed/Non-E-Overlapping unknown Strongly Weight-Preserving & Root-E-Closed/Non-E-Overlapping check Locally Decreasing Diagrams by Rule Labelling... Critical Pair <+(?x_1,s(s(?x_7))), s(+(?x_1,?x_7))> by Rules <7, 1> preceded by [(+,2)] joinable by a reduction of rules <[([(+,2)],8),([],1)], []> joinable by a reduction of rules <[([],1),([(s,1)],1)], [([],7)]> Critical Pair <+(?x_1,s(?x_8)), s(+(?x_1,s(?x_8)))> by Rules <8, 1> preceded by [(+,2)] joinable by a reduction of rules <[([(+,2)],7),([],1)], []> joinable by a reduction of rules <[([],1),([],7)], [([(s,1)],1)]> joinable by a reduction of rules <[([],1)], [([(s,1)],1),([],8)]> Critical Pair <+(s(s(?x_7)),?y_3), s(+(?x_7,?y_3))> by Rules <7, 3> preceded by [(+,1)] joinable by a reduction of rules <[([(+,1)],8),([],3)], []> joinable by a reduction of rules <[([],3),([(s,1)],3)], [([],7)]> Critical Pair <+(s(?x_8),?y_3), s(+(s(?x_8),?y_3))> by Rules <8, 3> preceded by [(+,1)] joinable by a reduction of rules <[([(+,1)],7),([],3)], []> joinable by a reduction of rules <[([],3),([],7)], [([(s,1)],3)]> joinable by a reduction of rules <[([],3)], [([(s,1)],3),([],8)]> Critical Pair <+(?x,?z_5), +(?x,+(0,?z_5))> by Rules <0, 5> preceded by [(+,1)] joinable by a reduction of rules <[], [([(+,2)],2)]> Critical Pair <+(s(+(?x_1,?y_1)),?z_5), +(?x_1,+(s(?y_1),?z_5))> by Rules <1, 5> preceded by [(+,1)] joinable by a reduction of rules <[([],3),([(s,1)],5)], [([(+,2)],3),([],1)]> Critical Pair <+(?y_2,?z_5), +(0,+(?y_2,?z_5))> by Rules <2, 5> preceded by [(+,1)] joinable by a reduction of rules <[], [([],2)]> Critical Pair <+(s(+(?x_3,?y_3)),?z_5), +(s(?x_3),+(?y_3,?z_5))> by Rules <3, 5> preceded by [(+,1)] joinable by a reduction of rules <[([],3),([(s,1)],5)], [([],3)]> Critical Pair <+(+(?y_6,?x_6),?z_5), +(?x_6,+(?y_6,?z_5))> by Rules <6, 5> preceded by [(+,1)] joinable by a reduction of rules <[([(+,1)],6),([],5)], []> joinable by a reduction of rules <[([],5),([(+,2)],6)], [([],6),([],5)]> Critical Pair by Rules <7, 8> preceded by [(s,1)] joinable by a reduction of rules <[([(s,1)],8)], [([],7)]> joinable by a reduction of rules <[([],8)], [([],7)]> Critical Pair <+(+(?x,+(?y,?z)),?z_1), +(+(?x,?y),+(?z,?z_1))> by Rules <5, 5> preceded by [(+,1)] joinable by a reduction of rules <[([],5),([(+,2)],5)], [([],5)]> Critical Pair by Rules <8, 8> preceded by [(s,1)] joinable by a reduction of rules <[], []> Critical Pair <0, 0> by Rules <2, 0> preceded by [] joinable by a reduction of rules <[], []> Critical Pair by Rules <3, 0> preceded by [] joinable by a reduction of rules <[([(s,1)],0)], []> Critical Pair <+(?x_5,+(?y_5,0)), +(?x_5,?y_5)> by Rules <5, 0> preceded by [] joinable by a reduction of rules <[([(+,2)],0)], []> Critical Pair <+(0,?x_6), ?x_6> by Rules <6, 0> preceded by [] joinable by a reduction of rules <[([],2)], []> Critical Pair by Rules <2, 1> preceded by [] joinable by a reduction of rules <[], [([(s,1)],2)]> Critical Pair by Rules <3, 1> preceded by [] joinable by a reduction of rules <[([(s,1)],1)], [([(s,1)],3)]> Critical Pair <+(?x_5,+(?y_5,s(?y_1))), s(+(+(?x_5,?y_5),?y_1))> by Rules <5, 1> preceded by [] joinable by a reduction of rules <[([(+,2)],1),([],1)], [([(s,1)],5)]> Critical Pair <+(s(?y_1),?x_6), s(+(?x_6,?y_1))> by Rules <6, 1> preceded by [] joinable by a reduction of rules <[([],3)], [([(s,1)],6)]> Critical Pair <+(?y_6,0), ?y_6> by Rules <6, 2> preceded by [] joinable by a reduction of rules <[([],0)], []> Critical Pair <+(?y_6,s(?x_3)), s(+(?x_3,?y_6))> by Rules <6, 3> preceded by [] joinable by a reduction of rules <[([],1)], [([(s,1)],6)]> Critical Pair <+(?y_6,+(?x_5,?y_5)), +(?x_5,+(?y_5,?y_6))> by Rules <6, 5> preceded by [] joinable by a reduction of rules <[([],6),([],5)], []> Critical Pair by Rules <8, 7> preceded by [] joinable by a reduction of rules <[([],7)], [([(s,1)],8)]> joinable by a reduction of rules <[([],7)], [([],8)]> unknown Diagram Decreasing [ +(?x,0) -> ?x, +(?x_1,s(?y_1)) -> s(+(?x_1,?y_1)), +(0,?y_2) -> ?y_2, +(s(?x_3),?y_3) -> s(+(?x_3,?y_3)), dbl(?x_4) -> +(?x_4,?x_4), +(+(?x_5,?y_5),?z_5) -> +(?x_5,+(?y_5,?z_5)), +(?x_6,?y_6) -> +(?y_6,?x_6), s(?x_7) -> s(s(?x_7)), s(s(?x_8)) -> s(?x_8) ] Sort Assignment: + : 23*23=>23 0 : =>23 s : 23=>23 dbl : 23=>23 non-linear variables: {?x_4} non-linear types: {23} types leq non-linear types: {23} rules applicable to terms of non-linear types: [ +(?x,0) -> ?x, +(?x_1,s(?y_1)) -> s(+(?x_1,?y_1)), +(0,?y_2) -> ?y_2, +(s(?x_3),?y_3) -> s(+(?x_3,?y_3)), dbl(?x_4) -> +(?x_4,?x_4), +(+(?x_5,?y_5),?z_5) -> +(?x_5,+(?y_5,?z_5)), +(?x_6,?y_6) -> +(?y_6,?x_6), s(?x_7) -> s(s(?x_7)), s(s(?x_8)) -> s(?x_8) ] NLR: 0: {} 1: {} 2: {} 3: {} 4: {0,1,2,3,4,5,6,7,8} 5: {} 6: {} 7: {} 8: {} unknown innermost-termination for terms of non-linear types unknown Quasi-Linear & Linearized-Decreasing [ +(?x,0) -> ?x, +(?x_1,s(?y_1)) -> s(+(?x_1,?y_1)), +(0,?y_2) -> ?y_2, +(s(?x_3),?y_3) -> s(+(?x_3,?y_3)), dbl(?x_4) -> +(?x_4,?x_4), +(+(?x_5,?y_5),?z_5) -> +(?x_5,+(?y_5,?z_5)), +(?x_6,?y_6) -> +(?y_6,?x_6), s(?x_7) -> s(s(?x_7)), s(s(?x_8)) -> s(?x_8) ] Sort Assignment: + : 23*23=>23 0 : =>23 s : 23=>23 dbl : 23=>23 non-linear variables: {?x_4} non-linear types: {23} types leq non-linear types: {23} rules applicable to terms of non-linear types: [ +(?x,0) -> ?x, +(?x_1,s(?y_1)) -> s(+(?x_1,?y_1)), +(0,?y_2) -> ?y_2, +(s(?x_3),?y_3) -> s(+(?x_3,?y_3)), dbl(?x_4) -> +(?x_4,?x_4), +(+(?x_5,?y_5),?z_5) -> +(?x_5,+(?y_5,?z_5)), +(?x_6,?y_6) -> +(?y_6,?x_6), s(?x_7) -> s(s(?x_7)), s(s(?x_8)) -> s(?x_8) ] unknown innermost-termination for terms of non-linear types unknown Strongly Quasi-Linear & Hierarchically Decreasing check Non-Confluence... obtain 19 rules by 3 steps unfolding strenghten dbl(0) and 0 strenghten +(?x_12,0) and ?x_12 strenghten +(0,?x_6) and ?x_6 strenghten +(0,0) and 0 strenghten s(s(?x_8)) and s(?x_8) strenghten dbl(+(0,0)) and 0 strenghten s(+(?x_3,0)) and s(?x_3) strenghten s(+(0,?y_1)) and s(?y_1) strenghten s(s(s(?x_7))) and s(?x_7) strenghten +(dbl(0),dbl(0)) and 0 strenghten s(+(?x_1,?x_9)) and +(?x_1,s(?x_9)) strenghten s(+(?x_3,?y_6)) and +(?y_6,s(?x_3)) strenghten s(+(?x_6,?y_1)) and +(s(?y_1),?x_6) strenghten s(+(?x_9,?y_3)) and +(s(?x_9),?y_3) strenghten +(?x,+(0,?z_5)) and +(?x,?z_5) strenghten +(?x_5,+(?y_5,0)) and +(?x_5,?y_5) strenghten +(0,+(?x_12,?z_5)) and +(?x_12,?z_5) strenghten +(?x_1,s(s(?x_7))) and s(+(?x_1,?x_7)) strenghten +(s(s(?x_7)),?y_3) and s(+(?x_7,?y_3)) strenghten s(+(?x_1,s(?x_8))) and +(?x_1,s(?x_8)) strenghten s(+(s(?x_8),?y_3)) and +(s(?x_8),?y_3) strenghten +(?x_5,+(?y_5,?y_6)) and +(?y_6,+(?x_5,?y_5)) obtain 100 candidates for checking non-joinability check by TCAP-Approximation (failure) check by Root-Approximation (failure) check by Ordering(rpo), check by Tree-Automata Approximation (failure) check by Interpretation(mod2) (failure) check by Descendants-Approximation, check by Ordering(poly) (failure) unknown Non-Confluence Check relative termination: [ +(?x,0) -> ?x, +(?x,s(?y)) -> s(+(?x,?y)), +(0,?y) -> ?y, +(s(?x),?y) -> s(+(?x,?y)), dbl(?x) -> +(?x,?x), s(?x) -> s(s(?x)), s(s(?x)) -> s(?x) ] [ +(+(?x,?y),?z) -> +(?x,+(?y,?z)), +(?x,?y) -> +(?y,?x) ] not relatively terminatiing unknown Huet (modulo AC) check by Reduction-Preserving Completion... STEP: 1 (parallel) S: [ +(?x,0) -> ?x, +(?x,s(?y)) -> s(+(?x,?y)), +(0,?y) -> ?y, +(s(?x),?y) -> s(+(?x,?y)), dbl(?x) -> +(?x,?x) ] P: [ +(+(?x,?y),?z) -> +(?x,+(?y,?z)), +(?x,?y) -> +(?y,?x), s(?x) -> s(s(?x)), s(s(?x)) -> s(?x) ] S: terminating CP(S,S): <0, 0> --> <0, 0> => yes --> => yes --> => yes --> => yes PCP_in(symP,S): <+(?x,s(s(?x_5))), s(+(?x,?x_5))> --> => no <+(?x,s(?x_4)), s(+(?x,s(?x_4)))> --> => no <+(s(s(?x_5)),?y), s(+(?x_5,?y))> --> => no <+(s(?x_4),?y), s(+(s(?x_4),?y))> --> => no CP(S,symP): <+(?x_1,?y_1), +(?x_1,+(?y_1,0))> --> <+(?x_1,?y_1), +(?x_1,?y_1)> => yes <+(?x,?z_1), +(?x,+(0,?z_1))> --> <+(?x,?z_1), +(?x,?z_1)> => yes <+(?x_1,?x), +(+(?x_1,?x),0)> --> <+(?x_1,?x), +(?x_1,?x)> => yes --> => yes --> => yes <+(s(+(?x,?y)),?z_1), +(?x,+(s(?y),?z_1))> --> => yes <+(?x_1,s(+(?x,?y))), +(+(?x_1,?x),s(?y))> --> => yes --> => yes <+(?y,?z_1), +(0,+(?y,?z_1))> --> <+(?y,?z_1), +(?y,?z_1)> => yes <+(?y_1,?z_1), +(+(0,?y_1),?z_1)> --> <+(?y_1,?z_1), +(?y_1,?z_1)> => yes <+(?x_1,?y), +(+(?x_1,0),?y)> --> <+(?x_1,?y), +(?x_1,?y)> => yes --> => yes <+(s(+(?x,?y)),?z_1), +(s(?x),+(?y,?z_1))> --> => yes --> => yes <+(?x_1,s(+(?x,?y))), +(+(?x_1,s(?x)),?y)> --> => yes --> => yes check joinability condition: check modulo joinability of s(s(+(?x,?x_5))) and s(+(?x,?x_5)): joinable by {0} check modulo joinability of s(+(?x,?x_4)) and s(s(+(?x,?x_4))): joinable by {0} check modulo joinability of s(s(+(?x_5,?y))) and s(+(?x_5,?y)): joinable by {0} check modulo joinability of s(+(?x_4,?y)) and s(s(+(?x_4,?y))): joinable by {0} success P': [ s(s(?x)) -> s(?x) ] Check relative termination: [ +(?x,0) -> ?x, +(?x,s(?y)) -> s(+(?x,?y)), +(0,?y) -> ?y, +(s(?x),?y) -> s(+(?x,?y)), dbl(?x) -> +(?x,?x) ] [ s(s(?x)) -> s(?x) ] Polynomial Interpretation: +:= (1)*x1*x1+(2)*x1*x2+(2)*x2*x2 0:= (5) s:= (1)*x1 dbl:= (1)+(14)*x1+(11)*x1*x1 retract +(?x,0) -> ?x retract +(0,?y) -> ?y retract dbl(?x) -> +(?x,?x) Polynomial Interpretation: +:= (2)*x1+(1)*x2 0:= (8) s:= (1)+(1)*x1 dbl:= (8)+(8)*x1 retract +(?x,0) -> ?x retract +(0,?y) -> ?y retract +(s(?x),?y) -> s(+(?x,?y)) retract dbl(?x) -> +(?x,?x) retract s(s(?x)) -> s(?x) Polynomial Interpretation: +:= (2)*x1+(3)*x1*x2+(2)*x2 0:= (8) s:= (4)+(5)*x1 dbl:= (9)+(10)*x1+(2)*x1*x1 relatively terminating S/P': relatively terminating S: [ +(?x,0) -> ?x, +(?x,s(?y)) -> s(+(?x,?y)), +(0,?y) -> ?y, +(s(?x),?y) -> s(+(?x,?y)), dbl(?x) -> +(?x,?x) ] P: [ +(+(?x,?y),?z) -> +(?x,+(?y,?z)), +(?x,?y) -> +(?y,?x), s(?x) -> s(s(?x)), s(s(?x)) -> s(?x) ] Success Reduction-Preserving Completion Direct Methods: CR Final result: CR 120.trs: Success(CR) (3089 msec.)