details

property	value
status	complete
benchmark	4.57.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n150.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.67 seconds
cpu usage	452.209
user time	449.243
system time	2.96582
max virtual memory	1.9433088E7
max residence set size	5634356.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(n^1))

output

WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) 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), 188 ms] (4) CpxRelTRS (5) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (6) CdtProblem (7) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (8) CdtProblem (9) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CdtProblem (11) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (14) CdtProblem (15) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 8 ms] (16) CdtProblem (17) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 157 ms] (18) CdtProblem (19) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 107 ms] (20) CdtProblem (21) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 81 ms] (22) CdtProblem (23) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (24) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: f(x, y, z) -> g(<=(x, y), x, y, z) g(true, x, y, z) -> z g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) p(0) -> 0 p(s(x)) -> x S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (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(<=(x_1, x_2)) -> <=(encArg(x_1), encArg(x_2)) encArg(true) -> true encArg(false) -> false encArg(0) -> 0 encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_f(x_1, x_2, x_3)) -> f(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_g(x_1, x_2, x_3, x_4)) -> g(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encode_f(x_1, x_2, x_3) -> f(encArg(x_1), encArg(x_2), encArg(x_3)) encode_g(x_1, x_2, x_3, x_4) -> g(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encode_<=(x_1, x_2) -> <=(encArg(x_1), encArg(x_2)) encode_true -> true encode_false -> false encode_p(x_1) -> p(encArg(x_1)) encode_0 -> 0 encode_s(x_1) -> s(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: f(x, y, z) -> g(<=(x, y), x, y, z) g(true, x, y, z) -> z g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) p(0) -> 0 p(s(x)) -> x The (relative) TRS S consists of the following rules: encArg(<=(x_1, x_2)) -> <=(encArg(x_1), encArg(x_2)) encArg(true) -> true encArg(false) -> false encArg(0) -> 0 encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_f(x_1, x_2, x_3)) -> f(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_g(x_1, x_2, x_3, x_4)) -> g(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encode_f(x_1, x_2, x_3) -> f(encArg(x_1), encArg(x_2), encArg(x_3)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost