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