Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313897
details
property
value
status
complete
benchmark
2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n117.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.626 seconds
cpu usage
380.416
user time
376.973
system time
3.44276
max virtual memory
1.8983988E7
max residence set size
5240472.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
380.31/291.56 WORST_CASE(Omega(n^1), O(n^2)) 380.31/291.58 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 380.31/291.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 380.31/291.58 380.31/291.58 380.31/291.58 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 380.31/291.58 380.31/291.58 (0) CpxTRS 380.31/291.58 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (2) CpxWeightedTrs 380.31/291.58 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (4) CpxTypedWeightedTrs 380.31/291.58 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 380.31/291.58 (6) CpxTypedWeightedCompleteTrs 380.31/291.58 (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (8) CpxTypedWeightedCompleteTrs 380.31/291.58 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 380.31/291.58 (10) CpxRNTS 380.31/291.58 (11) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (12) CpxRNTS 380.31/291.58 (13) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (14) CpxRNTS 380.31/291.58 (15) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.31/291.58 (16) CpxRNTS 380.31/291.58 (17) IntTrsBoundProof [UPPER BOUND(ID), 227 ms] 380.31/291.58 (18) CpxRNTS 380.31/291.58 (19) IntTrsBoundProof [UPPER BOUND(ID), 56 ms] 380.31/291.58 (20) CpxRNTS 380.31/291.58 (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.31/291.58 (22) CpxRNTS 380.31/291.58 (23) IntTrsBoundProof [UPPER BOUND(ID), 385 ms] 380.31/291.58 (24) CpxRNTS 380.31/291.58 (25) IntTrsBoundProof [UPPER BOUND(ID), 156 ms] 380.31/291.58 (26) CpxRNTS 380.31/291.58 (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 380.31/291.58 (28) CpxRNTS 380.31/291.58 (29) IntTrsBoundProof [UPPER BOUND(ID), 643 ms] 380.31/291.58 (30) CpxRNTS 380.31/291.58 (31) IntTrsBoundProof [UPPER BOUND(ID), 337 ms] 380.31/291.58 (32) CpxRNTS 380.31/291.58 (33) FinalProof [FINISHED, 0 ms] 380.31/291.58 (34) BOUNDS(1, n^2) 380.31/291.58 (35) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (36) CpxTRS 380.31/291.58 (37) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 380.31/291.58 (38) typed CpxTrs 380.31/291.58 (39) OrderProof [LOWER BOUND(ID), 0 ms] 380.31/291.58 (40) typed CpxTrs 380.31/291.58 (41) RewriteLemmaProof [LOWER BOUND(ID), 307 ms] 380.31/291.58 (42) BEST 380.31/291.58 (43) proven lower bound 380.31/291.58 (44) LowerBoundPropagationProof [FINISHED, 0 ms] 380.31/291.58 (45) BOUNDS(n^1, INF) 380.31/291.58 (46) typed CpxTrs 380.31/291.58 380.31/291.58 380.31/291.58 ---------------------------------------- 380.31/291.58 380.31/291.58 (0) 380.31/291.58 Obligation: 380.31/291.58 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 380.31/291.58 380.31/291.58 380.31/291.58 The TRS R consists of the following rules: 380.31/291.58 380.31/291.58 cond(true, x, y) -> cond(gr(x, y), p(x), s(y)) 380.31/291.58 gr(0, x) -> false 380.31/291.58 gr(s(x), 0) -> true 380.31/291.58 gr(s(x), s(y)) -> gr(x, y) 380.31/291.58 p(0) -> 0 380.31/291.58 p(s(x)) -> x 380.31/291.58 380.31/291.58 S is empty. 380.31/291.58 Rewrite Strategy: INNERMOST 380.31/291.58 ---------------------------------------- 380.31/291.58 380.31/291.58 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 380.31/291.58 Transformed relative TRS to weighted TRS 380.31/291.58 ---------------------------------------- 380.31/291.58 380.31/291.58 (2) 380.31/291.58 Obligation: 380.31/291.58 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2). 380.31/291.58 380.31/291.58 380.31/291.58 The TRS R consists of the following rules: 380.31/291.58 380.31/291.58 cond(true, x, y) -> cond(gr(x, y), p(x), s(y)) [1] 380.31/291.58 gr(0, x) -> false [1] 380.31/291.58 gr(s(x), 0) -> true [1] 380.31/291.58 gr(s(x), s(y)) -> gr(x, y) [1] 380.31/291.58 p(0) -> 0 [1] 380.31/291.58 p(s(x)) -> x [1] 380.31/291.58 380.31/291.58 Rewrite Strategy: INNERMOST 380.31/291.58 ---------------------------------------- 380.31/291.58 380.31/291.58 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 380.31/291.58 Infered types. 380.31/291.58 ----------------------------------------
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