(0) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, n^1).
The TRS R consists of the following rules:
active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Rewrite Strategy: INNERMOST
(1) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)
The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active
Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
(2) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, n^1).
The TRS R consists of the following rules:
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
top(ok(X)) → top(active(X))
proper(tt) → ok(tt)
x(mark(X1), X2) → mark(x(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
x(ok(X1), ok(X2)) → ok(x(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
s(ok(X)) → ok(s(X))
U31(ok(X)) → ok(U31(X))
U31(mark(X)) → mark(U31(X))
U11(mark(X1), X2) → mark(U11(X1, X2))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
x(X1, mark(X2)) → mark(x(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
proper(0) → ok(0)
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
top(mark(X)) → top(proper(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
Rewrite Strategy: INNERMOST
(3) 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, 7, 8, 9, 10, 11]
transitions:
ok0(0) → 0
active0(0) → 0
tt0() → 0
mark0(0) → 0
00() → 0
U110(0, 0) → 1
top0(0) → 2
proper0(0) → 3
x0(0, 0) → 4
and0(0, 0) → 5
isNat0(0) → 6
s0(0) → 7
U310(0) → 8
plus0(0, 0) → 9
U210(0, 0, 0) → 10
U410(0, 0, 0) → 11
U111(0, 0) → 12
ok1(12) → 1
active1(0) → 13
top1(13) → 2
tt1() → 14
ok1(14) → 3
x1(0, 0) → 15
mark1(15) → 4
and1(0, 0) → 16
mark1(16) → 5
isNat1(0) → 17
ok1(17) → 6
x1(0, 0) → 18
ok1(18) → 4
and1(0, 0) → 19
ok1(19) → 5
s1(0) → 20
ok1(20) → 7
U311(0) → 21
ok1(21) → 8
U311(0) → 22
mark1(22) → 8
U111(0, 0) → 23
mark1(23) → 1
s1(0) → 24
mark1(24) → 7
plus1(0, 0) → 25
mark1(25) → 9
U211(0, 0, 0) → 26
ok1(26) → 10
U411(0, 0, 0) → 27
mark1(27) → 11
01() → 28
ok1(28) → 3
plus1(0, 0) → 29
ok1(29) → 9
U211(0, 0, 0) → 30
mark1(30) → 10
proper1(0) → 31
top1(31) → 2
U411(0, 0, 0) → 32
ok1(32) → 11
ok1(12) → 12
ok1(12) → 23
ok1(14) → 31
mark1(15) → 15
mark1(15) → 18
mark1(16) → 16
mark1(16) → 19
ok1(17) → 17
ok1(18) → 15
ok1(18) → 18
ok1(19) → 16
ok1(19) → 19
ok1(20) → 20
ok1(20) → 24
ok1(21) → 21
ok1(21) → 22
mark1(22) → 21
mark1(22) → 22
mark1(23) → 12
mark1(23) → 23
mark1(24) → 20
mark1(24) → 24
mark1(25) → 25
mark1(25) → 29
ok1(26) → 26
ok1(26) → 30
mark1(27) → 27
mark1(27) → 32
ok1(28) → 31
ok1(29) → 25
ok1(29) → 29
mark1(30) → 26
mark1(30) → 30
ok1(32) → 27
ok1(32) → 32
active2(14) → 33
top2(33) → 2
active2(28) → 33
(4) BOUNDS(1, n^1)