Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313744
details
property
value
status
complete
benchmark
thiemann08.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.37397 seconds
cpu usage
6.29806
user time
5.99406
system time
0.304004
max virtual memory
1.8277336E7
max residence set size
801304.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
6.13/2.32 WORST_CASE(NON_POLY, ?) 6.13/2.33 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 6.13/2.33 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.13/2.33 6.13/2.33 6.13/2.33 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 6.13/2.33 6.13/2.33 (0) CpxTRS 6.13/2.33 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 6.13/2.33 (2) CpxTRS 6.13/2.33 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 6.13/2.33 (4) CpxTRS 6.13/2.33 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 6.13/2.33 (6) typed CpxTrs 6.13/2.33 (7) OrderProof [LOWER BOUND(ID), 0 ms] 6.13/2.33 (8) typed CpxTrs 6.13/2.33 (9) RewriteLemmaProof [LOWER BOUND(ID), 239 ms] 6.13/2.33 (10) BEST 6.13/2.33 (11) proven lower bound 6.13/2.33 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 6.13/2.33 (13) BOUNDS(n^1, INF) 6.13/2.33 (14) typed CpxTrs 6.13/2.33 (15) RewriteLemmaProof [FINISHED, 115 ms] 6.13/2.33 (16) BOUNDS(EXP, INF) 6.13/2.33 6.13/2.33 6.13/2.33 ---------------------------------------- 6.13/2.33 6.13/2.33 (0) 6.13/2.33 Obligation: 6.13/2.33 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 6.13/2.33 6.13/2.33 6.13/2.33 The TRS R consists of the following rules: 6.13/2.33 6.13/2.33 empty(nil) -> true 6.13/2.33 empty(cons(x, l)) -> false 6.13/2.33 head(cons(x, l)) -> x 6.13/2.33 tail(nil) -> nil 6.13/2.33 tail(cons(x, l)) -> l 6.13/2.33 rev(nil) -> nil 6.13/2.33 rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l)) 6.13/2.33 last(x, l) -> if(empty(l), x, l) 6.13/2.33 if(true, x, l) -> x 6.13/2.33 if(false, x, l) -> last(head(l), tail(l)) 6.13/2.33 rev2(x, nil) -> nil 6.13/2.33 rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) 6.13/2.33 6.13/2.33 S is empty. 6.13/2.33 Rewrite Strategy: INNERMOST 6.13/2.33 ---------------------------------------- 6.13/2.33 6.13/2.33 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 6.13/2.33 Renamed function symbols to avoid clashes with predefined symbol. 6.13/2.33 ---------------------------------------- 6.13/2.33 6.13/2.33 (2) 6.13/2.33 Obligation: 6.13/2.33 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 6.13/2.33 6.13/2.33 6.13/2.33 The TRS R consists of the following rules: 6.13/2.33 6.13/2.33 empty(nil) -> true 6.13/2.33 empty(cons(x, l)) -> false 6.13/2.33 head(cons(x, l)) -> x 6.13/2.33 tail(nil) -> nil 6.13/2.33 tail(cons(x, l)) -> l 6.13/2.33 rev(nil) -> nil 6.13/2.33 rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l)) 6.13/2.33 last(x, l) -> if(empty(l), x, l) 6.13/2.33 if(true, x, l) -> x 6.13/2.33 if(false, x, l) -> last(head(l), tail(l)) 6.13/2.33 rev2(x, nil) -> nil 6.13/2.33 rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) 6.13/2.33 6.13/2.33 S is empty. 6.13/2.33 Rewrite Strategy: INNERMOST 6.13/2.33 ---------------------------------------- 6.13/2.33 6.13/2.33 (3) SlicingProof (LOWER BOUND(ID)) 6.13/2.33 Sliced the following arguments: 6.13/2.33 rev1/0 6.13/2.33 rev1/1 6.13/2.33 6.13/2.33 ---------------------------------------- 6.13/2.33 6.13/2.33 (4) 6.13/2.33 Obligation: 6.13/2.33 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 6.13/2.33 6.13/2.33 6.13/2.33 The TRS R consists of the following rules: 6.13/2.33 6.13/2.33 empty(nil) -> true 6.13/2.33 empty(cons(x, l)) -> false 6.13/2.33 head(cons(x, l)) -> x 6.13/2.33 tail(nil) -> nil 6.13/2.33 tail(cons(x, l)) -> l 6.13/2.33 rev(nil) -> nil
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