/export/starexec/sandbox2/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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), 48 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 39 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(1(2(3(x1)))) -> 4(4(2(3(x1)))) 5(3(3(5(4(x1))))) -> 5(1(0(2(x1)))) 2(3(1(5(0(5(x1)))))) -> 2(1(3(5(0(5(x1)))))) 5(3(3(5(5(4(x1)))))) -> 4(2(4(3(2(x1))))) 5(1(4(5(1(1(5(x1))))))) -> 1(4(0(2(3(2(5(x1))))))) 3(3(4(3(1(3(0(5(x1)))))))) -> 3(5(2(4(5(0(5(2(x1)))))))) 3(1(2(2(2(1(3(1(3(x1))))))))) -> 1(4(3(1(5(0(2(2(x1)))))))) 3(4(2(0(5(2(3(5(3(x1))))))))) -> 3(5(4(4(2(2(0(5(1(x1))))))))) 5(5(1(3(3(5(4(0(0(x1))))))))) -> 3(1(0(1(4(2(4(3(x1)))))))) 3(0(2(5(1(5(0(1(5(0(x1)))))))))) -> 1(2(2(0(0(4(3(4(4(x1))))))))) 3(5(5(4(4(4(2(0(0(3(x1)))))))))) -> 1(1(2(3(2(3(4(1(x1)))))))) 3(0(4(3(3(5(0(4(4(0(4(2(x1)))))))))))) -> 3(4(5(5(3(2(0(5(1(4(2(x1))))))))))) 5(2(0(4(5(0(2(1(1(1(2(0(x1)))))))))))) -> 3(0(0(2(2(4(5(1(3(1(0(x1))))))))))) 5(5(4(3(3(4(5(4(5(0(0(4(5(x1))))))))))))) -> 5(0(1(0(3(1(4(1(2(3(1(x1))))))))))) 5(2(1(3(0(2(2(4(5(2(2(0(0(1(x1)))))))))))))) -> 3(4(5(1(4(3(3(5(0(3(0(1(x1)))))))))))) 3(1(5(2(5(5(3(3(4(4(5(2(3(2(4(x1))))))))))))))) -> 3(0(5(4(4(4(2(0(0(1(4(3(2(4(x1)))))))))))))) 4(5(5(4(3(4(4(2(4(2(4(3(3(3(3(x1))))))))))))))) -> 4(5(0(0(4(4(5(4(4(3(4(0(0(0(x1)))))))))))))) 0(1(2(4(3(1(1(4(1(5(0(2(5(3(2(4(3(x1))))))))))))))))) -> 4(2(2(1(3(1(3(0(4(5(1(2(2(5(5(4(1(x1))))))))))))))))) 2(4(3(0(4(2(0(0(2(5(1(0(2(0(0(4(4(x1))))))))))))))))) -> 5(4(1(2(1(2(1(0(2(0(4(3(1(0(0(2(x1)))))))))))))))) 3(3(3(1(0(2(1(1(5(2(4(0(0(4(5(2(2(0(2(x1))))))))))))))))))) -> 3(2(2(3(1(5(5(5(3(0(3(1(4(3(2(3(1(x1))))))))))))))))) 5(3(2(2(5(2(1(3(0(2(4(3(2(5(3(3(0(5(4(x1))))))))))))))))))) -> 1(3(0(3(3(4(5(5(0(5(5(4(0(2(1(1(0(0(2(x1))))))))))))))))))) 5(4(5(5(5(2(0(1(2(1(0(1(2(1(5(3(1(3(1(x1))))))))))))))))))) -> 0(0(3(5(3(0(2(0(1(4(0(5(4(3(0(2(4(1(x1)))))))))))))))))) 4(0(4(0(5(1(0(3(2(5(3(1(3(0(2(5(3(5(0(0(x1)))))))))))))))))))) -> 1(5(3(5(2(0(5(4(4(5(0(1(4(4(3(1(3(2(5(1(x1)))))))))))))))))))) 5(4(2(1(3(2(5(4(2(2(0(0(5(5(1(0(5(1(3(0(x1)))))))))))))))))))) -> 4(4(2(4(0(1(3(2(5(1(3(4(4(0(0(1(1(1(2(0(x1)))))))))))))))))))) 3(0(4(5(4(1(4(3(5(5(3(5(4(0(1(4(3(5(0(3(2(x1))))))))))))))))))))) -> 1(2(4(1(1(2(5(4(2(4(0(4(2(5(1(4(2(1(3(1(2(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(1(x_1)) -> 1(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(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(1(2(3(x1)))) -> 4(4(2(3(x1)))) 5(3(3(5(4(x1))))) -> 5(1(0(2(x1)))) 2(3(1(5(0(5(x1)))))) -> 2(1(3(5(0(5(x1)))))) 5(3(3(5(5(4(x1)))))) -> 4(2(4(3(2(x1))))) 5(1(4(5(1(1(5(x1))))))) -> 1(4(0(2(3(2(5(x1))))))) 3(3(4(3(1(3(0(5(x1)))))))) -> 3(5(2(4(5(0(5(2(x1)))))))) 3(1(2(2(2(1(3(1(3(x1))))))))) -> 1(4(3(1(5(0(2(2(x1)))))))) 3(4(2(0(5(2(3(5(3(x1))))))))) -> 3(5(4(4(2(2(0(5(1(x1))))))))) 5(5(1(3(3(5(4(0(0(x1))))))))) -> 3(1(0(1(4(2(4(3(x1)))))))) 3(0(2(5(1(5(0(1(5(0(x1)))))))))) -> 1(2(2(0(0(4(3(4(4(x1))))))))) 3(5(5(4(4(4(2(0(0(3(x1)))))))))) -> 1(1(2(3(2(3(4(1(x1)))))))) 3(0(4(3(3(5(0(4(4(0(4(2(x1)))))))))))) -> 3(4(5(5(3(2(0(5(1(4(2(x1))))))))))) 5(2(0(4(5(0(2(1(1(1(2(0(x1)))))))))))) -> 3(0(0(2(2(4(5(1(3(1(0(x1))))))))))) 5(5(4(3(3(4(5(4(5(0(0(4(5(x1))))))))))))) -> 5(0(1(0(3(1(4(1(2(3(1(x1))))))))))) 5(2(1(3(0(2(2(4(5(2(2(0(0(1(x1)))))))))))))) -> 3(4(5(1(4(3(3(5(0(3(0(1(x1)))))))))))) 3(1(5(2(5(5(3(3(4(4(5(2(3(2(4(x1))))))))))))))) -> 3(0(5(4(4(4(2(0(0(1(4(3(2(4(x1)))))))))))))) 4(5(5(4(3(4(4(2(4(2(4(3(3(3(3(x1))))))))))))))) -> 4(5(0(0(4(4(5(4(4(3(4(0(0(0(x1)))))))))))))) 0(1(2(4(3(1(1(4(1(5(0(2(5(3(2(4(3(x1))))))))))))))))) -> 4(2(2(1(3(1(3(0(4(5(1(2(2(5(5(4(1(x1))))))))))))))))) 2(4(3(0(4(2(0(0(2(5(1(0(2(0(0(4(4(x1))))))))))))))))) -> 5(4(1(2(1(2(1(0(2(0(4(3(1(0(0(2(x1)))))))))))))))) 3(3(3(1(0(2(1(1(5(2(4(0(0(4(5(2(2(0(2(x1))))))))))))))))))) -> 3(2(2(3(1(5(5(5(3(0(3(1(4(3(2(3(1(x1))))))))))))))))) 5(3(2(2(5(2(1(3(0(2(4(3(2(5(3(3(0(5(4(x1))))))))))))))))))) -> 1(3(0(3(3(4(5(5(0(5(5(4(0(2(1(1(0(0(2(x1))))))))))))))))))) 5(4(5(5(5(2(0(1(2(1(0(1(2(1(5(3(1(3(1(x1))))))))))))))))))) -> 0(0(3(5(3(0(2(0(1(4(0(5(4(3(0(2(4(1(x1)))))))))))))))))) 4(0(4(0(5(1(0(3(2(5(3(1(3(0(2(5(3(5(0(0(x1)))))))))))))))))))) -> 1(5(3(5(2(0(5(4(4(5(0(1(4(4(3(1(3(2(5(1(x1)))))))))))))))))))) 5(4(2(1(3(2(5(4(2(2(0(0(5(5(1(0(5(1(3(0(x1)))))))))))))))))))) -> 4(4(2(4(0(1(3(2(5(1(3(4(4(0(0(1(1(1(2(0(x1)))))))))))))))))))) 3(0(4(5(4(1(4(3(5(5(3(5(4(0(1(4(3(5(0(3(2(x1))))))))))))))))))))) -> 1(2(4(1(1(2(5(4(2(4(0(4(2(5(1(4(2(1(3(1(2(x1))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(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(1(2(3(x1)))) -> 4(4(2(3(x1)))) 5(3(3(5(4(x1))))) -> 5(1(0(2(x1)))) 2(3(1(5(0(5(x1)))))) -> 2(1(3(5(0(5(x1)))))) 5(3(3(5(5(4(x1)))))) -> 4(2(4(3(2(x1))))) 5(1(4(5(1(1(5(x1))))))) -> 1(4(0(2(3(2(5(x1))))))) 3(3(4(3(1(3(0(5(x1)))))))) -> 3(5(2(4(5(0(5(2(x1)))))))) 3(1(2(2(2(1(3(1(3(x1))))))))) -> 1(4(3(1(5(0(2(2(x1)))))))) 3(4(2(0(5(2(3(5(3(x1))))))))) -> 3(5(4(4(2(2(0(5(1(x1))))))))) 5(5(1(3(3(5(4(0(0(x1))))))))) -> 3(1(0(1(4(2(4(3(x1)))))))) 3(0(2(5(1(5(0(1(5(0(x1)))))))))) -> 1(2(2(0(0(4(3(4(4(x1))))))))) 3(5(5(4(4(4(2(0(0(3(x1)))))))))) -> 1(1(2(3(2(3(4(1(x1)))))))) 3(0(4(3(3(5(0(4(4(0(4(2(x1)))))))))))) -> 3(4(5(5(3(2(0(5(1(4(2(x1))))))))))) 5(2(0(4(5(0(2(1(1(1(2(0(x1)))))))))))) -> 3(0(0(2(2(4(5(1(3(1(0(x1))))))))))) 5(5(4(3(3(4(5(4(5(0(0(4(5(x1))))))))))))) -> 5(0(1(0(3(1(4(1(2(3(1(x1))))))))))) 5(2(1(3(0(2(2(4(5(2(2(0(0(1(x1)))))))))))))) -> 3(4(5(1(4(3(3(5(0(3(0(1(x1)))))))))))) 3(1(5(2(5(5(3(3(4(4(5(2(3(2(4(x1))))))))))))))) -> 3(0(5(4(4(4(2(0(0(1(4(3(2(4(x1)))))))))))))) 4(5(5(4(3(4(4(2(4(2(4(3(3(3(3(x1))))))))))))))) -> 4(5(0(0(4(4(5(4(4(3(4(0(0(0(x1)))))))))))))) 0(1(2(4(3(1(1(4(1(5(0(2(5(3(2(4(3(x1))))))))))))))))) -> 4(2(2(1(3(1(3(0(4(5(1(2(2(5(5(4(1(x1))))))))))))))))) 2(4(3(0(4(2(0(0(2(5(1(0(2(0(0(4(4(x1))))))))))))))))) -> 5(4(1(2(1(2(1(0(2(0(4(3(1(0(0(2(x1)))))))))))))))) 3(3(3(1(0(2(1(1(5(2(4(0(0(4(5(2(2(0(2(x1))))))))))))))))))) -> 3(2(2(3(1(5(5(5(3(0(3(1(4(3(2(3(1(x1))))))))))))))))) 5(3(2(2(5(2(1(3(0(2(4(3(2(5(3(3(0(5(4(x1))))))))))))))))))) -> 1(3(0(3(3(4(5(5(0(5(5(4(0(2(1(1(0(0(2(x1))))))))))))))))))) 5(4(5(5(5(2(0(1(2(1(0(1(2(1(5(3(1(3(1(x1))))))))))))))))))) -> 0(0(3(5(3(0(2(0(1(4(0(5(4(3(0(2(4(1(x1)))))))))))))))))) 4(0(4(0(5(1(0(3(2(5(3(1(3(0(2(5(3(5(0(0(x1)))))))))))))))))))) -> 1(5(3(5(2(0(5(4(4(5(0(1(4(4(3(1(3(2(5(1(x1)))))))))))))))))))) 5(4(2(1(3(2(5(4(2(2(0(0(5(5(1(0(5(1(3(0(x1)))))))))))))))))))) -> 4(4(2(4(0(1(3(2(5(1(3(4(4(0(0(1(1(1(2(0(x1)))))))))))))))))))) 3(0(4(5(4(1(4(3(5(5(3(5(4(0(1(4(3(5(0(3(2(x1))))))))))))))))))))) -> 1(2(4(1(1(2(5(4(2(4(0(4(2(5(1(4(2(1(3(1(2(x1))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(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(1(2(3(x1)))) -> 4(4(2(3(x1)))) 5(3(3(5(4(x1))))) -> 5(1(0(2(x1)))) 2(3(1(5(0(5(x1)))))) -> 2(1(3(5(0(5(x1)))))) 5(3(3(5(5(4(x1)))))) -> 4(2(4(3(2(x1))))) 5(1(4(5(1(1(5(x1))))))) -> 1(4(0(2(3(2(5(x1))))))) 3(3(4(3(1(3(0(5(x1)))))))) -> 3(5(2(4(5(0(5(2(x1)))))))) 3(1(2(2(2(1(3(1(3(x1))))))))) -> 1(4(3(1(5(0(2(2(x1)))))))) 3(4(2(0(5(2(3(5(3(x1))))))))) -> 3(5(4(4(2(2(0(5(1(x1))))))))) 5(5(1(3(3(5(4(0(0(x1))))))))) -> 3(1(0(1(4(2(4(3(x1)))))))) 3(0(2(5(1(5(0(1(5(0(x1)))))))))) -> 1(2(2(0(0(4(3(4(4(x1))))))))) 3(5(5(4(4(4(2(0(0(3(x1)))))))))) -> 1(1(2(3(2(3(4(1(x1)))))))) 3(0(4(3(3(5(0(4(4(0(4(2(x1)))))))))))) -> 3(4(5(5(3(2(0(5(1(4(2(x1))))))))))) 5(2(0(4(5(0(2(1(1(1(2(0(x1)))))))))))) -> 3(0(0(2(2(4(5(1(3(1(0(x1))))))))))) 5(5(4(3(3(4(5(4(5(0(0(4(5(x1))))))))))))) -> 5(0(1(0(3(1(4(1(2(3(1(x1))))))))))) 5(2(1(3(0(2(2(4(5(2(2(0(0(1(x1)))))))))))))) -> 3(4(5(1(4(3(3(5(0(3(0(1(x1)))))))))))) 3(1(5(2(5(5(3(3(4(4(5(2(3(2(4(x1))))))))))))))) -> 3(0(5(4(4(4(2(0(0(1(4(3(2(4(x1)))))))))))))) 4(5(5(4(3(4(4(2(4(2(4(3(3(3(3(x1))))))))))))))) -> 4(5(0(0(4(4(5(4(4(3(4(0(0(0(x1)))))))))))))) 0(1(2(4(3(1(1(4(1(5(0(2(5(3(2(4(3(x1))))))))))))))))) -> 4(2(2(1(3(1(3(0(4(5(1(2(2(5(5(4(1(x1))))))))))))))))) 2(4(3(0(4(2(0(0(2(5(1(0(2(0(0(4(4(x1))))))))))))))))) -> 5(4(1(2(1(2(1(0(2(0(4(3(1(0(0(2(x1)))))))))))))))) 3(3(3(1(0(2(1(1(5(2(4(0(0(4(5(2(2(0(2(x1))))))))))))))))))) -> 3(2(2(3(1(5(5(5(3(0(3(1(4(3(2(3(1(x1))))))))))))))))) 5(3(2(2(5(2(1(3(0(2(4(3(2(5(3(3(0(5(4(x1))))))))))))))))))) -> 1(3(0(3(3(4(5(5(0(5(5(4(0(2(1(1(0(0(2(x1))))))))))))))))))) 5(4(5(5(5(2(0(1(2(1(0(1(2(1(5(3(1(3(1(x1))))))))))))))))))) -> 0(0(3(5(3(0(2(0(1(4(0(5(4(3(0(2(4(1(x1)))))))))))))))))) 4(0(4(0(5(1(0(3(2(5(3(1(3(0(2(5(3(5(0(0(x1)))))))))))))))))))) -> 1(5(3(5(2(0(5(4(4(5(0(1(4(4(3(1(3(2(5(1(x1)))))))))))))))))))) 5(4(2(1(3(2(5(4(2(2(0(0(5(5(1(0(5(1(3(0(x1)))))))))))))))))))) -> 4(4(2(4(0(1(3(2(5(1(3(4(4(0(0(1(1(1(2(0(x1)))))))))))))))))))) 3(0(4(5(4(1(4(3(5(5(3(5(4(0(1(4(3(5(0(3(2(x1))))))))))))))))))))) -> 1(2(4(1(1(2(5(4(2(4(0(4(2(5(1(4(2(1(3(1(2(x1))))))))))))))))))))) encArg(1(x_1)) -> 1(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_4(x_1)) -> 4(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 2. The certificate found is represented by the following graph. "[79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 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] {(79,80,[0_1|0, 5_1|0, 2_1|0, 3_1|0, 4_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]), (79,81,[1_1|1, 0_1|1, 5_1|1, 2_1|1, 3_1|1, 4_1|1]), (79,82,[4_1|2]), (79,85,[4_1|2]), (79,101,[5_1|2]), (79,104,[4_1|2]), (79,108,[1_1|2]), (79,126,[1_1|2]), (79,132,[3_1|2]), (79,139,[5_1|2]), (79,149,[3_1|2]), (79,159,[3_1|2]), (79,170,[0_1|2]), (79,187,[4_1|2]), (79,206,[2_1|2]), (79,211,[5_1|2]), (79,226,[3_1|2]), (79,233,[3_1|2]), (79,249,[1_1|2]), (79,256,[3_1|2]), (79,269,[3_1|2]), (79,277,[1_1|2]), (79,285,[3_1|2]), (79,295,[1_1|2]), (79,315,[1_1|2]), (79,322,[4_1|2]), (79,335,[1_1|2]), (80,80,[1_1|0, cons_0_1|0, cons_5_1|0, cons_2_1|0, cons_3_1|0, cons_4_1|0]), (81,80,[encArg_1|1]), (81,81,[1_1|1, 0_1|1, 5_1|1, 2_1|1, 3_1|1, 4_1|1]), (81,82,[4_1|2]), (81,85,[4_1|2]), (81,101,[5_1|2]), (81,104,[4_1|2]), (81,108,[1_1|2]), (81,126,[1_1|2]), (81,132,[3_1|2]), (81,139,[5_1|2]), (81,149,[3_1|2]), (81,159,[3_1|2]), (81,170,[0_1|2]), (81,187,[4_1|2]), (81,206,[2_1|2]), (81,211,[5_1|2]), (81,226,[3_1|2]), (81,233,[3_1|2]), (81,249,[1_1|2]), (81,256,[3_1|2]), (81,269,[3_1|2]), (81,277,[1_1|2]), (81,285,[3_1|2]), (81,295,[1_1|2]), (81,315,[1_1|2]), (81,322,[4_1|2]), (81,335,[1_1|2]), (82,83,[4_1|2]), (83,84,[2_1|2]), (83,206,[2_1|2]), (84,81,[3_1|2]), (84,132,[3_1|2]), (84,149,[3_1|2]), (84,159,[3_1|2]), (84,226,[3_1|2]), (84,233,[3_1|2]), (84,256,[3_1|2]), (84,269,[3_1|2]), (84,285,[3_1|2]), (84,249,[1_1|2]), (84,277,[1_1|2]), (84,295,[1_1|2]), (84,315,[1_1|2]), (85,86,[2_1|2]), (86,87,[2_1|2]), (87,88,[1_1|2]), (88,89,[3_1|2]), (89,90,[1_1|2]), (90,91,[3_1|2]), (91,92,[0_1|2]), (92,93,[4_1|2]), (93,94,[5_1|2]), (94,95,[1_1|2]), (95,96,[2_1|2]), (96,97,[2_1|2]), (97,98,[5_1|2]), (98,99,[5_1|2]), (99,100,[4_1|2]), (100,81,[1_1|2]), (100,132,[1_1|2]), (100,149,[1_1|2]), (100,159,[1_1|2]), (100,226,[1_1|2]), (100,233,[1_1|2]), (100,256,[1_1|2]), (100,269,[1_1|2]), (100,285,[1_1|2]), (101,102,[1_1|2]), (102,103,[0_1|2]), (103,81,[2_1|2]), (103,82,[2_1|2]), (103,85,[2_1|2]), (103,104,[2_1|2]), (103,187,[2_1|2]), (103,322,[2_1|2]), (103,212,[2_1|2]), (103,271,[2_1|2]), (103,206,[2_1|2]), (103,211,[5_1|2]), (104,105,[2_1|2]), (105,106,[4_1|2]), (106,107,[3_1|2]), (107,81,[2_1|2]), (107,82,[2_1|2]), (107,85,[2_1|2]), (107,104,[2_1|2]), (107,187,[2_1|2]), (107,322,[2_1|2]), (107,212,[2_1|2]), (107,206,[2_1|2]), (107,211,[5_1|2]), (108,109,[3_1|2]), (109,110,[0_1|2]), (110,111,[3_1|2]), (111,112,[3_1|2]), (112,113,[4_1|2]), (113,114,[5_1|2]), (114,115,[5_1|2]), (115,116,[0_1|2]), (116,117,[5_1|2]), (117,118,[5_1|2]), (118,119,[4_1|2]), (119,120,[0_1|2]), (120,121,[2_1|2]), (121,122,[1_1|2]), (122,123,[1_1|2]), (123,124,[0_1|2]), (124,125,[0_1|2]), (125,81,[2_1|2]), (125,82,[2_1|2]), (125,85,[2_1|2]), (125,104,[2_1|2]), (125,187,[2_1|2]), (125,322,[2_1|2]), (125,212,[2_1|2]), (125,259,[2_1|2]), (125,206,[2_1|2]), (125,211,[5_1|2]), (126,127,[4_1|2]), (127,128,[0_1|2]), (128,129,[2_1|2]), (129,130,[3_1|2]), (130,131,[2_1|2]), (131,81,[5_1|2]), (131,101,[5_1|2]), (131,139,[5_1|2]), (131,211,[5_1|2]), (131,336,[5_1|2]), (131,104,[4_1|2]), (131,108,[1_1|2]), (131,126,[1_1|2]), (131,132,[3_1|2]), (131,149,[3_1|2]), (131,159,[3_1|2]), (131,170,[0_1|2]), (131,187,[4_1|2]), (132,133,[1_1|2]), (133,134,[0_1|2]), (134,135,[1_1|2]), (135,136,[4_1|2]), (136,137,[2_1|2]), (136,211,[5_1|2]), (137,138,[4_1|2]), (138,81,[3_1|2]), (138,170,[3_1|2]), (138,171,[3_1|2]), (138,226,[3_1|2]), (138,233,[3_1|2]), (138,249,[1_1|2]), (138,256,[3_1|2]), (138,269,[3_1|2]), (138,277,[1_1|2]), (138,285,[3_1|2]), (138,295,[1_1|2]), (138,315,[1_1|2]), (139,140,[0_1|2]), (140,141,[1_1|2]), (141,142,[0_1|2]), (142,143,[3_1|2]), (143,144,[1_1|2]), (144,145,[4_1|2]), (145,146,[1_1|2]), (146,147,[2_1|2]), (146,206,[2_1|2]), (147,148,[3_1|2]), (147,249,[1_1|2]), (147,256,[3_1|2]), (148,81,[1_1|2]), (148,101,[1_1|2]), (148,139,[1_1|2]), (148,211,[1_1|2]), (148,323,[1_1|2]), (149,150,[0_1|2]), (150,151,[0_1|2]), (151,152,[2_1|2]), (152,153,[2_1|2]), (153,154,[4_1|2]), (154,155,[5_1|2]), (155,156,[1_1|2]), (156,157,[3_1|2]), (157,158,[1_1|2]), (158,81,[0_1|2]), (158,170,[0_1|2]), (158,82,[4_1|2]), (158,85,[4_1|2]), (159,160,[4_1|2]), (160,161,[5_1|2]), (161,162,[1_1|2]), (162,163,[4_1|2]), (163,164,[3_1|2]), (164,165,[3_1|2]), (165,166,[5_1|2]), (166,167,[0_1|2]), (167,168,[3_1|2]), (168,169,[0_1|2]), (168,82,[4_1|2]), (168,85,[4_1|2]), (169,81,[1_1|2]), (169,108,[1_1|2]), (169,126,[1_1|2]), (169,249,[1_1|2]), (169,277,[1_1|2]), (169,295,[1_1|2]), (169,315,[1_1|2]), (169,335,[1_1|2]), (170,171,[0_1|2]), (171,172,[3_1|2]), (172,173,[5_1|2]), (173,174,[3_1|2]), (174,175,[0_1|2]), (175,176,[2_1|2]), (176,177,[0_1|2]), (177,178,[1_1|2]), (178,179,[4_1|2]), (179,180,[0_1|2]), (180,181,[5_1|2]), (181,182,[4_1|2]), (182,183,[3_1|2]), (183,184,[0_1|2]), (184,185,[2_1|2]), (185,186,[4_1|2]), (186,81,[1_1|2]), (186,108,[1_1|2]), (186,126,[1_1|2]), (186,249,[1_1|2]), (186,277,[1_1|2]), (186,295,[1_1|2]), (186,315,[1_1|2]), (186,335,[1_1|2]), (186,133,[1_1|2]), (187,188,[4_1|2]), (188,189,[2_1|2]), (189,190,[4_1|2]), (190,191,[0_1|2]), (191,192,[1_1|2]), (192,193,[3_1|2]), (193,194,[2_1|2]), (194,195,[5_1|2]), (195,196,[1_1|2]), (196,197,[3_1|2]), (197,198,[4_1|2]), (198,199,[4_1|2]), (199,200,[0_1|2]), (200,201,[0_1|2]), (201,202,[1_1|2]), (202,203,[1_1|2]), (203,204,[1_1|2]), (204,205,[2_1|2]), (205,81,[0_1|2]), (205,170,[0_1|2]), (205,150,[0_1|2]), (205,257,[0_1|2]), (205,110,[0_1|2]), (205,82,[4_1|2]), (205,85,[4_1|2]), (206,207,[1_1|2]), (207,208,[3_1|2]), (208,209,[5_1|2]), (209,210,[0_1|2]), (210,81,[5_1|2]), (210,101,[5_1|2]), (210,139,[5_1|2]), (210,211,[5_1|2]), (210,104,[4_1|2]), (210,108,[1_1|2]), (210,126,[1_1|2]), (210,132,[3_1|2]), (210,149,[3_1|2]), (210,159,[3_1|2]), (210,170,[0_1|2]), (210,187,[4_1|2]), (211,212,[4_1|2]), (212,213,[1_1|2]), (213,214,[2_1|2]), (214,215,[1_1|2]), (215,216,[2_1|2]), (216,217,[1_1|2]), (217,218,[0_1|2]), (218,219,[2_1|2]), (219,220,[0_1|2]), (220,221,[4_1|2]), (221,222,[3_1|2]), (222,223,[1_1|2]), (223,224,[0_1|2]), (224,225,[0_1|2]), (225,81,[2_1|2]), (225,82,[2_1|2]), (225,85,[2_1|2]), (225,104,[2_1|2]), (225,187,[2_1|2]), (225,322,[2_1|2]), (225,83,[2_1|2]), (225,188,[2_1|2]), (225,206,[2_1|2]), (225,211,[5_1|2]), (226,227,[5_1|2]), (227,228,[2_1|2]), (228,229,[4_1|2]), (229,230,[5_1|2]), (230,231,[0_1|2]), (231,232,[5_1|2]), (231,149,[3_1|2]), (231,159,[3_1|2]), (232,81,[2_1|2]), (232,101,[2_1|2]), (232,139,[2_1|2]), (232,211,[2_1|2, 5_1|2]), (232,258,[2_1|2]), (232,206,[2_1|2]), (233,234,[2_1|2]), (234,235,[2_1|2]), (235,236,[3_1|2]), (236,237,[1_1|2]), (237,238,[5_1|2]), (238,239,[5_1|2]), (239,240,[5_1|2]), (240,241,[3_1|2]), (241,242,[0_1|2]), (242,243,[3_1|2]), (243,244,[1_1|2]), (244,245,[4_1|2]), (245,246,[3_1|2]), (246,247,[2_1|2]), (246,206,[2_1|2]), (247,248,[3_1|2]), (247,249,[1_1|2]), (247,256,[3_1|2]), (248,81,[1_1|2]), (248,206,[1_1|2]), (249,250,[4_1|2]), (250,251,[3_1|2]), (251,252,[1_1|2]), (252,253,[5_1|2]), (253,254,[0_1|2]), (254,255,[2_1|2]), (255,81,[2_1|2]), (255,132,[2_1|2]), (255,149,[2_1|2]), (255,159,[2_1|2]), (255,226,[2_1|2]), (255,233,[2_1|2]), (255,256,[2_1|2]), (255,269,[2_1|2]), (255,285,[2_1|2]), (255,109,[2_1|2]), (255,206,[2_1|2]), (255,211,[5_1|2]), (256,257,[0_1|2]), (257,258,[5_1|2]), (258,259,[4_1|2]), (259,260,[4_1|2]), (260,261,[4_1|2]), (261,262,[2_1|2]), (262,263,[0_1|2]), (263,264,[0_1|2]), (264,265,[1_1|2]), (265,266,[4_1|2]), (266,267,[3_1|2]), (267,268,[2_1|2]), (267,211,[5_1|2]), (268,81,[4_1|2]), (268,82,[4_1|2]), (268,85,[4_1|2]), (268,104,[4_1|2]), (268,187,[4_1|2]), (268,322,[4_1|2]), (268,335,[1_1|2]), (269,270,[5_1|2]), (270,271,[4_1|2]), (271,272,[4_1|2]), (272,273,[2_1|2]), (273,274,[2_1|2]), (274,275,[0_1|2]), (275,276,[5_1|2]), (275,126,[1_1|2]), (276,81,[1_1|2]), (276,132,[1_1|2]), (276,149,[1_1|2]), (276,159,[1_1|2]), (276,226,[1_1|2]), (276,233,[1_1|2]), (276,256,[1_1|2]), (276,269,[1_1|2]), (276,285,[1_1|2]), (277,278,[2_1|2]), (278,279,[2_1|2]), (279,280,[0_1|2]), (280,281,[0_1|2]), (281,282,[4_1|2]), (282,283,[3_1|2]), (283,284,[4_1|2]), (284,81,[4_1|2]), (284,170,[4_1|2]), (284,140,[4_1|2]), (284,322,[4_1|2]), (284,335,[1_1|2]), (285,286,[4_1|2]), (286,287,[5_1|2]), (287,288,[5_1|2]), (288,289,[3_1|2]), (289,290,[2_1|2]), (290,291,[0_1|2]), (291,292,[5_1|2]), (292,293,[1_1|2]), (293,294,[4_1|2]), (294,81,[2_1|2]), (294,206,[2_1|2]), (294,86,[2_1|2]), (294,105,[2_1|2]), (294,211,[5_1|2]), (295,296,[2_1|2]), (296,297,[4_1|2]), (297,298,[1_1|2]), (298,299,[1_1|2]), (299,300,[2_1|2]), (300,301,[5_1|2]), (301,302,[4_1|2]), (302,303,[2_1|2]), (303,304,[4_1|2]), (304,305,[0_1|2]), (305,306,[4_1|2]), (306,307,[2_1|2]), (307,308,[5_1|2]), (308,309,[1_1|2]), (309,310,[4_1|2]), (310,311,[2_1|2]), (311,312,[1_1|2]), (312,313,[3_1|2]), (312,249,[1_1|2]), (313,314,[1_1|2]), (314,81,[2_1|2]), (314,206,[2_1|2]), (314,234,[2_1|2]), (314,211,[5_1|2]), (315,316,[1_1|2]), (316,317,[2_1|2]), (317,318,[3_1|2]), (318,319,[2_1|2]), (319,320,[3_1|2]), (320,321,[4_1|2]), (321,81,[1_1|2]), (321,132,[1_1|2]), (321,149,[1_1|2]), (321,159,[1_1|2]), (321,226,[1_1|2]), (321,233,[1_1|2]), (321,256,[1_1|2]), (321,269,[1_1|2]), (321,285,[1_1|2]), (321,172,[1_1|2]), (322,323,[5_1|2]), (323,324,[0_1|2]), (324,325,[0_1|2]), (325,326,[4_1|2]), (326,327,[4_1|2]), (327,328,[5_1|2]), (328,329,[4_1|2]), (329,330,[4_1|2]), (330,331,[3_1|2]), (331,332,[4_1|2]), (332,333,[0_1|2]), (333,334,[0_1|2]), (334,81,[0_1|2]), (334,132,[0_1|2]), (334,149,[0_1|2]), (334,159,[0_1|2]), (334,226,[0_1|2]), (334,233,[0_1|2]), (334,256,[0_1|2]), (334,269,[0_1|2]), (334,285,[0_1|2]), (334,82,[4_1|2]), (334,85,[4_1|2]), (335,336,[5_1|2]), (336,337,[3_1|2]), (337,338,[5_1|2]), (338,339,[2_1|2]), (339,340,[0_1|2]), (340,341,[5_1|2]), (341,342,[4_1|2]), (342,343,[4_1|2]), (343,344,[5_1|2]), (344,345,[0_1|2]), (345,346,[1_1|2]), (346,347,[4_1|2]), (347,348,[4_1|2]), (348,349,[3_1|2]), (349,350,[1_1|2]), (350,351,[3_1|2]), (351,352,[2_1|2]), (352,353,[5_1|2]), (352,126,[1_1|2]), (353,81,[1_1|2]), (353,170,[1_1|2]), (353,171,[1_1|2])}" ---------------------------------------- (8) BOUNDS(1, n^1)