Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS Innermost pair #487111936
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
n144.star.cs.uiowa.edu
space
Mixed_TRS
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.547 seconds
cpu usage
1080.13
user time
1065.87
system time
14.2615
max virtual memory
3.731518E7
max residence set size
1.4986032E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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 ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence mark(incr(X)) ->^+ a__incr(mark(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS Innermost