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