details

property	value
status	complete
benchmark	24.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	Beerendonk_07

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.725080013 seconds
cpu usage	303.632830072
max memory	5.313769472E9

stage attributes

key	value
output-size	9552
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), 297 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) 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: cond1(true, x, y) -> cond2(gr(x, y), x, y) cond2(true, x, y) -> cond3(gr(x, 0), x, y) cond2(false, x, y) -> cond4(gr(y, 0), x, y) cond3(true, x, y) -> cond3(gr(x, 0), p(x), y) cond3(false, x, y) -> cond1(and(gr(x, 0), gr(y, 0)), x, y) cond4(true, x, y) -> cond4(gr(y, 0), x, p(y)) cond4(false, x, y) -> cond1(and(gr(x, 0), gr(y, 0)), x, y) gr(0, x) -> false gr(s(x), 0) -> true gr(s(x), s(y)) -> gr(x, y) and(true, true) -> true and(false, x) -> false and(x, false) -> false p(0) -> 0 p(s(x)) -> x 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: cond1(true, x, y) -> cond2(gr(x, y), x, y) cond2(true, x, y) -> cond3(gr(x, 0'), x, y) cond2(false, x, y) -> cond4(gr(y, 0'), x, y) cond3(true, x, y) -> cond3(gr(x, 0'), p(x), y) cond3(false, x, y) -> cond1(and(gr(x, 0'), gr(y, 0')), x, y) cond4(true, x, y) -> cond4(gr(y, 0'), x, p(y)) cond4(false, x, y) -> cond1(and(gr(x, 0'), gr(y, 0')), x, y) gr(0', x) -> false gr(s(x), 0') -> true gr(s(x), s(y)) -> gr(x, y) and(true, true) -> true and(false, x) -> false and(x, false) -> false p(0') -> 0' p(s(x)) -> x S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: cond1(true, x, y) -> cond2(gr(x, y), x, y) cond2(true, x, y) -> cond3(gr(x, 0'), x, y) cond2(false, x, y) -> cond4(gr(y, 0'), x, y) cond3(true, x, y) -> cond3(gr(x, 0'), p(x), y) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127