Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313735
details
property
value
status
complete
benchmark
thiemann13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.594 seconds
cpu usage
1099.66
user time
1084.12
system time
15.5426
max virtual memory
3.791632E7
max residence set size
1.4962416E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
1099.37/291.48 WORST_CASE(Omega(n^1), O(n^2)) 1099.37/291.50 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 1099.37/291.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1099.37/291.50 1099.37/291.50 1099.37/291.50 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 1099.37/291.50 1099.37/291.50 (0) CpxTRS 1099.37/291.50 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 1099.37/291.50 (2) CpxWeightedTrs 1099.37/291.50 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1099.37/291.50 (4) CpxTypedWeightedTrs 1099.37/291.50 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 1099.37/291.50 (6) CpxTypedWeightedCompleteTrs 1099.37/291.50 (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 1099.37/291.50 (8) CpxRNTS 1099.37/291.50 (9) CompleteCoflocoProof [FINISHED, 2318 ms] 1099.37/291.50 (10) BOUNDS(1, n^2) 1099.37/291.50 (11) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 1099.37/291.50 (12) TRS for Loop Detection 1099.37/291.50 (13) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 1099.37/291.50 (14) BEST 1099.37/291.50 (15) proven lower bound 1099.37/291.50 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 1099.37/291.50 (17) BOUNDS(n^1, INF) 1099.37/291.50 (18) TRS for Loop Detection 1099.37/291.50 1099.37/291.50 1099.37/291.50 ---------------------------------------- 1099.37/291.50 1099.37/291.50 (0) 1099.37/291.50 Obligation: 1099.37/291.50 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 1099.37/291.50 1099.37/291.50 1099.37/291.50 The TRS R consists of the following rules: 1099.37/291.50 1099.37/291.50 le(0, y) -> true 1099.37/291.50 le(s(x), 0) -> false 1099.37/291.50 le(s(x), s(y)) -> le(x, y) 1099.37/291.50 inc(0) -> 0 1099.37/291.50 inc(s(x)) -> s(inc(x)) 1099.37/291.50 minus(0, y) -> 0 1099.37/291.50 minus(x, 0) -> x 1099.37/291.50 minus(s(x), s(y)) -> minus(x, y) 1099.37/291.50 quot(0, s(y)) -> 0 1099.37/291.50 quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) 1099.37/291.50 log(x) -> log2(x, 0) 1099.37/291.50 log2(x, y) -> if(le(x, 0), le(x, s(0)), x, inc(y)) 1099.37/291.50 if(true, b, x, y) -> log_undefined 1099.37/291.50 if(false, b, x, y) -> if2(b, x, y) 1099.37/291.50 if2(true, x, s(y)) -> y 1099.37/291.50 if2(false, x, y) -> log2(quot(x, s(s(0))), y) 1099.37/291.50 1099.37/291.50 S is empty. 1099.37/291.50 Rewrite Strategy: INNERMOST 1099.37/291.50 ---------------------------------------- 1099.37/291.50 1099.37/291.50 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 1099.37/291.50 Transformed relative TRS to weighted TRS 1099.37/291.50 ---------------------------------------- 1099.37/291.50 1099.37/291.50 (2) 1099.37/291.50 Obligation: 1099.37/291.50 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2). 1099.37/291.50 1099.37/291.50 1099.37/291.50 The TRS R consists of the following rules: 1099.37/291.50 1099.37/291.50 le(0, y) -> true [1] 1099.37/291.50 le(s(x), 0) -> false [1] 1099.37/291.50 le(s(x), s(y)) -> le(x, y) [1] 1099.37/291.50 inc(0) -> 0 [1] 1099.37/291.50 inc(s(x)) -> s(inc(x)) [1] 1099.37/291.50 minus(0, y) -> 0 [1] 1099.37/291.50 minus(x, 0) -> x [1] 1099.37/291.50 minus(s(x), s(y)) -> minus(x, y) [1] 1099.37/291.50 quot(0, s(y)) -> 0 [1] 1099.37/291.50 quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) [1] 1099.37/291.50 log(x) -> log2(x, 0) [1] 1099.37/291.50 log2(x, y) -> if(le(x, 0), le(x, s(0)), x, inc(y)) [1] 1099.37/291.50 if(true, b, x, y) -> log_undefined [1] 1099.37/291.50 if(false, b, x, y) -> if2(b, x, y) [1] 1099.37/291.50 if2(true, x, s(y)) -> y [1] 1099.37/291.50 if2(false, x, y) -> log2(quot(x, s(s(0))), y) [1] 1099.37/291.50 1099.37/291.50 Rewrite Strategy: INNERMOST 1099.37/291.50 ---------------------------------------- 1099.37/291.50 1099.37/291.50 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1099.37/291.50 Infered types. 1099.37/291.50 ---------------------------------------- 1099.37/291.50 1099.37/291.50 (4) 1099.37/291.50 Obligation: 1099.37/291.50 Runtime Complexity Weighted TRS with Types. 1099.37/291.50 The TRS R consists of the following rules: 1099.37/291.50 1099.37/291.50 le(0, y) -> true [1] 1099.37/291.50 le(s(x), 0) -> false [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
