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