Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307923
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
n069.star.cs.uiowa.edu
space
HirokawaMiddeldorp_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.676 seconds
cpu usage
1153.3
user time
1130.91
system time
22.3935
max virtual memory
5.8073748E7
max residence set size
1.4988076E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1149.40/291.67 WORST_CASE(Omega(n^1), ?) 1153.00/292.56 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1153.00/292.56 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1153.00/292.56 1153.00/292.56 1153.00/292.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1153.00/292.56 1153.00/292.56 (0) CpxTRS 1153.00/292.56 (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 1153.00/292.56 (2) TRS for Loop Detection 1153.00/292.56 (3) DecreasingLoopProof [LOWER BOUND(ID), 757 ms] 1153.00/292.56 (4) BEST 1153.00/292.56 (5) proven lower bound 1153.00/292.56 (6) LowerBoundPropagationProof [FINISHED, 0 ms] 1153.00/292.56 (7) BOUNDS(n^1, INF) 1153.00/292.56 (8) TRS for Loop Detection 1153.00/292.56 1153.00/292.56 1153.00/292.56 ---------------------------------------- 1153.00/292.56 1153.00/292.56 (0) 1153.00/292.56 Obligation: 1153.00/292.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1153.00/292.56 1153.00/292.56 1153.00/292.56 The TRS R consists of the following rules: 1153.00/292.56 1153.00/292.56 start(i) -> busy(F, closed, stop, false, false, false, i) 1153.00/292.56 busy(BF, d, stop, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(FS, d, stop, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(fl, open, up, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(fl, open, down, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(B, closed, stop, false, false, false, empty) -> correct 1153.00/292.56 busy(F, closed, stop, false, false, false, empty) -> correct 1153.00/292.56 busy(S, closed, stop, false, false, false, empty) -> correct 1153.00/292.56 busy(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) 1153.00/292.56 busy(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) 1153.00/292.56 busy(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) 1153.00/292.56 busy(B, open, stop, false, b2, b3, i) -> idle(B, closed, stop, false, b2, b3, i) 1153.00/292.56 busy(F, open, stop, b1, false, b3, i) -> idle(F, closed, stop, b1, false, b3, i) 1153.00/292.56 busy(S, open, stop, b1, b2, false, i) -> idle(S, closed, stop, b1, b2, false, i) 1153.00/292.56 busy(B, d, stop, true, b2, b3, i) -> idle(B, open, stop, false, b2, b3, i) 1153.00/292.56 busy(F, d, stop, b1, true, b3, i) -> idle(F, open, stop, b1, false, b3, i) 1153.00/292.56 busy(S, d, stop, b1, b2, true, i) -> idle(S, open, stop, b1, b2, false, i) 1153.00/292.56 busy(B, closed, down, b1, b2, b3, i) -> idle(B, closed, stop, b1, b2, b3, i) 1153.00/292.56 busy(S, closed, up, b1, b2, b3, i) -> idle(S, closed, stop, b1, b2, b3, i) 1153.00/292.56 busy(B, closed, up, true, b2, b3, i) -> idle(B, closed, stop, true, b2, b3, i) 1153.00/292.56 busy(F, closed, up, b1, true, b3, i) -> idle(F, closed, stop, b1, true, b3, i) 1153.00/292.56 busy(F, closed, down, b1, true, b3, i) -> idle(F, closed, stop, b1, true, b3, i) 1153.00/292.56 busy(S, closed, down, b1, b2, true, i) -> idle(S, closed, stop, b1, b2, true, i) 1153.00/292.56 busy(B, closed, up, false, b2, b3, i) -> idle(BF, closed, up, false, b2, b3, i) 1153.00/292.56 busy(F, closed, up, b1, false, b3, i) -> idle(FS, closed, up, b1, false, b3, i) 1153.00/292.56 busy(F, closed, down, b1, false, b3, i) -> idle(BF, closed, down, b1, false, b3, i) 1153.00/292.56 busy(S, closed, down, b1, b2, false, i) -> idle(FS, closed, down, b1, b2, false, i) 1153.00/292.56 busy(BF, closed, up, b1, b2, b3, i) -> idle(F, closed, up, b1, b2, b3, i) 1153.00/292.56 busy(BF, closed, down, b1, b2, b3, i) -> idle(B, closed, down, b1, b2, b3, i) 1153.00/292.56 busy(FS, closed, up, b1, b2, b3, i) -> idle(S, closed, up, b1, b2, b3, i) 1153.00/292.56 busy(FS, closed, down, b1, b2, b3, i) -> idle(F, closed, down, b1, b2, b3, i) 1153.00/292.56 busy(B, closed, stop, false, true, b3, i) -> idle(B, closed, up, false, true, b3, i) 1153.00/292.56 busy(B, closed, stop, false, false, true, i) -> idle(B, closed, up, false, false, true, i) 1153.00/292.56 busy(F, closed, stop, true, false, b3, i) -> idle(F, closed, down, true, false, b3, i) 1153.00/292.56 busy(F, closed, stop, false, false, true, i) -> idle(F, closed, up, false, false, true, i) 1153.00/292.56 busy(S, closed, stop, b1, true, false, i) -> idle(S, closed, down, b1, true, false, i) 1153.00/292.56 busy(S, closed, stop, true, false, false, i) -> idle(S, closed, down, true, false, false, i) 1153.00/292.56 idle(fl, d, m, b1, b2, b3, empty) -> busy(fl, d, m, b1, b2, b3, empty) 1153.00/292.56 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) 1153.00/292.56 or(true, b) -> true 1153.00/292.56 or(false, b) -> b 1153.00/292.56 1153.00/292.56 S is empty. 1153.00/292.56 Rewrite Strategy: FULL 1153.00/292.56 ---------------------------------------- 1153.00/292.56 1153.00/292.56 (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) 1153.00/292.56 Transformed a relative TRS into a decreasing-loop problem. 1153.00/292.56 ---------------------------------------- 1153.00/292.56 1153.00/292.56 (2) 1153.00/292.56 Obligation: 1153.00/292.56 Analyzing the following TRS for decreasing loops: 1153.00/292.56 1153.00/292.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1153.00/292.56 1153.00/292.56 1153.00/292.56 The TRS R consists of the following rules: 1153.00/292.56 1153.00/292.56 start(i) -> busy(F, closed, stop, false, false, false, i) 1153.00/292.56 busy(BF, d, stop, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(FS, d, stop, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(fl, open, up, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(fl, open, down, b1, b2, b3, i) -> incorrect 1153.00/292.56 busy(B, closed, stop, false, false, false, empty) -> correct 1153.00/292.56 busy(F, closed, stop, false, false, false, empty) -> correct 1153.00/292.56 busy(S, closed, stop, false, false, false, empty) -> correct 1153.00/292.56 busy(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) 1153.00/292.56 busy(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) 1153.00/292.56 busy(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) 1153.00/292.56 busy(B, open, stop, false, b2, b3, i) -> idle(B, closed, stop, false, b2, b3, i) 1153.00/292.56 busy(F, open, stop, b1, false, b3, i) -> idle(F, closed, stop, b1, false, b3, i) 1153.00/292.56 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_Full_Rewriting 2019-04-01 06.11