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