Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308418
details
property
value
status
complete
benchmark
4.27.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.537 seconds
cpu usage
980.815
user time
974.391
system time
6.42435
max virtual memory
1.9190148E7
max residence set size
8291228.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
980.63/291.46 WORST_CASE(Omega(n^1), ?) 980.63/291.47 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 980.63/291.47 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 980.63/291.47 980.63/291.47 980.63/291.47 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 980.63/291.47 980.63/291.47 (0) CpxTRS 980.63/291.47 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 980.63/291.47 (2) CpxTRS 980.63/291.47 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 980.63/291.47 (4) CpxTRS 980.63/291.47 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 980.63/291.47 (6) typed CpxTrs 980.63/291.47 (7) OrderProof [LOWER BOUND(ID), 0 ms] 980.63/291.47 (8) typed CpxTrs 980.63/291.47 (9) RewriteLemmaProof [LOWER BOUND(ID), 288 ms] 980.63/291.47 (10) BEST 980.63/291.47 (11) proven lower bound 980.63/291.47 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 980.63/291.47 (13) BOUNDS(n^1, INF) 980.63/291.47 (14) typed CpxTrs 980.63/291.47 (15) RewriteLemmaProof [LOWER BOUND(ID), 86 ms] 980.63/291.47 (16) BOUNDS(1, INF) 980.63/291.47 980.63/291.47 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (0) 980.63/291.47 Obligation: 980.63/291.47 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 980.63/291.47 980.63/291.47 980.63/291.47 The TRS R consists of the following rules: 980.63/291.47 980.63/291.47 int(0, 0) -> .(0, nil) 980.63/291.47 int(0, s(y)) -> .(0, int(s(0), s(y))) 980.63/291.47 int(s(x), 0) -> nil 980.63/291.47 int(s(x), s(y)) -> int_list(int(x, y)) 980.63/291.47 int_list(nil) -> nil 980.63/291.47 int_list(.(x, y)) -> .(s(x), int_list(y)) 980.63/291.47 980.63/291.47 S is empty. 980.63/291.47 Rewrite Strategy: FULL 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 980.63/291.47 Renamed function symbols to avoid clashes with predefined symbol. 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (2) 980.63/291.47 Obligation: 980.63/291.47 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 980.63/291.47 980.63/291.47 980.63/291.47 The TRS R consists of the following rules: 980.63/291.47 980.63/291.47 int(0', 0') -> .(0', nil) 980.63/291.47 int(0', s(y)) -> .(0', int(s(0'), s(y))) 980.63/291.47 int(s(x), 0') -> nil 980.63/291.47 int(s(x), s(y)) -> int_list(int(x, y)) 980.63/291.47 int_list(nil) -> nil 980.63/291.47 int_list(.(x, y)) -> .(s(x), int_list(y)) 980.63/291.47 980.63/291.47 S is empty. 980.63/291.47 Rewrite Strategy: FULL 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (3) SlicingProof (LOWER BOUND(ID)) 980.63/291.47 Sliced the following arguments: 980.63/291.47 ./0 980.63/291.47 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (4) 980.63/291.47 Obligation: 980.63/291.47 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 980.63/291.47 980.63/291.47 980.63/291.47 The TRS R consists of the following rules: 980.63/291.47 980.63/291.47 int(0', 0') -> .(nil) 980.63/291.47 int(0', s(y)) -> .(int(s(0'), s(y))) 980.63/291.47 int(s(x), 0') -> nil 980.63/291.47 int(s(x), s(y)) -> int_list(int(x, y)) 980.63/291.47 int_list(nil) -> nil 980.63/291.47 int_list(.(y)) -> .(int_list(y)) 980.63/291.47 980.63/291.47 S is empty. 980.63/291.47 Rewrite Strategy: FULL 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (5) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 980.63/291.47 Infered types. 980.63/291.47 ---------------------------------------- 980.63/291.47 980.63/291.47 (6) 980.63/291.47 Obligation: 980.63/291.47 TRS: 980.63/291.47 Rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11
