/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, 42 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(2(3(0(4(4(x1)))))))) -> 0(4(5(0(3(4(0(4(x1)))))))) 0(2(2(2(0(5(2(5(4(x1))))))))) -> 0(0(0(3(4(3(0(1(0(x1))))))))) 2(1(1(3(4(3(1(1(5(x1))))))))) -> 1(0(2(3(1(0(5(1(5(x1))))))))) 5(4(0(4(3(3(1(2(5(3(0(x1))))))))))) -> 5(5(2(5(3(1(5(0(3(5(2(x1))))))))))) 2(4(5(0(1(1(3(3(5(3(0(0(x1)))))))))))) -> 4(4(2(2(1(0(4(0(1(3(2(0(x1)))))))))))) 4(4(3(0(3(1(5(3(5(1(3(1(5(3(x1)))))))))))))) -> 0(2(4(5(0(0(0(5(1(0(5(4(4(x1))))))))))))) 2(2(0(0(2(1(0(5(3(2(2(1(4(0(5(x1))))))))))))))) -> 0(0(3(5(3(0(4(3(1(3(0(2(5(5(x1)))))))))))))) 3(0(0(4(2(5(5(1(3(0(2(3(3(5(1(4(5(x1))))))))))))))))) -> 3(4(0(1(0(5(5(3(1(4(0(3(5(3(2(2(5(x1))))))))))))))))) 5(1(1(4(1(5(3(0(4(3(2(5(4(1(3(3(5(x1))))))))))))))))) -> 5(0(1(0(4(0(2(4(5(1(5(4(1(5(3(3(5(x1))))))))))))))))) 0(1(4(4(3(2(0(4(1(4(3(4(4(1(5(3(4(4(x1)))))))))))))))))) -> 0(2(4(2(3(1(0(1(1(1(3(0(2(4(4(1(1(2(x1)))))))))))))))))) 1(1(4(1(0(1(0(3(3(4(4(1(5(4(0(4(4(5(5(3(x1)))))))))))))))))))) -> 1(3(0(3(2(2(4(4(2(0(3(3(4(0(3(0(4(3(4(0(x1)))))))))))))))))))) 2(0(3(3(3(4(1(1(0(4(4(0(3(3(3(0(0(1(5(3(x1)))))))))))))))))))) -> 5(3(3(1(4(0(4(5(4(4(4(2(4(3(1(1(1(5(4(x1))))))))))))))))))) 2(3(3(2(1(5(0(5(0(1(3(3(2(5(1(5(0(3(0(5(x1)))))))))))))))))))) -> 3(4(0(2(5(5(2(4(2(4(3(1(1(4(4(5(5(3(5(x1))))))))))))))))))) 3(3(2(2(3(3(4(0(0(0(2(5(0(5(3(0(0(1(1(4(x1)))))))))))))))))))) -> 3(1(1(0(3(3(5(4(2(2(1(0(1(1(0(5(0(3(4(0(x1)))))))))))))))))))) 4(2(4(1(0(5(0(4(1(0(3(0(2(5(4(3(5(3(5(3(x1)))))))))))))))))))) -> 4(2(5(4(4(2(4(5(0(0(3(1(5(0(2(0(2(2(1(x1))))))))))))))))))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_1(x_1)) -> 1(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(2(3(0(4(4(x1)))))))) -> 0(4(5(0(3(4(0(4(x1)))))))) 0(2(2(2(0(5(2(5(4(x1))))))))) -> 0(0(0(3(4(3(0(1(0(x1))))))))) 2(1(1(3(4(3(1(1(5(x1))))))))) -> 1(0(2(3(1(0(5(1(5(x1))))))))) 5(4(0(4(3(3(1(2(5(3(0(x1))))))))))) -> 5(5(2(5(3(1(5(0(3(5(2(x1))))))))))) 2(4(5(0(1(1(3(3(5(3(0(0(x1)))))))))))) -> 4(4(2(2(1(0(4(0(1(3(2(0(x1)))))))))))) 4(4(3(0(3(1(5(3(5(1(3(1(5(3(x1)))))))))))))) -> 0(2(4(5(0(0(0(5(1(0(5(4(4(x1))))))))))))) 2(2(0(0(2(1(0(5(3(2(2(1(4(0(5(x1))))))))))))))) -> 0(0(3(5(3(0(4(3(1(3(0(2(5(5(x1)))))))))))))) 3(0(0(4(2(5(5(1(3(0(2(3(3(5(1(4(5(x1))))))))))))))))) -> 3(4(0(1(0(5(5(3(1(4(0(3(5(3(2(2(5(x1))))))))))))))))) 5(1(1(4(1(5(3(0(4(3(2(5(4(1(3(3(5(x1))))))))))))))))) -> 5(0(1(0(4(0(2(4(5(1(5(4(1(5(3(3(5(x1))))))))))))))))) 0(1(4(4(3(2(0(4(1(4(3(4(4(1(5(3(4(4(x1)))))))))))))))))) -> 0(2(4(2(3(1(0(1(1(1(3(0(2(4(4(1(1(2(x1)))))))))))))))))) 1(1(4(1(0(1(0(3(3(4(4(1(5(4(0(4(4(5(5(3(x1)))))))))))))))))))) -> 1(3(0(3(2(2(4(4(2(0(3(3(4(0(3(0(4(3(4(0(x1)))))))))))))))))))) 2(0(3(3(3(4(1(1(0(4(4(0(3(3(3(0(0(1(5(3(x1)))))))))))))))))))) -> 5(3(3(1(4(0(4(5(4(4(4(2(4(3(1(1(1(5(4(x1))))))))))))))))))) 2(3(3(2(1(5(0(5(0(1(3(3(2(5(1(5(0(3(0(5(x1)))))))))))))))))))) -> 3(4(0(2(5(5(2(4(2(4(3(1(1(4(4(5(5(3(5(x1))))))))))))))))))) 3(3(2(2(3(3(4(0(0(0(2(5(0(5(3(0(0(1(1(4(x1)))))))))))))))))))) -> 3(1(1(0(3(3(5(4(2(2(1(0(1(1(0(5(0(3(4(0(x1)))))))))))))))))))) 4(2(4(1(0(5(0(4(1(0(3(0(2(5(4(3(5(3(5(3(x1)))))))))))))))))))) -> 4(2(5(4(4(2(4(5(0(0(3(1(5(0(2(0(2(2(1(x1))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_1(x_1)) -> 1(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(2(3(0(4(4(x1)))))))) -> 0(4(5(0(3(4(0(4(x1)))))))) 0(2(2(2(0(5(2(5(4(x1))))))))) -> 0(0(0(3(4(3(0(1(0(x1))))))))) 2(1(1(3(4(3(1(1(5(x1))))))))) -> 1(0(2(3(1(0(5(1(5(x1))))))))) 5(4(0(4(3(3(1(2(5(3(0(x1))))))))))) -> 5(5(2(5(3(1(5(0(3(5(2(x1))))))))))) 2(4(5(0(1(1(3(3(5(3(0(0(x1)))))))))))) -> 4(4(2(2(1(0(4(0(1(3(2(0(x1)))))))))))) 4(4(3(0(3(1(5(3(5(1(3(1(5(3(x1)))))))))))))) -> 0(2(4(5(0(0(0(5(1(0(5(4(4(x1))))))))))))) 2(2(0(0(2(1(0(5(3(2(2(1(4(0(5(x1))))))))))))))) -> 0(0(3(5(3(0(4(3(1(3(0(2(5(5(x1)))))))))))))) 3(0(0(4(2(5(5(1(3(0(2(3(3(5(1(4(5(x1))))))))))))))))) -> 3(4(0(1(0(5(5(3(1(4(0(3(5(3(2(2(5(x1))))))))))))))))) 5(1(1(4(1(5(3(0(4(3(2(5(4(1(3(3(5(x1))))))))))))))))) -> 5(0(1(0(4(0(2(4(5(1(5(4(1(5(3(3(5(x1))))))))))))))))) 0(1(4(4(3(2(0(4(1(4(3(4(4(1(5(3(4(4(x1)))))))))))))))))) -> 0(2(4(2(3(1(0(1(1(1(3(0(2(4(4(1(1(2(x1)))))))))))))))))) 1(1(4(1(0(1(0(3(3(4(4(1(5(4(0(4(4(5(5(3(x1)))))))))))))))))))) -> 1(3(0(3(2(2(4(4(2(0(3(3(4(0(3(0(4(3(4(0(x1)))))))))))))))))))) 2(0(3(3(3(4(1(1(0(4(4(0(3(3(3(0(0(1(5(3(x1)))))))))))))))))))) -> 5(3(3(1(4(0(4(5(4(4(4(2(4(3(1(1(1(5(4(x1))))))))))))))))))) 2(3(3(2(1(5(0(5(0(1(3(3(2(5(1(5(0(3(0(5(x1)))))))))))))))))))) -> 3(4(0(2(5(5(2(4(2(4(3(1(1(4(4(5(5(3(5(x1))))))))))))))))))) 3(3(2(2(3(3(4(0(0(0(2(5(0(5(3(0(0(1(1(4(x1)))))))))))))))))))) -> 3(1(1(0(3(3(5(4(2(2(1(0(1(1(0(5(0(3(4(0(x1)))))))))))))))))))) 4(2(4(1(0(5(0(4(1(0(3(0(2(5(4(3(5(3(5(3(x1)))))))))))))))))))) -> 4(2(5(4(4(2(4(5(0(0(3(1(5(0(2(0(2(2(1(x1))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_1(x_1)) -> 1(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(2(3(0(4(4(x1)))))))) -> 0(4(5(0(3(4(0(4(x1)))))))) 0(2(2(2(0(5(2(5(4(x1))))))))) -> 0(0(0(3(4(3(0(1(0(x1))))))))) 2(1(1(3(4(3(1(1(5(x1))))))))) -> 1(0(2(3(1(0(5(1(5(x1))))))))) 5(4(0(4(3(3(1(2(5(3(0(x1))))))))))) -> 5(5(2(5(3(1(5(0(3(5(2(x1))))))))))) 2(4(5(0(1(1(3(3(5(3(0(0(x1)))))))))))) -> 4(4(2(2(1(0(4(0(1(3(2(0(x1)))))))))))) 4(4(3(0(3(1(5(3(5(1(3(1(5(3(x1)))))))))))))) -> 0(2(4(5(0(0(0(5(1(0(5(4(4(x1))))))))))))) 2(2(0(0(2(1(0(5(3(2(2(1(4(0(5(x1))))))))))))))) -> 0(0(3(5(3(0(4(3(1(3(0(2(5(5(x1)))))))))))))) 3(0(0(4(2(5(5(1(3(0(2(3(3(5(1(4(5(x1))))))))))))))))) -> 3(4(0(1(0(5(5(3(1(4(0(3(5(3(2(2(5(x1))))))))))))))))) 5(1(1(4(1(5(3(0(4(3(2(5(4(1(3(3(5(x1))))))))))))))))) -> 5(0(1(0(4(0(2(4(5(1(5(4(1(5(3(3(5(x1))))))))))))))))) 0(1(4(4(3(2(0(4(1(4(3(4(4(1(5(3(4(4(x1)))))))))))))))))) -> 0(2(4(2(3(1(0(1(1(1(3(0(2(4(4(1(1(2(x1)))))))))))))))))) 1(1(4(1(0(1(0(3(3(4(4(1(5(4(0(4(4(5(5(3(x1)))))))))))))))))))) -> 1(3(0(3(2(2(4(4(2(0(3(3(4(0(3(0(4(3(4(0(x1)))))))))))))))))))) 2(0(3(3(3(4(1(1(0(4(4(0(3(3(3(0(0(1(5(3(x1)))))))))))))))))))) -> 5(3(3(1(4(0(4(5(4(4(4(2(4(3(1(1(1(5(4(x1))))))))))))))))))) 2(3(3(2(1(5(0(5(0(1(3(3(2(5(1(5(0(3(0(5(x1)))))))))))))))))))) -> 3(4(0(2(5(5(2(4(2(4(3(1(1(4(4(5(5(3(5(x1))))))))))))))))))) 3(3(2(2(3(3(4(0(0(0(2(5(0(5(3(0(0(1(1(4(x1)))))))))))))))))))) -> 3(1(1(0(3(3(5(4(2(2(1(0(1(1(0(5(0(3(4(0(x1)))))))))))))))))))) 4(2(4(1(0(5(0(4(1(0(3(0(2(5(4(3(5(3(5(3(x1)))))))))))))))))))) -> 4(2(5(4(4(2(4(5(0(0(3(1(5(0(2(0(2(2(1(x1))))))))))))))))))) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_2(x_1)) -> 2(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encArg(cons_4(x_1)) -> 4(encArg(x_1)) encArg(cons_3(x_1)) -> 3(encArg(x_1)) encArg(cons_1(x_1)) -> 1(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] {(148,149,[0_1|0, 2_1|0, 5_1|0, 4_1|0, 3_1|0, 1_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, 2_1|1, 5_1|1, 4_1|1, 3_1|1, 1_1|1]), (148,151,[0_1|2]), (148,158,[0_1|2]), (148,175,[0_1|2]), (148,183,[1_1|2]), (148,191,[4_1|2]), (148,202,[0_1|2]), (148,215,[5_1|2]), (148,233,[3_1|2]), (148,251,[5_1|2]), (148,261,[5_1|2]), (148,277,[0_1|2]), (148,289,[4_1|2]), (148,307,[3_1|2]), (148,323,[3_1|2]), (148,342,[1_1|2]), (149,149,[cons_0_1|0, cons_2_1|0, cons_5_1|0, cons_4_1|0, cons_3_1|0, cons_1_1|0]), (150,149,[encArg_1|1]), (150,150,[0_1|1, 2_1|1, 5_1|1, 4_1|1, 3_1|1, 1_1|1]), (150,151,[0_1|2]), (150,158,[0_1|2]), (150,175,[0_1|2]), (150,183,[1_1|2]), (150,191,[4_1|2]), (150,202,[0_1|2]), (150,215,[5_1|2]), (150,233,[3_1|2]), (150,251,[5_1|2]), (150,261,[5_1|2]), (150,277,[0_1|2]), (150,289,[4_1|2]), (150,307,[3_1|2]), (150,323,[3_1|2]), (150,342,[1_1|2]), (151,152,[4_1|2]), (152,153,[5_1|2]), (153,154,[0_1|2]), (154,155,[3_1|2]), (155,156,[4_1|2]), (156,157,[0_1|2]), (157,150,[4_1|2]), (157,191,[4_1|2]), (157,289,[4_1|2]), (157,192,[4_1|2]), (157,277,[0_1|2]), (158,159,[2_1|2]), (159,160,[4_1|2]), (160,161,[2_1|2]), (161,162,[3_1|2]), (162,163,[1_1|2]), (163,164,[0_1|2]), (164,165,[1_1|2]), (165,166,[1_1|2]), (166,167,[1_1|2]), (167,168,[3_1|2]), (168,169,[0_1|2]), (169,170,[2_1|2]), (170,171,[4_1|2]), (171,172,[4_1|2]), (172,173,[1_1|2]), (173,174,[1_1|2]), (174,150,[2_1|2]), (174,191,[2_1|2, 4_1|2]), (174,289,[2_1|2]), (174,192,[2_1|2]), (174,183,[1_1|2]), (174,202,[0_1|2]), (174,215,[5_1|2]), (174,233,[3_1|2]), (175,176,[0_1|2]), (176,177,[0_1|2]), (177,178,[3_1|2]), (178,179,[4_1|2]), (179,180,[3_1|2]), (180,181,[0_1|2]), (181,182,[1_1|2]), (182,150,[0_1|2]), (182,191,[0_1|2]), (182,289,[0_1|2]), (182,151,[0_1|2]), (182,158,[0_1|2]), (182,175,[0_1|2]), (183,184,[0_1|2]), (184,185,[2_1|2]), (185,186,[3_1|2]), (186,187,[1_1|2]), (187,188,[0_1|2]), (188,189,[5_1|2]), (189,190,[1_1|2]), (190,150,[5_1|2]), (190,215,[5_1|2]), (190,251,[5_1|2]), (190,261,[5_1|2]), (191,192,[4_1|2]), (192,193,[2_1|2]), (193,194,[2_1|2]), (194,195,[1_1|2]), (195,196,[0_1|2]), (196,197,[4_1|2]), (197,198,[0_1|2]), (198,199,[1_1|2]), (199,200,[3_1|2]), (200,201,[2_1|2]), (200,215,[5_1|2]), (201,150,[0_1|2]), (201,151,[0_1|2]), (201,158,[0_1|2]), (201,175,[0_1|2]), (201,202,[0_1|2]), (201,277,[0_1|2]), (201,176,[0_1|2]), (201,203,[0_1|2]), (202,203,[0_1|2]), (203,204,[3_1|2]), (204,205,[5_1|2]), (205,206,[3_1|2]), (206,207,[0_1|2]), (207,208,[4_1|2]), (208,209,[3_1|2]), (209,210,[1_1|2]), (210,211,[3_1|2]), (211,212,[0_1|2]), (212,213,[2_1|2]), (213,214,[5_1|2]), (214,150,[5_1|2]), (214,215,[5_1|2]), (214,251,[5_1|2]), (214,261,[5_1|2]), (215,216,[3_1|2]), (216,217,[3_1|2]), (217,218,[1_1|2]), (218,219,[4_1|2]), (219,220,[0_1|2]), (220,221,[4_1|2]), (221,222,[5_1|2]), (222,223,[4_1|2]), (223,224,[4_1|2]), (224,225,[4_1|2]), (225,226,[2_1|2]), (226,227,[4_1|2]), (227,228,[3_1|2]), (228,229,[1_1|2]), (229,230,[1_1|2]), (230,231,[1_1|2]), (231,232,[5_1|2]), (231,251,[5_1|2]), (232,150,[4_1|2]), (232,233,[4_1|2]), (232,307,[4_1|2]), (232,323,[4_1|2]), (232,216,[4_1|2]), (232,277,[0_1|2]), (232,289,[4_1|2]), (233,234,[4_1|2]), (234,235,[0_1|2]), (235,236,[2_1|2]), (236,237,[5_1|2]), (237,238,[5_1|2]), (238,239,[2_1|2]), (239,240,[4_1|2]), (240,241,[2_1|2]), (241,242,[4_1|2]), (242,243,[3_1|2]), (243,244,[1_1|2]), (244,245,[1_1|2]), (245,246,[4_1|2]), (246,247,[4_1|2]), (247,248,[5_1|2]), (248,249,[5_1|2]), (249,250,[3_1|2]), (250,150,[5_1|2]), (250,215,[5_1|2]), (250,251,[5_1|2]), (250,261,[5_1|2]), (251,252,[5_1|2]), (252,253,[2_1|2]), (253,254,[5_1|2]), (254,255,[3_1|2]), (255,256,[1_1|2]), (256,257,[5_1|2]), (257,258,[0_1|2]), (258,259,[3_1|2]), (259,260,[5_1|2]), (260,150,[2_1|2]), (260,151,[2_1|2]), (260,158,[2_1|2]), (260,175,[2_1|2]), (260,202,[2_1|2, 0_1|2]), (260,277,[2_1|2]), (260,183,[1_1|2]), (260,191,[4_1|2]), (260,215,[5_1|2]), (260,233,[3_1|2]), (261,262,[0_1|2]), (262,263,[1_1|2]), (263,264,[0_1|2]), (264,265,[4_1|2]), (265,266,[0_1|2]), (266,267,[2_1|2]), (267,268,[4_1|2]), (268,269,[5_1|2]), (269,270,[1_1|2]), (270,271,[5_1|2]), (271,272,[4_1|2]), (272,273,[1_1|2]), (273,274,[5_1|2]), (274,275,[3_1|2]), (275,276,[3_1|2]), (276,150,[5_1|2]), (276,215,[5_1|2]), (276,251,[5_1|2]), (276,261,[5_1|2]), (277,278,[2_1|2]), (278,279,[4_1|2]), (279,280,[5_1|2]), (280,281,[0_1|2]), (281,282,[0_1|2]), (282,283,[0_1|2]), (283,284,[5_1|2]), (284,285,[1_1|2]), (285,286,[0_1|2]), (286,287,[5_1|2]), (287,288,[4_1|2]), (287,277,[0_1|2]), (288,150,[4_1|2]), (288,233,[4_1|2]), (288,307,[4_1|2]), (288,323,[4_1|2]), (288,216,[4_1|2]), (288,277,[0_1|2]), (288,289,[4_1|2]), (289,290,[2_1|2]), (290,291,[5_1|2]), (291,292,[4_1|2]), (292,293,[4_1|2]), (293,294,[2_1|2]), (294,295,[4_1|2]), (295,296,[5_1|2]), (296,297,[0_1|2]), (297,298,[0_1|2]), (298,299,[3_1|2]), (299,300,[1_1|2]), (300,301,[5_1|2]), (301,302,[0_1|2]), (302,303,[2_1|2]), (303,304,[0_1|2]), (304,305,[2_1|2]), (305,306,[2_1|2]), (305,183,[1_1|2]), (306,150,[1_1|2]), (306,233,[1_1|2]), (306,307,[1_1|2]), (306,323,[1_1|2]), (306,216,[1_1|2]), (306,342,[1_1|2]), (307,308,[4_1|2]), (308,309,[0_1|2]), (309,310,[1_1|2]), (310,311,[0_1|2]), (311,312,[5_1|2]), (312,313,[5_1|2]), (313,314,[3_1|2]), (314,315,[1_1|2]), (315,316,[4_1|2]), (316,317,[0_1|2]), (317,318,[3_1|2]), (318,319,[5_1|2]), (319,320,[3_1|2]), (320,321,[2_1|2]), (321,322,[2_1|2]), (322,150,[5_1|2]), (322,215,[5_1|2]), (322,251,[5_1|2]), (322,261,[5_1|2]), (323,324,[1_1|2]), (324,325,[1_1|2]), (325,326,[0_1|2]), (326,327,[3_1|2]), (327,328,[3_1|2]), (328,329,[5_1|2]), (329,330,[4_1|2]), (330,331,[2_1|2]), (331,332,[2_1|2]), (332,333,[1_1|2]), (333,334,[0_1|2]), (334,335,[1_1|2]), (335,336,[1_1|2]), (336,337,[0_1|2]), (337,338,[5_1|2]), (338,339,[0_1|2]), (339,340,[3_1|2]), (340,341,[4_1|2]), (341,150,[0_1|2]), (341,191,[0_1|2]), (341,289,[0_1|2]), (341,151,[0_1|2]), (341,158,[0_1|2]), (341,175,[0_1|2]), (342,343,[3_1|2]), (343,344,[0_1|2]), (344,345,[3_1|2]), (345,346,[2_1|2]), (346,347,[2_1|2]), (347,348,[4_1|2]), (348,349,[4_1|2]), (349,350,[2_1|2]), (350,351,[0_1|2]), (351,352,[3_1|2]), (352,353,[3_1|2]), (353,354,[4_1|2]), (354,355,[0_1|2]), (355,356,[3_1|2]), (356,357,[0_1|2]), (357,358,[4_1|2]), (358,359,[3_1|2]), (359,360,[4_1|2]), (360,150,[0_1|2]), (360,233,[0_1|2]), (360,307,[0_1|2]), (360,323,[0_1|2]), (360,216,[0_1|2]), (360,151,[0_1|2]), (360,158,[0_1|2]), (360,175,[0_1|2])}" ---------------------------------------- (8) BOUNDS(1, n^1)