1146.49/291.58 WORST_CASE(Omega(n^1), ?) 1160.01/295.03 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1160.01/295.03 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1160.01/295.03 1160.01/295.03 1160.01/295.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1160.01/295.03 1160.01/295.03 (0) CpxTRS 1160.01/295.03 (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 1160.01/295.03 (2) TRS for Loop Detection 1160.01/295.03 (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 1160.01/295.03 (4) BEST 1160.01/295.03 (5) proven lower bound 1160.01/295.03 (6) LowerBoundPropagationProof [FINISHED, 0 ms] 1160.01/295.03 (7) BOUNDS(n^1, INF) 1160.01/295.03 (8) TRS for Loop Detection 1160.01/295.03 1160.01/295.03 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (0) 1160.01/295.03 Obligation: 1160.01/295.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1160.01/295.03 1160.01/295.03 1160.01/295.03 The TRS R consists of the following rules: 1160.01/295.03 1160.01/295.03 active(zeros) -> mark(cons(0, zeros)) 1160.01/295.03 active(U11(tt, V1)) -> mark(U12(isNatList(V1))) 1160.01/295.03 active(U12(tt)) -> mark(tt) 1160.01/295.03 active(U21(tt, V1)) -> mark(U22(isNat(V1))) 1160.01/295.03 active(U22(tt)) -> mark(tt) 1160.01/295.03 active(U31(tt, V)) -> mark(U32(isNatList(V))) 1160.01/295.03 active(U32(tt)) -> mark(tt) 1160.01/295.03 active(U41(tt, V1, V2)) -> mark(U42(isNat(V1), V2)) 1160.01/295.03 active(U42(tt, V2)) -> mark(U43(isNatIList(V2))) 1160.01/295.03 active(U43(tt)) -> mark(tt) 1160.01/295.03 active(U51(tt, V1, V2)) -> mark(U52(isNat(V1), V2)) 1160.01/295.03 active(U52(tt, V2)) -> mark(U53(isNatList(V2))) 1160.01/295.03 active(U53(tt)) -> mark(tt) 1160.01/295.03 active(U61(tt, V1, V2)) -> mark(U62(isNat(V1), V2)) 1160.01/295.03 active(U62(tt, V2)) -> mark(U63(isNatIList(V2))) 1160.01/295.03 active(U63(tt)) -> mark(tt) 1160.01/295.03 active(U71(tt, L)) -> mark(s(length(L))) 1160.01/295.03 active(U81(tt)) -> mark(nil) 1160.01/295.03 active(U91(tt, IL, M, N)) -> mark(cons(N, take(M, IL))) 1160.01/295.03 active(and(tt, X)) -> mark(X) 1160.01/295.03 active(isNat(0)) -> mark(tt) 1160.01/295.03 active(isNat(length(V1))) -> mark(U11(isNatIListKind(V1), V1)) 1160.01/295.03 active(isNat(s(V1))) -> mark(U21(isNatKind(V1), V1)) 1160.01/295.03 active(isNatIList(V)) -> mark(U31(isNatIListKind(V), V)) 1160.01/295.03 active(isNatIList(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIList(cons(V1, V2))) -> mark(U41(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatIListKind(nil)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(cons(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatIListKind(take(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatKind(0)) -> mark(tt) 1160.01/295.03 active(isNatKind(length(V1))) -> mark(isNatIListKind(V1)) 1160.01/295.03 active(isNatKind(s(V1))) -> mark(isNatKind(V1)) 1160.01/295.03 active(isNatList(nil)) -> mark(tt) 1160.01/295.03 active(isNatList(cons(V1, V2))) -> mark(U51(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatList(take(V1, V2))) -> mark(U61(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(length(nil)) -> mark(0) 1160.01/295.03 active(length(cons(N, L))) -> mark(U71(and(and(isNatList(L), isNatIListKind(L)), and(isNat(N), isNatKind(N))), L)) 1160.01/295.03 active(take(0, IL)) -> mark(U81(and(isNatIList(IL), isNatIListKind(IL)))) 1160.01/295.03 active(take(s(M), cons(N, IL))) -> mark(U91(and(and(isNatIList(IL), isNatIListKind(IL)), and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N)))), IL, M, N)) 1160.01/295.03 active(cons(X1, X2)) -> cons(active(X1), X2) 1160.01/295.03 active(U11(X1, X2)) -> U11(active(X1), X2) 1160.01/295.03 active(U12(X)) -> U12(active(X)) 1160.01/295.03 active(U21(X1, X2)) -> U21(active(X1), X2) 1160.01/295.03 active(U22(X)) -> U22(active(X)) 1160.01/295.03 active(U31(X1, X2)) -> U31(active(X1), X2) 1160.01/295.03 active(U32(X)) -> U32(active(X)) 1160.01/295.03 active(U41(X1, X2, X3)) -> U41(active(X1), X2, X3) 1160.01/295.03 active(U42(X1, X2)) -> U42(active(X1), X2) 1160.01/295.03 active(U43(X)) -> U43(active(X)) 1160.01/295.03 active(U51(X1, X2, X3)) -> U51(active(X1), X2, X3) 1160.01/295.03 active(U52(X1, X2)) -> U52(active(X1), X2) 1160.01/295.03 active(U53(X)) -> U53(active(X)) 1160.01/295.03 active(U61(X1, X2, X3)) -> U61(active(X1), X2, X3) 1160.01/295.03 active(U62(X1, X2)) -> U62(active(X1), X2) 1160.01/295.03 active(U63(X)) -> U63(active(X)) 1160.01/295.03 active(U71(X1, X2)) -> U71(active(X1), X2) 1160.01/295.03 active(s(X)) -> s(active(X)) 1160.01/295.03 active(length(X)) -> length(active(X)) 1160.01/295.03 active(U81(X)) -> U81(active(X)) 1160.01/295.03 active(U91(X1, X2, X3, X4)) -> U91(active(X1), X2, X3, X4) 1160.01/295.03 active(take(X1, X2)) -> take(active(X1), X2) 1160.01/295.03 active(take(X1, X2)) -> take(X1, active(X2)) 1160.01/295.03 active(and(X1, X2)) -> and(active(X1), X2) 1160.01/295.03 cons(mark(X1), X2) -> mark(cons(X1, X2)) 1160.01/295.03 U11(mark(X1), X2) -> mark(U11(X1, X2)) 1160.01/295.03 U12(mark(X)) -> mark(U12(X)) 1160.01/295.03 U21(mark(X1), X2) -> mark(U21(X1, X2)) 1160.01/295.03 U22(mark(X)) -> mark(U22(X)) 1160.01/295.03 U31(mark(X1), X2) -> mark(U31(X1, X2)) 1160.01/295.03 U32(mark(X)) -> mark(U32(X)) 1160.01/295.03 U41(mark(X1), X2, X3) -> mark(U41(X1, X2, X3)) 1160.01/295.03 U42(mark(X1), X2) -> mark(U42(X1, X2)) 1160.01/295.03 U43(mark(X)) -> mark(U43(X)) 1160.01/295.03 U51(mark(X1), X2, X3) -> mark(U51(X1, X2, X3)) 1160.01/295.03 U52(mark(X1), X2) -> mark(U52(X1, X2)) 1160.01/295.03 U53(mark(X)) -> mark(U53(X)) 1160.01/295.03 U61(mark(X1), X2, X3) -> mark(U61(X1, X2, X3)) 1160.01/295.03 U62(mark(X1), X2) -> mark(U62(X1, X2)) 1160.01/295.03 U63(mark(X)) -> mark(U63(X)) 1160.01/295.03 U71(mark(X1), X2) -> mark(U71(X1, X2)) 1160.01/295.03 s(mark(X)) -> mark(s(X)) 1160.01/295.03 length(mark(X)) -> mark(length(X)) 1160.01/295.03 U81(mark(X)) -> mark(U81(X)) 1160.01/295.03 U91(mark(X1), X2, X3, X4) -> mark(U91(X1, X2, X3, X4)) 1160.01/295.03 take(mark(X1), X2) -> mark(take(X1, X2)) 1160.01/295.03 take(X1, mark(X2)) -> mark(take(X1, X2)) 1160.01/295.03 and(mark(X1), X2) -> mark(and(X1, X2)) 1160.01/295.03 proper(zeros) -> ok(zeros) 1160.01/295.03 proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1160.01/295.03 proper(0) -> ok(0) 1160.01/295.03 proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) 1160.01/295.03 proper(tt) -> ok(tt) 1160.01/295.03 proper(U12(X)) -> U12(proper(X)) 1160.01/295.03 proper(isNatList(X)) -> isNatList(proper(X)) 1160.01/295.03 proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) 1160.01/295.03 proper(U22(X)) -> U22(proper(X)) 1160.01/295.03 proper(isNat(X)) -> isNat(proper(X)) 1160.01/295.03 proper(U31(X1, X2)) -> U31(proper(X1), proper(X2)) 1160.01/295.03 proper(U32(X)) -> U32(proper(X)) 1160.01/295.03 proper(U41(X1, X2, X3)) -> U41(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U42(X1, X2)) -> U42(proper(X1), proper(X2)) 1160.01/295.03 proper(U43(X)) -> U43(proper(X)) 1160.01/295.03 proper(isNatIList(X)) -> isNatIList(proper(X)) 1160.01/295.03 proper(U51(X1, X2, X3)) -> U51(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U52(X1, X2)) -> U52(proper(X1), proper(X2)) 1160.01/295.03 proper(U53(X)) -> U53(proper(X)) 1160.01/295.03 proper(U61(X1, X2, X3)) -> U61(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U62(X1, X2)) -> U62(proper(X1), proper(X2)) 1160.01/295.03 proper(U63(X)) -> U63(proper(X)) 1160.01/295.03 proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) 1160.01/295.03 proper(s(X)) -> s(proper(X)) 1160.01/295.03 proper(length(X)) -> length(proper(X)) 1160.01/295.03 proper(U81(X)) -> U81(proper(X)) 1160.01/295.03 proper(nil) -> ok(nil) 1160.01/295.03 proper(U91(X1, X2, X3, X4)) -> U91(proper(X1), proper(X2), proper(X3), proper(X4)) 1160.01/295.03 proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 1160.01/295.03 proper(and(X1, X2)) -> and(proper(X1), proper(X2)) 1160.01/295.03 proper(isNatIListKind(X)) -> isNatIListKind(proper(X)) 1160.01/295.03 proper(isNatKind(X)) -> isNatKind(proper(X)) 1160.01/295.03 cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1160.01/295.03 U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) 1160.01/295.03 U12(ok(X)) -> ok(U12(X)) 1160.01/295.03 isNatList(ok(X)) -> ok(isNatList(X)) 1160.01/295.03 U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) 1160.01/295.03 U22(ok(X)) -> ok(U22(X)) 1160.01/295.03 isNat(ok(X)) -> ok(isNat(X)) 1160.01/295.03 U31(ok(X1), ok(X2)) -> ok(U31(X1, X2)) 1160.01/295.03 U32(ok(X)) -> ok(U32(X)) 1160.01/295.03 U41(ok(X1), ok(X2), ok(X3)) -> ok(U41(X1, X2, X3)) 1160.01/295.03 U42(ok(X1), ok(X2)) -> ok(U42(X1, X2)) 1160.01/295.03 U43(ok(X)) -> ok(U43(X)) 1160.01/295.03 isNatIList(ok(X)) -> ok(isNatIList(X)) 1160.01/295.03 U51(ok(X1), ok(X2), ok(X3)) -> ok(U51(X1, X2, X3)) 1160.01/295.03 U52(ok(X1), ok(X2)) -> ok(U52(X1, X2)) 1160.01/295.03 U53(ok(X)) -> ok(U53(X)) 1160.01/295.03 U61(ok(X1), ok(X2), ok(X3)) -> ok(U61(X1, X2, X3)) 1160.01/295.03 U62(ok(X1), ok(X2)) -> ok(U62(X1, X2)) 1160.01/295.03 U63(ok(X)) -> ok(U63(X)) 1160.01/295.03 U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) 1160.01/295.03 s(ok(X)) -> ok(s(X)) 1160.01/295.03 length(ok(X)) -> ok(length(X)) 1160.01/295.03 U81(ok(X)) -> ok(U81(X)) 1160.01/295.03 U91(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U91(X1, X2, X3, X4)) 1160.01/295.03 take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 1160.01/295.03 and(ok(X1), ok(X2)) -> ok(and(X1, X2)) 1160.01/295.03 isNatIListKind(ok(X)) -> ok(isNatIListKind(X)) 1160.01/295.03 isNatKind(ok(X)) -> ok(isNatKind(X)) 1160.01/295.03 top(mark(X)) -> top(proper(X)) 1160.01/295.03 top(ok(X)) -> top(active(X)) 1160.01/295.03 1160.01/295.03 S is empty. 1160.01/295.03 Rewrite Strategy: FULL 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) 1160.01/295.03 Transformed a relative TRS into a decreasing-loop problem. 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (2) 1160.01/295.03 Obligation: 1160.01/295.03 Analyzing the following TRS for decreasing loops: 1160.01/295.03 1160.01/295.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1160.01/295.03 1160.01/295.03 1160.01/295.03 The TRS R consists of the following rules: 1160.01/295.03 1160.01/295.03 active(zeros) -> mark(cons(0, zeros)) 1160.01/295.03 active(U11(tt, V1)) -> mark(U12(isNatList(V1))) 1160.01/295.03 active(U12(tt)) -> mark(tt) 1160.01/295.03 active(U21(tt, V1)) -> mark(U22(isNat(V1))) 1160.01/295.03 active(U22(tt)) -> mark(tt) 1160.01/295.03 active(U31(tt, V)) -> mark(U32(isNatList(V))) 1160.01/295.03 active(U32(tt)) -> mark(tt) 1160.01/295.03 active(U41(tt, V1, V2)) -> mark(U42(isNat(V1), V2)) 1160.01/295.03 active(U42(tt, V2)) -> mark(U43(isNatIList(V2))) 1160.01/295.03 active(U43(tt)) -> mark(tt) 1160.01/295.03 active(U51(tt, V1, V2)) -> mark(U52(isNat(V1), V2)) 1160.01/295.03 active(U52(tt, V2)) -> mark(U53(isNatList(V2))) 1160.01/295.03 active(U53(tt)) -> mark(tt) 1160.01/295.03 active(U61(tt, V1, V2)) -> mark(U62(isNat(V1), V2)) 1160.01/295.03 active(U62(tt, V2)) -> mark(U63(isNatIList(V2))) 1160.01/295.03 active(U63(tt)) -> mark(tt) 1160.01/295.03 active(U71(tt, L)) -> mark(s(length(L))) 1160.01/295.03 active(U81(tt)) -> mark(nil) 1160.01/295.03 active(U91(tt, IL, M, N)) -> mark(cons(N, take(M, IL))) 1160.01/295.03 active(and(tt, X)) -> mark(X) 1160.01/295.03 active(isNat(0)) -> mark(tt) 1160.01/295.03 active(isNat(length(V1))) -> mark(U11(isNatIListKind(V1), V1)) 1160.01/295.03 active(isNat(s(V1))) -> mark(U21(isNatKind(V1), V1)) 1160.01/295.03 active(isNatIList(V)) -> mark(U31(isNatIListKind(V), V)) 1160.01/295.03 active(isNatIList(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIList(cons(V1, V2))) -> mark(U41(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatIListKind(nil)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(cons(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatIListKind(take(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatKind(0)) -> mark(tt) 1160.01/295.03 active(isNatKind(length(V1))) -> mark(isNatIListKind(V1)) 1160.01/295.03 active(isNatKind(s(V1))) -> mark(isNatKind(V1)) 1160.01/295.03 active(isNatList(nil)) -> mark(tt) 1160.01/295.03 active(isNatList(cons(V1, V2))) -> mark(U51(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatList(take(V1, V2))) -> mark(U61(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(length(nil)) -> mark(0) 1160.01/295.03 active(length(cons(N, L))) -> mark(U71(and(and(isNatList(L), isNatIListKind(L)), and(isNat(N), isNatKind(N))), L)) 1160.01/295.03 active(take(0, IL)) -> mark(U81(and(isNatIList(IL), isNatIListKind(IL)))) 1160.01/295.03 active(take(s(M), cons(N, IL))) -> mark(U91(and(and(isNatIList(IL), isNatIListKind(IL)), and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N)))), IL, M, N)) 1160.01/295.03 active(cons(X1, X2)) -> cons(active(X1), X2) 1160.01/295.03 active(U11(X1, X2)) -> U11(active(X1), X2) 1160.01/295.03 active(U12(X)) -> U12(active(X)) 1160.01/295.03 active(U21(X1, X2)) -> U21(active(X1), X2) 1160.01/295.03 active(U22(X)) -> U22(active(X)) 1160.01/295.03 active(U31(X1, X2)) -> U31(active(X1), X2) 1160.01/295.03 active(U32(X)) -> U32(active(X)) 1160.01/295.03 active(U41(X1, X2, X3)) -> U41(active(X1), X2, X3) 1160.01/295.03 active(U42(X1, X2)) -> U42(active(X1), X2) 1160.01/295.03 active(U43(X)) -> U43(active(X)) 1160.01/295.03 active(U51(X1, X2, X3)) -> U51(active(X1), X2, X3) 1160.01/295.03 active(U52(X1, X2)) -> U52(active(X1), X2) 1160.01/295.03 active(U53(X)) -> U53(active(X)) 1160.01/295.03 active(U61(X1, X2, X3)) -> U61(active(X1), X2, X3) 1160.01/295.03 active(U62(X1, X2)) -> U62(active(X1), X2) 1160.01/295.03 active(U63(X)) -> U63(active(X)) 1160.01/295.03 active(U71(X1, X2)) -> U71(active(X1), X2) 1160.01/295.03 active(s(X)) -> s(active(X)) 1160.01/295.03 active(length(X)) -> length(active(X)) 1160.01/295.03 active(U81(X)) -> U81(active(X)) 1160.01/295.03 active(U91(X1, X2, X3, X4)) -> U91(active(X1), X2, X3, X4) 1160.01/295.03 active(take(X1, X2)) -> take(active(X1), X2) 1160.01/295.03 active(take(X1, X2)) -> take(X1, active(X2)) 1160.01/295.03 active(and(X1, X2)) -> and(active(X1), X2) 1160.01/295.03 cons(mark(X1), X2) -> mark(cons(X1, X2)) 1160.01/295.03 U11(mark(X1), X2) -> mark(U11(X1, X2)) 1160.01/295.03 U12(mark(X)) -> mark(U12(X)) 1160.01/295.03 U21(mark(X1), X2) -> mark(U21(X1, X2)) 1160.01/295.03 U22(mark(X)) -> mark(U22(X)) 1160.01/295.03 U31(mark(X1), X2) -> mark(U31(X1, X2)) 1160.01/295.03 U32(mark(X)) -> mark(U32(X)) 1160.01/295.03 U41(mark(X1), X2, X3) -> mark(U41(X1, X2, X3)) 1160.01/295.03 U42(mark(X1), X2) -> mark(U42(X1, X2)) 1160.01/295.03 U43(mark(X)) -> mark(U43(X)) 1160.01/295.03 U51(mark(X1), X2, X3) -> mark(U51(X1, X2, X3)) 1160.01/295.03 U52(mark(X1), X2) -> mark(U52(X1, X2)) 1160.01/295.03 U53(mark(X)) -> mark(U53(X)) 1160.01/295.03 U61(mark(X1), X2, X3) -> mark(U61(X1, X2, X3)) 1160.01/295.03 U62(mark(X1), X2) -> mark(U62(X1, X2)) 1160.01/295.03 U63(mark(X)) -> mark(U63(X)) 1160.01/295.03 U71(mark(X1), X2) -> mark(U71(X1, X2)) 1160.01/295.03 s(mark(X)) -> mark(s(X)) 1160.01/295.03 length(mark(X)) -> mark(length(X)) 1160.01/295.03 U81(mark(X)) -> mark(U81(X)) 1160.01/295.03 U91(mark(X1), X2, X3, X4) -> mark(U91(X1, X2, X3, X4)) 1160.01/295.03 take(mark(X1), X2) -> mark(take(X1, X2)) 1160.01/295.03 take(X1, mark(X2)) -> mark(take(X1, X2)) 1160.01/295.03 and(mark(X1), X2) -> mark(and(X1, X2)) 1160.01/295.03 proper(zeros) -> ok(zeros) 1160.01/295.03 proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1160.01/295.03 proper(0) -> ok(0) 1160.01/295.03 proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) 1160.01/295.03 proper(tt) -> ok(tt) 1160.01/295.03 proper(U12(X)) -> U12(proper(X)) 1160.01/295.03 proper(isNatList(X)) -> isNatList(proper(X)) 1160.01/295.03 proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) 1160.01/295.03 proper(U22(X)) -> U22(proper(X)) 1160.01/295.03 proper(isNat(X)) -> isNat(proper(X)) 1160.01/295.03 proper(U31(X1, X2)) -> U31(proper(X1), proper(X2)) 1160.01/295.03 proper(U32(X)) -> U32(proper(X)) 1160.01/295.03 proper(U41(X1, X2, X3)) -> U41(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U42(X1, X2)) -> U42(proper(X1), proper(X2)) 1160.01/295.03 proper(U43(X)) -> U43(proper(X)) 1160.01/295.03 proper(isNatIList(X)) -> isNatIList(proper(X)) 1160.01/295.03 proper(U51(X1, X2, X3)) -> U51(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U52(X1, X2)) -> U52(proper(X1), proper(X2)) 1160.01/295.03 proper(U53(X)) -> U53(proper(X)) 1160.01/295.03 proper(U61(X1, X2, X3)) -> U61(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U62(X1, X2)) -> U62(proper(X1), proper(X2)) 1160.01/295.03 proper(U63(X)) -> U63(proper(X)) 1160.01/295.03 proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) 1160.01/295.03 proper(s(X)) -> s(proper(X)) 1160.01/295.03 proper(length(X)) -> length(proper(X)) 1160.01/295.03 proper(U81(X)) -> U81(proper(X)) 1160.01/295.03 proper(nil) -> ok(nil) 1160.01/295.03 proper(U91(X1, X2, X3, X4)) -> U91(proper(X1), proper(X2), proper(X3), proper(X4)) 1160.01/295.03 proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 1160.01/295.03 proper(and(X1, X2)) -> and(proper(X1), proper(X2)) 1160.01/295.03 proper(isNatIListKind(X)) -> isNatIListKind(proper(X)) 1160.01/295.03 proper(isNatKind(X)) -> isNatKind(proper(X)) 1160.01/295.03 cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1160.01/295.03 U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) 1160.01/295.03 U12(ok(X)) -> ok(U12(X)) 1160.01/295.03 isNatList(ok(X)) -> ok(isNatList(X)) 1160.01/295.03 U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) 1160.01/295.03 U22(ok(X)) -> ok(U22(X)) 1160.01/295.03 isNat(ok(X)) -> ok(isNat(X)) 1160.01/295.03 U31(ok(X1), ok(X2)) -> ok(U31(X1, X2)) 1160.01/295.03 U32(ok(X)) -> ok(U32(X)) 1160.01/295.03 U41(ok(X1), ok(X2), ok(X3)) -> ok(U41(X1, X2, X3)) 1160.01/295.03 U42(ok(X1), ok(X2)) -> ok(U42(X1, X2)) 1160.01/295.03 U43(ok(X)) -> ok(U43(X)) 1160.01/295.03 isNatIList(ok(X)) -> ok(isNatIList(X)) 1160.01/295.03 U51(ok(X1), ok(X2), ok(X3)) -> ok(U51(X1, X2, X3)) 1160.01/295.03 U52(ok(X1), ok(X2)) -> ok(U52(X1, X2)) 1160.01/295.03 U53(ok(X)) -> ok(U53(X)) 1160.01/295.03 U61(ok(X1), ok(X2), ok(X3)) -> ok(U61(X1, X2, X3)) 1160.01/295.03 U62(ok(X1), ok(X2)) -> ok(U62(X1, X2)) 1160.01/295.03 U63(ok(X)) -> ok(U63(X)) 1160.01/295.03 U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) 1160.01/295.03 s(ok(X)) -> ok(s(X)) 1160.01/295.03 length(ok(X)) -> ok(length(X)) 1160.01/295.03 U81(ok(X)) -> ok(U81(X)) 1160.01/295.03 U91(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U91(X1, X2, X3, X4)) 1160.01/295.03 take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 1160.01/295.03 and(ok(X1), ok(X2)) -> ok(and(X1, X2)) 1160.01/295.03 isNatIListKind(ok(X)) -> ok(isNatIListKind(X)) 1160.01/295.03 isNatKind(ok(X)) -> ok(isNatKind(X)) 1160.01/295.03 top(mark(X)) -> top(proper(X)) 1160.01/295.03 top(ok(X)) -> top(active(X)) 1160.01/295.03 1160.01/295.03 S is empty. 1160.01/295.03 Rewrite Strategy: FULL 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (3) DecreasingLoopProof (LOWER BOUND(ID)) 1160.01/295.03 The following loop(s) give(s) rise to the lower bound Omega(n^1): 1160.01/295.03 1160.01/295.03 The rewrite sequence 1160.01/295.03 1160.01/295.03 U52(ok(X1), ok(X2)) ->^+ ok(U52(X1, X2)) 1160.01/295.03 1160.01/295.03 gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. 1160.01/295.03 1160.01/295.03 The pumping substitution is [X1 / ok(X1), X2 / ok(X2)]. 1160.01/295.03 1160.01/295.03 The result substitution is [ ]. 1160.01/295.03 1160.01/295.03 1160.01/295.03 1160.01/295.03 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (4) 1160.01/295.03 Complex Obligation (BEST) 1160.01/295.03 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (5) 1160.01/295.03 Obligation: 1160.01/295.03 Proved the lower bound n^1 for the following obligation: 1160.01/295.03 1160.01/295.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1160.01/295.03 1160.01/295.03 1160.01/295.03 The TRS R consists of the following rules: 1160.01/295.03 1160.01/295.03 active(zeros) -> mark(cons(0, zeros)) 1160.01/295.03 active(U11(tt, V1)) -> mark(U12(isNatList(V1))) 1160.01/295.03 active(U12(tt)) -> mark(tt) 1160.01/295.03 active(U21(tt, V1)) -> mark(U22(isNat(V1))) 1160.01/295.03 active(U22(tt)) -> mark(tt) 1160.01/295.03 active(U31(tt, V)) -> mark(U32(isNatList(V))) 1160.01/295.03 active(U32(tt)) -> mark(tt) 1160.01/295.03 active(U41(tt, V1, V2)) -> mark(U42(isNat(V1), V2)) 1160.01/295.03 active(U42(tt, V2)) -> mark(U43(isNatIList(V2))) 1160.01/295.03 active(U43(tt)) -> mark(tt) 1160.01/295.03 active(U51(tt, V1, V2)) -> mark(U52(isNat(V1), V2)) 1160.01/295.03 active(U52(tt, V2)) -> mark(U53(isNatList(V2))) 1160.01/295.03 active(U53(tt)) -> mark(tt) 1160.01/295.03 active(U61(tt, V1, V2)) -> mark(U62(isNat(V1), V2)) 1160.01/295.03 active(U62(tt, V2)) -> mark(U63(isNatIList(V2))) 1160.01/295.03 active(U63(tt)) -> mark(tt) 1160.01/295.03 active(U71(tt, L)) -> mark(s(length(L))) 1160.01/295.03 active(U81(tt)) -> mark(nil) 1160.01/295.03 active(U91(tt, IL, M, N)) -> mark(cons(N, take(M, IL))) 1160.01/295.03 active(and(tt, X)) -> mark(X) 1160.01/295.03 active(isNat(0)) -> mark(tt) 1160.01/295.03 active(isNat(length(V1))) -> mark(U11(isNatIListKind(V1), V1)) 1160.01/295.03 active(isNat(s(V1))) -> mark(U21(isNatKind(V1), V1)) 1160.01/295.03 active(isNatIList(V)) -> mark(U31(isNatIListKind(V), V)) 1160.01/295.03 active(isNatIList(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIList(cons(V1, V2))) -> mark(U41(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatIListKind(nil)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(cons(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatIListKind(take(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatKind(0)) -> mark(tt) 1160.01/295.03 active(isNatKind(length(V1))) -> mark(isNatIListKind(V1)) 1160.01/295.03 active(isNatKind(s(V1))) -> mark(isNatKind(V1)) 1160.01/295.03 active(isNatList(nil)) -> mark(tt) 1160.01/295.03 active(isNatList(cons(V1, V2))) -> mark(U51(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatList(take(V1, V2))) -> mark(U61(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(length(nil)) -> mark(0) 1160.01/295.03 active(length(cons(N, L))) -> mark(U71(and(and(isNatList(L), isNatIListKind(L)), and(isNat(N), isNatKind(N))), L)) 1160.01/295.03 active(take(0, IL)) -> mark(U81(and(isNatIList(IL), isNatIListKind(IL)))) 1160.01/295.03 active(take(s(M), cons(N, IL))) -> mark(U91(and(and(isNatIList(IL), isNatIListKind(IL)), and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N)))), IL, M, N)) 1160.01/295.03 active(cons(X1, X2)) -> cons(active(X1), X2) 1160.01/295.03 active(U11(X1, X2)) -> U11(active(X1), X2) 1160.01/295.03 active(U12(X)) -> U12(active(X)) 1160.01/295.03 active(U21(X1, X2)) -> U21(active(X1), X2) 1160.01/295.03 active(U22(X)) -> U22(active(X)) 1160.01/295.03 active(U31(X1, X2)) -> U31(active(X1), X2) 1160.01/295.03 active(U32(X)) -> U32(active(X)) 1160.01/295.03 active(U41(X1, X2, X3)) -> U41(active(X1), X2, X3) 1160.01/295.03 active(U42(X1, X2)) -> U42(active(X1), X2) 1160.01/295.03 active(U43(X)) -> U43(active(X)) 1160.01/295.03 active(U51(X1, X2, X3)) -> U51(active(X1), X2, X3) 1160.01/295.03 active(U52(X1, X2)) -> U52(active(X1), X2) 1160.01/295.03 active(U53(X)) -> U53(active(X)) 1160.01/295.03 active(U61(X1, X2, X3)) -> U61(active(X1), X2, X3) 1160.01/295.03 active(U62(X1, X2)) -> U62(active(X1), X2) 1160.01/295.03 active(U63(X)) -> U63(active(X)) 1160.01/295.03 active(U71(X1, X2)) -> U71(active(X1), X2) 1160.01/295.03 active(s(X)) -> s(active(X)) 1160.01/295.03 active(length(X)) -> length(active(X)) 1160.01/295.03 active(U81(X)) -> U81(active(X)) 1160.01/295.03 active(U91(X1, X2, X3, X4)) -> U91(active(X1), X2, X3, X4) 1160.01/295.03 active(take(X1, X2)) -> take(active(X1), X2) 1160.01/295.03 active(take(X1, X2)) -> take(X1, active(X2)) 1160.01/295.03 active(and(X1, X2)) -> and(active(X1), X2) 1160.01/295.03 cons(mark(X1), X2) -> mark(cons(X1, X2)) 1160.01/295.03 U11(mark(X1), X2) -> mark(U11(X1, X2)) 1160.01/295.03 U12(mark(X)) -> mark(U12(X)) 1160.01/295.03 U21(mark(X1), X2) -> mark(U21(X1, X2)) 1160.01/295.03 U22(mark(X)) -> mark(U22(X)) 1160.01/295.03 U31(mark(X1), X2) -> mark(U31(X1, X2)) 1160.01/295.03 U32(mark(X)) -> mark(U32(X)) 1160.01/295.03 U41(mark(X1), X2, X3) -> mark(U41(X1, X2, X3)) 1160.01/295.03 U42(mark(X1), X2) -> mark(U42(X1, X2)) 1160.01/295.03 U43(mark(X)) -> mark(U43(X)) 1160.01/295.03 U51(mark(X1), X2, X3) -> mark(U51(X1, X2, X3)) 1160.01/295.03 U52(mark(X1), X2) -> mark(U52(X1, X2)) 1160.01/295.03 U53(mark(X)) -> mark(U53(X)) 1160.01/295.03 U61(mark(X1), X2, X3) -> mark(U61(X1, X2, X3)) 1160.01/295.03 U62(mark(X1), X2) -> mark(U62(X1, X2)) 1160.01/295.03 U63(mark(X)) -> mark(U63(X)) 1160.01/295.03 U71(mark(X1), X2) -> mark(U71(X1, X2)) 1160.01/295.03 s(mark(X)) -> mark(s(X)) 1160.01/295.03 length(mark(X)) -> mark(length(X)) 1160.01/295.03 U81(mark(X)) -> mark(U81(X)) 1160.01/295.03 U91(mark(X1), X2, X3, X4) -> mark(U91(X1, X2, X3, X4)) 1160.01/295.03 take(mark(X1), X2) -> mark(take(X1, X2)) 1160.01/295.03 take(X1, mark(X2)) -> mark(take(X1, X2)) 1160.01/295.03 and(mark(X1), X2) -> mark(and(X1, X2)) 1160.01/295.03 proper(zeros) -> ok(zeros) 1160.01/295.03 proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1160.01/295.03 proper(0) -> ok(0) 1160.01/295.03 proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) 1160.01/295.03 proper(tt) -> ok(tt) 1160.01/295.03 proper(U12(X)) -> U12(proper(X)) 1160.01/295.03 proper(isNatList(X)) -> isNatList(proper(X)) 1160.01/295.03 proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) 1160.01/295.03 proper(U22(X)) -> U22(proper(X)) 1160.01/295.03 proper(isNat(X)) -> isNat(proper(X)) 1160.01/295.03 proper(U31(X1, X2)) -> U31(proper(X1), proper(X2)) 1160.01/295.03 proper(U32(X)) -> U32(proper(X)) 1160.01/295.03 proper(U41(X1, X2, X3)) -> U41(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U42(X1, X2)) -> U42(proper(X1), proper(X2)) 1160.01/295.03 proper(U43(X)) -> U43(proper(X)) 1160.01/295.03 proper(isNatIList(X)) -> isNatIList(proper(X)) 1160.01/295.03 proper(U51(X1, X2, X3)) -> U51(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U52(X1, X2)) -> U52(proper(X1), proper(X2)) 1160.01/295.03 proper(U53(X)) -> U53(proper(X)) 1160.01/295.03 proper(U61(X1, X2, X3)) -> U61(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U62(X1, X2)) -> U62(proper(X1), proper(X2)) 1160.01/295.03 proper(U63(X)) -> U63(proper(X)) 1160.01/295.03 proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) 1160.01/295.03 proper(s(X)) -> s(proper(X)) 1160.01/295.03 proper(length(X)) -> length(proper(X)) 1160.01/295.03 proper(U81(X)) -> U81(proper(X)) 1160.01/295.03 proper(nil) -> ok(nil) 1160.01/295.03 proper(U91(X1, X2, X3, X4)) -> U91(proper(X1), proper(X2), proper(X3), proper(X4)) 1160.01/295.03 proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 1160.01/295.03 proper(and(X1, X2)) -> and(proper(X1), proper(X2)) 1160.01/295.03 proper(isNatIListKind(X)) -> isNatIListKind(proper(X)) 1160.01/295.03 proper(isNatKind(X)) -> isNatKind(proper(X)) 1160.01/295.03 cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1160.01/295.03 U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) 1160.01/295.03 U12(ok(X)) -> ok(U12(X)) 1160.01/295.03 isNatList(ok(X)) -> ok(isNatList(X)) 1160.01/295.03 U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) 1160.01/295.03 U22(ok(X)) -> ok(U22(X)) 1160.01/295.03 isNat(ok(X)) -> ok(isNat(X)) 1160.01/295.03 U31(ok(X1), ok(X2)) -> ok(U31(X1, X2)) 1160.01/295.03 U32(ok(X)) -> ok(U32(X)) 1160.01/295.03 U41(ok(X1), ok(X2), ok(X3)) -> ok(U41(X1, X2, X3)) 1160.01/295.03 U42(ok(X1), ok(X2)) -> ok(U42(X1, X2)) 1160.01/295.03 U43(ok(X)) -> ok(U43(X)) 1160.01/295.03 isNatIList(ok(X)) -> ok(isNatIList(X)) 1160.01/295.03 U51(ok(X1), ok(X2), ok(X3)) -> ok(U51(X1, X2, X3)) 1160.01/295.03 U52(ok(X1), ok(X2)) -> ok(U52(X1, X2)) 1160.01/295.03 U53(ok(X)) -> ok(U53(X)) 1160.01/295.03 U61(ok(X1), ok(X2), ok(X3)) -> ok(U61(X1, X2, X3)) 1160.01/295.03 U62(ok(X1), ok(X2)) -> ok(U62(X1, X2)) 1160.01/295.03 U63(ok(X)) -> ok(U63(X)) 1160.01/295.03 U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) 1160.01/295.03 s(ok(X)) -> ok(s(X)) 1160.01/295.03 length(ok(X)) -> ok(length(X)) 1160.01/295.03 U81(ok(X)) -> ok(U81(X)) 1160.01/295.03 U91(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U91(X1, X2, X3, X4)) 1160.01/295.03 take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 1160.01/295.03 and(ok(X1), ok(X2)) -> ok(and(X1, X2)) 1160.01/295.03 isNatIListKind(ok(X)) -> ok(isNatIListKind(X)) 1160.01/295.03 isNatKind(ok(X)) -> ok(isNatKind(X)) 1160.01/295.03 top(mark(X)) -> top(proper(X)) 1160.01/295.03 top(ok(X)) -> top(active(X)) 1160.01/295.03 1160.01/295.03 S is empty. 1160.01/295.03 Rewrite Strategy: FULL 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (6) LowerBoundPropagationProof (FINISHED) 1160.01/295.03 Propagated lower bound. 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (7) 1160.01/295.03 BOUNDS(n^1, INF) 1160.01/295.03 1160.01/295.03 ---------------------------------------- 1160.01/295.03 1160.01/295.03 (8) 1160.01/295.03 Obligation: 1160.01/295.03 Analyzing the following TRS for decreasing loops: 1160.01/295.03 1160.01/295.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1160.01/295.03 1160.01/295.03 1160.01/295.03 The TRS R consists of the following rules: 1160.01/295.03 1160.01/295.03 active(zeros) -> mark(cons(0, zeros)) 1160.01/295.03 active(U11(tt, V1)) -> mark(U12(isNatList(V1))) 1160.01/295.03 active(U12(tt)) -> mark(tt) 1160.01/295.03 active(U21(tt, V1)) -> mark(U22(isNat(V1))) 1160.01/295.03 active(U22(tt)) -> mark(tt) 1160.01/295.03 active(U31(tt, V)) -> mark(U32(isNatList(V))) 1160.01/295.03 active(U32(tt)) -> mark(tt) 1160.01/295.03 active(U41(tt, V1, V2)) -> mark(U42(isNat(V1), V2)) 1160.01/295.03 active(U42(tt, V2)) -> mark(U43(isNatIList(V2))) 1160.01/295.03 active(U43(tt)) -> mark(tt) 1160.01/295.03 active(U51(tt, V1, V2)) -> mark(U52(isNat(V1), V2)) 1160.01/295.03 active(U52(tt, V2)) -> mark(U53(isNatList(V2))) 1160.01/295.03 active(U53(tt)) -> mark(tt) 1160.01/295.03 active(U61(tt, V1, V2)) -> mark(U62(isNat(V1), V2)) 1160.01/295.03 active(U62(tt, V2)) -> mark(U63(isNatIList(V2))) 1160.01/295.03 active(U63(tt)) -> mark(tt) 1160.01/295.03 active(U71(tt, L)) -> mark(s(length(L))) 1160.01/295.03 active(U81(tt)) -> mark(nil) 1160.01/295.03 active(U91(tt, IL, M, N)) -> mark(cons(N, take(M, IL))) 1160.01/295.03 active(and(tt, X)) -> mark(X) 1160.01/295.03 active(isNat(0)) -> mark(tt) 1160.01/295.03 active(isNat(length(V1))) -> mark(U11(isNatIListKind(V1), V1)) 1160.01/295.03 active(isNat(s(V1))) -> mark(U21(isNatKind(V1), V1)) 1160.01/295.03 active(isNatIList(V)) -> mark(U31(isNatIListKind(V), V)) 1160.01/295.03 active(isNatIList(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIList(cons(V1, V2))) -> mark(U41(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatIListKind(nil)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(zeros)) -> mark(tt) 1160.01/295.03 active(isNatIListKind(cons(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatIListKind(take(V1, V2))) -> mark(and(isNatKind(V1), isNatIListKind(V2))) 1160.01/295.03 active(isNatKind(0)) -> mark(tt) 1160.01/295.03 active(isNatKind(length(V1))) -> mark(isNatIListKind(V1)) 1160.01/295.03 active(isNatKind(s(V1))) -> mark(isNatKind(V1)) 1160.01/295.03 active(isNatList(nil)) -> mark(tt) 1160.01/295.03 active(isNatList(cons(V1, V2))) -> mark(U51(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(isNatList(take(V1, V2))) -> mark(U61(and(isNatKind(V1), isNatIListKind(V2)), V1, V2)) 1160.01/295.03 active(length(nil)) -> mark(0) 1160.01/295.03 active(length(cons(N, L))) -> mark(U71(and(and(isNatList(L), isNatIListKind(L)), and(isNat(N), isNatKind(N))), L)) 1160.01/295.03 active(take(0, IL)) -> mark(U81(and(isNatIList(IL), isNatIListKind(IL)))) 1160.01/295.03 active(take(s(M), cons(N, IL))) -> mark(U91(and(and(isNatIList(IL), isNatIListKind(IL)), and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N)))), IL, M, N)) 1160.01/295.03 active(cons(X1, X2)) -> cons(active(X1), X2) 1160.01/295.03 active(U11(X1, X2)) -> U11(active(X1), X2) 1160.01/295.03 active(U12(X)) -> U12(active(X)) 1160.01/295.03 active(U21(X1, X2)) -> U21(active(X1), X2) 1160.01/295.03 active(U22(X)) -> U22(active(X)) 1160.01/295.03 active(U31(X1, X2)) -> U31(active(X1), X2) 1160.01/295.03 active(U32(X)) -> U32(active(X)) 1160.01/295.03 active(U41(X1, X2, X3)) -> U41(active(X1), X2, X3) 1160.01/295.03 active(U42(X1, X2)) -> U42(active(X1), X2) 1160.01/295.03 active(U43(X)) -> U43(active(X)) 1160.01/295.03 active(U51(X1, X2, X3)) -> U51(active(X1), X2, X3) 1160.01/295.03 active(U52(X1, X2)) -> U52(active(X1), X2) 1160.01/295.03 active(U53(X)) -> U53(active(X)) 1160.01/295.03 active(U61(X1, X2, X3)) -> U61(active(X1), X2, X3) 1160.01/295.03 active(U62(X1, X2)) -> U62(active(X1), X2) 1160.01/295.03 active(U63(X)) -> U63(active(X)) 1160.01/295.03 active(U71(X1, X2)) -> U71(active(X1), X2) 1160.01/295.03 active(s(X)) -> s(active(X)) 1160.01/295.03 active(length(X)) -> length(active(X)) 1160.01/295.03 active(U81(X)) -> U81(active(X)) 1160.01/295.03 active(U91(X1, X2, X3, X4)) -> U91(active(X1), X2, X3, X4) 1160.01/295.03 active(take(X1, X2)) -> take(active(X1), X2) 1160.01/295.03 active(take(X1, X2)) -> take(X1, active(X2)) 1160.01/295.03 active(and(X1, X2)) -> and(active(X1), X2) 1160.01/295.03 cons(mark(X1), X2) -> mark(cons(X1, X2)) 1160.01/295.03 U11(mark(X1), X2) -> mark(U11(X1, X2)) 1160.01/295.03 U12(mark(X)) -> mark(U12(X)) 1160.01/295.03 U21(mark(X1), X2) -> mark(U21(X1, X2)) 1160.01/295.03 U22(mark(X)) -> mark(U22(X)) 1160.01/295.03 U31(mark(X1), X2) -> mark(U31(X1, X2)) 1160.01/295.03 U32(mark(X)) -> mark(U32(X)) 1160.01/295.03 U41(mark(X1), X2, X3) -> mark(U41(X1, X2, X3)) 1160.01/295.03 U42(mark(X1), X2) -> mark(U42(X1, X2)) 1160.01/295.03 U43(mark(X)) -> mark(U43(X)) 1160.01/295.03 U51(mark(X1), X2, X3) -> mark(U51(X1, X2, X3)) 1160.01/295.03 U52(mark(X1), X2) -> mark(U52(X1, X2)) 1160.01/295.03 U53(mark(X)) -> mark(U53(X)) 1160.01/295.03 U61(mark(X1), X2, X3) -> mark(U61(X1, X2, X3)) 1160.01/295.03 U62(mark(X1), X2) -> mark(U62(X1, X2)) 1160.01/295.03 U63(mark(X)) -> mark(U63(X)) 1160.01/295.03 U71(mark(X1), X2) -> mark(U71(X1, X2)) 1160.01/295.03 s(mark(X)) -> mark(s(X)) 1160.01/295.03 length(mark(X)) -> mark(length(X)) 1160.01/295.03 U81(mark(X)) -> mark(U81(X)) 1160.01/295.03 U91(mark(X1), X2, X3, X4) -> mark(U91(X1, X2, X3, X4)) 1160.01/295.03 take(mark(X1), X2) -> mark(take(X1, X2)) 1160.01/295.03 take(X1, mark(X2)) -> mark(take(X1, X2)) 1160.01/295.03 and(mark(X1), X2) -> mark(and(X1, X2)) 1160.01/295.03 proper(zeros) -> ok(zeros) 1160.01/295.03 proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1160.01/295.03 proper(0) -> ok(0) 1160.01/295.03 proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) 1160.01/295.03 proper(tt) -> ok(tt) 1160.01/295.03 proper(U12(X)) -> U12(proper(X)) 1160.01/295.03 proper(isNatList(X)) -> isNatList(proper(X)) 1160.01/295.03 proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) 1160.01/295.03 proper(U22(X)) -> U22(proper(X)) 1160.01/295.03 proper(isNat(X)) -> isNat(proper(X)) 1160.01/295.03 proper(U31(X1, X2)) -> U31(proper(X1), proper(X2)) 1160.01/295.03 proper(U32(X)) -> U32(proper(X)) 1160.01/295.03 proper(U41(X1, X2, X3)) -> U41(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U42(X1, X2)) -> U42(proper(X1), proper(X2)) 1160.01/295.03 proper(U43(X)) -> U43(proper(X)) 1160.01/295.03 proper(isNatIList(X)) -> isNatIList(proper(X)) 1160.01/295.03 proper(U51(X1, X2, X3)) -> U51(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U52(X1, X2)) -> U52(proper(X1), proper(X2)) 1160.01/295.03 proper(U53(X)) -> U53(proper(X)) 1160.01/295.03 proper(U61(X1, X2, X3)) -> U61(proper(X1), proper(X2), proper(X3)) 1160.01/295.03 proper(U62(X1, X2)) -> U62(proper(X1), proper(X2)) 1160.01/295.03 proper(U63(X)) -> U63(proper(X)) 1160.01/295.03 proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) 1160.01/295.03 proper(s(X)) -> s(proper(X)) 1160.01/295.03 proper(length(X)) -> length(proper(X)) 1160.01/295.03 proper(U81(X)) -> U81(proper(X)) 1160.01/295.03 proper(nil) -> ok(nil) 1160.01/295.03 proper(U91(X1, X2, X3, X4)) -> U91(proper(X1), proper(X2), proper(X3), proper(X4)) 1160.01/295.03 proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 1160.01/295.03 proper(and(X1, X2)) -> and(proper(X1), proper(X2)) 1160.01/295.03 proper(isNatIListKind(X)) -> isNatIListKind(proper(X)) 1160.01/295.03 proper(isNatKind(X)) -> isNatKind(proper(X)) 1160.01/295.03 cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1160.01/295.03 U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) 1160.01/295.03 U12(ok(X)) -> ok(U12(X)) 1160.01/295.03 isNatList(ok(X)) -> ok(isNatList(X)) 1160.01/295.03 U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) 1160.01/295.03 U22(ok(X)) -> ok(U22(X)) 1160.01/295.03 isNat(ok(X)) -> ok(isNat(X)) 1160.01/295.03 U31(ok(X1), ok(X2)) -> ok(U31(X1, X2)) 1160.01/295.03 U32(ok(X)) -> ok(U32(X)) 1160.01/295.03 U41(ok(X1), ok(X2), ok(X3)) -> ok(U41(X1, X2, X3)) 1160.01/295.03 U42(ok(X1), ok(X2)) -> ok(U42(X1, X2)) 1160.01/295.03 U43(ok(X)) -> ok(U43(X)) 1160.01/295.03 isNatIList(ok(X)) -> ok(isNatIList(X)) 1160.01/295.03 U51(ok(X1), ok(X2), ok(X3)) -> ok(U51(X1, X2, X3)) 1160.01/295.03 U52(ok(X1), ok(X2)) -> ok(U52(X1, X2)) 1160.01/295.03 U53(ok(X)) -> ok(U53(X)) 1160.01/295.03 U61(ok(X1), ok(X2), ok(X3)) -> ok(U61(X1, X2, X3)) 1160.01/295.03 U62(ok(X1), ok(X2)) -> ok(U62(X1, X2)) 1160.01/295.03 U63(ok(X)) -> ok(U63(X)) 1160.01/295.03 U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) 1160.01/295.03 s(ok(X)) -> ok(s(X)) 1160.01/295.03 length(ok(X)) -> ok(length(X)) 1160.01/295.03 U81(ok(X)) -> ok(U81(X)) 1160.01/295.03 U91(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U91(X1, X2, X3, X4)) 1160.01/295.03 take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 1160.01/295.03 and(ok(X1), ok(X2)) -> ok(and(X1, X2)) 1160.01/295.03 isNatIListKind(ok(X)) -> ok(isNatIListKind(X)) 1160.01/295.03 isNatKind(ok(X)) -> ok(isNatKind(X)) 1160.01/295.03 top(mark(X)) -> top(proper(X)) 1160.01/295.03 top(ok(X)) -> top(active(X)) 1160.01/295.03 1160.01/295.03 S is empty. 1160.01/295.03 Rewrite Strategy: FULL 1160.26/295.10 EOF