WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(1, n^1). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 52 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 56 ms] (8) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: 0(0(1(2(1(x1))))) -> 0(2(3(4(x1)))) 1(4(5(3(2(x1))))) -> 1(5(0(5(x1)))) 3(0(2(3(0(x1))))) -> 5(0(2(1(1(x1))))) 0(1(5(2(3(2(x1)))))) -> 0(5(3(1(3(2(x1)))))) 1(3(0(4(1(4(x1)))))) -> 1(2(0(1(2(x1))))) 3(5(4(4(1(1(x1)))))) -> 0(2(3(0(4(x1))))) 4(5(5(4(5(5(x1)))))) -> 4(3(1(5(1(5(x1)))))) 1(3(2(5(2(3(1(x1))))))) -> 1(0(5(1(3(4(x1)))))) 3(2(1(2(5(4(3(1(x1)))))))) -> 2(5(0(4(4(3(5(x1))))))) 2(4(2(3(0(3(4(5(2(x1))))))))) -> 2(4(0(0(0(0(0(5(2(x1))))))))) 3(4(2(4(0(2(1(0(2(x1))))))))) -> 3(1(0(5(0(5(0(1(x1)))))))) 2(4(2(0(3(4(0(3(3(1(x1)))))))))) -> 3(5(2(0(5(3(3(2(2(x1))))))))) 0(0(4(2(0(3(4(5(2(0(0(0(0(0(x1)))))))))))))) -> 2(4(1(2(4(4(3(2(5(2(3(5(5(0(x1)))))))))))))) 3(2(3(2(2(0(4(5(0(3(5(3(4(4(5(x1))))))))))))))) -> 5(2(3(5(2(1(4(4(1(5(5(3(0(1(4(2(x1)))))))))))))))) 2(4(0(1(1(5(0(2(0(5(2(3(5(4(0(2(x1)))))))))))))))) -> 5(0(2(0(2(0(2(5(4(0(0(5(5(2(0(x1))))))))))))))) 3(0(4(5(3(5(0(3(5(2(3(1(5(4(2(1(x1)))))))))))))))) -> 2(5(3(3(2(3(0(2(5(4(0(2(4(5(2(1(x1)))))))))))))))) 3(5(3(2(4(3(3(1(0(0(5(4(0(2(1(1(x1)))))))))))))))) -> 3(5(3(3(3(2(5(4(1(5(5(1(3(5(1(x1))))))))))))))) 3(1(5(3(2(4(2(2(4(3(4(2(3(4(5(1(4(4(5(x1))))))))))))))))))) -> 3(4(3(2(2(4(1(2(1(3(3(0(0(3(3(4(2(4(x1)))))))))))))))))) 4(5(3(3(0(5(2(0(3(5(0(3(3(2(3(1(3(3(4(x1))))))))))))))))))) -> 4(0(4(1(5(1(4(2(4(2(5(4(1(2(5(2(1(2(5(2(2(x1))))))))))))))))))))) 0(3(5(0(0(0(4(1(2(1(3(5(5(5(0(3(5(0(3(4(x1)))))))))))))))))))) -> 0(3(5(3(3(2(4(5(5(4(0(2(3(0(2(5(2(4(3(4(x1)))))))))))))))))))) 0(4(2(4(3(5(4(2(5(1(4(3(2(5(3(5(4(2(3(0(x1)))))))))))))))))))) -> 5(2(3(3(4(1(5(3(2(2(3(5(1(1(1(2(1(2(2(1(x1)))))))))))))))))))) 2(2(2(3(5(5(2(1(4(1(2(2(1(5(2(1(1(0(2(2(x1)))))))))))))))))))) -> 2(3(2(3(2(5(4(2(0(3(2(0(2(4(5(2(4(4(x1)))))))))))))))))) 3(3(2(0(2(2(5(3(2(3(3(1(3(5(5(1(3(0(2(1(x1)))))))))))))))))))) -> 3(0(5(1(1(3(2(1(2(5(5(4(3(4(3(0(5(5(3(4(x1)))))))))))))))))))) 0(4(5(4(0(3(1(4(4(0(3(4(2(5(4(1(0(0(5(1(2(x1))))))))))))))))))))) -> 3(5(4(4(4(5(5(0(2(4(4(1(5(2(1(2(5(2(5(2(2(x1))))))))))))))))))))) 4(4(1(5(4(1(1(2(1(5(1(1(4(4(2(2(4(2(4(5(3(x1))))))))))))))))))))) -> 0(3(2(3(2(0(3(2(1(1(4(5(2(2(0(1(1(2(3(x1))))))))))))))))))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (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(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_1(x_1)) -> 1(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_3(x_1) -> 3(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: 0(0(1(2(1(x1))))) -> 0(2(3(4(x1)))) 1(4(5(3(2(x1))))) -> 1(5(0(5(x1)))) 3(0(2(3(0(x1))))) -> 5(0(2(1(1(x1))))) 0(1(5(2(3(2(x1)))))) -> 0(5(3(1(3(2(x1)))))) 1(3(0(4(1(4(x1)))))) -> 1(2(0(1(2(x1))))) 3(5(4(4(1(1(x1)))))) -> 0(2(3(0(4(x1))))) 4(5(5(4(5(5(x1)))))) -> 4(3(1(5(1(5(x1)))))) 1(3(2(5(2(3(1(x1))))))) -> 1(0(5(1(3(4(x1)))))) 3(2(1(2(5(4(3(1(x1)))))))) -> 2(5(0(4(4(3(5(x1))))))) 2(4(2(3(0(3(4(5(2(x1))))))))) -> 2(4(0(0(0(0(0(5(2(x1))))))))) 3(4(2(4(0(2(1(0(2(x1))))))))) -> 3(1(0(5(0(5(0(1(x1)))))))) 2(4(2(0(3(4(0(3(3(1(x1)))))))))) -> 3(5(2(0(5(3(3(2(2(x1))))))))) 0(0(4(2(0(3(4(5(2(0(0(0(0(0(x1)))))))))))))) -> 2(4(1(2(4(4(3(2(5(2(3(5(5(0(x1)))))))))))))) 3(2(3(2(2(0(4(5(0(3(5(3(4(4(5(x1))))))))))))))) -> 5(2(3(5(2(1(4(4(1(5(5(3(0(1(4(2(x1)))))))))))))))) 2(4(0(1(1(5(0(2(0(5(2(3(5(4(0(2(x1)))))))))))))))) -> 5(0(2(0(2(0(2(5(4(0(0(5(5(2(0(x1))))))))))))))) 3(0(4(5(3(5(0(3(5(2(3(1(5(4(2(1(x1)))))))))))))))) -> 2(5(3(3(2(3(0(2(5(4(0(2(4(5(2(1(x1)))))))))))))))) 3(5(3(2(4(3(3(1(0(0(5(4(0(2(1(1(x1)))))))))))))))) -> 3(5(3(3(3(2(5(4(1(5(5(1(3(5(1(x1))))))))))))))) 3(1(5(3(2(4(2(2(4(3(4(2(3(4(5(1(4(4(5(x1))))))))))))))))))) -> 3(4(3(2(2(4(1(2(1(3(3(0(0(3(3(4(2(4(x1)))))))))))))))))) 4(5(3(3(0(5(2(0(3(5(0(3(3(2(3(1(3(3(4(x1))))))))))))))))))) -> 4(0(4(1(5(1(4(2(4(2(5(4(1(2(5(2(1(2(5(2(2(x1))))))))))))))))))))) 0(3(5(0(0(0(4(1(2(1(3(5(5(5(0(3(5(0(3(4(x1)))))))))))))))))))) -> 0(3(5(3(3(2(4(5(5(4(0(2(3(0(2(5(2(4(3(4(x1)))))))))))))))))))) 0(4(2(4(3(5(4(2(5(1(4(3(2(5(3(5(4(2(3(0(x1)))))))))))))))))))) -> 5(2(3(3(4(1(5(3(2(2(3(5(1(1(1(2(1(2(2(1(x1)))))))))))))))))))) 2(2(2(3(5(5(2(1(4(1(2(2(1(5(2(1(1(0(2(2(x1)))))))))))))))))))) -> 2(3(2(3(2(5(4(2(0(3(2(0(2(4(5(2(4(4(x1)))))))))))))))))) 3(3(2(0(2(2(5(3(2(3(3(1(3(5(5(1(3(0(2(1(x1)))))))))))))))))))) -> 3(0(5(1(1(3(2(1(2(5(5(4(3(4(3(0(5(5(3(4(x1)))))))))))))))))))) 0(4(5(4(0(3(1(4(4(0(3(4(2(5(4(1(0(0(5(1(2(x1))))))))))))))))))))) -> 3(5(4(4(4(5(5(0(2(4(4(1(5(2(1(2(5(2(5(2(2(x1))))))))))))))))))))) 4(4(1(5(4(1(1(2(1(5(1(1(4(4(2(2(4(2(4(5(3(x1))))))))))))))))))))) -> 0(3(2(3(2(0(3(2(1(1(4(5(2(2(0(1(1(2(3(x1))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_1(x_1)) -> 1(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_3(x_1) -> 3(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) Rewrite Strategy: INNERMOST ---------------------------------------- (3) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (4) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: 0(0(1(2(1(x1))))) -> 0(2(3(4(x1)))) 1(4(5(3(2(x1))))) -> 1(5(0(5(x1)))) 3(0(2(3(0(x1))))) -> 5(0(2(1(1(x1))))) 0(1(5(2(3(2(x1)))))) -> 0(5(3(1(3(2(x1)))))) 1(3(0(4(1(4(x1)))))) -> 1(2(0(1(2(x1))))) 3(5(4(4(1(1(x1)))))) -> 0(2(3(0(4(x1))))) 4(5(5(4(5(5(x1)))))) -> 4(3(1(5(1(5(x1)))))) 1(3(2(5(2(3(1(x1))))))) -> 1(0(5(1(3(4(x1)))))) 3(2(1(2(5(4(3(1(x1)))))))) -> 2(5(0(4(4(3(5(x1))))))) 2(4(2(3(0(3(4(5(2(x1))))))))) -> 2(4(0(0(0(0(0(5(2(x1))))))))) 3(4(2(4(0(2(1(0(2(x1))))))))) -> 3(1(0(5(0(5(0(1(x1)))))))) 2(4(2(0(3(4(0(3(3(1(x1)))))))))) -> 3(5(2(0(5(3(3(2(2(x1))))))))) 0(0(4(2(0(3(4(5(2(0(0(0(0(0(x1)))))))))))))) -> 2(4(1(2(4(4(3(2(5(2(3(5(5(0(x1)))))))))))))) 3(2(3(2(2(0(4(5(0(3(5(3(4(4(5(x1))))))))))))))) -> 5(2(3(5(2(1(4(4(1(5(5(3(0(1(4(2(x1)))))))))))))))) 2(4(0(1(1(5(0(2(0(5(2(3(5(4(0(2(x1)))))))))))))))) -> 5(0(2(0(2(0(2(5(4(0(0(5(5(2(0(x1))))))))))))))) 3(0(4(5(3(5(0(3(5(2(3(1(5(4(2(1(x1)))))))))))))))) -> 2(5(3(3(2(3(0(2(5(4(0(2(4(5(2(1(x1)))))))))))))))) 3(5(3(2(4(3(3(1(0(0(5(4(0(2(1(1(x1)))))))))))))))) -> 3(5(3(3(3(2(5(4(1(5(5(1(3(5(1(x1))))))))))))))) 3(1(5(3(2(4(2(2(4(3(4(2(3(4(5(1(4(4(5(x1))))))))))))))))))) -> 3(4(3(2(2(4(1(2(1(3(3(0(0(3(3(4(2(4(x1)))))))))))))))))) 4(5(3(3(0(5(2(0(3(5(0(3(3(2(3(1(3(3(4(x1))))))))))))))))))) -> 4(0(4(1(5(1(4(2(4(2(5(4(1(2(5(2(1(2(5(2(2(x1))))))))))))))))))))) 0(3(5(0(0(0(4(1(2(1(3(5(5(5(0(3(5(0(3(4(x1)))))))))))))))))))) -> 0(3(5(3(3(2(4(5(5(4(0(2(3(0(2(5(2(4(3(4(x1)))))))))))))))))))) 0(4(2(4(3(5(4(2(5(1(4(3(2(5(3(5(4(2(3(0(x1)))))))))))))))))))) -> 5(2(3(3(4(1(5(3(2(2(3(5(1(1(1(2(1(2(2(1(x1)))))))))))))))))))) 2(2(2(3(5(5(2(1(4(1(2(2(1(5(2(1(1(0(2(2(x1)))))))))))))))))))) -> 2(3(2(3(2(5(4(2(0(3(2(0(2(4(5(2(4(4(x1)))))))))))))))))) 3(3(2(0(2(2(5(3(2(3(3(1(3(5(5(1(3(0(2(1(x1)))))))))))))))))))) -> 3(0(5(1(1(3(2(1(2(5(5(4(3(4(3(0(5(5(3(4(x1)))))))))))))))))))) 0(4(5(4(0(3(1(4(4(0(3(4(2(5(4(1(0(0(5(1(2(x1))))))))))))))))))))) -> 3(5(4(4(4(5(5(0(2(4(4(1(5(2(1(2(5(2(5(2(2(x1))))))))))))))))))))) 4(4(1(5(4(1(1(2(1(5(1(1(4(4(2(2(4(2(4(5(3(x1))))))))))))))))))))) -> 0(3(2(3(2(0(3(2(1(1(4(5(2(2(0(1(1(2(3(x1))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_1(x_1)) -> 1(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_3(x_1) -> 3(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) Rewrite Strategy: INNERMOST ---------------------------------------- (5) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (6) 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: 0(0(1(2(1(x1))))) -> 0(2(3(4(x1)))) 1(4(5(3(2(x1))))) -> 1(5(0(5(x1)))) 3(0(2(3(0(x1))))) -> 5(0(2(1(1(x1))))) 0(1(5(2(3(2(x1)))))) -> 0(5(3(1(3(2(x1)))))) 1(3(0(4(1(4(x1)))))) -> 1(2(0(1(2(x1))))) 3(5(4(4(1(1(x1)))))) -> 0(2(3(0(4(x1))))) 4(5(5(4(5(5(x1)))))) -> 4(3(1(5(1(5(x1)))))) 1(3(2(5(2(3(1(x1))))))) -> 1(0(5(1(3(4(x1)))))) 3(2(1(2(5(4(3(1(x1)))))))) -> 2(5(0(4(4(3(5(x1))))))) 2(4(2(3(0(3(4(5(2(x1))))))))) -> 2(4(0(0(0(0(0(5(2(x1))))))))) 3(4(2(4(0(2(1(0(2(x1))))))))) -> 3(1(0(5(0(5(0(1(x1)))))))) 2(4(2(0(3(4(0(3(3(1(x1)))))))))) -> 3(5(2(0(5(3(3(2(2(x1))))))))) 0(0(4(2(0(3(4(5(2(0(0(0(0(0(x1)))))))))))))) -> 2(4(1(2(4(4(3(2(5(2(3(5(5(0(x1)))))))))))))) 3(2(3(2(2(0(4(5(0(3(5(3(4(4(5(x1))))))))))))))) -> 5(2(3(5(2(1(4(4(1(5(5(3(0(1(4(2(x1)))))))))))))))) 2(4(0(1(1(5(0(2(0(5(2(3(5(4(0(2(x1)))))))))))))))) -> 5(0(2(0(2(0(2(5(4(0(0(5(5(2(0(x1))))))))))))))) 3(0(4(5(3(5(0(3(5(2(3(1(5(4(2(1(x1)))))))))))))))) -> 2(5(3(3(2(3(0(2(5(4(0(2(4(5(2(1(x1)))))))))))))))) 3(5(3(2(4(3(3(1(0(0(5(4(0(2(1(1(x1)))))))))))))))) -> 3(5(3(3(3(2(5(4(1(5(5(1(3(5(1(x1))))))))))))))) 3(1(5(3(2(4(2(2(4(3(4(2(3(4(5(1(4(4(5(x1))))))))))))))))))) -> 3(4(3(2(2(4(1(2(1(3(3(0(0(3(3(4(2(4(x1)))))))))))))))))) 4(5(3(3(0(5(2(0(3(5(0(3(3(2(3(1(3(3(4(x1))))))))))))))))))) -> 4(0(4(1(5(1(4(2(4(2(5(4(1(2(5(2(1(2(5(2(2(x1))))))))))))))))))))) 0(3(5(0(0(0(4(1(2(1(3(5(5(5(0(3(5(0(3(4(x1)))))))))))))))))))) -> 0(3(5(3(3(2(4(5(5(4(0(2(3(0(2(5(2(4(3(4(x1)))))))))))))))))))) 0(4(2(4(3(5(4(2(5(1(4(3(2(5(3(5(4(2(3(0(x1)))))))))))))))))))) -> 5(2(3(3(4(1(5(3(2(2(3(5(1(1(1(2(1(2(2(1(x1)))))))))))))))))))) 2(2(2(3(5(5(2(1(4(1(2(2(1(5(2(1(1(0(2(2(x1)))))))))))))))))))) -> 2(3(2(3(2(5(4(2(0(3(2(0(2(4(5(2(4(4(x1)))))))))))))))))) 3(3(2(0(2(2(5(3(2(3(3(1(3(5(5(1(3(0(2(1(x1)))))))))))))))))))) -> 3(0(5(1(1(3(2(1(2(5(5(4(3(4(3(0(5(5(3(4(x1)))))))))))))))))))) 0(4(5(4(0(3(1(4(4(0(3(4(2(5(4(1(0(0(5(1(2(x1))))))))))))))))))))) -> 3(5(4(4(4(5(5(0(2(4(4(1(5(2(1(2(5(2(5(2(2(x1))))))))))))))))))))) 4(4(1(5(4(1(1(2(1(5(1(1(4(4(2(2(4(2(4(5(3(x1))))))))))))))))))))) -> 0(3(2(3(2(0(3(2(1(1(4(5(2(2(0(1(1(2(3(x1))))))))))))))))))) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_1(x_1)) -> 1(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_3(x_1) -> 3(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (7) CpxTrsMatchBoundsProof (FINISHED) A linear upper bound on the runtime complexity of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 3. The certificate found is represented by the following graph. "[129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417] {(129,130,[0_1|0, 1_1|0, 3_1|0, 4_1|0, 2_1|0, encArg_1|0, encode_0_1|0, encode_1_1|0, encode_2_1|0, encode_3_1|0, encode_4_1|0, encode_5_1|0]), (129,131,[5_1|1, 0_1|1, 1_1|1, 3_1|1, 4_1|1, 2_1|1]), (129,132,[0_1|2]), (129,135,[2_1|2]), (129,148,[0_1|2]), (129,153,[0_1|2]), (129,172,[5_1|2]), (129,191,[3_1|2]), (129,211,[1_1|2]), (129,214,[1_1|2]), (129,218,[1_1|2]), (129,223,[5_1|2]), (129,227,[2_1|2]), (129,242,[0_1|2]), (129,246,[3_1|2]), (129,260,[2_1|2]), (129,266,[5_1|2]), (129,281,[3_1|2]), (129,288,[3_1|2]), (129,305,[3_1|2]), (129,324,[4_1|2]), (129,329,[4_1|2]), (129,349,[0_1|2]), (129,367,[2_1|2]), (129,375,[3_1|2]), (129,383,[5_1|2]), (129,397,[2_1|2]), (130,130,[5_1|0, cons_0_1|0, cons_1_1|0, cons_3_1|0, cons_4_1|0, cons_2_1|0]), (131,130,[encArg_1|1]), (131,131,[5_1|1, 0_1|1, 1_1|1, 3_1|1, 4_1|1, 2_1|1]), (131,132,[0_1|2]), (131,135,[2_1|2]), (131,148,[0_1|2]), (131,153,[0_1|2]), (131,172,[5_1|2]), (131,191,[3_1|2]), (131,211,[1_1|2]), (131,214,[1_1|2]), (131,218,[1_1|2]), (131,223,[5_1|2]), (131,227,[2_1|2]), (131,242,[0_1|2]), (131,246,[3_1|2]), (131,260,[2_1|2]), (131,266,[5_1|2]), (131,281,[3_1|2]), (131,288,[3_1|2]), (131,305,[3_1|2]), (131,324,[4_1|2]), (131,329,[4_1|2]), (131,349,[0_1|2]), (131,367,[2_1|2]), (131,375,[3_1|2]), (131,383,[5_1|2]), (131,397,[2_1|2]), (132,133,[2_1|2]), (133,134,[3_1|2]), (133,281,[3_1|2]), (134,131,[4_1|2]), (134,211,[4_1|2]), (134,214,[4_1|2]), (134,218,[4_1|2]), (134,324,[4_1|2]), (134,329,[4_1|2]), (134,349,[0_1|2]), (135,136,[4_1|2]), (136,137,[1_1|2]), (137,138,[2_1|2]), (138,139,[4_1|2]), (139,140,[4_1|2]), (140,141,[3_1|2]), (141,142,[2_1|2]), (142,143,[5_1|2]), (143,144,[2_1|2]), (144,145,[3_1|2]), (145,146,[5_1|2]), (146,147,[5_1|2]), (147,131,[0_1|2]), (147,132,[0_1|2]), (147,148,[0_1|2]), (147,153,[0_1|2]), (147,242,[0_1|2]), (147,349,[0_1|2]), (147,135,[2_1|2]), (147,172,[5_1|2]), (147,191,[3_1|2]), (148,149,[5_1|2]), (149,150,[3_1|2]), (150,151,[1_1|2]), (150,218,[1_1|2]), (151,152,[3_1|2]), (151,260,[2_1|2]), (151,266,[5_1|2]), (152,131,[2_1|2]), (152,135,[2_1|2]), (152,227,[2_1|2]), (152,260,[2_1|2]), (152,367,[2_1|2]), (152,397,[2_1|2]), (152,399,[2_1|2]), (152,375,[3_1|2]), (152,383,[5_1|2]), (153,154,[3_1|2]), (154,155,[5_1|2]), (155,156,[3_1|2]), (156,157,[3_1|2]), (157,158,[2_1|2]), (158,159,[4_1|2]), (159,160,[5_1|2]), (160,161,[5_1|2]), (161,162,[4_1|2]), (162,163,[0_1|2]), (163,164,[2_1|2]), (164,165,[3_1|2]), (165,166,[0_1|2]), (166,167,[2_1|2]), (167,168,[5_1|2]), (168,169,[2_1|2]), (169,170,[4_1|2]), (170,171,[3_1|2]), (170,281,[3_1|2]), (171,131,[4_1|2]), (171,324,[4_1|2]), (171,329,[4_1|2]), (171,289,[4_1|2]), (171,349,[0_1|2]), (172,173,[2_1|2]), (173,174,[3_1|2]), (174,175,[3_1|2]), (175,176,[4_1|2]), (176,177,[1_1|2]), (177,178,[5_1|2]), (178,179,[3_1|2]), (179,180,[2_1|2]), (180,181,[2_1|2]), (181,182,[3_1|2]), (182,183,[5_1|2]), (183,184,[1_1|2]), (184,185,[1_1|2]), (185,186,[1_1|2]), (186,187,[2_1|2]), (187,188,[1_1|2]), (188,189,[2_1|2]), (189,190,[2_1|2]), (190,131,[1_1|2]), (190,132,[1_1|2]), (190,148,[1_1|2]), (190,153,[1_1|2]), (190,242,[1_1|2]), (190,349,[1_1|2]), (190,306,[1_1|2]), (190,211,[1_1|2]), (190,214,[1_1|2]), (190,218,[1_1|2]), (191,192,[5_1|2]), (192,193,[4_1|2]), (193,194,[4_1|2]), (194,195,[4_1|2]), (195,196,[5_1|2]), (196,197,[5_1|2]), (197,198,[0_1|2]), (198,199,[2_1|2]), (199,200,[4_1|2]), (200,201,[4_1|2]), (201,202,[1_1|2]), (202,203,[5_1|2]), (203,204,[2_1|2]), (204,205,[1_1|2]), (205,206,[2_1|2]), (206,207,[5_1|2]), (207,208,[2_1|2]), (208,209,[5_1|2]), (209,210,[2_1|2]), (209,397,[2_1|2]), (210,131,[2_1|2]), (210,135,[2_1|2]), (210,227,[2_1|2]), (210,260,[2_1|2]), (210,367,[2_1|2]), (210,397,[2_1|2]), (210,215,[2_1|2]), (210,375,[3_1|2]), (210,383,[5_1|2]), (211,212,[5_1|2]), (212,213,[0_1|2]), (213,131,[5_1|2]), (213,135,[5_1|2]), (213,227,[5_1|2]), (213,260,[5_1|2]), (213,367,[5_1|2]), (213,397,[5_1|2]), (214,215,[2_1|2]), (215,216,[0_1|2]), (216,217,[1_1|2]), (217,131,[2_1|2]), (217,324,[2_1|2]), (217,329,[2_1|2]), (217,367,[2_1|2]), (217,375,[3_1|2]), (217,383,[5_1|2]), (217,397,[2_1|2]), (218,219,[0_1|2]), (219,220,[5_1|2]), (220,221,[1_1|2]), (221,222,[3_1|2]), (221,281,[3_1|2]), (222,131,[4_1|2]), (222,211,[4_1|2]), (222,214,[4_1|2]), (222,218,[4_1|2]), (222,282,[4_1|2]), (222,324,[4_1|2]), (222,329,[4_1|2]), (222,349,[0_1|2]), (223,224,[0_1|2]), (224,225,[2_1|2]), (225,226,[1_1|2]), (226,131,[1_1|2]), (226,132,[1_1|2]), (226,148,[1_1|2]), (226,153,[1_1|2]), (226,242,[1_1|2]), (226,349,[1_1|2]), (226,306,[1_1|2]), (226,245,[1_1|2]), (226,211,[1_1|2]), (226,214,[1_1|2]), (226,218,[1_1|2]), (227,228,[5_1|2]), (228,229,[3_1|2]), (229,230,[3_1|2]), (230,231,[2_1|2]), (231,232,[3_1|2]), (232,233,[0_1|2]), (233,234,[2_1|2]), (234,235,[5_1|2]), (235,236,[4_1|2]), (236,237,[0_1|2]), (237,238,[2_1|2]), (238,239,[4_1|2]), (239,240,[5_1|2]), (240,241,[2_1|2]), (241,131,[1_1|2]), (241,211,[1_1|2]), (241,214,[1_1|2]), (241,218,[1_1|2]), (242,243,[2_1|2]), (243,244,[3_1|2]), (243,227,[2_1|2]), (244,245,[0_1|2]), (244,172,[5_1|2]), (244,191,[3_1|2]), (245,131,[4_1|2]), (245,211,[4_1|2]), (245,214,[4_1|2]), (245,218,[4_1|2]), (245,324,[4_1|2]), (245,329,[4_1|2]), (245,349,[0_1|2]), (246,247,[5_1|2]), (247,248,[3_1|2]), (248,249,[3_1|2]), (249,250,[3_1|2]), (250,251,[2_1|2]), (251,252,[5_1|2]), (252,253,[4_1|2]), (253,254,[1_1|2]), (254,255,[5_1|2]), (255,256,[5_1|2]), (256,257,[1_1|2]), (257,258,[3_1|2]), (258,259,[5_1|2]), (259,131,[1_1|2]), (259,211,[1_1|2]), (259,214,[1_1|2]), (259,218,[1_1|2]), (260,261,[5_1|2]), (261,262,[0_1|2]), (262,263,[4_1|2]), (263,264,[4_1|2]), (264,265,[3_1|2]), (264,242,[0_1|2]), (264,246,[3_1|2]), (265,131,[5_1|2]), (265,211,[5_1|2]), (265,214,[5_1|2]), (265,218,[5_1|2]), (265,282,[5_1|2]), (265,326,[5_1|2]), (266,267,[2_1|2]), (267,268,[3_1|2]), (268,269,[5_1|2]), (269,270,[2_1|2]), (270,271,[1_1|2]), (271,272,[4_1|2]), (272,273,[4_1|2]), (273,274,[1_1|2]), (274,275,[5_1|2]), (275,276,[5_1|2]), (276,277,[3_1|2]), (277,278,[0_1|2]), (278,279,[1_1|2]), (279,280,[4_1|2]), (280,131,[2_1|2]), (280,172,[2_1|2]), (280,223,[2_1|2]), (280,266,[2_1|2]), (280,383,[2_1|2, 5_1|2]), (280,367,[2_1|2]), (280,375,[3_1|2]), (280,397,[2_1|2]), (281,282,[1_1|2]), (282,283,[0_1|2]), (283,284,[5_1|2]), (284,285,[0_1|2]), (285,286,[5_1|2]), (286,287,[0_1|2]), (286,148,[0_1|2]), (287,131,[1_1|2]), (287,135,[1_1|2]), (287,227,[1_1|2]), (287,260,[1_1|2]), (287,367,[1_1|2]), (287,397,[1_1|2]), (287,133,[1_1|2]), (287,243,[1_1|2]), (287,211,[1_1|2]), (287,214,[1_1|2]), (287,218,[1_1|2]), (288,289,[4_1|2]), (289,290,[3_1|2]), (290,291,[2_1|2]), (291,292,[2_1|2]), (292,293,[4_1|2]), (293,294,[1_1|2]), (294,295,[2_1|2]), (295,296,[1_1|2]), (296,297,[3_1|2]), (297,298,[3_1|2]), (298,299,[0_1|2]), (299,300,[0_1|2]), (300,301,[3_1|2]), (301,302,[3_1|2]), (301,281,[3_1|2]), (302,303,[4_1|2]), (303,304,[2_1|2]), (303,367,[2_1|2]), (303,375,[3_1|2]), (303,383,[5_1|2]), (304,131,[4_1|2]), (304,172,[4_1|2]), (304,223,[4_1|2]), (304,266,[4_1|2]), (304,383,[4_1|2]), (304,324,[4_1|2]), (304,329,[4_1|2]), (304,349,[0_1|2]), (305,306,[0_1|2]), (306,307,[5_1|2]), (307,308,[1_1|2]), (308,309,[1_1|2]), (309,310,[3_1|2]), (310,311,[2_1|2]), (311,312,[1_1|2]), (312,313,[2_1|2]), (313,314,[5_1|2]), (314,315,[5_1|2]), (315,316,[4_1|2]), (316,317,[3_1|2]), (317,318,[4_1|2]), (318,319,[3_1|2]), (319,320,[0_1|2]), (320,321,[5_1|2]), (321,322,[5_1|2]), (322,323,[3_1|2]), (322,281,[3_1|2]), (323,131,[4_1|2]), (323,211,[4_1|2]), (323,214,[4_1|2]), (323,218,[4_1|2]), (323,324,[4_1|2]), (323,329,[4_1|2]), (323,349,[0_1|2]), (324,325,[3_1|2]), (325,326,[1_1|2]), (326,327,[5_1|2]), (327,328,[1_1|2]), (328,131,[5_1|2]), (328,172,[5_1|2]), (328,223,[5_1|2]), (328,266,[5_1|2]), (328,383,[5_1|2]), (329,330,[0_1|2]), (330,331,[4_1|2]), (331,332,[1_1|2]), (332,333,[5_1|2]), (333,334,[1_1|2]), (334,335,[4_1|2]), (335,336,[2_1|2]), (336,337,[4_1|2]), (337,338,[2_1|2]), (338,339,[5_1|2]), (339,340,[4_1|2]), (340,341,[1_1|2]), (341,342,[2_1|2]), (342,343,[5_1|2]), (343,344,[2_1|2]), (344,345,[1_1|2]), (345,346,[2_1|2]), (346,347,[5_1|2]), (347,348,[2_1|2]), (347,397,[2_1|2]), (348,131,[2_1|2]), (348,324,[2_1|2]), (348,329,[2_1|2]), (348,289,[2_1|2]), (348,367,[2_1|2]), (348,375,[3_1|2]), (348,383,[5_1|2]), (348,397,[2_1|2]), (349,350,[3_1|2]), (350,351,[2_1|2]), (351,352,[3_1|2]), (352,353,[2_1|2]), (353,354,[0_1|2]), (354,355,[3_1|2]), (355,356,[2_1|2]), (356,357,[1_1|2]), (357,358,[1_1|2]), (358,359,[4_1|2]), (359,360,[5_1|2]), (360,361,[2_1|2]), (361,362,[2_1|2]), (362,363,[0_1|2]), (363,364,[1_1|2]), (364,365,[1_1|2]), (365,366,[2_1|2]), (366,131,[3_1|2]), (366,191,[3_1|2]), (366,246,[3_1|2]), (366,281,[3_1|2]), (366,288,[3_1|2]), (366,305,[3_1|2]), (366,375,[3_1|2]), (366,223,[5_1|2]), (366,227,[2_1|2]), (366,242,[0_1|2]), (366,260,[2_1|2]), (366,266,[5_1|2]), (366,414,[5_1|3]), (367,368,[4_1|2]), (368,369,[0_1|2]), (369,370,[0_1|2]), (370,371,[0_1|2]), (371,372,[0_1|2]), (372,373,[0_1|2]), (373,374,[5_1|2]), (374,131,[2_1|2]), (374,135,[2_1|2]), (374,227,[2_1|2]), (374,260,[2_1|2]), (374,367,[2_1|2]), (374,397,[2_1|2]), (374,173,[2_1|2]), (374,267,[2_1|2]), (374,375,[3_1|2]), (374,383,[5_1|2]), (375,376,[5_1|2]), (376,377,[2_1|2]), (377,378,[0_1|2]), (378,379,[5_1|2]), (379,380,[3_1|2]), (380,381,[3_1|2]), (381,382,[2_1|2]), (381,397,[2_1|2]), (382,131,[2_1|2]), (382,211,[2_1|2]), (382,214,[2_1|2]), (382,218,[2_1|2]), (382,282,[2_1|2]), (382,367,[2_1|2]), (382,375,[3_1|2]), (382,383,[5_1|2]), (382,397,[2_1|2]), (383,384,[0_1|2]), (384,385,[2_1|2]), (385,386,[0_1|2]), (386,387,[2_1|2]), (387,388,[0_1|2]), (388,389,[2_1|2]), (389,390,[5_1|2]), (390,391,[4_1|2]), (391,392,[0_1|2]), (392,393,[0_1|2]), (393,394,[5_1|2]), (394,395,[5_1|2]), (395,396,[2_1|2]), (396,131,[0_1|2]), (396,135,[0_1|2, 2_1|2]), (396,227,[0_1|2]), (396,260,[0_1|2]), (396,367,[0_1|2]), (396,397,[0_1|2]), (396,133,[0_1|2]), (396,243,[0_1|2]), (396,132,[0_1|2]), (396,148,[0_1|2]), (396,153,[0_1|2]), (396,172,[5_1|2]), (396,191,[3_1|2]), (397,398,[3_1|2]), (398,399,[2_1|2]), (399,400,[3_1|2]), (400,401,[2_1|2]), (401,402,[5_1|2]), (402,403,[4_1|2]), (403,404,[2_1|2]), (404,405,[0_1|2]), (405,406,[3_1|2]), (406,407,[2_1|2]), (407,408,[0_1|2]), (408,409,[2_1|2]), (409,410,[4_1|2]), (410,411,[5_1|2]), (411,412,[2_1|2]), (412,413,[4_1|2]), (412,349,[0_1|2]), (413,131,[4_1|2]), (413,135,[4_1|2]), (413,227,[4_1|2]), (413,260,[4_1|2]), (413,367,[4_1|2]), (413,397,[4_1|2]), (413,324,[4_1|2]), (413,329,[4_1|2]), (413,349,[0_1|2]), (414,415,[0_1|3]), (415,416,[2_1|3]), (416,417,[1_1|3]), (417,245,[1_1|3]), (417,349,[1_1|3]), (417,211,[1_1|2])}" ---------------------------------------- (8) BOUNDS(1, n^1)