details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.581269026 seconds
cpu usage	307.573469675
max memory	5.682323456E9

stage attributes

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

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: 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), 305 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), 134 ms] (14) 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(true, x, y) -> f(gt(x, y), trunc(x), s(y)) trunc(0) -> 0 trunc(s(0)) -> 0 trunc(s(s(x))) -> s(s(trunc(x))) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) 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(true, x, y) -> f(gt(x, y), trunc(x), s(y)) trunc(0') -> 0' trunc(s(0')) -> 0' trunc(s(s(x))) -> s(s(trunc(x))) gt(0', v) -> false gt(s(u), 0') -> true gt(s(u), s(v)) -> gt(u, v) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: f(true, x, y) -> f(gt(x, y), trunc(x), s(y)) trunc(0') -> 0' trunc(s(0')) -> 0' trunc(s(s(x))) -> s(s(trunc(x))) gt(0', v) -> false gt(s(u), 0') -> true gt(s(u), s(v)) -> gt(u, v) Types: f :: true:false -> s:0' -> s:0' -> f true :: true:false gt :: s:0' -> s:0' -> true:false trunc :: s:0' -> s:0' s :: s:0' -> s:0' 0' :: s:0' false :: true:false hole_f1_0 :: f hole_true:false2_0 :: true:false popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127