/export/starexec/sandbox/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/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), 50 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 59 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(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: 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(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 (full) 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: 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(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: 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(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: 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 2. The certificate found is represented by the following graph. "[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, 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] {(113,114,[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]), (113,115,[1_1|1, 0_1|1, 5_1|1, 2_1|1, 3_1|1, 4_1|1]), (113,116,[4_1|2]), (113,119,[4_1|2]), (113,135,[5_1|2]), (113,138,[4_1|2]), (113,142,[1_1|2]), (113,160,[1_1|2]), (113,166,[3_1|2]), (113,173,[5_1|2]), (113,183,[3_1|2]), (113,193,[3_1|2]), (113,204,[0_1|2]), (113,221,[4_1|2]), (113,240,[2_1|2]), (113,245,[5_1|2]), (113,260,[3_1|2]), (113,267,[3_1|2]), (113,283,[1_1|2]), (113,290,[3_1|2]), (113,303,[3_1|2]), (113,311,[1_1|2]), (113,319,[3_1|2]), (113,329,[1_1|2]), (113,349,[1_1|2]), (113,356,[4_1|2]), (113,369,[1_1|2]), (114,114,[1_1|0, cons_0_1|0, cons_5_1|0, cons_2_1|0, cons_3_1|0, cons_4_1|0]), (115,114,[encArg_1|1]), (115,115,[1_1|1, 0_1|1, 5_1|1, 2_1|1, 3_1|1, 4_1|1]), (115,116,[4_1|2]), (115,119,[4_1|2]), (115,135,[5_1|2]), (115,138,[4_1|2]), (115,142,[1_1|2]), (115,160,[1_1|2]), (115,166,[3_1|2]), (115,173,[5_1|2]), (115,183,[3_1|2]), (115,193,[3_1|2]), (115,204,[0_1|2]), (115,221,[4_1|2]), (115,240,[2_1|2]), (115,245,[5_1|2]), (115,260,[3_1|2]), (115,267,[3_1|2]), (115,283,[1_1|2]), (115,290,[3_1|2]), (115,303,[3_1|2]), (115,311,[1_1|2]), (115,319,[3_1|2]), (115,329,[1_1|2]), (115,349,[1_1|2]), (115,356,[4_1|2]), (115,369,[1_1|2]), (116,117,[4_1|2]), (117,118,[2_1|2]), (117,240,[2_1|2]), (118,115,[3_1|2]), (118,166,[3_1|2]), (118,183,[3_1|2]), (118,193,[3_1|2]), (118,260,[3_1|2]), (118,267,[3_1|2]), (118,290,[3_1|2]), (118,303,[3_1|2]), (118,319,[3_1|2]), (118,283,[1_1|2]), (118,311,[1_1|2]), (118,329,[1_1|2]), (118,349,[1_1|2]), (119,120,[2_1|2]), (120,121,[2_1|2]), (121,122,[1_1|2]), (122,123,[3_1|2]), (123,124,[1_1|2]), (124,125,[3_1|2]), (125,126,[0_1|2]), (126,127,[4_1|2]), (127,128,[5_1|2]), (128,129,[1_1|2]), (129,130,[2_1|2]), (130,131,[2_1|2]), (131,132,[5_1|2]), (132,133,[5_1|2]), (133,134,[4_1|2]), (134,115,[1_1|2]), (134,166,[1_1|2]), (134,183,[1_1|2]), (134,193,[1_1|2]), (134,260,[1_1|2]), (134,267,[1_1|2]), (134,290,[1_1|2]), (134,303,[1_1|2]), (134,319,[1_1|2]), (135,136,[1_1|2]), (136,137,[0_1|2]), (137,115,[2_1|2]), (137,116,[2_1|2]), (137,119,[2_1|2]), (137,138,[2_1|2]), (137,221,[2_1|2]), (137,356,[2_1|2]), (137,246,[2_1|2]), (137,305,[2_1|2]), (137,240,[2_1|2]), (137,245,[5_1|2]), (138,139,[2_1|2]), (139,140,[4_1|2]), (140,141,[3_1|2]), (141,115,[2_1|2]), (141,116,[2_1|2]), (141,119,[2_1|2]), (141,138,[2_1|2]), (141,221,[2_1|2]), (141,356,[2_1|2]), (141,246,[2_1|2]), (141,240,[2_1|2]), (141,245,[5_1|2]), (142,143,[3_1|2]), (143,144,[0_1|2]), (144,145,[3_1|2]), (145,146,[3_1|2]), (146,147,[4_1|2]), (147,148,[5_1|2]), (148,149,[5_1|2]), (149,150,[0_1|2]), (150,151,[5_1|2]), (151,152,[5_1|2]), (152,153,[4_1|2]), (153,154,[0_1|2]), (154,155,[2_1|2]), (155,156,[1_1|2]), (156,157,[1_1|2]), (157,158,[0_1|2]), (158,159,[0_1|2]), (159,115,[2_1|2]), (159,116,[2_1|2]), (159,119,[2_1|2]), (159,138,[2_1|2]), (159,221,[2_1|2]), (159,356,[2_1|2]), (159,246,[2_1|2]), (159,293,[2_1|2]), (159,240,[2_1|2]), (159,245,[5_1|2]), (160,161,[4_1|2]), (161,162,[0_1|2]), (162,163,[2_1|2]), (163,164,[3_1|2]), (164,165,[2_1|2]), (165,115,[5_1|2]), (165,135,[5_1|2]), (165,173,[5_1|2]), (165,245,[5_1|2]), (165,370,[5_1|2]), (165,138,[4_1|2]), (165,142,[1_1|2]), (165,160,[1_1|2]), (165,166,[3_1|2]), (165,183,[3_1|2]), (165,193,[3_1|2]), (165,204,[0_1|2]), (165,221,[4_1|2]), (166,167,[1_1|2]), (167,168,[0_1|2]), (168,169,[1_1|2]), (169,170,[4_1|2]), (170,171,[2_1|2]), (170,245,[5_1|2]), (171,172,[4_1|2]), (172,115,[3_1|2]), (172,204,[3_1|2]), (172,205,[3_1|2]), (172,260,[3_1|2]), (172,267,[3_1|2]), (172,283,[1_1|2]), (172,290,[3_1|2]), (172,303,[3_1|2]), (172,311,[1_1|2]), (172,319,[3_1|2]), (172,329,[1_1|2]), (172,349,[1_1|2]), (173,174,[0_1|2]), (174,175,[1_1|2]), (175,176,[0_1|2]), (176,177,[3_1|2]), (177,178,[1_1|2]), (178,179,[4_1|2]), (179,180,[1_1|2]), (180,181,[2_1|2]), (180,240,[2_1|2]), (181,182,[3_1|2]), (181,283,[1_1|2]), (181,290,[3_1|2]), (182,115,[1_1|2]), (182,135,[1_1|2]), (182,173,[1_1|2]), (182,245,[1_1|2]), (182,357,[1_1|2]), (183,184,[0_1|2]), (184,185,[0_1|2]), (185,186,[2_1|2]), (186,187,[2_1|2]), (187,188,[4_1|2]), (188,189,[5_1|2]), (189,190,[1_1|2]), (190,191,[3_1|2]), (191,192,[1_1|2]), (192,115,[0_1|2]), (192,204,[0_1|2]), (192,116,[4_1|2]), (192,119,[4_1|2]), (193,194,[4_1|2]), (194,195,[5_1|2]), (195,196,[1_1|2]), (196,197,[4_1|2]), (197,198,[3_1|2]), (198,199,[3_1|2]), (199,200,[5_1|2]), (200,201,[0_1|2]), (201,202,[3_1|2]), (202,203,[0_1|2]), (202,116,[4_1|2]), (202,119,[4_1|2]), (203,115,[1_1|2]), (203,142,[1_1|2]), (203,160,[1_1|2]), (203,283,[1_1|2]), (203,311,[1_1|2]), (203,329,[1_1|2]), (203,349,[1_1|2]), (203,369,[1_1|2]), (204,205,[0_1|2]), (205,206,[3_1|2]), (206,207,[5_1|2]), (207,208,[3_1|2]), (208,209,[0_1|2]), (209,210,[2_1|2]), (210,211,[0_1|2]), (211,212,[1_1|2]), (212,213,[4_1|2]), (213,214,[0_1|2]), (214,215,[5_1|2]), (215,216,[4_1|2]), (216,217,[3_1|2]), (217,218,[0_1|2]), (218,219,[2_1|2]), (219,220,[4_1|2]), (220,115,[1_1|2]), (220,142,[1_1|2]), (220,160,[1_1|2]), (220,283,[1_1|2]), (220,311,[1_1|2]), (220,329,[1_1|2]), (220,349,[1_1|2]), (220,369,[1_1|2]), (220,167,[1_1|2]), (221,222,[4_1|2]), (222,223,[2_1|2]), (223,224,[4_1|2]), (224,225,[0_1|2]), (225,226,[1_1|2]), (226,227,[3_1|2]), (227,228,[2_1|2]), (228,229,[5_1|2]), (229,230,[1_1|2]), (230,231,[3_1|2]), (231,232,[4_1|2]), (232,233,[4_1|2]), (233,234,[0_1|2]), (234,235,[0_1|2]), (235,236,[1_1|2]), (236,237,[1_1|2]), (237,238,[1_1|2]), (238,239,[2_1|2]), (239,115,[0_1|2]), (239,204,[0_1|2]), (239,184,[0_1|2]), (239,291,[0_1|2]), (239,144,[0_1|2]), (239,116,[4_1|2]), (239,119,[4_1|2]), (240,241,[1_1|2]), (241,242,[3_1|2]), (242,243,[5_1|2]), (243,244,[0_1|2]), (244,115,[5_1|2]), (244,135,[5_1|2]), (244,173,[5_1|2]), (244,245,[5_1|2]), (244,138,[4_1|2]), (244,142,[1_1|2]), (244,160,[1_1|2]), (244,166,[3_1|2]), (244,183,[3_1|2]), (244,193,[3_1|2]), (244,204,[0_1|2]), (244,221,[4_1|2]), (245,246,[4_1|2]), (246,247,[1_1|2]), (247,248,[2_1|2]), (248,249,[1_1|2]), (249,250,[2_1|2]), (250,251,[1_1|2]), (251,252,[0_1|2]), (252,253,[2_1|2]), (253,254,[0_1|2]), (254,255,[4_1|2]), (255,256,[3_1|2]), (256,257,[1_1|2]), (257,258,[0_1|2]), (258,259,[0_1|2]), (259,115,[2_1|2]), (259,116,[2_1|2]), (259,119,[2_1|2]), (259,138,[2_1|2]), (259,221,[2_1|2]), (259,356,[2_1|2]), (259,117,[2_1|2]), (259,222,[2_1|2]), (259,240,[2_1|2]), (259,245,[5_1|2]), (260,261,[5_1|2]), (261,262,[2_1|2]), (262,263,[4_1|2]), (263,264,[5_1|2]), (264,265,[0_1|2]), (265,266,[5_1|2]), (265,183,[3_1|2]), (265,193,[3_1|2]), (266,115,[2_1|2]), (266,135,[2_1|2]), (266,173,[2_1|2]), (266,245,[2_1|2, 5_1|2]), (266,292,[2_1|2]), (266,240,[2_1|2]), (267,268,[2_1|2]), (268,269,[2_1|2]), (269,270,[3_1|2]), (270,271,[1_1|2]), (271,272,[5_1|2]), (272,273,[5_1|2]), (273,274,[5_1|2]), (274,275,[3_1|2]), (275,276,[0_1|2]), (276,277,[3_1|2]), (277,278,[1_1|2]), (278,279,[4_1|2]), (279,280,[3_1|2]), (280,281,[2_1|2]), (280,240,[2_1|2]), (281,282,[3_1|2]), (281,283,[1_1|2]), (281,290,[3_1|2]), (282,115,[1_1|2]), (282,240,[1_1|2]), (283,284,[4_1|2]), (284,285,[3_1|2]), (285,286,[1_1|2]), (286,287,[5_1|2]), (287,288,[0_1|2]), (288,289,[2_1|2]), (289,115,[2_1|2]), (289,166,[2_1|2]), (289,183,[2_1|2]), (289,193,[2_1|2]), (289,260,[2_1|2]), (289,267,[2_1|2]), (289,290,[2_1|2]), (289,303,[2_1|2]), (289,319,[2_1|2]), (289,143,[2_1|2]), (289,240,[2_1|2]), (289,245,[5_1|2]), (290,291,[0_1|2]), (291,292,[5_1|2]), (292,293,[4_1|2]), (293,294,[4_1|2]), (294,295,[4_1|2]), (295,296,[2_1|2]), (296,297,[0_1|2]), (297,298,[0_1|2]), (298,299,[1_1|2]), (299,300,[4_1|2]), (300,301,[3_1|2]), (301,302,[2_1|2]), (301,245,[5_1|2]), (302,115,[4_1|2]), (302,116,[4_1|2]), (302,119,[4_1|2]), (302,138,[4_1|2]), (302,221,[4_1|2]), (302,356,[4_1|2]), (302,369,[1_1|2]), (303,304,[5_1|2]), (304,305,[4_1|2]), (305,306,[4_1|2]), (306,307,[2_1|2]), (307,308,[2_1|2]), (308,309,[0_1|2]), (309,310,[5_1|2]), (309,160,[1_1|2]), (310,115,[1_1|2]), (310,166,[1_1|2]), (310,183,[1_1|2]), (310,193,[1_1|2]), (310,260,[1_1|2]), (310,267,[1_1|2]), (310,290,[1_1|2]), (310,303,[1_1|2]), (310,319,[1_1|2]), (311,312,[2_1|2]), (312,313,[2_1|2]), (313,314,[0_1|2]), (314,315,[0_1|2]), (315,316,[4_1|2]), (316,317,[3_1|2]), (317,318,[4_1|2]), (318,115,[4_1|2]), (318,204,[4_1|2]), (318,174,[4_1|2]), (318,356,[4_1|2]), (318,369,[1_1|2]), (319,320,[4_1|2]), (320,321,[5_1|2]), (321,322,[5_1|2]), (322,323,[3_1|2]), (323,324,[2_1|2]), (324,325,[0_1|2]), (325,326,[5_1|2]), (326,327,[1_1|2]), (327,328,[4_1|2]), (328,115,[2_1|2]), (328,240,[2_1|2]), (328,120,[2_1|2]), (328,139,[2_1|2]), (328,245,[5_1|2]), (329,330,[2_1|2]), (330,331,[4_1|2]), (331,332,[1_1|2]), (332,333,[1_1|2]), (333,334,[2_1|2]), (334,335,[5_1|2]), (335,336,[4_1|2]), (336,337,[2_1|2]), (337,338,[4_1|2]), (338,339,[0_1|2]), (339,340,[4_1|2]), (340,341,[2_1|2]), (341,342,[5_1|2]), (342,343,[1_1|2]), (343,344,[4_1|2]), (344,345,[2_1|2]), (345,346,[1_1|2]), (346,347,[3_1|2]), (346,283,[1_1|2]), (347,348,[1_1|2]), (348,115,[2_1|2]), (348,240,[2_1|2]), (348,268,[2_1|2]), (348,245,[5_1|2]), (349,350,[1_1|2]), (350,351,[2_1|2]), (351,352,[3_1|2]), (352,353,[2_1|2]), (353,354,[3_1|2]), (354,355,[4_1|2]), (355,115,[1_1|2]), (355,166,[1_1|2]), (355,183,[1_1|2]), (355,193,[1_1|2]), (355,260,[1_1|2]), (355,267,[1_1|2]), (355,290,[1_1|2]), (355,303,[1_1|2]), (355,319,[1_1|2]), (355,206,[1_1|2]), (356,357,[5_1|2]), (357,358,[0_1|2]), (358,359,[0_1|2]), (359,360,[4_1|2]), (360,361,[4_1|2]), (361,362,[5_1|2]), (362,363,[4_1|2]), (363,364,[4_1|2]), (364,365,[3_1|2]), (365,366,[4_1|2]), (366,367,[0_1|2]), (367,368,[0_1|2]), (368,115,[0_1|2]), (368,166,[0_1|2]), (368,183,[0_1|2]), (368,193,[0_1|2]), (368,260,[0_1|2]), (368,267,[0_1|2]), (368,290,[0_1|2]), (368,303,[0_1|2]), (368,319,[0_1|2]), (368,116,[4_1|2]), (368,119,[4_1|2]), (369,370,[5_1|2]), (370,371,[3_1|2]), (371,372,[5_1|2]), (372,373,[2_1|2]), (373,374,[0_1|2]), (374,375,[5_1|2]), (375,376,[4_1|2]), (376,377,[4_1|2]), (377,378,[5_1|2]), (378,379,[0_1|2]), (379,380,[1_1|2]), (380,381,[4_1|2]), (381,382,[4_1|2]), (382,383,[3_1|2]), (383,384,[1_1|2]), (384,385,[3_1|2]), (385,386,[2_1|2]), (386,387,[5_1|2]), (386,160,[1_1|2]), (387,115,[1_1|2]), (387,204,[1_1|2]), (387,205,[1_1|2])}" ---------------------------------------- (8) BOUNDS(1, n^1)