details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	14.4421 seconds
cpu usage	39.7855
user time	37.8006
system time	1.98487
max virtual memory	1.906554E7
max residence set size	4215244.0

stage attributes

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

output

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 Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxWeightedTrs (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTypedWeightedTrs (5) CompletionProof [UPPER BOUND(ID), 0 ms] (6) CpxTypedWeightedCompleteTrs (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 5 ms] (10) CpxRNTS (11) InliningProof [UPPER BOUND(ID), 403 ms] (12) CpxRNTS (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 227 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 77 ms] (22) CpxRNTS (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 554 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 289 ms] (28) CpxRNTS (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 148 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 5 ms] (34) CpxRNTS (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 202 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 46 ms] (40) CpxRNTS (41) FinalProof [FINISHED, 0 ms] (42) BOUNDS(1, n^1) (43) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (44) TRS for Loop Detection (45) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (46) BEST (47) proven lower bound (48) LowerBoundPropagationProof [FINISHED, 0 ms] (49) BOUNDS(n^1, INF) (50) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: cond(true, x, y) -> cond(and(gr(x, 0), gr(y, 0)), p(x), p(y)) and(true, true) -> true and(x, false) -> false and(false, x) -> false gr(0, 0) -> false gr(0, x) -> false gr(s(x), 0) -> true gr(s(x), s(y)) -> gr(x, y) p(0) -> 0 p(s(x)) -> x S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) Transformed relative TRS to weighted TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: cond(true, x, y) -> cond(and(gr(x, 0), gr(y, 0)), p(x), p(y)) [1] and(true, true) -> true [1] and(x, false) -> false [1] and(false, x) -> false [1] gr(0, 0) -> false [1] popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost