details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	301.030488968 seconds
cpu usage	783.849019209
max memory	1.5236227072E10

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: 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), 583 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) -> s(x) f(s(s(x))) -> s(f(f(x))) 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) -> s(x) f(s(s(x))) -> s(f(f(x))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: f(x) -> s(x) f(s(s(x))) -> s(f(f(x))) Types: f :: s -> s s :: s -> s hole_s1_0 :: s gen_s2_0 :: Nat -> s ---------------------------------------- (5) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: f ---------------------------------------- (6) Obligation: Innermost TRS: Rules: f(x) -> s(x) f(s(s(x))) -> s(f(f(x))) Types: f :: s -> s s :: s -> s hole_s1_0 :: s gen_s2_0 :: Nat -> s Generator Equations: gen_s2_0(0) <=> hole_s1_0 popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807