Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313892
details
property
value
status
complete
benchmark
23.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.588 seconds
cpu usage
886.838
user time
879.541
system time
7.29715
max virtual memory
5.6405644E7
max residence set size
8025892.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
886.72/291.52 WORST_CASE(Omega(n^1), O(n^2)) 886.72/291.53 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 886.72/291.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 886.72/291.53 886.72/291.53 886.72/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 886.72/291.53 886.72/291.53 (0) CpxTRS 886.72/291.53 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 886.72/291.53 (2) CpxWeightedTrs 886.72/291.53 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 886.72/291.53 (4) CpxTypedWeightedTrs 886.72/291.53 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 886.72/291.53 (6) CpxTypedWeightedCompleteTrs 886.72/291.53 (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 886.72/291.53 (8) CpxRNTS 886.72/291.53 (9) CompleteCoflocoProof [FINISHED, 1192 ms] 886.72/291.53 (10) BOUNDS(1, n^2) 886.72/291.53 (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 886.72/291.53 (12) CpxTRS 886.72/291.53 (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 886.72/291.53 (14) typed CpxTrs 886.72/291.53 (15) OrderProof [LOWER BOUND(ID), 0 ms] 886.72/291.53 (16) typed CpxTrs 886.72/291.53 (17) RewriteLemmaProof [LOWER BOUND(ID), 222 ms] 886.72/291.53 (18) BEST 886.72/291.53 (19) proven lower bound 886.72/291.53 (20) LowerBoundPropagationProof [FINISHED, 0 ms] 886.72/291.53 (21) BOUNDS(n^1, INF) 886.72/291.53 (22) typed CpxTrs 886.72/291.53 886.72/291.53 886.72/291.53 ---------------------------------------- 886.72/291.53 886.72/291.53 (0) 886.72/291.53 Obligation: 886.72/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 886.72/291.53 886.72/291.53 886.72/291.53 The TRS R consists of the following rules: 886.72/291.53 886.72/291.53 cond1(true, x, y, z) -> cond2(gr(y, z), x, y, z) 886.72/291.53 cond2(true, x, y, z) -> cond2(gr(y, z), x, p(y), z) 886.72/291.53 cond2(false, x, y, z) -> cond1(gr(x, z), p(x), y, z) 886.72/291.53 gr(0, x) -> false 886.72/291.53 gr(s(x), 0) -> true 886.72/291.53 gr(s(x), s(y)) -> gr(x, y) 886.72/291.53 p(0) -> 0 886.72/291.53 p(s(x)) -> x 886.72/291.53 886.72/291.53 S is empty. 886.72/291.53 Rewrite Strategy: INNERMOST 886.72/291.53 ---------------------------------------- 886.72/291.53 886.72/291.53 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 886.72/291.53 Transformed relative TRS to weighted TRS 886.72/291.53 ---------------------------------------- 886.72/291.53 886.72/291.53 (2) 886.72/291.53 Obligation: 886.72/291.53 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2). 886.72/291.53 886.72/291.53 886.72/291.53 The TRS R consists of the following rules: 886.72/291.53 886.72/291.53 cond1(true, x, y, z) -> cond2(gr(y, z), x, y, z) [1] 886.72/291.53 cond2(true, x, y, z) -> cond2(gr(y, z), x, p(y), z) [1] 886.72/291.53 cond2(false, x, y, z) -> cond1(gr(x, z), p(x), y, z) [1] 886.72/291.53 gr(0, x) -> false [1] 886.72/291.53 gr(s(x), 0) -> true [1] 886.72/291.53 gr(s(x), s(y)) -> gr(x, y) [1] 886.72/291.53 p(0) -> 0 [1] 886.72/291.53 p(s(x)) -> x [1] 886.72/291.53 886.72/291.53 Rewrite Strategy: INNERMOST 886.72/291.53 ---------------------------------------- 886.72/291.53 886.72/291.53 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 886.72/291.53 Infered types. 886.72/291.53 ---------------------------------------- 886.72/291.53 886.72/291.53 (4) 886.72/291.53 Obligation: 886.72/291.53 Runtime Complexity Weighted TRS with Types. 886.72/291.53 The TRS R consists of the following rules: 886.72/291.53 886.72/291.53 cond1(true, x, y, z) -> cond2(gr(y, z), x, y, z) [1] 886.72/291.53 cond2(true, x, y, z) -> cond2(gr(y, z), x, p(y), z) [1] 886.72/291.53 cond2(false, x, y, z) -> cond1(gr(x, z), p(x), y, z) [1] 886.72/291.53 gr(0, x) -> false [1] 886.72/291.53 gr(s(x), 0) -> true [1] 886.72/291.53 gr(s(x), s(y)) -> gr(x, y) [1] 886.72/291.53 p(0) -> 0 [1] 886.72/291.53 p(s(x)) -> x [1] 886.72/291.53 886.72/291.53 The TRS has the following type information: 886.72/291.53 cond1 :: true:false -> 0:s -> 0:s -> 0:s -> cond1:cond2 886.72/291.53 true :: true:false 886.72/291.53 cond2 :: true:false -> 0:s -> 0:s -> 0:s -> cond1:cond2 886.72/291.53 gr :: 0:s -> 0:s -> true:false
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