Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487111482
details
property
value
status
complete
benchmark
2.14.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.75788 seconds
cpu usage
7.95923
user time
7.54375
system time
0.415482
max virtual memory
1.8279408E7
max residence set size
1247976.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (4) CpxTRS (5) CpxTrsMatchBoundsTAProof [FINISHED, 29 ms] (6) BOUNDS(1, n^1) (7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (8) TRS for Loop Detection (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: double(0) -> 0 double(s(x)) -> s(s(double(x))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) -(x, 0) -> x -(s(x), s(y)) -> -(x, y) if(0, y, z) -> y if(s(x), y, z) -> z half(double(x)) -> x S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) The TRS does not nest defined symbols. Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: half(double(x)) -> x ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: double(0) -> 0 double(s(x)) -> s(s(double(x))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) -(x, 0) -> x -(s(x), s(y)) -> -(x, y) if(0, y, z) -> y if(s(x), y, z) -> z S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (4) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: double(0) -> 0 double(s(x)) -> s(s(double(x))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) -(x, 0) -> x -(s(x), s(y)) -> -(x, y) if(0, y, z) -> y if(s(x), y, z) -> z S is empty. Rewrite Strategy: FULL ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS