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