Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990662
details
property
value
status
complete
benchmark
st88.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.53974 seconds
cpu usage
5.93444
user time
5.53495
system time
0.399492
max virtual memory
1.8775552E7
max residence set size
223928.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
5.66/2.50 WORST_CASE(NON_POLY, ?) 5.66/2.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 5.66/2.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.66/2.51 5.66/2.51 5.66/2.51 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 5.66/2.51 5.66/2.51 (0) CpxIntTrs 5.66/2.51 (1) Loat Proof [FINISHED, 717 ms] 5.66/2.51 (2) BOUNDS(INF, INF) 5.66/2.51 5.66/2.51 5.66/2.51 ---------------------------------------- 5.66/2.51 5.66/2.51 (0) 5.66/2.51 Obligation: 5.66/2.51 Complexity Int TRS consisting of the following rules: 5.66/2.51 f9(A, B) -> Com_1(f10(A, B)) :|: 5 >= A 5.66/2.51 f25(A, B) -> Com_1(f2(A, B)) :|: TRUE 5.66/2.51 f2(A, B) -> Com_1(f2(A, B)) :|: TRUE 5.66/2.51 f9(A, B) -> Com_1(f10(A, C)) :|: A >= 6 && 0 >= C + 1 5.66/2.51 f9(A, B) -> Com_1(f10(A, C)) :|: A >= 6 && C >= 1 5.66/2.51 f10(A, B) -> Com_1(f9(A + 1, B)) :|: A >= 6 5.66/2.51 f27(A, B) -> Com_1(f29(A, B)) :|: TRUE 5.66/2.51 f19(A, B) -> Com_1(f19(A - 1, B)) :|: A >= 3 5.66/2.51 f19(A, B) -> Com_1(f9(A, B)) :|: 2 >= A 5.66/2.51 f10(A, B) -> Com_1(f9(A + 1, B)) :|: 5 >= A 5.66/2.51 f9(A, B) -> Com_1(f19(A, 0)) :|: A >= 6 5.66/2.51 f0(A, B) -> Com_1(f9(C, B)) :|: TRUE 5.66/2.51 5.66/2.51 The start-symbols are:[f0_2] 5.66/2.51 5.66/2.51 5.66/2.51 ---------------------------------------- 5.66/2.51 5.66/2.51 (1) Loat Proof (FINISHED) 5.66/2.51 5.66/2.51 5.66/2.51 ### Pre-processing the ITS problem ### 5.66/2.51 5.66/2.51 5.66/2.51 5.66/2.51 Initial linear ITS problem 5.66/2.51 5.66/2.51 Start location: f0 5.66/2.51 5.66/2.51 0: f9 -> f10 : [ 5>=A ], cost: 1 5.66/2.51 5.66/2.51 3: f9 -> f10 : B'=free, [ A>=6 && 0>=1+free ], cost: 1 5.66/2.51 5.66/2.51 4: f9 -> f10 : B'=free_1, [ A>=6 && free_1>=1 ], cost: 1 5.66/2.51 5.66/2.51 10: f9 -> f19 : B'=0, [ A>=6 ], cost: 1 5.66/2.51 5.66/2.51 1: f25 -> f2 : [], cost: 1 5.66/2.51 5.66/2.51 2: f2 -> f2 : [], cost: 1 5.66/2.51 5.66/2.51 5: f10 -> f9 : A'=1+A, [ A>=6 ], cost: 1 5.66/2.51 5.66/2.51 9: f10 -> f9 : A'=1+A, [ 5>=A ], cost: 1 5.66/2.51 5.66/2.51 6: f27 -> f29 : [], cost: 1 5.66/2.51 5.66/2.51 7: f19 -> f19 : A'=-1+A, [ A>=3 ], cost: 1 5.66/2.51 5.66/2.51 8: f19 -> f9 : [ 2>=A ], cost: 1 5.66/2.51 5.66/2.51 11: f0 -> f9 : A'=free_2, [], cost: 1 5.66/2.51 5.66/2.51 5.66/2.51 5.66/2.51 Removed unreachable and leaf rules: 5.66/2.51 5.66/2.51 Start location: f0 5.66/2.51 5.66/2.51 0: f9 -> f10 : [ 5>=A ], cost: 1 5.66/2.51 5.66/2.51 3: f9 -> f10 : B'=free, [ A>=6 && 0>=1+free ], cost: 1 5.66/2.51 5.66/2.51 4: f9 -> f10 : B'=free_1, [ A>=6 && free_1>=1 ], cost: 1 5.66/2.51 5.66/2.51 10: f9 -> f19 : B'=0, [ A>=6 ], cost: 1 5.66/2.51 5.66/2.51 5: f10 -> f9 : A'=1+A, [ A>=6 ], cost: 1 5.66/2.51 5.66/2.51 9: f10 -> f9 : A'=1+A, [ 5>=A ], cost: 1 5.66/2.51 5.66/2.51 7: f19 -> f19 : A'=-1+A, [ A>=3 ], cost: 1 5.66/2.51 5.66/2.51 8: f19 -> f9 : [ 2>=A ], cost: 1 5.66/2.51 5.66/2.51 11: f0 -> f9 : A'=free_2, [], cost: 1 5.66/2.51 5.66/2.51 5.66/2.51 5.66/2.51 ### Simplification by acceleration and chaining ### 5.66/2.51 5.66/2.51 5.66/2.51
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