/export/starexec/sandbox2/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 906 ms] (4) CpxRelTRS (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 3 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(isList(X)) -> isList(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(U61(X)) -> U61(proper(X)) proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) proper(U72(X)) -> U72(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(U81(X)) -> U81(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) U22(ok(X)) -> ok(U22(X)) isList(ok(X)) -> ok(isList(X)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2)) -> ok(U41(X1, X2)) U42(ok(X)) -> ok(U42(X)) isNeList(ok(X)) -> ok(isNeList(X)) U51(ok(X1), ok(X2)) -> ok(U51(X1, X2)) U52(ok(X)) -> ok(U52(X)) U61(ok(X)) -> ok(U61(X)) U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) U72(ok(X)) -> ok(U72(X)) isPal(ok(X)) -> ok(isPal(X)) U81(ok(X)) -> ok(U81(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(nil) -> nil encArg(tt) -> tt encArg(a) -> a encArg(e) -> e encArg(i) -> i encArg(o) -> o encArg(u) -> u encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1)) -> U31(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U42(x_1)) -> U42(encArg(x_1)) encArg(cons_U51(x_1, x_2)) -> U51(encArg(x_1), encArg(x_2)) encArg(cons_U52(x_1)) -> U52(encArg(x_1)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2)) -> U71(encArg(x_1), encArg(x_2)) encArg(cons_U72(x_1)) -> U72(encArg(x_1)) encArg(cons_U81(x_1)) -> U81(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_isList(x_1)) -> isList(encArg(x_1)) encArg(cons_isNeList(x_1)) -> isNeList(encArg(x_1)) encArg(cons_isPal(x_1)) -> isPal(encArg(x_1)) encArg(cons_isQid(x_1)) -> isQid(encArg(x_1)) encArg(cons_isNePal(x_1)) -> isNePal(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode___(x_1, x_2) -> __(encArg(x_1), encArg(x_2)) encode_mark(x_1) -> mark(encArg(x_1)) encode_nil -> nil encode_U11(x_1) -> U11(encArg(x_1)) encode_tt -> tt encode_U21(x_1, x_2) -> U21(encArg(x_1), encArg(x_2)) encode_U22(x_1) -> U22(encArg(x_1)) encode_isList(x_1) -> isList(encArg(x_1)) encode_U31(x_1) -> U31(encArg(x_1)) encode_U41(x_1, x_2) -> U41(encArg(x_1), encArg(x_2)) encode_U42(x_1) -> U42(encArg(x_1)) encode_isNeList(x_1) -> isNeList(encArg(x_1)) encode_U51(x_1, x_2) -> U51(encArg(x_1), encArg(x_2)) encode_U52(x_1) -> U52(encArg(x_1)) encode_U61(x_1) -> U61(encArg(x_1)) encode_U71(x_1, x_2) -> U71(encArg(x_1), encArg(x_2)) encode_U72(x_1) -> U72(encArg(x_1)) encode_isPal(x_1) -> isPal(encArg(x_1)) encode_U81(x_1) -> U81(encArg(x_1)) encode_isQid(x_1) -> isQid(encArg(x_1)) encode_isNePal(x_1) -> isNePal(encArg(x_1)) encode_a -> a encode_e -> e encode_i -> i encode_o -> o encode_u -> u encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(isList(X)) -> isList(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(U61(X)) -> U61(proper(X)) proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) proper(U72(X)) -> U72(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(U81(X)) -> U81(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) U22(ok(X)) -> ok(U22(X)) isList(ok(X)) -> ok(isList(X)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2)) -> ok(U41(X1, X2)) U42(ok(X)) -> ok(U42(X)) isNeList(ok(X)) -> ok(isNeList(X)) U51(ok(X1), ok(X2)) -> ok(U51(X1, X2)) U52(ok(X)) -> ok(U52(X)) U61(ok(X)) -> ok(U61(X)) U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) U72(ok(X)) -> ok(U72(X)) isPal(ok(X)) -> ok(isPal(X)) U81(ok(X)) -> ok(U81(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(nil) -> nil encArg(tt) -> tt encArg(a) -> a encArg(e) -> e encArg(i) -> i encArg(o) -> o encArg(u) -> u encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1)) -> U31(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U42(x_1)) -> U42(encArg(x_1)) encArg(cons_U51(x_1, x_2)) -> U51(encArg(x_1), encArg(x_2)) encArg(cons_U52(x_1)) -> U52(encArg(x_1)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2)) -> U71(encArg(x_1), encArg(x_2)) encArg(cons_U72(x_1)) -> U72(encArg(x_1)) encArg(cons_U81(x_1)) -> U81(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_isList(x_1)) -> isList(encArg(x_1)) encArg(cons_isNeList(x_1)) -> isNeList(encArg(x_1)) encArg(cons_isPal(x_1)) -> isPal(encArg(x_1)) encArg(cons_isQid(x_1)) -> isQid(encArg(x_1)) encArg(cons_isNePal(x_1)) -> isNePal(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode___(x_1, x_2) -> __(encArg(x_1), encArg(x_2)) encode_mark(x_1) -> mark(encArg(x_1)) encode_nil -> nil encode_U11(x_1) -> U11(encArg(x_1)) encode_tt -> tt encode_U21(x_1, x_2) -> U21(encArg(x_1), encArg(x_2)) encode_U22(x_1) -> U22(encArg(x_1)) encode_isList(x_1) -> isList(encArg(x_1)) encode_U31(x_1) -> U31(encArg(x_1)) encode_U41(x_1, x_2) -> U41(encArg(x_1), encArg(x_2)) encode_U42(x_1) -> U42(encArg(x_1)) encode_isNeList(x_1) -> isNeList(encArg(x_1)) encode_U51(x_1, x_2) -> U51(encArg(x_1), encArg(x_2)) encode_U52(x_1) -> U52(encArg(x_1)) encode_U61(x_1) -> U61(encArg(x_1)) encode_U71(x_1, x_2) -> U71(encArg(x_1), encArg(x_2)) encode_U72(x_1) -> U72(encArg(x_1)) encode_isPal(x_1) -> isPal(encArg(x_1)) encode_U81(x_1) -> U81(encArg(x_1)) encode_isQid(x_1) -> isQid(encArg(x_1)) encode_isNePal(x_1) -> isNePal(encArg(x_1)) encode_a -> a encode_e -> e encode_i -> i encode_o -> o encode_u -> u encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: FULL ---------------------------------------- (3) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (4) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(isList(X)) -> isList(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(U61(X)) -> U61(proper(X)) proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) proper(U72(X)) -> U72(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(U81(X)) -> U81(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) U22(ok(X)) -> ok(U22(X)) isList(ok(X)) -> ok(isList(X)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2)) -> ok(U41(X1, X2)) U42(ok(X)) -> ok(U42(X)) isNeList(ok(X)) -> ok(isNeList(X)) U51(ok(X1), ok(X2)) -> ok(U51(X1, X2)) U52(ok(X)) -> ok(U52(X)) U61(ok(X)) -> ok(U61(X)) U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) U72(ok(X)) -> ok(U72(X)) isPal(ok(X)) -> ok(isPal(X)) U81(ok(X)) -> ok(U81(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(nil) -> nil encArg(tt) -> tt encArg(a) -> a encArg(e) -> e encArg(i) -> i encArg(o) -> o encArg(u) -> u encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1)) -> U31(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U42(x_1)) -> U42(encArg(x_1)) encArg(cons_U51(x_1, x_2)) -> U51(encArg(x_1), encArg(x_2)) encArg(cons_U52(x_1)) -> U52(encArg(x_1)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2)) -> U71(encArg(x_1), encArg(x_2)) encArg(cons_U72(x_1)) -> U72(encArg(x_1)) encArg(cons_U81(x_1)) -> U81(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_isList(x_1)) -> isList(encArg(x_1)) encArg(cons_isNeList(x_1)) -> isNeList(encArg(x_1)) encArg(cons_isPal(x_1)) -> isPal(encArg(x_1)) encArg(cons_isQid(x_1)) -> isQid(encArg(x_1)) encArg(cons_isNePal(x_1)) -> isNePal(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode___(x_1, x_2) -> __(encArg(x_1), encArg(x_2)) encode_mark(x_1) -> mark(encArg(x_1)) encode_nil -> nil encode_U11(x_1) -> U11(encArg(x_1)) encode_tt -> tt encode_U21(x_1, x_2) -> U21(encArg(x_1), encArg(x_2)) encode_U22(x_1) -> U22(encArg(x_1)) encode_isList(x_1) -> isList(encArg(x_1)) encode_U31(x_1) -> U31(encArg(x_1)) encode_U41(x_1, x_2) -> U41(encArg(x_1), encArg(x_2)) encode_U42(x_1) -> U42(encArg(x_1)) encode_isNeList(x_1) -> isNeList(encArg(x_1)) encode_U51(x_1, x_2) -> U51(encArg(x_1), encArg(x_2)) encode_U52(x_1) -> U52(encArg(x_1)) encode_U61(x_1) -> U61(encArg(x_1)) encode_U71(x_1, x_2) -> U71(encArg(x_1), encArg(x_2)) encode_U72(x_1) -> U72(encArg(x_1)) encode_isPal(x_1) -> isPal(encArg(x_1)) encode_U81(x_1) -> U81(encArg(x_1)) encode_isQid(x_1) -> isQid(encArg(x_1)) encode_isNePal(x_1) -> isNePal(encArg(x_1)) encode_a -> a encode_e -> e encode_i -> i encode_o -> o encode_u -> u encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: FULL ---------------------------------------- (5) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (6) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(isList(X)) -> isList(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(U61(X)) -> U61(proper(X)) proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) proper(U72(X)) -> U72(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(U81(X)) -> U81(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) U22(ok(X)) -> ok(U22(X)) isList(ok(X)) -> ok(isList(X)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2)) -> ok(U41(X1, X2)) U42(ok(X)) -> ok(U42(X)) isNeList(ok(X)) -> ok(isNeList(X)) U51(ok(X1), ok(X2)) -> ok(U51(X1, X2)) U52(ok(X)) -> ok(U52(X)) U61(ok(X)) -> ok(U61(X)) U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) U72(ok(X)) -> ok(U72(X)) isPal(ok(X)) -> ok(isPal(X)) U81(ok(X)) -> ok(U81(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(nil) -> nil encArg(tt) -> tt encArg(a) -> a encArg(e) -> e encArg(i) -> i encArg(o) -> o encArg(u) -> u encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1)) -> U31(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U42(x_1)) -> U42(encArg(x_1)) encArg(cons_U51(x_1, x_2)) -> U51(encArg(x_1), encArg(x_2)) encArg(cons_U52(x_1)) -> U52(encArg(x_1)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2)) -> U71(encArg(x_1), encArg(x_2)) encArg(cons_U72(x_1)) -> U72(encArg(x_1)) encArg(cons_U81(x_1)) -> U81(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_isList(x_1)) -> isList(encArg(x_1)) encArg(cons_isNeList(x_1)) -> isNeList(encArg(x_1)) encArg(cons_isPal(x_1)) -> isPal(encArg(x_1)) encArg(cons_isQid(x_1)) -> isQid(encArg(x_1)) encArg(cons_isNePal(x_1)) -> isNePal(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode___(x_1, x_2) -> __(encArg(x_1), encArg(x_2)) encode_mark(x_1) -> mark(encArg(x_1)) encode_nil -> nil encode_U11(x_1) -> U11(encArg(x_1)) encode_tt -> tt encode_U21(x_1, x_2) -> U21(encArg(x_1), encArg(x_2)) encode_U22(x_1) -> U22(encArg(x_1)) encode_isList(x_1) -> isList(encArg(x_1)) encode_U31(x_1) -> U31(encArg(x_1)) encode_U41(x_1, x_2) -> U41(encArg(x_1), encArg(x_2)) encode_U42(x_1) -> U42(encArg(x_1)) encode_isNeList(x_1) -> isNeList(encArg(x_1)) encode_U51(x_1, x_2) -> U51(encArg(x_1), encArg(x_2)) encode_U52(x_1) -> U52(encArg(x_1)) encode_U61(x_1) -> U61(encArg(x_1)) encode_U71(x_1, x_2) -> U71(encArg(x_1), encArg(x_2)) encode_U72(x_1) -> U72(encArg(x_1)) encode_isPal(x_1) -> isPal(encArg(x_1)) encode_U81(x_1) -> U81(encArg(x_1)) encode_isQid(x_1) -> isQid(encArg(x_1)) encode_isNePal(x_1) -> isNePal(encArg(x_1)) encode_a -> a encode_e -> e encode_i -> i encode_o -> o encode_u -> u encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: FULL ---------------------------------------- (7) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence U31(ok(X)) ->^+ ok(U31(X)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [X / ok(X)]. The result substitution is [ ]. ---------------------------------------- (8) Complex Obligation (BEST) ---------------------------------------- (9) Obligation: Proved the lower bound n^1 for the following obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(isList(X)) -> isList(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(U61(X)) -> U61(proper(X)) proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) proper(U72(X)) -> U72(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(U81(X)) -> U81(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) U22(ok(X)) -> ok(U22(X)) isList(ok(X)) -> ok(isList(X)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2)) -> ok(U41(X1, X2)) U42(ok(X)) -> ok(U42(X)) isNeList(ok(X)) -> ok(isNeList(X)) U51(ok(X1), ok(X2)) -> ok(U51(X1, X2)) U52(ok(X)) -> ok(U52(X)) U61(ok(X)) -> ok(U61(X)) U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) U72(ok(X)) -> ok(U72(X)) isPal(ok(X)) -> ok(isPal(X)) U81(ok(X)) -> ok(U81(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(nil) -> nil encArg(tt) -> tt encArg(a) -> a encArg(e) -> e encArg(i) -> i encArg(o) -> o encArg(u) -> u encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1)) -> U31(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U42(x_1)) -> U42(encArg(x_1)) encArg(cons_U51(x_1, x_2)) -> U51(encArg(x_1), encArg(x_2)) encArg(cons_U52(x_1)) -> U52(encArg(x_1)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2)) -> U71(encArg(x_1), encArg(x_2)) encArg(cons_U72(x_1)) -> U72(encArg(x_1)) encArg(cons_U81(x_1)) -> U81(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_isList(x_1)) -> isList(encArg(x_1)) encArg(cons_isNeList(x_1)) -> isNeList(encArg(x_1)) encArg(cons_isPal(x_1)) -> isPal(encArg(x_1)) encArg(cons_isQid(x_1)) -> isQid(encArg(x_1)) encArg(cons_isNePal(x_1)) -> isNePal(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode___(x_1, x_2) -> __(encArg(x_1), encArg(x_2)) encode_mark(x_1) -> mark(encArg(x_1)) encode_nil -> nil encode_U11(x_1) -> U11(encArg(x_1)) encode_tt -> tt encode_U21(x_1, x_2) -> U21(encArg(x_1), encArg(x_2)) encode_U22(x_1) -> U22(encArg(x_1)) encode_isList(x_1) -> isList(encArg(x_1)) encode_U31(x_1) -> U31(encArg(x_1)) encode_U41(x_1, x_2) -> U41(encArg(x_1), encArg(x_2)) encode_U42(x_1) -> U42(encArg(x_1)) encode_isNeList(x_1) -> isNeList(encArg(x_1)) encode_U51(x_1, x_2) -> U51(encArg(x_1), encArg(x_2)) encode_U52(x_1) -> U52(encArg(x_1)) encode_U61(x_1) -> U61(encArg(x_1)) encode_U71(x_1, x_2) -> U71(encArg(x_1), encArg(x_2)) encode_U72(x_1) -> U72(encArg(x_1)) encode_isPal(x_1) -> isPal(encArg(x_1)) encode_U81(x_1) -> U81(encArg(x_1)) encode_isQid(x_1) -> isQid(encArg(x_1)) encode_isNePal(x_1) -> isNePal(encArg(x_1)) encode_a -> a encode_e -> e encode_i -> i encode_o -> o encode_u -> u encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: FULL ---------------------------------------- (10) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (11) BOUNDS(n^1, INF) ---------------------------------------- (12) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X)) -> U61(active(X)) active(U71(X1, X2)) -> U71(active(X1), X2) active(U72(X)) -> U72(active(X)) active(U81(X)) -> U81(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X)) -> mark(U61(X)) U71(mark(X1), X2) -> mark(U71(X1, X2)) U72(mark(X)) -> mark(U72(X)) U81(mark(X)) -> mark(U81(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(isList(X)) -> isList(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNeList(X)) -> isNeList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(U61(X)) -> U61(proper(X)) proper(U71(X1, X2)) -> U71(proper(X1), proper(X2)) proper(U72(X)) -> U72(proper(X)) proper(isPal(X)) -> isPal(proper(X)) proper(U81(X)) -> U81(proper(X)) proper(isQid(X)) -> isQid(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) proper(a) -> ok(a) proper(e) -> ok(e) proper(i) -> ok(i) proper(o) -> ok(o) proper(u) -> ok(u) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X1), ok(X2)) -> ok(U21(X1, X2)) U22(ok(X)) -> ok(U22(X)) isList(ok(X)) -> ok(isList(X)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2)) -> ok(U41(X1, X2)) U42(ok(X)) -> ok(U42(X)) isNeList(ok(X)) -> ok(isNeList(X)) U51(ok(X1), ok(X2)) -> ok(U51(X1, X2)) U52(ok(X)) -> ok(U52(X)) U61(ok(X)) -> ok(U61(X)) U71(ok(X1), ok(X2)) -> ok(U71(X1, X2)) U72(ok(X)) -> ok(U72(X)) isPal(ok(X)) -> ok(isPal(X)) U81(ok(X)) -> ok(U81(X)) isQid(ok(X)) -> ok(isQid(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(nil) -> nil encArg(tt) -> tt encArg(a) -> a encArg(e) -> e encArg(i) -> i encArg(o) -> o encArg(u) -> u encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1)) -> U31(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U42(x_1)) -> U42(encArg(x_1)) encArg(cons_U51(x_1, x_2)) -> U51(encArg(x_1), encArg(x_2)) encArg(cons_U52(x_1)) -> U52(encArg(x_1)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2)) -> U71(encArg(x_1), encArg(x_2)) encArg(cons_U72(x_1)) -> U72(encArg(x_1)) encArg(cons_U81(x_1)) -> U81(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_isList(x_1)) -> isList(encArg(x_1)) encArg(cons_isNeList(x_1)) -> isNeList(encArg(x_1)) encArg(cons_isPal(x_1)) -> isPal(encArg(x_1)) encArg(cons_isQid(x_1)) -> isQid(encArg(x_1)) encArg(cons_isNePal(x_1)) -> isNePal(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode___(x_1, x_2) -> __(encArg(x_1), encArg(x_2)) encode_mark(x_1) -> mark(encArg(x_1)) encode_nil -> nil encode_U11(x_1) -> U11(encArg(x_1)) encode_tt -> tt encode_U21(x_1, x_2) -> U21(encArg(x_1), encArg(x_2)) encode_U22(x_1) -> U22(encArg(x_1)) encode_isList(x_1) -> isList(encArg(x_1)) encode_U31(x_1) -> U31(encArg(x_1)) encode_U41(x_1, x_2) -> U41(encArg(x_1), encArg(x_2)) encode_U42(x_1) -> U42(encArg(x_1)) encode_isNeList(x_1) -> isNeList(encArg(x_1)) encode_U51(x_1, x_2) -> U51(encArg(x_1), encArg(x_2)) encode_U52(x_1) -> U52(encArg(x_1)) encode_U61(x_1) -> U61(encArg(x_1)) encode_U71(x_1, x_2) -> U71(encArg(x_1), encArg(x_2)) encode_U72(x_1) -> U72(encArg(x_1)) encode_isPal(x_1) -> isPal(encArg(x_1)) encode_U81(x_1) -> U81(encArg(x_1)) encode_isQid(x_1) -> isQid(encArg(x_1)) encode_isNePal(x_1) -> isNePal(encArg(x_1)) encode_a -> a encode_e -> e encode_i -> i encode_o -> o encode_u -> u encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: FULL