details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.490705013 seconds
cpu usage	1090.33156848
max memory	1.557028864E10

stage attributes

key	value
output-size	5359
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 (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (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: a__nats -> cons(0, incr(nats)) a__pairs -> cons(0, incr(odds)) a__odds -> a__incr(a__pairs) a__incr(cons(X, XS)) -> cons(s(mark(X)), incr(XS)) a__head(cons(X, XS)) -> mark(X) a__tail(cons(X, XS)) -> mark(XS) mark(nats) -> a__nats mark(pairs) -> a__pairs mark(odds) -> a__odds mark(incr(X)) -> a__incr(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(0) -> 0 mark(s(X)) -> s(mark(X)) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) a__nats -> nats a__pairs -> pairs a__odds -> odds a__incr(X) -> incr(X) a__head(X) -> head(X) a__tail(X) -> tail(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: 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: a__nats -> cons(0, incr(nats)) a__pairs -> cons(0, incr(odds)) a__odds -> a__incr(a__pairs) a__incr(cons(X, XS)) -> cons(s(mark(X)), incr(XS)) a__head(cons(X, XS)) -> mark(X) a__tail(cons(X, XS)) -> mark(XS) mark(nats) -> a__nats mark(pairs) -> a__pairs mark(odds) -> a__odds mark(incr(X)) -> a__incr(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(0) -> 0 mark(s(X)) -> s(mark(X)) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) a__nats -> nats a__pairs -> pairs a__odds -> odds a__incr(X) -> incr(X) a__head(X) -> head(X) a__tail(X) -> tail(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807