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