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