Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990440
details
property
value
status
complete
benchmark
n-4.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n067.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
6.04435 seconds
cpu usage
14.2283
user time
13.7533
system time
0.475009
max virtual memory
1.8706344E7
max residence set size
222124.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
14.05/5.62 WORST_CASE(NON_POLY, ?) 14.20/5.92 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 14.20/5.92 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.20/5.92 14.20/5.92 14.20/5.92 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 14.20/5.92 14.20/5.92 (0) CpxIntTrs 14.20/5.92 (1) Loat Proof [FINISHED, 3824 ms] 14.20/5.92 (2) BOUNDS(INF, INF) 14.20/5.92 14.20/5.92 14.20/5.92 ---------------------------------------- 14.20/5.92 14.20/5.92 (0) 14.20/5.92 Obligation: 14.20/5.92 Complexity Int TRS consisting of the following rules: 14.20/5.92 f5(A, B, C, D, E) -> Com_1(f300(A, B, C, D, E)) :|: TRUE 14.20/5.92 f4(A, B, C, D, E) -> Com_1(f300(A, B, 1 + C, D, E)) :|: A >= B 14.20/5.92 f4(A, B, C, D, E) -> Com_1(f4(1 + A, B, C, F, E)) :|: F >= 1 && B >= 1 + A 14.20/5.92 f4(A, B, C, D, E) -> Com_1(f4(1 + A, B, C, F, E)) :|: 0 >= F + 1 && B >= 1 + A 14.20/5.92 f4(A, B, C, D, E) -> Com_1(f2(A, B, C, 0, E)) :|: B >= 1 + A 14.20/5.92 f2(A, B, C, D, E) -> Com_1(f4(1 + A, B, C, F, E)) :|: F >= 1 && B >= 1 + A 14.20/5.92 f2(A, B, C, D, E) -> Com_1(f4(1 + A, B, C, F, E)) :|: 0 >= F + 1 && B >= 1 + A 14.20/5.92 f2(A, B, C, D, E) -> Com_1(f2(A, B, C, 0, E)) :|: B >= 1 + A 14.20/5.92 f300(A, B, C, D, E) -> Com_1(f1(A, B, C, D, F)) :|: C >= A 14.20/5.92 f300(A, B, C, D, E) -> Com_1(f300(A, B, 1 + C, D, E)) :|: A >= 1 + C && A >= B 14.20/5.92 f300(A, B, C, D, E) -> Com_1(f4(1 + A, B, C, F, E)) :|: F >= 1 && A >= 1 + C && B >= 1 + A 14.20/5.92 f300(A, B, C, D, E) -> Com_1(f4(1 + A, B, C, F, E)) :|: 0 >= F + 1 && A >= 1 + C && B >= 1 + A 14.20/5.92 f300(A, B, C, D, E) -> Com_1(f2(A, B, C, 0, E)) :|: A >= 1 + C && B >= 1 + A 14.20/5.92 14.20/5.92 The start-symbols are:[f5_5] 14.20/5.92 14.20/5.92 14.20/5.92 ---------------------------------------- 14.20/5.92 14.20/5.92 (1) Loat Proof (FINISHED) 14.20/5.92 14.20/5.92 14.20/5.92 ### Pre-processing the ITS problem ### 14.20/5.92 14.20/5.92 14.20/5.92 14.20/5.92 Initial linear ITS problem 14.20/5.92 14.20/5.92 Start location: f5 14.20/5.92 14.20/5.92 0: f5 -> f300 : [], cost: 1 14.20/5.92 14.20/5.92 1: f4 -> f300 : C'=1+C, [ A>=B ], cost: 1 14.20/5.92 14.20/5.92 2: f4 -> f4 : A'=1+A, D'=free, [ free>=1 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 3: f4 -> f4 : A'=1+A, D'=free_1, [ 0>=1+free_1 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 4: f4 -> f2 : D'=0, [ B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 5: f2 -> f4 : A'=1+A, D'=free_2, [ free_2>=1 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 6: f2 -> f4 : A'=1+A, D'=free_3, [ 0>=1+free_3 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 7: f2 -> f2 : D'=0, [ B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 8: f300 -> f1 : E'=free_4, [ C>=A ], cost: 1 14.20/5.92 14.20/5.92 9: f300 -> f300 : C'=1+C, [ A>=1+C && A>=B ], cost: 1 14.20/5.92 14.20/5.92 10: f300 -> f4 : A'=1+A, D'=free_5, [ free_5>=1 && A>=1+C && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 11: f300 -> f4 : A'=1+A, D'=free_6, [ 0>=1+free_6 && A>=1+C && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 12: f300 -> f2 : D'=0, [ A>=1+C && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 14.20/5.92 14.20/5.92 Removed unreachable and leaf rules: 14.20/5.92 14.20/5.92 Start location: f5 14.20/5.92 14.20/5.92 0: f5 -> f300 : [], cost: 1 14.20/5.92 14.20/5.92 1: f4 -> f300 : C'=1+C, [ A>=B ], cost: 1 14.20/5.92 14.20/5.92 2: f4 -> f4 : A'=1+A, D'=free, [ free>=1 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 3: f4 -> f4 : A'=1+A, D'=free_1, [ 0>=1+free_1 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 4: f4 -> f2 : D'=0, [ B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 5: f2 -> f4 : A'=1+A, D'=free_2, [ free_2>=1 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 6: f2 -> f4 : A'=1+A, D'=free_3, [ 0>=1+free_3 && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 7: f2 -> f2 : D'=0, [ B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 9: f300 -> f300 : C'=1+C, [ A>=1+C && A>=B ], cost: 1 14.20/5.92 14.20/5.92 10: f300 -> f4 : A'=1+A, D'=free_5, [ free_5>=1 && A>=1+C && B>=1+A ], cost: 1 14.20/5.92 14.20/5.92 11: f300 -> f4 : A'=1+A, D'=free_6, [ 0>=1+free_6 && A>=1+C && B>=1+A ], cost: 1
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