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