details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	296.220171928 seconds
cpu usage	1147.74078977
max memory	1.53388032E10

stage attributes

key	value
output-size	4338
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 (innermost) 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), 591 ms] (8) proven lower bound (9) LowerBoundPropagationProof [FINISHED, 0 ms] (10) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: f(x, a(b(y))) -> f(a(b(x)), y) f(x, b(c(y))) -> f(b(c(x)), y) f(x, c(a(y))) -> f(c(a(x)), y) f(a(x), y) -> f(x, a(y)) f(b(x), y) -> f(x, b(y)) f(c(x), y) -> f(x, c(y)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: f(x, a(b(y))) -> f(a(b(x)), y) f(x, b(c(y))) -> f(b(c(x)), y) f(x, c(a(y))) -> f(c(a(x)), y) f(a(x), y) -> f(x, a(y)) f(b(x), y) -> f(x, b(y)) f(c(x), y) -> f(x, c(y)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: f(x, a(b(y))) -> f(a(b(x)), y) f(x, b(c(y))) -> f(b(c(x)), y) f(x, c(a(y))) -> f(c(a(x)), y) f(a(x), y) -> f(x, a(y)) f(b(x), y) -> f(x, b(y)) f(c(x), y) -> f(x, c(y)) Types: f :: b:a:c -> b:a:c -> f a :: b:a:c -> b:a:c b :: b:a:c -> b:a:c c :: b:a:c -> b:a:c hole_f1_0 :: f hole_b:a:c2_0 :: b:a:c gen_b:a:c3_0 :: Nat -> b:a:c ---------------------------------------- (5) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: f ---------------------------------------- (6) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807