Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990212
details
property
value
status
complete
benchmark
smagilla-succeed.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.99537 seconds
cpu usage
5.317
user time
4.94692
system time
0.370076
max virtual memory
1.875212E7
max residence set size
221292.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
5.11/2.37 WORST_CASE(NON_POLY, ?) 5.28/2.78 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 5.28/2.78 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.28/2.78 5.28/2.78 5.28/2.78 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 5.28/2.78 5.28/2.78 (0) CpxIntTrs 5.28/2.78 (1) Loat Proof [FINISHED, 635 ms] 5.28/2.78 (2) BOUNDS(INF, INF) 5.28/2.78 5.28/2.78 5.28/2.78 ---------------------------------------- 5.28/2.78 5.28/2.78 (0) 5.28/2.78 Obligation: 5.28/2.78 Complexity Int TRS consisting of the following rules: 5.28/2.78 f10(A, B, C, D, E) -> Com_1(f10(A - 1, B - 1, C + 1, F, E)) :|: A >= 1 && F >= 1 5.28/2.78 f10(A, B, C, D, E) -> Com_1(f10(A - 1, B, C, F, E)) :|: 0 >= F && A >= 1 && A >= B + 1 5.28/2.78 f20(A, B, C, D, E) -> Com_1(f20(A, B, C, D, E)) :|: TRUE 5.28/2.78 f22(A, B, C, D, E) -> Com_1(f25(A, B, C, D, E)) :|: TRUE 5.28/2.78 f10(A, B, C, D, E) -> Com_1(f20(A, B, C, D, E)) :|: 0 >= A 5.28/2.78 f0(A, B, C, D, E) -> Com_1(f10(8, F, 0, D, 8)) :|: F >= 1 5.28/2.78 5.28/2.78 The start-symbols are:[f0_5] 5.28/2.78 5.28/2.78 5.28/2.78 ---------------------------------------- 5.28/2.78 5.28/2.78 (1) Loat Proof (FINISHED) 5.28/2.78 5.28/2.78 5.28/2.78 ### Pre-processing the ITS problem ### 5.28/2.78 5.28/2.78 5.28/2.78 5.28/2.78 Initial linear ITS problem 5.28/2.78 5.28/2.78 Start location: f0 5.28/2.78 5.28/2.78 0: f10 -> f10 : A'=-1+A, B'=-1+B, C'=1+C, D'=free, [ A>=1 && free>=1 ], cost: 1 5.28/2.78 5.28/2.78 1: f10 -> f10 : A'=-1+A, D'=free_1, [ 0>=free_1 && A>=1 && A>=1+B ], cost: 1 5.28/2.78 5.28/2.78 4: f10 -> f20 : [ 0>=A ], cost: 1 5.28/2.78 5.28/2.78 2: f20 -> f20 : [], cost: 1 5.28/2.78 5.28/2.78 3: f22 -> f25 : [], cost: 1 5.28/2.78 5.28/2.78 5: f0 -> f10 : A'=8, B'=free_2, C'=0, E'=8, [ free_2>=1 ], cost: 1 5.28/2.78 5.28/2.78 5.28/2.78 5.28/2.78 Removed unreachable and leaf rules: 5.28/2.78 5.28/2.78 Start location: f0 5.28/2.78 5.28/2.78 0: f10 -> f10 : A'=-1+A, B'=-1+B, C'=1+C, D'=free, [ A>=1 && free>=1 ], cost: 1 5.28/2.78 5.28/2.78 1: f10 -> f10 : A'=-1+A, D'=free_1, [ 0>=free_1 && A>=1 && A>=1+B ], cost: 1 5.28/2.78 5.28/2.78 4: f10 -> f20 : [ 0>=A ], cost: 1 5.28/2.78 5.28/2.78 2: f20 -> f20 : [], cost: 1 5.28/2.78 5.28/2.78 5: f0 -> f10 : A'=8, B'=free_2, C'=0, E'=8, [ free_2>=1 ], cost: 1 5.28/2.78 5.28/2.78 5.28/2.78 5.28/2.78 ### Simplification by acceleration and chaining ### 5.28/2.78 5.28/2.78 5.28/2.78 5.28/2.78 Accelerating simple loops of location 0. 5.28/2.78 5.28/2.78 Accelerating the following rules: 5.28/2.78 5.28/2.78 0: f10 -> f10 : A'=-1+A, B'=-1+B, C'=1+C, D'=free, [ A>=1 && free>=1 ], cost: 1 5.28/2.78 5.28/2.78 1: f10 -> f10 : A'=-1+A, D'=free_1, [ 0>=free_1 && A>=1 && A>=1+B ], cost: 1 5.28/2.78 5.28/2.78 5.28/2.78 5.28/2.78 Accelerated rule 0 with metering function A, yielding the new rule 6. 5.28/2.78 5.28/2.78 Accelerated rule 1 with backward acceleration, yielding the new rule 7. 5.28/2.78 5.28/2.78 Accelerated rule 1 with backward acceleration, yielding the new rule 8. 5.28/2.78 5.28/2.78 Removing the simple loops: 0 1. 5.28/2.78 5.28/2.78 5.28/2.78 5.28/2.78 Accelerating simple loops of location 1. 5.28/2.78 5.28/2.78 Accelerating the following rules: 5.28/2.78 5.28/2.78 2: f20 -> f20 : [], cost: 1 5.28/2.78
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_ITS 2019-03-21 04.46