details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.612 seconds
cpu usage	1140.01
user time	1127.56
system time	12.4483
max virtual memory	3.773936E7
max residence set size	1.174058E7

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^2)) 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^2). (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), 22 ms] (6) CpxTypedWeightedCompleteTrs (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (8) CpxRNTS (9) CompleteCoflocoProof [FINISHED, 1195 ms] (10) BOUNDS(1, n^2) (11) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (12) TRS for Loop Detection (13) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^1, INF) (18) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). The TRS R consists of the following rules: le(0, y) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) mod(x, 0) -> modZeroErro mod(x, s(y)) -> modIter(x, s(y), 0, 0) modIter(x, s(y), z, u) -> if(le(x, z), x, s(y), z, u) if(true, x, y, z, u) -> u if(false, x, y, z, u) -> if2(le(y, s(u)), x, y, s(z), s(u)) if2(false, x, y, z, u) -> modIter(x, y, z, u) if2(true, x, y, z, u) -> modIter(x, y, z, 0) 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^2). The TRS R consists of the following rules: le(0, y) -> true [1] le(s(x), 0) -> false [1] le(s(x), s(y)) -> le(x, y) [1] mod(x, 0) -> modZeroErro [1] mod(x, s(y)) -> modIter(x, s(y), 0, 0) [1] modIter(x, s(y), z, u) -> if(le(x, z), x, s(y), z, u) [1] if(true, x, y, z, u) -> u [1] if(false, x, y, z, u) -> if2(le(y, s(u)), x, y, s(z), s(u)) [1] if2(false, x, y, z, u) -> modIter(x, y, z, u) [1] if2(true, x, y, z, u) -> modIter(x, y, z, 0) [1] Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Runtime Complexity Weighted TRS with Types. The TRS R consists of the following rules: le(0, y) -> true [1] le(s(x), 0) -> false [1] le(s(x), s(y)) -> le(x, y) [1] mod(x, 0) -> modZeroErro [1] mod(x, s(y)) -> modIter(x, s(y), 0, 0) [1] modIter(x, s(y), z, u) -> if(le(x, z), x, s(y), z, u) [1] if(true, x, y, z, u) -> u [1] if(false, x, y, z, u) -> if2(le(y, s(u)), x, y, s(z), s(u)) [1] if2(false, x, y, z, u) -> modIter(x, y, z, u) [1] if2(true, x, y, z, u) -> modIter(x, y, z, 0) [1] The TRS has the following type information: le :: 0:s:modZeroErro -> 0:s:modZeroErro -> true:false 0 :: 0:s:modZeroErro popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost