Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307681
details
property
value
status
complete
benchmark
Liveness6.3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n119.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
8.14901 seconds
cpu usage
26.9169
user time
25.2141
system time
1.70285
max virtual memory
1.9339948E7
max residence set size
4084244.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
26.59/8.07 WORST_CASE(Omega(n^1), O(n^1)) 26.59/8.08 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 26.59/8.08 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 26.59/8.08 26.59/8.08 26.59/8.08 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 26.59/8.08 26.59/8.08 (0) CpxTRS 26.59/8.08 (1) DependencyGraphProof [UPPER BOUND(ID), 0 ms] 26.59/8.08 (2) CpxTRS 26.59/8.08 (3) NestedDefinedSymbolProof [UPPER BOUND(ID), 3 ms] 26.59/8.08 (4) CpxTRS 26.59/8.08 (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 26.59/8.08 (6) CpxTRS 26.59/8.08 (7) CpxTrsMatchBoundsProof [FINISHED, 0 ms] 26.59/8.08 (8) BOUNDS(1, n^1) 26.59/8.08 (9) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 26.59/8.08 (10) TRS for Loop Detection 26.59/8.08 (11) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 26.59/8.08 (12) BEST 26.59/8.08 (13) proven lower bound 26.59/8.08 (14) LowerBoundPropagationProof [FINISHED, 0 ms] 26.59/8.08 (15) BOUNDS(n^1, INF) 26.59/8.08 (16) TRS for Loop Detection 26.59/8.08 26.59/8.08 26.59/8.08 ---------------------------------------- 26.59/8.08 26.59/8.08 (0) 26.59/8.08 Obligation: 26.59/8.08 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 26.59/8.08 26.59/8.08 26.59/8.08 The TRS R consists of the following rules: 26.59/8.08 26.59/8.08 rec(rec(x)) -> sent(rec(x)) 26.59/8.08 rec(sent(x)) -> sent(rec(x)) 26.59/8.08 rec(no(x)) -> sent(rec(x)) 26.59/8.08 rec(bot) -> up(sent(bot)) 26.59/8.08 rec(up(x)) -> up(rec(x)) 26.59/8.08 sent(up(x)) -> up(sent(x)) 26.59/8.08 no(up(x)) -> up(no(x)) 26.59/8.08 top(rec(up(x))) -> top(check(rec(x))) 26.59/8.08 top(sent(up(x))) -> top(check(rec(x))) 26.59/8.08 top(no(up(x))) -> top(check(rec(x))) 26.59/8.08 check(up(x)) -> up(check(x)) 26.59/8.08 check(sent(x)) -> sent(check(x)) 26.59/8.08 check(rec(x)) -> rec(check(x)) 26.59/8.08 check(no(x)) -> no(check(x)) 26.59/8.08 check(no(x)) -> no(x) 26.59/8.08 26.59/8.08 S is empty. 26.59/8.08 Rewrite Strategy: FULL 26.59/8.08 ---------------------------------------- 26.59/8.08 26.59/8.08 (1) DependencyGraphProof (UPPER BOUND(ID)) 26.59/8.08 The following rules are not reachable from basic terms in the dependency graph and can be removed: 26.59/8.08 26.59/8.08 top(rec(up(x))) -> top(check(rec(x))) 26.59/8.08 top(sent(up(x))) -> top(check(rec(x))) 26.59/8.08 top(no(up(x))) -> top(check(rec(x))) 26.59/8.08 26.59/8.08 ---------------------------------------- 26.59/8.08 26.59/8.08 (2) 26.59/8.08 Obligation: 26.59/8.08 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1). 26.59/8.08 26.59/8.08 26.59/8.08 The TRS R consists of the following rules: 26.59/8.08 26.59/8.08 rec(rec(x)) -> sent(rec(x)) 26.59/8.08 rec(sent(x)) -> sent(rec(x)) 26.59/8.08 rec(no(x)) -> sent(rec(x)) 26.59/8.08 rec(bot) -> up(sent(bot)) 26.59/8.08 rec(up(x)) -> up(rec(x)) 26.59/8.08 sent(up(x)) -> up(sent(x)) 26.59/8.08 no(up(x)) -> up(no(x)) 26.59/8.08 check(up(x)) -> up(check(x)) 26.59/8.08 check(sent(x)) -> sent(check(x)) 26.59/8.08 check(rec(x)) -> rec(check(x)) 26.59/8.08 check(no(x)) -> no(check(x)) 26.59/8.08 check(no(x)) -> no(x) 26.59/8.08 26.59/8.08 S is empty. 26.59/8.08 Rewrite Strategy: FULL 26.59/8.08 ---------------------------------------- 26.59/8.08 26.59/8.08 (3) NestedDefinedSymbolProof (UPPER BOUND(ID)) 26.59/8.08 The TRS does not nest defined symbols. 26.59/8.08 Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: 26.59/8.08 rec(rec(x)) -> sent(rec(x)) 26.59/8.08 rec(sent(x)) -> sent(rec(x)) 26.59/8.08 rec(no(x)) -> sent(rec(x)) 26.59/8.08 check(sent(x)) -> sent(check(x)) 26.59/8.08 check(rec(x)) -> rec(check(x)) 26.59/8.08 check(no(x)) -> no(check(x)) 26.59/8.08 check(no(x)) -> no(x) 26.59/8.08 26.59/8.08 ----------------------------------------
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
