details

property	value
status	timeout (wallclock)
benchmark	id_inc.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	AProVE_08

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	301.008834839 seconds
cpu usage	375.755182456
max memory	9.41490176E9

stage attributes

unavailable

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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), 279 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: f(s(x)) -> f(id_inc(c(x, x))) f(c(s(x), y)) -> g(c(x, y)) g(c(s(x), y)) -> g(c(y, x)) g(c(x, s(y))) -> g(c(y, x)) g(c(x, x)) -> f(x) id_inc(c(x, y)) -> c(id_inc(x), id_inc(y)) id_inc(s(x)) -> s(id_inc(x)) id_inc(0) -> 0 id_inc(0) -> s(0) 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: f(s(x)) -> f(id_inc(c(x, x))) f(c(s(x), y)) -> g(c(x, y)) g(c(s(x), y)) -> g(c(y, x)) g(c(x, s(y))) -> g(c(y, x)) g(c(x, x)) -> f(x) id_inc(c(x, y)) -> c(id_inc(x), id_inc(y)) id_inc(s(x)) -> s(id_inc(x)) id_inc(0') -> 0' id_inc(0') -> s(0') S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: f(s(x)) -> f(id_inc(c(x, x))) f(c(s(x), y)) -> g(c(x, y)) g(c(s(x), y)) -> g(c(y, x)) g(c(x, s(y))) -> g(c(y, x)) g(c(x, x)) -> f(x) id_inc(c(x, y)) -> c(id_inc(x), id_inc(y)) id_inc(s(x)) -> s(id_inc(x)) id_inc(0') -> 0' id_inc(0') -> s(0') Types: f :: s:c:0' -> f:g s :: s:c:0' -> s:c:0' id_inc :: s:c:0' -> s:c:0' c :: s:c:0' -> s:c:0' -> s:c:0' g :: s:c:0' -> f:g popout

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

job log

popout

actions

all output return to Runtime_Complexity: TRS