Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487110848
details
property
value
status
complete
benchmark
t009.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
HirokawaMiddeldorp_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.772 seconds
cpu usage
1147.31
user time
1133.82
system time
13.4837
max virtual memory
3.863492E7
max residence set size
1.51372E7
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 (full) 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), 685 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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: start(i) -> busy(F, closed, stop, false, false, false, i) busy(BF, d, stop, b1, b2, b3, i) -> incorrect busy(FS, d, stop, b1, b2, b3, i) -> incorrect busy(fl, open, up, b1, b2, b3, i) -> incorrect busy(fl, open, down, b1, b2, b3, i) -> incorrect busy(B, closed, stop, false, false, false, empty) -> correct busy(F, closed, stop, false, false, false, empty) -> correct busy(S, closed, stop, false, false, false, empty) -> correct busy(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(B, open, stop, false, b2, b3, i) -> idle(B, closed, stop, false, b2, b3, i) busy(F, open, stop, b1, false, b3, i) -> idle(F, closed, stop, b1, false, b3, i) busy(S, open, stop, b1, b2, false, i) -> idle(S, closed, stop, b1, b2, false, i) busy(B, d, stop, true, b2, b3, i) -> idle(B, open, stop, false, b2, b3, i) busy(F, d, stop, b1, true, b3, i) -> idle(F, open, stop, b1, false, b3, i) busy(S, d, stop, b1, b2, true, i) -> idle(S, open, stop, b1, b2, false, i) busy(B, closed, down, b1, b2, b3, i) -> idle(B, closed, stop, b1, b2, b3, i) busy(S, closed, up, b1, b2, b3, i) -> idle(S, closed, stop, b1, b2, b3, i) busy(B, closed, up, true, b2, b3, i) -> idle(B, closed, stop, true, b2, b3, i) busy(F, closed, up, b1, true, b3, i) -> idle(F, closed, stop, b1, true, b3, i) busy(F, closed, down, b1, true, b3, i) -> idle(F, closed, stop, b1, true, b3, i) busy(S, closed, down, b1, b2, true, i) -> idle(S, closed, stop, b1, b2, true, i) busy(B, closed, up, false, b2, b3, i) -> idle(BF, closed, up, false, b2, b3, i) busy(F, closed, up, b1, false, b3, i) -> idle(FS, closed, up, b1, false, b3, i) busy(F, closed, down, b1, false, b3, i) -> idle(BF, closed, down, b1, false, b3, i) busy(S, closed, down, b1, b2, false, i) -> idle(FS, closed, down, b1, b2, false, i) busy(BF, closed, up, b1, b2, b3, i) -> idle(F, closed, up, b1, b2, b3, i) busy(BF, closed, down, b1, b2, b3, i) -> idle(B, closed, down, b1, b2, b3, i) busy(FS, closed, up, b1, b2, b3, i) -> idle(S, closed, up, b1, b2, b3, i) busy(FS, closed, down, b1, b2, b3, i) -> idle(F, closed, down, b1, b2, b3, i) busy(B, closed, stop, false, true, b3, i) -> idle(B, closed, up, false, true, b3, i) busy(B, closed, stop, false, false, true, i) -> idle(B, closed, up, false, false, true, i) busy(F, closed, stop, true, false, b3, i) -> idle(F, closed, down, true, false, b3, i) busy(F, closed, stop, false, false, true, i) -> idle(F, closed, up, false, false, true, i) busy(S, closed, stop, b1, true, false, i) -> idle(S, closed, down, b1, true, false, i) busy(S, closed, stop, true, false, false, i) -> idle(S, closed, down, true, false, false, i) idle(fl, d, m, b1, b2, b3, empty) -> busy(fl, d, m, b1, b2, b3, empty) idle(fl, d, m, b1, b2, b3, newbuttons(i1, i2, i3, i)) -> busy(fl, d, m, or(b1, i1), or(b2, i2), or(b3, i3), i) or(true, b) -> true or(false, b) -> b S is empty. Rewrite Strategy: FULL ---------------------------------------- (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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: start(i) -> busy(F, closed, stop, false, false, false, i) busy(BF, d, stop, b1, b2, b3, i) -> incorrect busy(FS, d, stop, b1, b2, b3, i) -> incorrect busy(fl, open, up, b1, b2, b3, i) -> incorrect busy(fl, open, down, b1, b2, b3, i) -> incorrect busy(B, closed, stop, false, false, false, empty) -> correct busy(F, closed, stop, false, false, false, empty) -> correct busy(S, closed, stop, false, false, false, empty) -> correct busy(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(B, open, stop, false, b2, b3, i) -> idle(B, closed, stop, false, b2, b3, i) busy(F, open, stop, b1, false, b3, i) -> idle(F, closed, stop, b1, false, b3, i) busy(S, open, stop, b1, b2, false, i) -> idle(S, closed, stop, b1, b2, false, i)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS