details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.71022296 seconds
cpu usage	310.131088408
max memory	5.3203968E9

stage attributes

key	value
output-size	15710
starexec-result	WORST_CASE(Omega(n^1), ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 460 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 166 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 53 ms] (16) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: ge(0, 0) -> true ge(s(x), 0) -> ge(x, 0) ge(0, s(0)) -> false ge(0, s(s(x))) -> ge(0, s(x)) ge(s(x), s(y)) -> ge(x, y) minus(0, 0) -> 0 minus(0, s(x)) -> minus(0, x) minus(s(x), 0) -> s(minus(x, 0)) minus(s(x), s(y)) -> minus(x, y) plus(0, 0) -> 0 plus(0, s(x)) -> s(plus(0, x)) plus(s(x), y) -> s(plus(x, y)) div(x, y) -> ify(ge(y, s(0)), x, y) ify(false, x, y) -> divByZeroError ify(true, x, y) -> if(ge(x, y), x, y) if(false, x, y) -> 0 if(true, x, y) -> s(div(minus(x, y), y)) div(plus(x, y), z) -> plus(div(x, z), div(y, z)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: ge(0', 0') -> true ge(s(x), 0') -> ge(x, 0') ge(0', s(0')) -> false ge(0', s(s(x))) -> ge(0', s(x)) ge(s(x), s(y)) -> ge(x, y) minus(0', 0') -> 0' minus(0', s(x)) -> minus(0', x) minus(s(x), 0') -> s(minus(x, 0')) minus(s(x), s(y)) -> minus(x, y) plus(0', 0') -> 0' plus(0', s(x)) -> s(plus(0', x)) plus(s(x), y) -> s(plus(x, y)) div(x, y) -> ify(ge(y, s(0')), x, y) ify(false, x, y) -> divByZeroError ify(true, x, y) -> if(ge(x, y), x, y) if(false, x, y) -> 0' if(true, x, y) -> s(div(minus(x, y), y)) div(plus(x, y), z) -> plus(div(x, z), div(y, z)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127