/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), 72 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 6 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(2(1(x1))) -> 0(4(0(1(4(5(1(5(0(1(x1)))))))))) 1(1(3(x1))) -> 1(2(1(2(2(2(5(1(4(2(x1)))))))))) 0(0(0(3(x1)))) -> 4(2(4(0(2(5(3(3(4(5(x1)))))))))) 1(0(2(3(x1)))) -> 1(1(2(5(4(1(2(4(3(2(x1)))))))))) 1(3(5(3(x1)))) -> 3(5(4(5(2(4(3(2(5(4(x1)))))))))) 0(2(3(1(3(x1))))) -> 1(0(1(2(1(3(1(3(1(2(x1)))))))))) 0(3(4(5(3(x1))))) -> 2(0(2(5(1(2(4(4(5(5(x1)))))))))) 0(5(2(1(3(x1))))) -> 2(4(2(5(2(4(3(0(2(4(x1)))))))))) 2(1(3(1(0(x1))))) -> 0(1(4(5(1(5(5(2(3(0(x1)))))))))) 0(5(2(2(2(0(x1)))))) -> 2(5(4(3(0(2(5(1(2(1(x1)))))))))) 2(0(0(5(2(0(x1)))))) -> 4(0(4(2(1(4(4(4(0(1(x1)))))))))) 2(0(5(3(0(2(x1)))))) -> 2(5(3(5(1(4(5(0(0(2(x1)))))))))) 2(1(0(2(1(5(x1)))))) -> 2(5(4(1(3(2(2(5(4(5(x1)))))))))) 5(1(5(1(0(2(x1)))))) -> 4(5(0(0(4(3(1(1(0(4(x1)))))))))) 0(5(2(2(2(1(0(x1))))))) -> 0(3(2(3(1(4(1(0(1(0(x1)))))))))) 0(5(3(5(3(1(5(x1))))))) -> 0(1(3(4(0(1(4(5(1(5(x1)))))))))) 1(1(5(1(4(4(3(x1))))))) -> 1(0(3(4(4(1(0(2(5(5(x1)))))))))) 1(3(2(3(0(5(3(x1))))))) -> 1(4(0(1(5(4(0(3(2(5(x1)))))))))) 1(5(2(4(2(1(1(x1))))))) -> 4(4(1(4(1(4(3(1(0(3(x1)))))))))) 2(0(2(0(2(1(0(x1))))))) -> 2(0(2(3(4(2(4(4(4(0(x1)))))))))) 2(4(5(5(1(3(5(x1))))))) -> 2(1(2(1(4(4(4(3(4(4(x1)))))))))) 3(0(0(5(5(2(1(x1))))))) -> 0(2(4(3(2(3(2(1(0(3(x1)))))))))) 3(1(5(2(3(0(5(x1))))))) -> 5(3(4(0(4(5(2(0(0(4(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(4(x_1)) -> 4(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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_3(x_1)) -> 3(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) encode_3(x_1) -> 3(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(2(1(x1))) -> 0(4(0(1(4(5(1(5(0(1(x1)))))))))) 1(1(3(x1))) -> 1(2(1(2(2(2(5(1(4(2(x1)))))))))) 0(0(0(3(x1)))) -> 4(2(4(0(2(5(3(3(4(5(x1)))))))))) 1(0(2(3(x1)))) -> 1(1(2(5(4(1(2(4(3(2(x1)))))))))) 1(3(5(3(x1)))) -> 3(5(4(5(2(4(3(2(5(4(x1)))))))))) 0(2(3(1(3(x1))))) -> 1(0(1(2(1(3(1(3(1(2(x1)))))))))) 0(3(4(5(3(x1))))) -> 2(0(2(5(1(2(4(4(5(5(x1)))))))))) 0(5(2(1(3(x1))))) -> 2(4(2(5(2(4(3(0(2(4(x1)))))))))) 2(1(3(1(0(x1))))) -> 0(1(4(5(1(5(5(2(3(0(x1)))))))))) 0(5(2(2(2(0(x1)))))) -> 2(5(4(3(0(2(5(1(2(1(x1)))))))))) 2(0(0(5(2(0(x1)))))) -> 4(0(4(2(1(4(4(4(0(1(x1)))))))))) 2(0(5(3(0(2(x1)))))) -> 2(5(3(5(1(4(5(0(0(2(x1)))))))))) 2(1(0(2(1(5(x1)))))) -> 2(5(4(1(3(2(2(5(4(5(x1)))))))))) 5(1(5(1(0(2(x1)))))) -> 4(5(0(0(4(3(1(1(0(4(x1)))))))))) 0(5(2(2(2(1(0(x1))))))) -> 0(3(2(3(1(4(1(0(1(0(x1)))))))))) 0(5(3(5(3(1(5(x1))))))) -> 0(1(3(4(0(1(4(5(1(5(x1)))))))))) 1(1(5(1(4(4(3(x1))))))) -> 1(0(3(4(4(1(0(2(5(5(x1)))))))))) 1(3(2(3(0(5(3(x1))))))) -> 1(4(0(1(5(4(0(3(2(5(x1)))))))))) 1(5(2(4(2(1(1(x1))))))) -> 4(4(1(4(1(4(3(1(0(3(x1)))))))))) 2(0(2(0(2(1(0(x1))))))) -> 2(0(2(3(4(2(4(4(4(0(x1)))))))))) 2(4(5(5(1(3(5(x1))))))) -> 2(1(2(1(4(4(4(3(4(4(x1)))))))))) 3(0(0(5(5(2(1(x1))))))) -> 0(2(4(3(2(3(2(1(0(3(x1)))))))))) 3(1(5(2(3(0(5(x1))))))) -> 5(3(4(0(4(5(2(0(0(4(x1)))))))))) The (relative) TRS S consists of the following rules: encArg(4(x_1)) -> 4(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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_3(x_1)) -> 3(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) encode_3(x_1) -> 3(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(2(1(x1))) -> 0(4(0(1(4(5(1(5(0(1(x1)))))))))) 1(1(3(x1))) -> 1(2(1(2(2(2(5(1(4(2(x1)))))))))) 0(0(0(3(x1)))) -> 4(2(4(0(2(5(3(3(4(5(x1)))))))))) 1(0(2(3(x1)))) -> 1(1(2(5(4(1(2(4(3(2(x1)))))))))) 1(3(5(3(x1)))) -> 3(5(4(5(2(4(3(2(5(4(x1)))))))))) 0(2(3(1(3(x1))))) -> 1(0(1(2(1(3(1(3(1(2(x1)))))))))) 0(3(4(5(3(x1))))) -> 2(0(2(5(1(2(4(4(5(5(x1)))))))))) 0(5(2(1(3(x1))))) -> 2(4(2(5(2(4(3(0(2(4(x1)))))))))) 2(1(3(1(0(x1))))) -> 0(1(4(5(1(5(5(2(3(0(x1)))))))))) 0(5(2(2(2(0(x1)))))) -> 2(5(4(3(0(2(5(1(2(1(x1)))))))))) 2(0(0(5(2(0(x1)))))) -> 4(0(4(2(1(4(4(4(0(1(x1)))))))))) 2(0(5(3(0(2(x1)))))) -> 2(5(3(5(1(4(5(0(0(2(x1)))))))))) 2(1(0(2(1(5(x1)))))) -> 2(5(4(1(3(2(2(5(4(5(x1)))))))))) 5(1(5(1(0(2(x1)))))) -> 4(5(0(0(4(3(1(1(0(4(x1)))))))))) 0(5(2(2(2(1(0(x1))))))) -> 0(3(2(3(1(4(1(0(1(0(x1)))))))))) 0(5(3(5(3(1(5(x1))))))) -> 0(1(3(4(0(1(4(5(1(5(x1)))))))))) 1(1(5(1(4(4(3(x1))))))) -> 1(0(3(4(4(1(0(2(5(5(x1)))))))))) 1(3(2(3(0(5(3(x1))))))) -> 1(4(0(1(5(4(0(3(2(5(x1)))))))))) 1(5(2(4(2(1(1(x1))))))) -> 4(4(1(4(1(4(3(1(0(3(x1)))))))))) 2(0(2(0(2(1(0(x1))))))) -> 2(0(2(3(4(2(4(4(4(0(x1)))))))))) 2(4(5(5(1(3(5(x1))))))) -> 2(1(2(1(4(4(4(3(4(4(x1)))))))))) 3(0(0(5(5(2(1(x1))))))) -> 0(2(4(3(2(3(2(1(0(3(x1)))))))))) 3(1(5(2(3(0(5(x1))))))) -> 5(3(4(0(4(5(2(0(0(4(x1)))))))))) The (relative) TRS S consists of the following rules: encArg(4(x_1)) -> 4(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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_3(x_1)) -> 3(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) encode_3(x_1) -> 3(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(2(1(x1))) -> 0(4(0(1(4(5(1(5(0(1(x1)))))))))) 1(1(3(x1))) -> 1(2(1(2(2(2(5(1(4(2(x1)))))))))) 0(0(0(3(x1)))) -> 4(2(4(0(2(5(3(3(4(5(x1)))))))))) 1(0(2(3(x1)))) -> 1(1(2(5(4(1(2(4(3(2(x1)))))))))) 1(3(5(3(x1)))) -> 3(5(4(5(2(4(3(2(5(4(x1)))))))))) 0(2(3(1(3(x1))))) -> 1(0(1(2(1(3(1(3(1(2(x1)))))))))) 0(3(4(5(3(x1))))) -> 2(0(2(5(1(2(4(4(5(5(x1)))))))))) 0(5(2(1(3(x1))))) -> 2(4(2(5(2(4(3(0(2(4(x1)))))))))) 2(1(3(1(0(x1))))) -> 0(1(4(5(1(5(5(2(3(0(x1)))))))))) 0(5(2(2(2(0(x1)))))) -> 2(5(4(3(0(2(5(1(2(1(x1)))))))))) 2(0(0(5(2(0(x1)))))) -> 4(0(4(2(1(4(4(4(0(1(x1)))))))))) 2(0(5(3(0(2(x1)))))) -> 2(5(3(5(1(4(5(0(0(2(x1)))))))))) 2(1(0(2(1(5(x1)))))) -> 2(5(4(1(3(2(2(5(4(5(x1)))))))))) 5(1(5(1(0(2(x1)))))) -> 4(5(0(0(4(3(1(1(0(4(x1)))))))))) 0(5(2(2(2(1(0(x1))))))) -> 0(3(2(3(1(4(1(0(1(0(x1)))))))))) 0(5(3(5(3(1(5(x1))))))) -> 0(1(3(4(0(1(4(5(1(5(x1)))))))))) 1(1(5(1(4(4(3(x1))))))) -> 1(0(3(4(4(1(0(2(5(5(x1)))))))))) 1(3(2(3(0(5(3(x1))))))) -> 1(4(0(1(5(4(0(3(2(5(x1)))))))))) 1(5(2(4(2(1(1(x1))))))) -> 4(4(1(4(1(4(3(1(0(3(x1)))))))))) 2(0(2(0(2(1(0(x1))))))) -> 2(0(2(3(4(2(4(4(4(0(x1)))))))))) 2(4(5(5(1(3(5(x1))))))) -> 2(1(2(1(4(4(4(3(4(4(x1)))))))))) 3(0(0(5(5(2(1(x1))))))) -> 0(2(4(3(2(3(2(1(0(3(x1)))))))))) 3(1(5(2(3(0(5(x1))))))) -> 5(3(4(0(4(5(2(0(0(4(x1)))))))))) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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_3(x_1)) -> 3(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) encode_5(x_1) -> 5(encArg(x_1)) encode_3(x_1) -> 3(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 3. The certificate found is represented by the following graph. "[89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 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, 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, 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] {(89,90,[0_1|0, 1_1|0, 2_1|0, 5_1|0, 3_1|0, encArg_1|0, encode_0_1|0, encode_2_1|0, encode_1_1|0, encode_4_1|0, encode_5_1|0, encode_3_1|0]), (89,91,[4_1|1, 0_1|1, 1_1|1, 2_1|1, 5_1|1, 3_1|1]), (89,92,[0_1|2]), (89,101,[1_1|2]), (89,110,[4_1|2]), (89,119,[2_1|2]), (89,128,[2_1|2]), (89,137,[2_1|2]), (89,146,[0_1|2]), (89,155,[0_1|2]), (89,164,[1_1|2]), (89,173,[1_1|2]), (89,182,[1_1|2]), (89,191,[3_1|2]), (89,200,[1_1|2]), (89,209,[4_1|2]), (89,218,[0_1|2]), (89,227,[2_1|2]), (89,248,[4_1|2]), (89,257,[2_1|2]), (89,266,[2_1|2]), (89,275,[2_1|2]), (89,284,[4_1|2]), (89,293,[0_1|2]), (89,302,[5_1|2]), (90,90,[4_1|0, cons_0_1|0, cons_1_1|0, cons_2_1|0, cons_5_1|0, cons_3_1|0]), (91,90,[encArg_1|1]), (91,91,[4_1|1, 0_1|1, 1_1|1, 2_1|1, 5_1|1, 3_1|1]), (91,92,[0_1|2]), (91,101,[1_1|2]), (91,110,[4_1|2]), (91,119,[2_1|2]), (91,128,[2_1|2]), (91,137,[2_1|2]), (91,146,[0_1|2]), (91,155,[0_1|2]), (91,164,[1_1|2]), (91,173,[1_1|2]), (91,182,[1_1|2]), (91,191,[3_1|2]), (91,200,[1_1|2]), (91,209,[4_1|2]), (91,218,[0_1|2]), (91,227,[2_1|2]), (91,248,[4_1|2]), (91,257,[2_1|2]), (91,266,[2_1|2]), (91,275,[2_1|2]), (91,284,[4_1|2]), (91,293,[0_1|2]), (91,302,[5_1|2]), (92,93,[4_1|2]), (93,94,[0_1|2]), (94,95,[1_1|2]), (95,96,[4_1|2]), (96,97,[5_1|2]), (97,98,[1_1|2]), (98,99,[5_1|2]), (99,100,[0_1|2]), (100,91,[1_1|2]), (100,101,[1_1|2]), (100,164,[1_1|2]), (100,173,[1_1|2]), (100,182,[1_1|2]), (100,200,[1_1|2]), (100,276,[1_1|2]), (100,191,[3_1|2]), (100,209,[4_1|2]), (101,102,[0_1|2]), (102,103,[1_1|2]), (103,104,[2_1|2]), (104,105,[1_1|2]), (105,106,[3_1|2]), (106,107,[1_1|2]), (107,108,[3_1|2]), (108,109,[1_1|2]), (109,91,[2_1|2]), (109,191,[2_1|2]), (109,218,[0_1|2]), (109,227,[2_1|2]), (109,248,[4_1|2]), (109,257,[2_1|2]), (109,266,[2_1|2]), (109,275,[2_1|2]), (110,111,[2_1|2]), (111,112,[4_1|2]), (112,113,[0_1|2]), (113,114,[2_1|2]), (114,115,[5_1|2]), (115,116,[3_1|2]), (116,117,[3_1|2]), (117,118,[4_1|2]), (118,91,[5_1|2]), (118,191,[5_1|2]), (118,147,[5_1|2]), (118,284,[4_1|2]), (119,120,[0_1|2]), (120,121,[2_1|2]), (121,122,[5_1|2]), (122,123,[1_1|2]), (123,124,[2_1|2]), (124,125,[4_1|2]), (125,126,[4_1|2]), (126,127,[5_1|2]), (127,91,[5_1|2]), (127,191,[5_1|2]), (127,303,[5_1|2]), (127,284,[4_1|2]), (128,129,[4_1|2]), (129,130,[2_1|2]), (130,131,[5_1|2]), (131,132,[2_1|2]), (132,133,[4_1|2]), (133,134,[3_1|2]), (134,135,[0_1|2]), (134,335,[0_1|3]), (135,136,[2_1|2]), (135,275,[2_1|2]), (136,91,[4_1|2]), (136,191,[4_1|2]), (137,138,[5_1|2]), (138,139,[4_1|2]), (139,140,[3_1|2]), (140,141,[0_1|2]), (141,142,[2_1|2]), (142,143,[5_1|2]), (143,144,[1_1|2]), (144,145,[2_1|2]), (144,218,[0_1|2]), (144,227,[2_1|2]), (145,91,[1_1|2]), (145,92,[1_1|2]), (145,146,[1_1|2]), (145,155,[1_1|2]), (145,218,[1_1|2]), (145,293,[1_1|2]), (145,120,[1_1|2]), (145,267,[1_1|2]), (145,164,[1_1|2]), (145,173,[1_1|2]), (145,182,[1_1|2]), (145,191,[3_1|2]), (145,200,[1_1|2]), (145,209,[4_1|2]), (145,353,[1_1|3]), (146,147,[3_1|2]), (147,148,[2_1|2]), (148,149,[3_1|2]), (149,150,[1_1|2]), (150,151,[4_1|2]), (151,152,[1_1|2]), (152,153,[0_1|2]), (153,154,[1_1|2]), (153,182,[1_1|2]), (154,91,[0_1|2]), (154,92,[0_1|2]), (154,146,[0_1|2]), (154,155,[0_1|2]), (154,218,[0_1|2]), (154,293,[0_1|2]), (154,102,[0_1|2]), (154,174,[0_1|2]), (154,101,[1_1|2]), (154,110,[4_1|2]), (154,119,[2_1|2]), (154,128,[2_1|2]), (154,137,[2_1|2]), (154,335,[0_1|3]), (155,156,[1_1|2]), (156,157,[3_1|2]), (157,158,[4_1|2]), (158,159,[0_1|2]), (159,160,[1_1|2]), (160,161,[4_1|2]), (161,162,[5_1|2]), (161,284,[4_1|2]), (162,163,[1_1|2]), (162,209,[4_1|2]), (163,91,[5_1|2]), (163,302,[5_1|2]), (163,284,[4_1|2]), (164,165,[2_1|2]), (165,166,[1_1|2]), (166,167,[2_1|2]), (167,168,[2_1|2]), (168,169,[2_1|2]), (169,170,[5_1|2]), (170,171,[1_1|2]), (171,172,[4_1|2]), (172,91,[2_1|2]), (172,191,[2_1|2]), (172,218,[0_1|2]), (172,227,[2_1|2]), (172,248,[4_1|2]), (172,257,[2_1|2]), (172,266,[2_1|2]), (172,275,[2_1|2]), (173,174,[0_1|2]), (174,175,[3_1|2]), (175,176,[4_1|2]), (176,177,[4_1|2]), (177,178,[1_1|2]), (178,179,[0_1|2]), (179,180,[2_1|2]), (180,181,[5_1|2]), (181,91,[5_1|2]), (181,191,[5_1|2]), (181,284,[4_1|2]), (182,183,[1_1|2]), (183,184,[2_1|2]), (184,185,[5_1|2]), (185,186,[4_1|2]), (186,187,[1_1|2]), (187,188,[2_1|2]), (188,189,[4_1|2]), (189,190,[3_1|2]), (190,91,[2_1|2]), (190,191,[2_1|2]), (190,218,[0_1|2]), (190,227,[2_1|2]), (190,248,[4_1|2]), (190,257,[2_1|2]), (190,266,[2_1|2]), (190,275,[2_1|2]), (191,192,[5_1|2]), (192,193,[4_1|2]), (193,194,[5_1|2]), (194,195,[2_1|2]), (195,196,[4_1|2]), (196,197,[3_1|2]), (197,198,[2_1|2]), (198,199,[5_1|2]), (199,91,[4_1|2]), (199,191,[4_1|2]), (199,303,[4_1|2]), (200,201,[4_1|2]), (201,202,[0_1|2]), (202,203,[1_1|2]), (203,204,[5_1|2]), (204,205,[4_1|2]), (205,206,[0_1|2]), (206,207,[3_1|2]), (207,208,[2_1|2]), (208,91,[5_1|2]), (208,191,[5_1|2]), (208,303,[5_1|2]), (208,284,[4_1|2]), (209,210,[4_1|2]), (210,211,[1_1|2]), (211,212,[4_1|2]), (212,213,[1_1|2]), (213,214,[4_1|2]), (214,215,[3_1|2]), (215,216,[1_1|2]), (216,217,[0_1|2]), (216,119,[2_1|2]), (217,91,[3_1|2]), (217,101,[3_1|2]), (217,164,[3_1|2]), (217,173,[3_1|2]), (217,182,[3_1|2]), (217,200,[3_1|2]), (217,183,[3_1|2]), (217,293,[0_1|2]), (217,302,[5_1|2]), (218,219,[1_1|2]), (219,220,[4_1|2]), (220,221,[5_1|2]), (221,222,[1_1|2]), (222,223,[5_1|2]), (223,224,[5_1|2]), (224,225,[2_1|2]), (225,226,[3_1|2]), (225,293,[0_1|2]), (226,91,[0_1|2]), (226,92,[0_1|2]), (226,146,[0_1|2]), (226,155,[0_1|2]), (226,218,[0_1|2]), (226,293,[0_1|2]), (226,102,[0_1|2]), (226,174,[0_1|2]), (226,101,[1_1|2]), (226,110,[4_1|2]), (226,119,[2_1|2]), (226,128,[2_1|2]), (226,137,[2_1|2]), (226,335,[0_1|3]), (227,228,[5_1|2]), (228,229,[4_1|2]), (229,230,[1_1|2]), (230,231,[3_1|2]), (231,232,[2_1|2]), (232,233,[2_1|2]), (233,234,[5_1|2]), (234,235,[4_1|2]), (235,91,[5_1|2]), (235,302,[5_1|2]), (235,284,[4_1|2]), (248,249,[0_1|2]), (249,250,[4_1|2]), (250,251,[2_1|2]), (251,252,[1_1|2]), (252,253,[4_1|2]), (253,254,[4_1|2]), (254,255,[4_1|2]), (255,256,[0_1|2]), (256,91,[1_1|2]), (256,92,[1_1|2]), (256,146,[1_1|2]), (256,155,[1_1|2]), (256,218,[1_1|2]), (256,293,[1_1|2]), (256,120,[1_1|2]), (256,267,[1_1|2]), (256,164,[1_1|2]), (256,173,[1_1|2]), (256,182,[1_1|2]), (256,191,[3_1|2]), (256,200,[1_1|2]), (256,209,[4_1|2]), (256,353,[1_1|3]), (257,258,[5_1|2]), (258,259,[3_1|2]), (259,260,[5_1|2]), (260,261,[1_1|2]), (261,262,[4_1|2]), (262,263,[5_1|2]), (263,264,[0_1|2]), (264,265,[0_1|2]), (264,92,[0_1|2]), (264,101,[1_1|2]), (264,344,[0_1|3]), (265,91,[2_1|2]), (265,119,[2_1|2]), (265,128,[2_1|2]), (265,137,[2_1|2]), (265,227,[2_1|2]), (265,257,[2_1|2]), (265,266,[2_1|2]), (265,275,[2_1|2]), (265,294,[2_1|2]), (265,218,[0_1|2]), (265,248,[4_1|2]), (266,267,[0_1|2]), (267,268,[2_1|2]), (268,269,[3_1|2]), (269,270,[4_1|2]), (270,271,[2_1|2]), (271,272,[4_1|2]), (272,273,[4_1|2]), (273,274,[4_1|2]), (274,91,[0_1|2]), (274,92,[0_1|2]), (274,146,[0_1|2]), (274,155,[0_1|2]), (274,218,[0_1|2]), (274,293,[0_1|2]), (274,102,[0_1|2]), (274,174,[0_1|2]), (274,101,[1_1|2]), (274,110,[4_1|2]), (274,119,[2_1|2]), (274,128,[2_1|2]), (274,137,[2_1|2]), (274,335,[0_1|3]), (275,276,[1_1|2]), (276,277,[2_1|2]), (277,278,[1_1|2]), (278,279,[4_1|2]), (279,280,[4_1|2]), (280,281,[4_1|2]), (281,282,[3_1|2]), (282,283,[4_1|2]), (283,91,[4_1|2]), (283,302,[4_1|2]), (283,192,[4_1|2]), (284,285,[5_1|2]), (285,286,[0_1|2]), (286,287,[0_1|2]), (287,288,[4_1|2]), (288,289,[3_1|2]), (289,290,[1_1|2]), (290,291,[1_1|2]), (291,292,[0_1|2]), (292,91,[4_1|2]), (292,119,[4_1|2]), (292,128,[4_1|2]), (292,137,[4_1|2]), (292,227,[4_1|2]), (292,257,[4_1|2]), (292,266,[4_1|2]), (292,275,[4_1|2]), (292,294,[4_1|2]), (293,294,[2_1|2]), (294,295,[4_1|2]), (295,296,[3_1|2]), (296,297,[2_1|2]), (297,298,[3_1|2]), (298,299,[2_1|2]), (299,300,[1_1|2]), (300,301,[0_1|2]), (300,119,[2_1|2]), (301,91,[3_1|2]), (301,101,[3_1|2]), (301,164,[3_1|2]), (301,173,[3_1|2]), (301,182,[3_1|2]), (301,200,[3_1|2]), (301,276,[3_1|2]), (301,293,[0_1|2]), (301,302,[5_1|2]), (302,303,[3_1|2]), (303,304,[4_1|2]), (304,305,[0_1|2]), (305,306,[4_1|2]), (306,307,[5_1|2]), (307,308,[2_1|2]), (308,309,[0_1|2]), (309,310,[0_1|2]), (310,91,[4_1|2]), (310,302,[4_1|2]), (335,336,[4_1|3]), (336,337,[0_1|3]), (337,338,[1_1|3]), (338,339,[4_1|3]), (339,340,[5_1|3]), (340,341,[1_1|3]), (341,342,[5_1|3]), (342,343,[0_1|3]), (343,276,[1_1|3]), (344,345,[4_1|3]), (345,346,[0_1|3]), (346,347,[1_1|3]), (347,348,[4_1|3]), (348,349,[5_1|3]), (349,350,[1_1|3]), (350,351,[5_1|3]), (351,352,[0_1|3]), (352,101,[1_1|3]), (352,164,[1_1|3]), (352,173,[1_1|3]), (352,182,[1_1|3]), (352,200,[1_1|3]), (352,276,[1_1|3]), (353,354,[2_1|3]), (354,355,[1_1|3]), (355,356,[2_1|3]), (356,357,[2_1|3]), (357,358,[2_1|3]), (358,359,[5_1|3]), (359,360,[1_1|3]), (360,361,[4_1|3]), (361,157,[2_1|3])}" ---------------------------------------- (8) BOUNDS(1, n^1)