WORST_CASE(?, O(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(1, n^1). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 43 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 84 ms] (8) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) 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: 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(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 (full) 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: 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(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: FULL ---------------------------------------- (5) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (6) Obligation: The Runtime Complexity (full) 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: FULL ---------------------------------------- (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. "[115, 116, 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] {(115,116,[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]), (115,129,[5_1|1, 0_1|1, 1_1|1, 3_1|1, 4_1|1, 2_1|1]), (115,130,[0_1|2]), (115,133,[2_1|2]), (115,146,[0_1|2]), (115,151,[0_1|2]), (115,170,[5_1|2]), (115,189,[3_1|2]), (115,209,[1_1|2]), (115,212,[1_1|2]), (115,216,[1_1|2]), (115,221,[5_1|2]), (115,225,[2_1|2]), (115,240,[0_1|2]), (115,244,[3_1|2]), (115,258,[2_1|2]), (115,264,[5_1|2]), (115,279,[3_1|2]), (115,286,[3_1|2]), (115,303,[3_1|2]), (115,322,[4_1|2]), (115,327,[4_1|2]), (115,347,[0_1|2]), (115,365,[2_1|2]), (115,373,[3_1|2]), (115,381,[5_1|2]), (115,395,[2_1|2]), (116,116,[5_1|0, cons_0_1|0, cons_1_1|0, cons_3_1|0, cons_4_1|0, cons_2_1|0]), (129,116,[encArg_1|1]), (129,129,[5_1|1, 0_1|1, 1_1|1, 3_1|1, 4_1|1, 2_1|1]), (129,130,[0_1|2]), (129,133,[2_1|2]), (129,146,[0_1|2]), (129,151,[0_1|2]), (129,170,[5_1|2]), (129,189,[3_1|2]), (129,209,[1_1|2]), (129,212,[1_1|2]), (129,216,[1_1|2]), (129,221,[5_1|2]), (129,225,[2_1|2]), (129,240,[0_1|2]), (129,244,[3_1|2]), (129,258,[2_1|2]), (129,264,[5_1|2]), (129,279,[3_1|2]), (129,286,[3_1|2]), (129,303,[3_1|2]), (129,322,[4_1|2]), (129,327,[4_1|2]), (129,347,[0_1|2]), (129,365,[2_1|2]), (129,373,[3_1|2]), (129,381,[5_1|2]), (129,395,[2_1|2]), (130,131,[2_1|2]), (131,132,[3_1|2]), (131,279,[3_1|2]), (132,129,[4_1|2]), (132,209,[4_1|2]), (132,212,[4_1|2]), (132,216,[4_1|2]), (132,322,[4_1|2]), (132,327,[4_1|2]), (132,347,[0_1|2]), (133,134,[4_1|2]), (134,135,[1_1|2]), (135,136,[2_1|2]), (136,137,[4_1|2]), (137,138,[4_1|2]), (138,139,[3_1|2]), (139,140,[2_1|2]), (140,141,[5_1|2]), (141,142,[2_1|2]), (142,143,[3_1|2]), (143,144,[5_1|2]), (144,145,[5_1|2]), (145,129,[0_1|2]), (145,130,[0_1|2]), (145,146,[0_1|2]), (145,151,[0_1|2]), (145,240,[0_1|2]), (145,347,[0_1|2]), (145,133,[2_1|2]), (145,170,[5_1|2]), (145,189,[3_1|2]), (146,147,[5_1|2]), (147,148,[3_1|2]), (148,149,[1_1|2]), (148,216,[1_1|2]), (149,150,[3_1|2]), (149,258,[2_1|2]), (149,264,[5_1|2]), (150,129,[2_1|2]), (150,133,[2_1|2]), (150,225,[2_1|2]), (150,258,[2_1|2]), (150,365,[2_1|2]), (150,395,[2_1|2]), (150,397,[2_1|2]), (150,373,[3_1|2]), (150,381,[5_1|2]), (151,152,[3_1|2]), (152,153,[5_1|2]), (153,154,[3_1|2]), (154,155,[3_1|2]), (155,156,[2_1|2]), (156,157,[4_1|2]), (157,158,[5_1|2]), (158,159,[5_1|2]), (159,160,[4_1|2]), (160,161,[0_1|2]), (161,162,[2_1|2]), (162,163,[3_1|2]), (163,164,[0_1|2]), (164,165,[2_1|2]), (165,166,[5_1|2]), (166,167,[2_1|2]), (167,168,[4_1|2]), (168,169,[3_1|2]), (168,279,[3_1|2]), (169,129,[4_1|2]), (169,322,[4_1|2]), (169,327,[4_1|2]), (169,287,[4_1|2]), (169,347,[0_1|2]), (170,171,[2_1|2]), (171,172,[3_1|2]), (172,173,[3_1|2]), (173,174,[4_1|2]), (174,175,[1_1|2]), (175,176,[5_1|2]), (176,177,[3_1|2]), (177,178,[2_1|2]), (178,179,[2_1|2]), (179,180,[3_1|2]), (180,181,[5_1|2]), (181,182,[1_1|2]), (182,183,[1_1|2]), (183,184,[1_1|2]), (184,185,[2_1|2]), (185,186,[1_1|2]), (186,187,[2_1|2]), (187,188,[2_1|2]), (188,129,[1_1|2]), (188,130,[1_1|2]), (188,146,[1_1|2]), (188,151,[1_1|2]), (188,240,[1_1|2]), (188,347,[1_1|2]), (188,304,[1_1|2]), (188,209,[1_1|2]), (188,212,[1_1|2]), (188,216,[1_1|2]), (189,190,[5_1|2]), (190,191,[4_1|2]), (191,192,[4_1|2]), (192,193,[4_1|2]), (193,194,[5_1|2]), (194,195,[5_1|2]), (195,196,[0_1|2]), (196,197,[2_1|2]), (197,198,[4_1|2]), (198,199,[4_1|2]), (199,200,[1_1|2]), (200,201,[5_1|2]), (201,202,[2_1|2]), (202,203,[1_1|2]), (203,204,[2_1|2]), (204,205,[5_1|2]), (205,206,[2_1|2]), (206,207,[5_1|2]), (207,208,[2_1|2]), (207,395,[2_1|2]), (208,129,[2_1|2]), (208,133,[2_1|2]), (208,225,[2_1|2]), (208,258,[2_1|2]), (208,365,[2_1|2]), (208,395,[2_1|2]), (208,213,[2_1|2]), (208,373,[3_1|2]), (208,381,[5_1|2]), (209,210,[5_1|2]), (210,211,[0_1|2]), (211,129,[5_1|2]), (211,133,[5_1|2]), (211,225,[5_1|2]), (211,258,[5_1|2]), (211,365,[5_1|2]), (211,395,[5_1|2]), (212,213,[2_1|2]), (213,214,[0_1|2]), (214,215,[1_1|2]), (215,129,[2_1|2]), (215,322,[2_1|2]), (215,327,[2_1|2]), (215,365,[2_1|2]), (215,373,[3_1|2]), (215,381,[5_1|2]), (215,395,[2_1|2]), (216,217,[0_1|2]), (217,218,[5_1|2]), (218,219,[1_1|2]), (219,220,[3_1|2]), (219,279,[3_1|2]), (220,129,[4_1|2]), (220,209,[4_1|2]), (220,212,[4_1|2]), (220,216,[4_1|2]), (220,280,[4_1|2]), (220,322,[4_1|2]), (220,327,[4_1|2]), (220,347,[0_1|2]), (221,222,[0_1|2]), (222,223,[2_1|2]), (223,224,[1_1|2]), (224,129,[1_1|2]), (224,130,[1_1|2]), (224,146,[1_1|2]), (224,151,[1_1|2]), (224,240,[1_1|2]), (224,347,[1_1|2]), (224,304,[1_1|2]), (224,243,[1_1|2]), (224,209,[1_1|2]), (224,212,[1_1|2]), (224,216,[1_1|2]), (225,226,[5_1|2]), (226,227,[3_1|2]), (227,228,[3_1|2]), (228,229,[2_1|2]), (229,230,[3_1|2]), (230,231,[0_1|2]), (231,232,[2_1|2]), (232,233,[5_1|2]), (233,234,[4_1|2]), (234,235,[0_1|2]), (235,236,[2_1|2]), (236,237,[4_1|2]), (237,238,[5_1|2]), (238,239,[2_1|2]), (239,129,[1_1|2]), (239,209,[1_1|2]), (239,212,[1_1|2]), (239,216,[1_1|2]), (240,241,[2_1|2]), (241,242,[3_1|2]), (241,225,[2_1|2]), (242,243,[0_1|2]), (242,170,[5_1|2]), (242,189,[3_1|2]), (243,129,[4_1|2]), (243,209,[4_1|2]), (243,212,[4_1|2]), (243,216,[4_1|2]), (243,322,[4_1|2]), (243,327,[4_1|2]), (243,347,[0_1|2]), (244,245,[5_1|2]), (245,246,[3_1|2]), (246,247,[3_1|2]), (247,248,[3_1|2]), (248,249,[2_1|2]), (249,250,[5_1|2]), (250,251,[4_1|2]), (251,252,[1_1|2]), (252,253,[5_1|2]), (253,254,[5_1|2]), (254,255,[1_1|2]), (255,256,[3_1|2]), (256,257,[5_1|2]), (257,129,[1_1|2]), (257,209,[1_1|2]), (257,212,[1_1|2]), (257,216,[1_1|2]), (258,259,[5_1|2]), (259,260,[0_1|2]), (260,261,[4_1|2]), (261,262,[4_1|2]), (262,263,[3_1|2]), (262,240,[0_1|2]), (262,244,[3_1|2]), (263,129,[5_1|2]), (263,209,[5_1|2]), (263,212,[5_1|2]), (263,216,[5_1|2]), (263,280,[5_1|2]), (263,324,[5_1|2]), (264,265,[2_1|2]), (265,266,[3_1|2]), (266,267,[5_1|2]), (267,268,[2_1|2]), (268,269,[1_1|2]), (269,270,[4_1|2]), (270,271,[4_1|2]), (271,272,[1_1|2]), (272,273,[5_1|2]), (273,274,[5_1|2]), (274,275,[3_1|2]), (275,276,[0_1|2]), (276,277,[1_1|2]), (277,278,[4_1|2]), (278,129,[2_1|2]), (278,170,[2_1|2]), (278,221,[2_1|2]), (278,264,[2_1|2]), (278,381,[2_1|2, 5_1|2]), (278,365,[2_1|2]), (278,373,[3_1|2]), (278,395,[2_1|2]), (279,280,[1_1|2]), (280,281,[0_1|2]), (281,282,[5_1|2]), (282,283,[0_1|2]), (283,284,[5_1|2]), (284,285,[0_1|2]), (284,146,[0_1|2]), (285,129,[1_1|2]), (285,133,[1_1|2]), (285,225,[1_1|2]), (285,258,[1_1|2]), (285,365,[1_1|2]), (285,395,[1_1|2]), (285,131,[1_1|2]), (285,241,[1_1|2]), (285,209,[1_1|2]), (285,212,[1_1|2]), (285,216,[1_1|2]), (286,287,[4_1|2]), (287,288,[3_1|2]), (288,289,[2_1|2]), (289,290,[2_1|2]), (290,291,[4_1|2]), (291,292,[1_1|2]), (292,293,[2_1|2]), (293,294,[1_1|2]), (294,295,[3_1|2]), (295,296,[3_1|2]), (296,297,[0_1|2]), (297,298,[0_1|2]), (298,299,[3_1|2]), (299,300,[3_1|2]), (299,279,[3_1|2]), (300,301,[4_1|2]), (301,302,[2_1|2]), (301,365,[2_1|2]), (301,373,[3_1|2]), (301,381,[5_1|2]), (302,129,[4_1|2]), (302,170,[4_1|2]), (302,221,[4_1|2]), (302,264,[4_1|2]), (302,381,[4_1|2]), (302,322,[4_1|2]), (302,327,[4_1|2]), (302,347,[0_1|2]), (303,304,[0_1|2]), (304,305,[5_1|2]), (305,306,[1_1|2]), (306,307,[1_1|2]), (307,308,[3_1|2]), (308,309,[2_1|2]), (309,310,[1_1|2]), (310,311,[2_1|2]), (311,312,[5_1|2]), (312,313,[5_1|2]), (313,314,[4_1|2]), (314,315,[3_1|2]), (315,316,[4_1|2]), (316,317,[3_1|2]), (317,318,[0_1|2]), (318,319,[5_1|2]), (319,320,[5_1|2]), (320,321,[3_1|2]), (320,279,[3_1|2]), (321,129,[4_1|2]), (321,209,[4_1|2]), (321,212,[4_1|2]), (321,216,[4_1|2]), (321,322,[4_1|2]), (321,327,[4_1|2]), (321,347,[0_1|2]), (322,323,[3_1|2]), (323,324,[1_1|2]), (324,325,[5_1|2]), (325,326,[1_1|2]), (326,129,[5_1|2]), (326,170,[5_1|2]), (326,221,[5_1|2]), (326,264,[5_1|2]), (326,381,[5_1|2]), (327,328,[0_1|2]), (328,329,[4_1|2]), (329,330,[1_1|2]), (330,331,[5_1|2]), (331,332,[1_1|2]), (332,333,[4_1|2]), (333,334,[2_1|2]), (334,335,[4_1|2]), (335,336,[2_1|2]), (336,337,[5_1|2]), (337,338,[4_1|2]), (338,339,[1_1|2]), (339,340,[2_1|2]), (340,341,[5_1|2]), (341,342,[2_1|2]), (342,343,[1_1|2]), (343,344,[2_1|2]), (344,345,[5_1|2]), (345,346,[2_1|2]), (345,395,[2_1|2]), (346,129,[2_1|2]), (346,322,[2_1|2]), (346,327,[2_1|2]), (346,287,[2_1|2]), (346,365,[2_1|2]), (346,373,[3_1|2]), (346,381,[5_1|2]), (346,395,[2_1|2]), (347,348,[3_1|2]), (348,349,[2_1|2]), (349,350,[3_1|2]), (350,351,[2_1|2]), (351,352,[0_1|2]), (352,353,[3_1|2]), (353,354,[2_1|2]), (354,355,[1_1|2]), (355,356,[1_1|2]), (356,357,[4_1|2]), (357,358,[5_1|2]), (358,359,[2_1|2]), (359,360,[2_1|2]), (360,361,[0_1|2]), (361,362,[1_1|2]), (362,363,[1_1|2]), (363,364,[2_1|2]), (364,129,[3_1|2]), (364,189,[3_1|2]), (364,244,[3_1|2]), (364,279,[3_1|2]), (364,286,[3_1|2]), (364,303,[3_1|2]), (364,373,[3_1|2]), (364,221,[5_1|2]), (364,225,[2_1|2]), (364,240,[0_1|2]), (364,258,[2_1|2]), (364,264,[5_1|2]), (364,412,[5_1|3]), (365,366,[4_1|2]), (366,367,[0_1|2]), (367,368,[0_1|2]), (368,369,[0_1|2]), (369,370,[0_1|2]), (370,371,[0_1|2]), (371,372,[5_1|2]), (372,129,[2_1|2]), (372,133,[2_1|2]), (372,225,[2_1|2]), (372,258,[2_1|2]), (372,365,[2_1|2]), (372,395,[2_1|2]), (372,171,[2_1|2]), (372,265,[2_1|2]), (372,373,[3_1|2]), (372,381,[5_1|2]), (373,374,[5_1|2]), (374,375,[2_1|2]), (375,376,[0_1|2]), (376,377,[5_1|2]), (377,378,[3_1|2]), (378,379,[3_1|2]), (379,380,[2_1|2]), (379,395,[2_1|2]), (380,129,[2_1|2]), (380,209,[2_1|2]), (380,212,[2_1|2]), (380,216,[2_1|2]), (380,280,[2_1|2]), (380,365,[2_1|2]), (380,373,[3_1|2]), (380,381,[5_1|2]), (380,395,[2_1|2]), (381,382,[0_1|2]), (382,383,[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,[5_1|2]), (388,389,[4_1|2]), (389,390,[0_1|2]), (390,391,[0_1|2]), (391,392,[5_1|2]), (392,393,[5_1|2]), (393,394,[2_1|2]), (394,129,[0_1|2]), (394,133,[0_1|2, 2_1|2]), (394,225,[0_1|2]), (394,258,[0_1|2]), (394,365,[0_1|2]), (394,395,[0_1|2]), (394,131,[0_1|2]), (394,241,[0_1|2]), (394,130,[0_1|2]), (394,146,[0_1|2]), (394,151,[0_1|2]), (394,170,[5_1|2]), (394,189,[3_1|2]), (395,396,[3_1|2]), (396,397,[2_1|2]), (397,398,[3_1|2]), (398,399,[2_1|2]), (399,400,[5_1|2]), (400,401,[4_1|2]), (401,402,[2_1|2]), (402,403,[0_1|2]), (403,404,[3_1|2]), (404,405,[2_1|2]), (405,406,[0_1|2]), (406,407,[2_1|2]), (407,408,[4_1|2]), (408,409,[5_1|2]), (409,410,[2_1|2]), (410,411,[4_1|2]), (410,347,[0_1|2]), (411,129,[4_1|2]), (411,133,[4_1|2]), (411,225,[4_1|2]), (411,258,[4_1|2]), (411,365,[4_1|2]), (411,395,[4_1|2]), (411,322,[4_1|2]), (411,327,[4_1|2]), (411,347,[0_1|2]), (412,413,[0_1|3]), (413,414,[2_1|3]), (414,415,[1_1|3]), (415,243,[1_1|3]), (415,347,[1_1|3]), (415,209,[1_1|2])}" ---------------------------------------- (8) BOUNDS(1, n^1)