WORST_CASE(Omega(n^1), 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(n^1, n^1). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 70 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 0 ms] (8) BOUNDS(1, n^1) (9) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (10) TRS for Loop Detection (11) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(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(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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(n^1, n^1). The TRS R consists of the following rules: 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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(n^1, n^1). The TRS R consists of the following rules: 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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 4. The certificate found is represented by the following graph. "[5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 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, 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] {(5,6,[0_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]), (5,7,[1_1|1]), (5,25,[1_1|1]), (5,49,[1_1|1, 2_1|1, 3_1|1, 4_1|1, 5_1|1, 0_1|1]), (5,58,[1_1|2]), (5,76,[1_1|2]), (6,6,[1_1|0, 2_1|0, 3_1|0, 4_1|0, 5_1|0, cons_0_1|0]), (7,8,[2_1|1]), (8,9,[3_1|1]), (9,10,[4_1|1]), (10,11,[5_1|1]), (11,12,[1_1|1]), (12,13,[1_1|1]), (13,14,[0_1|1]), (13,100,[1_1|2]), (13,118,[1_1|2]), (14,15,[1_1|1]), (15,16,[2_1|1]), (16,17,[3_1|1]), (17,18,[4_1|1]), (18,19,[5_1|1]), (19,20,[0_1|1]), (19,7,[1_1|1]), (19,25,[1_1|1]), (20,21,[1_1|1]), (21,22,[2_1|1]), (22,23,[3_1|1]), (23,24,[4_1|1]), (24,6,[5_1|1]), (25,26,[2_1|1]), (26,27,[3_1|1]), (27,28,[4_1|1]), (28,29,[5_1|1]), (29,30,[1_1|1]), (30,31,[1_1|1]), (31,32,[0_1|1]), (31,142,[1_1|2]), (31,160,[1_1|2]), (32,33,[1_1|1]), (33,34,[2_1|1]), (34,35,[3_1|1]), (35,36,[4_1|1]), (36,37,[5_1|1]), (37,38,[0_1|1]), (37,100,[1_1|2]), (37,118,[1_1|2]), (38,39,[1_1|1]), (39,40,[2_1|1]), (40,41,[3_1|1]), (41,42,[4_1|1]), (42,43,[5_1|1]), (43,44,[0_1|1]), (43,7,[1_1|1]), (43,25,[1_1|1]), (44,45,[1_1|1]), (45,46,[2_1|1]), (46,47,[3_1|1]), (47,48,[4_1|1]), (48,6,[5_1|1]), (49,6,[encArg_1|1]), (49,49,[1_1|1, 2_1|1, 3_1|1, 4_1|1, 5_1|1, 0_1|1]), (49,58,[1_1|2]), (49,76,[1_1|2]), (58,59,[2_1|2]), (59,60,[3_1|2]), (60,61,[4_1|2]), (61,62,[5_1|2]), (62,63,[1_1|2]), (63,64,[1_1|2]), (64,65,[0_1|2]), (64,184,[1_1|3]), (64,202,[1_1|3]), (65,66,[1_1|2]), (66,67,[2_1|2]), (67,68,[3_1|2]), (68,69,[4_1|2]), (69,70,[5_1|2]), (70,71,[0_1|2]), (70,58,[1_1|2]), (70,76,[1_1|2]), (70,184,[1_1|3]), (70,202,[1_1|3]), (71,72,[1_1|2]), (72,73,[2_1|2]), (73,74,[3_1|2]), (74,75,[4_1|2]), (75,49,[5_1|2]), (75,58,[5_1|2]), (75,76,[5_1|2]), (75,63,[5_1|2]), (75,81,[5_1|2]), (76,77,[2_1|2]), (77,78,[3_1|2]), (78,79,[4_1|2]), (79,80,[5_1|2]), (80,81,[1_1|2]), (81,82,[1_1|2]), (82,83,[0_1|2]), (82,184,[1_1|3]), (82,202,[1_1|3]), (83,84,[1_1|2]), (84,85,[2_1|2]), (85,86,[3_1|2]), (86,87,[4_1|2]), (87,88,[5_1|2]), (88,89,[0_1|2]), (88,184,[1_1|3]), (88,202,[1_1|3]), (89,90,[1_1|2]), (90,91,[2_1|2]), (91,92,[3_1|2]), (92,93,[4_1|2]), (93,94,[5_1|2]), (94,95,[0_1|2]), (94,58,[1_1|2]), (94,76,[1_1|2]), (94,184,[1_1|3]), (94,202,[1_1|3]), (95,96,[1_1|2]), (96,97,[2_1|2]), (97,98,[3_1|2]), (98,99,[4_1|2]), (99,49,[5_1|2]), (99,58,[5_1|2]), (99,76,[5_1|2]), (99,63,[5_1|2]), (99,81,[5_1|2]), (100,101,[2_1|2]), (101,102,[3_1|2]), (102,103,[4_1|2]), (103,104,[5_1|2]), (104,105,[1_1|2]), (105,106,[1_1|2]), (106,107,[0_1|2]), (107,108,[1_1|2]), (108,109,[2_1|2]), (109,110,[3_1|2]), (110,111,[4_1|2]), (111,112,[5_1|2]), (112,113,[0_1|2]), (113,114,[1_1|2]), (114,115,[2_1|2]), (115,116,[3_1|2]), (116,117,[4_1|2]), (117,7,[5_1|2]), (117,25,[5_1|2]), (118,119,[2_1|2]), (119,120,[3_1|2]), (120,121,[4_1|2]), (121,122,[5_1|2]), (122,123,[1_1|2]), (123,124,[1_1|2]), (124,125,[0_1|2]), (125,126,[1_1|2]), (126,127,[2_1|2]), (127,128,[3_1|2]), (128,129,[4_1|2]), (129,130,[5_1|2]), (130,131,[0_1|2]), (131,132,[1_1|2]), (132,133,[2_1|2]), (133,134,[3_1|2]), (134,135,[4_1|2]), (135,136,[5_1|2]), (136,137,[0_1|2]), (137,138,[1_1|2]), (138,139,[2_1|2]), (139,140,[3_1|2]), (140,141,[4_1|2]), (141,7,[5_1|2]), (141,25,[5_1|2]), (142,143,[2_1|2]), (143,144,[3_1|2]), (144,145,[4_1|2]), (145,146,[5_1|2]), (146,147,[1_1|2]), (147,148,[1_1|2]), (148,149,[0_1|2]), (149,150,[1_1|2]), (150,151,[2_1|2]), (151,152,[3_1|2]), (152,153,[4_1|2]), (153,154,[5_1|2]), (154,155,[0_1|2]), (155,156,[1_1|2]), (156,157,[2_1|2]), (157,158,[3_1|2]), (158,159,[4_1|2]), (159,100,[5_1|2]), (159,118,[5_1|2]), (160,161,[2_1|2]), (161,162,[3_1|2]), (162,163,[4_1|2]), (163,164,[5_1|2]), (164,165,[1_1|2]), (165,166,[1_1|2]), (166,167,[0_1|2]), (167,168,[1_1|2]), (168,169,[2_1|2]), (169,170,[3_1|2]), (170,171,[4_1|2]), (171,172,[5_1|2]), (172,173,[0_1|2]), (173,174,[1_1|2]), (174,175,[2_1|2]), (175,176,[3_1|2]), (176,177,[4_1|2]), (177,178,[5_1|2]), (178,179,[0_1|2]), (179,180,[1_1|2]), (180,181,[2_1|2]), (181,182,[3_1|2]), (182,183,[4_1|2]), (183,100,[5_1|2]), (183,118,[5_1|2]), (184,185,[2_1|3]), (185,186,[3_1|3]), (186,187,[4_1|3]), (187,188,[5_1|3]), (188,189,[1_1|3]), (189,190,[1_1|3]), (190,191,[0_1|3]), (190,268,[1_1|4]), (190,286,[1_1|4]), (191,192,[1_1|3]), (192,193,[2_1|3]), (193,194,[3_1|3]), (194,195,[4_1|3]), (195,196,[5_1|3]), (196,197,[0_1|3]), (196,226,[1_1|4]), (196,244,[1_1|4]), (197,198,[1_1|3]), (198,199,[2_1|3]), (199,200,[3_1|3]), (200,201,[4_1|3]), (201,58,[5_1|3]), (201,76,[5_1|3]), (201,184,[5_1|3]), (201,202,[5_1|3]), (201,64,[5_1|3]), (201,82,[5_1|3]), (202,203,[2_1|3]), (203,204,[3_1|3]), (204,205,[4_1|3]), (205,206,[5_1|3]), (206,207,[1_1|3]), (207,208,[1_1|3]), (208,209,[0_1|3]), (208,310,[1_1|4]), (208,328,[1_1|4]), (209,210,[1_1|3]), (210,211,[2_1|3]), (211,212,[3_1|3]), (212,213,[4_1|3]), (213,214,[5_1|3]), (214,215,[0_1|3]), (214,268,[1_1|4]), (214,286,[1_1|4]), (215,216,[1_1|3]), (216,217,[2_1|3]), (217,218,[3_1|3]), (218,219,[4_1|3]), (219,220,[5_1|3]), (220,221,[0_1|3]), (220,226,[1_1|4]), (220,244,[1_1|4]), (221,222,[1_1|3]), (222,223,[2_1|3]), (223,224,[3_1|3]), (224,225,[4_1|3]), (225,58,[5_1|3]), (225,76,[5_1|3]), (225,184,[5_1|3]), (225,202,[5_1|3]), (225,64,[5_1|3]), (225,82,[5_1|3]), (226,227,[2_1|4]), (227,228,[3_1|4]), (228,229,[4_1|4]), (229,230,[5_1|4]), (230,231,[1_1|4]), (231,232,[1_1|4]), (232,233,[0_1|4]), (233,234,[1_1|4]), (234,235,[2_1|4]), (235,236,[3_1|4]), (236,237,[4_1|4]), (237,238,[5_1|4]), (238,239,[0_1|4]), (239,240,[1_1|4]), (240,241,[2_1|4]), (241,242,[3_1|4]), (242,243,[4_1|4]), (243,184,[5_1|4]), (243,202,[5_1|4]), (244,245,[2_1|4]), (245,246,[3_1|4]), (246,247,[4_1|4]), (247,248,[5_1|4]), (248,249,[1_1|4]), (249,250,[1_1|4]), (250,251,[0_1|4]), (251,252,[1_1|4]), (252,253,[2_1|4]), (253,254,[3_1|4]), (254,255,[4_1|4]), (255,256,[5_1|4]), (256,257,[0_1|4]), (257,258,[1_1|4]), (258,259,[2_1|4]), (259,260,[3_1|4]), (260,261,[4_1|4]), (261,262,[5_1|4]), (262,263,[0_1|4]), (263,264,[1_1|4]), (264,265,[2_1|4]), (265,266,[3_1|4]), (266,267,[4_1|4]), (267,184,[5_1|4]), (267,202,[5_1|4]), (268,269,[2_1|4]), (269,270,[3_1|4]), (270,271,[4_1|4]), (271,272,[5_1|4]), (272,273,[1_1|4]), (273,274,[1_1|4]), (274,275,[0_1|4]), (275,276,[1_1|4]), (276,277,[2_1|4]), (277,278,[3_1|4]), (278,279,[4_1|4]), (279,280,[5_1|4]), (280,281,[0_1|4]), (281,282,[1_1|4]), (282,283,[2_1|4]), (283,284,[3_1|4]), (284,285,[4_1|4]), (285,226,[5_1|4]), (285,244,[5_1|4]), (286,287,[2_1|4]), (287,288,[3_1|4]), (288,289,[4_1|4]), (289,290,[5_1|4]), (290,291,[1_1|4]), (291,292,[1_1|4]), (292,293,[0_1|4]), (293,294,[1_1|4]), (294,295,[2_1|4]), (295,296,[3_1|4]), (296,297,[4_1|4]), (297,298,[5_1|4]), (298,299,[0_1|4]), (299,300,[1_1|4]), (300,301,[2_1|4]), (301,302,[3_1|4]), (302,303,[4_1|4]), (303,304,[5_1|4]), (304,305,[0_1|4]), (305,306,[1_1|4]), (306,307,[2_1|4]), (307,308,[3_1|4]), (308,309,[4_1|4]), (309,226,[5_1|4]), (309,244,[5_1|4]), (310,311,[2_1|4]), (311,312,[3_1|4]), (312,313,[4_1|4]), (313,314,[5_1|4]), (314,315,[1_1|4]), (315,316,[1_1|4]), (316,317,[0_1|4]), (317,318,[1_1|4]), (318,319,[2_1|4]), (319,320,[3_1|4]), (320,321,[4_1|4]), (321,322,[5_1|4]), (322,323,[0_1|4]), (323,324,[1_1|4]), (324,325,[2_1|4]), (325,326,[3_1|4]), (326,327,[4_1|4]), (327,268,[5_1|4]), (327,286,[5_1|4]), (328,329,[2_1|4]), (329,330,[3_1|4]), (330,331,[4_1|4]), (331,332,[5_1|4]), (332,333,[1_1|4]), (333,334,[1_1|4]), (334,335,[0_1|4]), (335,336,[1_1|4]), (336,337,[2_1|4]), (337,338,[3_1|4]), (338,339,[4_1|4]), (339,340,[5_1|4]), (340,341,[0_1|4]), (341,342,[1_1|4]), (342,343,[2_1|4]), (343,344,[3_1|4]), (344,345,[4_1|4]), (345,346,[5_1|4]), (346,347,[0_1|4]), (347,348,[1_1|4]), (348,349,[2_1|4]), (349,350,[3_1|4]), (350,351,[4_1|4]), (351,268,[5_1|4]), (351,286,[5_1|4])}" ---------------------------------------- (8) BOUNDS(1, n^1) ---------------------------------------- (9) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (10) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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 ---------------------------------------- (11) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence 0(1(2(3(4(5(1(x1))))))) ->^+ 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]. The pumping substitution is [x1 / 1(x1)]. The result substitution is [ ]. ---------------------------------------- (12) Complex Obligation (BEST) ---------------------------------------- (13) Obligation: Proved the lower bound n^1 for the following obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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 ---------------------------------------- (14) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (15) BOUNDS(n^1, INF) ---------------------------------------- (16) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) 0(1(2(3(4(5(1(x1))))))) -> 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) The (relative) TRS S consists of the following rules: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(5(x_1)) -> 5(encArg(x_1)) encArg(cons_0(x_1)) -> 0(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