/export/starexec/sandbox2/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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), 61 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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(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(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1))))))))))))) The (relative) TRS S consists of the following rules: encArg(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1))))))))))))) The (relative) TRS S consists of the following rules: encArg(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1))))))))))))) encArg(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(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. "[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] {(19,20,[c_1|0, encArg_1|0, encode_c_1|0, encode_a_1|0, encode_b_1|0]), (19,21,[a_1|1]), (19,33,[a_1|1, b_1|1, c_1|1]), (19,34,[a_1|2]), (20,20,[a_1|0, b_1|0, cons_c_1|0]), (21,22,[b_1|1]), (22,23,[a_1|1]), (23,24,[b_1|1]), (24,25,[b_1|1]), (25,26,[a_1|1]), (26,27,[b_1|1]), (27,28,[b_1|1]), (28,29,[c_1|1]), (28,46,[a_1|2]), (29,30,[a_1|1]), (30,31,[b_1|1]), (31,32,[c_1|1]), (31,21,[a_1|1]), (32,20,[a_1|1]), (33,20,[encArg_1|1]), (33,33,[a_1|1, b_1|1, c_1|1]), (33,34,[a_1|2]), (34,35,[b_1|2]), (35,36,[a_1|2]), (36,37,[b_1|2]), (37,38,[b_1|2]), (38,39,[a_1|2]), (39,40,[b_1|2]), (40,41,[b_1|2]), (41,42,[c_1|2]), (41,58,[a_1|3]), (42,43,[a_1|2]), (43,44,[b_1|2]), (44,45,[c_1|2]), (44,34,[a_1|2]), (44,70,[a_1|3]), (45,33,[a_1|2]), (45,35,[a_1|2]), (45,37,[a_1|2]), (46,47,[b_1|2]), (47,48,[a_1|2]), (48,49,[b_1|2]), (49,50,[b_1|2]), (50,51,[a_1|2]), (51,52,[b_1|2]), (52,53,[b_1|2]), (53,54,[c_1|2]), (54,55,[a_1|2]), (55,56,[b_1|2]), (56,57,[c_1|2]), (57,22,[a_1|2]), (58,59,[b_1|3]), (59,60,[a_1|3]), (60,61,[b_1|3]), (61,62,[b_1|3]), (62,63,[a_1|3]), (63,64,[b_1|3]), (64,65,[b_1|3]), (65,66,[c_1|3]), (66,67,[a_1|3]), (67,68,[b_1|3]), (68,69,[c_1|3]), (69,35,[a_1|3]), (69,71,[a_1|3]), (70,71,[b_1|3]), (71,72,[a_1|3]), (72,73,[b_1|3]), (73,74,[b_1|3]), (74,75,[a_1|3]), (75,76,[b_1|3]), (76,77,[b_1|3]), (77,78,[c_1|3]), (77,94,[a_1|4]), (78,79,[a_1|3]), (79,80,[b_1|3]), (80,81,[c_1|3]), (80,82,[a_1|3]), (81,40,[a_1|3]), (82,83,[b_1|3]), (83,84,[a_1|3]), (84,85,[b_1|3]), (85,86,[b_1|3]), (86,87,[a_1|3]), (87,88,[b_1|3]), (88,89,[b_1|3]), (89,90,[c_1|3]), (90,91,[a_1|3]), (91,92,[b_1|3]), (92,93,[c_1|3]), (93,59,[a_1|3]), (94,95,[b_1|4]), (95,96,[a_1|4]), (96,97,[b_1|4]), (97,98,[b_1|4]), (98,99,[a_1|4]), (99,100,[b_1|4]), (100,101,[b_1|4]), (101,102,[c_1|4]), (102,103,[a_1|4]), (103,104,[b_1|4]), (104,105,[c_1|4]), (105,83,[a_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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1))))))))))))) The (relative) TRS S consists of the following rules: encArg(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(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 c(a(b(a(b(x1))))) ->^+ a(b(a(b(b(a(b(b(c(a(b(c(a(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]. The pumping substitution is [x1 / b(a(b(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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1))))))))))))) The (relative) TRS S consists of the following rules: encArg(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(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: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1))))))))))))) The (relative) TRS S consists of the following rules: encArg(a(x_1)) -> a(encArg(x_1)) encArg(b(x_1)) -> b(encArg(x_1)) encArg(cons_c(x_1)) -> c(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_b(x_1) -> b(encArg(x_1)) Rewrite Strategy: FULL