/export/starexec/sandbox/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), 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(n^1, n^1). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 180 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 20 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. "[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, 50, 51, 52, 53, 54, 55, 56, 57, 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, 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, 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] {(7,8,[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]), (7,9,[1_1|1]), (7,27,[1_1|1]), (7,51,[1_1|1, 2_1|1, 3_1|1, 4_1|1, 5_1|1, 0_1|1]), (7,52,[1_1|2]), (7,70,[1_1|2]), (8,8,[1_1|0, 2_1|0, 3_1|0, 4_1|0, 5_1|0, cons_0_1|0]), (9,10,[2_1|1]), (10,11,[3_1|1]), (11,12,[4_1|1]), (12,13,[5_1|1]), (13,14,[1_1|1]), (14,15,[1_1|1]), (15,16,[0_1|1]), (15,94,[1_1|2]), (15,112,[1_1|2]), (16,17,[1_1|1]), (17,18,[2_1|1]), (18,19,[3_1|1]), (19,20,[4_1|1]), (20,21,[5_1|1]), (21,22,[0_1|1]), (21,9,[1_1|1]), (21,27,[1_1|1]), (22,23,[1_1|1]), (23,24,[2_1|1]), (24,25,[3_1|1]), (25,26,[4_1|1]), (26,8,[5_1|1]), (27,28,[2_1|1]), (28,29,[3_1|1]), (29,30,[4_1|1]), (30,31,[5_1|1]), (31,32,[1_1|1]), (32,33,[1_1|1]), (33,34,[0_1|1]), (33,144,[1_1|2]), (33,162,[1_1|2]), (34,35,[1_1|1]), (35,36,[2_1|1]), (36,37,[3_1|1]), (37,38,[4_1|1]), (38,39,[5_1|1]), (39,40,[0_1|1]), (39,94,[1_1|2]), (39,112,[1_1|2]), (40,41,[1_1|1]), (41,42,[2_1|1]), (42,43,[3_1|1]), (43,44,[4_1|1]), (44,45,[5_1|1]), (45,46,[0_1|1]), (45,9,[1_1|1]), (45,27,[1_1|1]), (46,47,[1_1|1]), (47,48,[2_1|1]), (48,49,[3_1|1]), (49,50,[4_1|1]), (50,8,[5_1|1]), (51,8,[encArg_1|1]), (51,51,[1_1|1, 2_1|1, 3_1|1, 4_1|1, 5_1|1, 0_1|1]), (51,52,[1_1|2]), (51,70,[1_1|2]), (52,53,[2_1|2]), (53,54,[3_1|2]), (54,55,[4_1|2]), (55,56,[5_1|2]), (56,57,[1_1|2]), (57,58,[1_1|2]), (58,59,[0_1|2]), (58,186,[1_1|3]), (58,204,[1_1|3]), (59,60,[1_1|2]), (60,61,[2_1|2]), (61,62,[3_1|2]), (62,63,[4_1|2]), (63,64,[5_1|2]), (64,65,[0_1|2]), (64,52,[1_1|2]), (64,70,[1_1|2]), (64,186,[1_1|3]), (64,204,[1_1|3]), (65,66,[1_1|2]), (66,67,[2_1|2]), (67,68,[3_1|2]), (68,69,[4_1|2]), (69,51,[5_1|2]), (69,52,[5_1|2]), (69,70,[5_1|2]), (69,57,[5_1|2]), (69,75,[5_1|2]), (70,71,[2_1|2]), (71,72,[3_1|2]), (72,73,[4_1|2]), (73,74,[5_1|2]), (74,75,[1_1|2]), (75,76,[1_1|2]), (76,77,[0_1|2]), (76,186,[1_1|3]), (76,204,[1_1|3]), (77,78,[1_1|2]), (78,79,[2_1|2]), (79,80,[3_1|2]), (80,81,[4_1|2]), (81,82,[5_1|2]), (82,83,[0_1|2]), (82,186,[1_1|3]), (82,204,[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,52,[1_1|2]), (88,70,[1_1|2]), (88,186,[1_1|3]), (88,204,[1_1|3]), (89,90,[1_1|2]), (90,91,[2_1|2]), (91,92,[3_1|2]), (92,93,[4_1|2]), (93,51,[5_1|2]), (93,52,[5_1|2]), (93,70,[5_1|2]), (93,57,[5_1|2]), (93,75,[5_1|2]), (94,95,[2_1|2]), (95,96,[3_1|2]), (96,97,[4_1|2]), (97,98,[5_1|2]), (98,99,[1_1|2]), (99,100,[1_1|2]), (100,101,[0_1|2]), (101,102,[1_1|2]), (102,103,[2_1|2]), (103,104,[3_1|2]), (104,105,[4_1|2]), (105,106,[5_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,9,[5_1|2]), (111,27,[5_1|2]), (112,113,[2_1|2]), (113,114,[3_1|2]), (114,115,[4_1|2]), (115,116,[5_1|2]), (116,117,[1_1|2]), (117,118,[1_1|2]), (118,119,[0_1|2]), (119,120,[1_1|2]), (120,121,[2_1|2]), (121,122,[3_1|2]), (122,123,[4_1|2]), (123,124,[5_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,9,[5_1|2]), (135,27,[5_1|2]), (144,145,[2_1|2]), (145,146,[3_1|2]), (146,147,[4_1|2]), (147,148,[5_1|2]), (148,149,[1_1|2]), (149,150,[1_1|2]), (150,151,[0_1|2]), (151,152,[1_1|2]), (152,153,[2_1|2]), (153,154,[3_1|2]), (154,155,[4_1|2]), (155,156,[5_1|2]), (156,157,[0_1|2]), (157,158,[1_1|2]), (158,159,[2_1|2]), (159,160,[3_1|2]), (160,161,[4_1|2]), (161,94,[5_1|2]), (161,112,[5_1|2]), (162,163,[2_1|2]), (163,164,[3_1|2]), (164,165,[4_1|2]), (165,166,[5_1|2]), (166,167,[1_1|2]), (167,168,[1_1|2]), (168,169,[0_1|2]), (169,170,[1_1|2]), (170,171,[2_1|2]), (171,172,[3_1|2]), (172,173,[4_1|2]), (173,174,[5_1|2]), (174,175,[0_1|2]), (175,176,[1_1|2]), (176,177,[2_1|2]), (177,178,[3_1|2]), (178,179,[4_1|2]), (179,180,[5_1|2]), (180,181,[0_1|2]), (181,182,[1_1|2]), (182,183,[2_1|2]), (183,184,[3_1|2]), (184,185,[4_1|2]), (185,94,[5_1|2]), (185,112,[5_1|2]), (186,187,[2_1|3]), (187,188,[3_1|3]), (188,189,[4_1|3]), (189,190,[5_1|3]), (190,191,[1_1|3]), (191,192,[1_1|3]), (192,193,[0_1|3]), (192,278,[1_1|4]), (192,296,[1_1|4]), (193,194,[1_1|3]), (194,195,[2_1|3]), (195,196,[3_1|3]), (196,197,[4_1|3]), (197,198,[5_1|3]), (198,199,[0_1|3]), (198,236,[1_1|4]), (198,254,[1_1|4]), (199,200,[1_1|3]), (200,201,[2_1|3]), (201,202,[3_1|3]), (202,203,[4_1|3]), (203,52,[5_1|3]), (203,70,[5_1|3]), (203,186,[5_1|3]), (203,204,[5_1|3]), (203,58,[5_1|3]), (203,76,[5_1|3]), (204,205,[2_1|3]), (205,206,[3_1|3]), (206,207,[4_1|3]), (207,208,[5_1|3]), (208,209,[1_1|3]), (209,210,[1_1|3]), (210,211,[0_1|3]), (210,320,[1_1|4]), (210,338,[1_1|4]), (211,212,[1_1|3]), (212,213,[2_1|3]), (213,214,[3_1|3]), (214,215,[4_1|3]), (215,216,[5_1|3]), (216,217,[0_1|3]), (216,278,[1_1|4]), (216,296,[1_1|4]), (217,218,[1_1|3]), (218,219,[2_1|3]), (219,220,[3_1|3]), (220,221,[4_1|3]), (221,222,[5_1|3]), (222,223,[0_1|3]), (222,236,[1_1|4]), (222,254,[1_1|4]), (223,224,[1_1|3]), (224,225,[2_1|3]), (225,226,[3_1|3]), (226,227,[4_1|3]), (227,52,[5_1|3]), (227,70,[5_1|3]), (227,186,[5_1|3]), (227,204,[5_1|3]), (227,58,[5_1|3]), (227,76,[5_1|3]), (236,237,[2_1|4]), (237,238,[3_1|4]), (238,239,[4_1|4]), (239,240,[5_1|4]), (240,241,[1_1|4]), (241,242,[1_1|4]), (242,243,[0_1|4]), (243,244,[1_1|4]), (244,245,[2_1|4]), (245,246,[3_1|4]), (246,247,[4_1|4]), (247,248,[5_1|4]), (248,249,[0_1|4]), (249,250,[1_1|4]), (250,251,[2_1|4]), (251,252,[3_1|4]), (252,253,[4_1|4]), (253,186,[5_1|4]), (253,204,[5_1|4]), (254,255,[2_1|4]), (255,256,[3_1|4]), (256,257,[4_1|4]), (257,258,[5_1|4]), (258,259,[1_1|4]), (259,260,[1_1|4]), (260,261,[0_1|4]), (261,262,[1_1|4]), (262,263,[2_1|4]), (263,264,[3_1|4]), (264,265,[4_1|4]), (265,266,[5_1|4]), (266,267,[0_1|4]), (267,268,[1_1|4]), (268,269,[2_1|4]), (269,270,[3_1|4]), (270,271,[4_1|4]), (271,272,[5_1|4]), (272,273,[0_1|4]), (273,274,[1_1|4]), (274,275,[2_1|4]), (275,276,[3_1|4]), (276,277,[4_1|4]), (277,186,[5_1|4]), (277,204,[5_1|4]), (278,279,[2_1|4]), (279,280,[3_1|4]), (280,281,[4_1|4]), (281,282,[5_1|4]), (282,283,[1_1|4]), (283,284,[1_1|4]), (284,285,[0_1|4]), (285,286,[1_1|4]), (286,287,[2_1|4]), (287,288,[3_1|4]), (288,289,[4_1|4]), (289,290,[5_1|4]), (290,291,[0_1|4]), (291,292,[1_1|4]), (292,293,[2_1|4]), (293,294,[3_1|4]), (294,295,[4_1|4]), (295,236,[5_1|4]), (295,254,[5_1|4]), (296,297,[2_1|4]), (297,298,[3_1|4]), (298,299,[4_1|4]), (299,300,[5_1|4]), (300,301,[1_1|4]), (301,302,[1_1|4]), (302,303,[0_1|4]), (303,304,[1_1|4]), (304,305,[2_1|4]), (305,306,[3_1|4]), (306,307,[4_1|4]), (307,308,[5_1|4]), (308,309,[0_1|4]), (309,310,[1_1|4]), (310,311,[2_1|4]), (311,312,[3_1|4]), (312,313,[4_1|4]), (313,314,[5_1|4]), (314,315,[0_1|4]), (315,316,[1_1|4]), (316,317,[2_1|4]), (317,318,[3_1|4]), (318,319,[4_1|4]), (319,236,[5_1|4]), (319,254,[5_1|4]), (320,321,[2_1|4]), (321,322,[3_1|4]), (322,323,[4_1|4]), (323,324,[5_1|4]), (324,325,[1_1|4]), (325,326,[1_1|4]), (326,327,[0_1|4]), (327,328,[1_1|4]), (328,329,[2_1|4]), (329,330,[3_1|4]), (330,331,[4_1|4]), (331,332,[5_1|4]), (332,333,[0_1|4]), (333,334,[1_1|4]), (334,335,[2_1|4]), (335,336,[3_1|4]), (336,337,[4_1|4]), (337,278,[5_1|4]), (337,296,[5_1|4]), (338,339,[2_1|4]), (339,340,[3_1|4]), (340,341,[4_1|4]), (341,342,[5_1|4]), (342,343,[1_1|4]), (343,344,[1_1|4]), (344,345,[0_1|4]), (345,346,[1_1|4]), (346,347,[2_1|4]), (347,348,[3_1|4]), (348,349,[4_1|4]), (349,350,[5_1|4]), (350,351,[0_1|4]), (351,352,[1_1|4]), (352,353,[2_1|4]), (353,354,[3_1|4]), (354,355,[4_1|4]), (355,356,[5_1|4]), (356,357,[0_1|4]), (357,358,[1_1|4]), (358,359,[2_1|4]), (359,360,[3_1|4]), (360,361,[4_1|4]), (361,278,[5_1|4]), (361,296,[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