Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313736
details
property
value
status
complete
benchmark
thiemann06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n112.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
40.2128 seconds
cpu usage
154.225
user time
149.557
system time
4.66804
max virtual memory
3.7822208E7
max residence set size
5261072.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
154.10/40.16 WORST_CASE(Omega(n^1), O(n^1)) 154.15/40.17 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 154.15/40.17 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 154.15/40.17 154.15/40.17 154.15/40.17 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 154.15/40.17 154.15/40.17 (0) CpxTRS 154.15/40.17 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 154.15/40.17 (2) CpxWeightedTrs 154.15/40.17 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 154.15/40.17 (4) CpxTypedWeightedTrs 154.15/40.17 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 154.15/40.17 (6) CpxTypedWeightedCompleteTrs 154.15/40.17 (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 11 ms] 154.15/40.17 (8) CpxRNTS 154.15/40.17 (9) CompleteCoflocoProof [FINISHED, 717 ms] 154.15/40.17 (10) BOUNDS(1, n^1) 154.15/40.17 (11) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 154.15/40.17 (12) TRS for Loop Detection 154.15/40.17 (13) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 154.15/40.17 (14) BEST 154.15/40.17 (15) proven lower bound 154.15/40.17 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 154.15/40.17 (17) BOUNDS(n^1, INF) 154.15/40.17 (18) TRS for Loop Detection 154.15/40.17 154.15/40.17 154.15/40.17 ---------------------------------------- 154.15/40.17 154.15/40.17 (0) 154.15/40.17 Obligation: 154.15/40.17 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 154.15/40.17 154.15/40.17 154.15/40.17 The TRS R consists of the following rules: 154.15/40.17 154.15/40.17 p(s(x)) -> x 154.15/40.17 p(0) -> 0 154.15/40.17 le(0, y) -> true 154.15/40.17 le(s(x), 0) -> false 154.15/40.17 le(s(x), s(y)) -> le(x, y) 154.15/40.17 average(x, y) -> if(le(x, 0), le(y, 0), le(y, s(0)), le(y, s(s(0))), x, y) 154.15/40.17 if(true, b1, b2, b3, x, y) -> if2(b1, b2, b3, x, y) 154.15/40.17 if(false, b1, b2, b3, x, y) -> average(p(x), s(y)) 154.15/40.17 if2(true, b2, b3, x, y) -> 0 154.15/40.17 if2(false, b2, b3, x, y) -> if3(b2, b3, x, y) 154.15/40.17 if3(true, b3, x, y) -> 0 154.15/40.17 if3(false, b3, x, y) -> if4(b3, x, y) 154.15/40.17 if4(true, x, y) -> s(0) 154.15/40.17 if4(false, x, y) -> average(s(x), p(p(y))) 154.15/40.17 154.15/40.17 S is empty. 154.15/40.17 Rewrite Strategy: INNERMOST 154.15/40.17 ---------------------------------------- 154.15/40.17 154.15/40.17 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 154.15/40.17 Transformed relative TRS to weighted TRS 154.15/40.17 ---------------------------------------- 154.15/40.17 154.15/40.17 (2) 154.15/40.17 Obligation: 154.15/40.17 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^1). 154.15/40.17 154.15/40.17 154.15/40.17 The TRS R consists of the following rules: 154.15/40.17 154.15/40.17 p(s(x)) -> x [1] 154.15/40.17 p(0) -> 0 [1] 154.15/40.17 le(0, y) -> true [1] 154.15/40.17 le(s(x), 0) -> false [1] 154.15/40.17 le(s(x), s(y)) -> le(x, y) [1] 154.15/40.17 average(x, y) -> if(le(x, 0), le(y, 0), le(y, s(0)), le(y, s(s(0))), x, y) [1] 154.15/40.17 if(true, b1, b2, b3, x, y) -> if2(b1, b2, b3, x, y) [1] 154.15/40.17 if(false, b1, b2, b3, x, y) -> average(p(x), s(y)) [1] 154.15/40.17 if2(true, b2, b3, x, y) -> 0 [1] 154.15/40.17 if2(false, b2, b3, x, y) -> if3(b2, b3, x, y) [1] 154.15/40.17 if3(true, b3, x, y) -> 0 [1] 154.15/40.17 if3(false, b3, x, y) -> if4(b3, x, y) [1] 154.15/40.17 if4(true, x, y) -> s(0) [1] 154.15/40.17 if4(false, x, y) -> average(s(x), p(p(y))) [1] 154.15/40.17 154.15/40.17 Rewrite Strategy: INNERMOST 154.15/40.17 ---------------------------------------- 154.15/40.17 154.15/40.17 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 154.15/40.17 Infered types. 154.15/40.17 ---------------------------------------- 154.15/40.17 154.15/40.17 (4) 154.15/40.17 Obligation: 154.15/40.17 Runtime Complexity Weighted TRS with Types. 154.15/40.17 The TRS R consists of the following rules: 154.15/40.17 154.15/40.17 p(s(x)) -> x [1] 154.15/40.17 p(0) -> 0 [1] 154.15/40.17 le(0, y) -> true [1] 154.15/40.17 le(s(x), 0) -> false [1] 154.15/40.17 le(s(x), s(y)) -> le(x, y) [1] 154.15/40.17 average(x, y) -> if(le(x, 0), le(y, 0), le(y, s(0)), le(y, s(s(0))), x, y) [1]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40