136.53/45.67
136.53/45.67
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
active(and(tt, X)) → mark(X)
136.53/45.67
active(plus(N, 0)) → mark(N)
136.53/45.67
active(plus(N, s(M))) → mark(s(plus(N, M)))
136.53/45.67
active(and(X1, X2)) → and(active(X1), X2)
136.53/45.67
active(plus(X1, X2)) → plus(active(X1), X2)
136.53/45.67
active(plus(X1, X2)) → plus(X1, active(X2))
136.53/45.67
active(s(X)) → s(active(X))
136.53/45.67
and(mark(X1), X2) → mark(and(X1, X2))
136.53/45.67
plus(mark(X1), X2) → mark(plus(X1, X2))
136.53/45.67
plus(X1, mark(X2)) → mark(plus(X1, X2))
136.53/45.67
s(mark(X)) → mark(s(X))
136.53/45.67
proper(and(X1, X2)) → and(proper(X1), proper(X2))
136.53/45.67
proper(tt) → ok(tt)
136.53/45.67
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
136.53/45.67
proper(0) → ok(0)
136.53/45.67
proper(s(X)) → s(proper(X))
136.53/45.67
and(ok(X1), ok(X2)) → ok(and(X1, X2))
136.53/45.67
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
136.53/45.67
s(ok(X)) → ok(s(X))
136.53/45.67
top(mark(X)) → top(proper(X))
136.53/45.67
top(ok(X)) → top(active(X))
Rewrite Strategy: INNERMOST
136.53/45.67
136.53/45.67
(1) CpxTrsMatchBoundsTAProof (EQUIVALENT transformation)
A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2.
The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by:
final states : [1, 2, 3, 4, 5, 6]
transitions:
tt0() → 0
mark0(0) → 0
00() → 0
ok0(0) → 0
active0(0) → 1
and0(0, 0) → 2
plus0(0, 0) → 3
s0(0) → 4
proper0(0) → 5
top0(0) → 6
and1(0, 0) → 7
mark1(7) → 2
plus1(0, 0) → 8
mark1(8) → 3
s1(0) → 9
mark1(9) → 4
tt1() → 10
ok1(10) → 5
01() → 11
ok1(11) → 5
and1(0, 0) → 12
ok1(12) → 2
plus1(0, 0) → 13
ok1(13) → 3
s1(0) → 14
ok1(14) → 4
proper1(0) → 15
top1(15) → 6
active1(0) → 16
top1(16) → 6
mark1(7) → 7
mark1(7) → 12
mark1(8) → 8
mark1(8) → 13
mark1(9) → 9
mark1(9) → 14
ok1(10) → 15
ok1(11) → 15
ok1(12) → 7
ok1(12) → 12
ok1(13) → 8
ok1(13) → 13
ok1(14) → 9
ok1(14) → 14
active2(10) → 17
top2(17) → 6
active2(11) → 17
136.53/45.67
136.53/45.67
(2) BOUNDS(O(1), O(n^1))
136.53/45.67