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