Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429991118
details
property
value
status
complete
benchmark
counterex1b.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
WTC
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
7.84052 seconds
cpu usage
16.7677
user time
16.1044
system time
0.663312
max virtual memory
1.8787536E7
max residence set size
221824.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
16.67/7.80 WORST_CASE(Omega(n^2), ?) 16.67/7.81 proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat 16.67/7.81 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.67/7.81 16.67/7.81 16.67/7.81 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^2, INF). 16.67/7.81 16.67/7.81 (0) CpxIntTrs 16.67/7.81 (1) Loat Proof [FINISHED, 2946 ms] 16.67/7.81 (2) BOUNDS(n^2, INF) 16.67/7.81 16.67/7.81 16.67/7.81 ---------------------------------------- 16.67/7.81 16.67/7.81 (0) 16.67/7.81 Obligation: 16.67/7.81 Complexity Int TRS consisting of the following rules: 16.67/7.81 evalfstart(A, B, C, D, E, F) -> Com_1(evalfentryin(A, B, C, D, E, F)) :|: TRUE 16.67/7.81 evalfentryin(A, B, C, D, E, F) -> Com_1(evalfbb8in(B, A, C, D, E, F)) :|: TRUE 16.67/7.81 evalfbb8in(A, B, C, D, E, F) -> Com_1(evalfbb2in(A, B, A, D, E, F)) :|: B >= 0 16.67/7.81 evalfbb8in(A, B, C, D, E, F) -> Com_1(evalfreturnin(A, B, C, D, E, F)) :|: 0 >= B + 1 16.67/7.81 evalfbb2in(A, B, C, D, E, F) -> Com_1(evalfbb4in(A, B, C, D, E, F)) :|: 0 >= C + 1 16.67/7.81 evalfbb2in(A, B, C, D, E, F) -> Com_1(evalfbb3in(A, B, C, D, E, F)) :|: C >= 0 16.67/7.81 evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb1in(A, B, C, D, E, F)) :|: 0 >= G + 1 16.67/7.81 evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb1in(A, B, C, D, E, F)) :|: G >= 1 16.67/7.81 evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb4in(A, B, C, D, E, F)) :|: TRUE 16.67/7.81 evalfbb1in(A, B, C, D, E, F) -> Com_1(evalfbb2in(A, B, C - 1, D, E, F)) :|: TRUE 16.67/7.81 evalfbb4in(A, B, C, D, E, F) -> Com_1(evalfbb6in(A, B, C, B - 1, C, F)) :|: TRUE 16.67/7.81 evalfbb6in(A, B, C, D, E, F) -> Com_1(evalfbb8in(E, D, C, D, E, F)) :|: E >= F + 1 16.67/7.81 evalfbb6in(A, B, C, D, E, F) -> Com_1(evalfbb7in(A, B, C, D, E, F)) :|: F >= E 16.67/7.81 evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb5in(A, B, C, D, E, F)) :|: 0 >= G + 1 16.67/7.81 evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb5in(A, B, C, D, E, F)) :|: G >= 1 16.67/7.81 evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb8in(E, D, C, D, E, F)) :|: TRUE 16.67/7.81 evalfbb5in(A, B, C, D, E, F) -> Com_1(evalfbb6in(A, B, C, D, E + 1, F)) :|: TRUE 16.67/7.81 evalfreturnin(A, B, C, D, E, F) -> Com_1(evalfstop(A, B, C, D, E, F)) :|: TRUE 16.67/7.81 16.67/7.81 The start-symbols are:[evalfstart_6] 16.67/7.81 16.67/7.81 16.67/7.81 ---------------------------------------- 16.67/7.81 16.67/7.81 (1) Loat Proof (FINISHED) 16.67/7.81 16.67/7.81 16.67/7.81 ### Pre-processing the ITS problem ### 16.67/7.81 16.67/7.81 16.67/7.81 16.67/7.81 Initial linear ITS problem 16.67/7.81 16.67/7.81 Start location: evalfstart 16.67/7.81 16.67/7.81 0: evalfstart -> evalfentryin : [], cost: 1 16.67/7.81 16.67/7.81 1: evalfentryin -> evalfbb8in : A'=B, B'=A, [], cost: 1 16.67/7.81 16.67/7.81 2: evalfbb8in -> evalfbb2in : C'=A, [ B>=0 ], cost: 1 16.67/7.81 16.67/7.81 3: evalfbb8in -> evalfreturnin : [ 0>=1+B ], cost: 1 16.67/7.81 16.67/7.81 4: evalfbb2in -> evalfbb4in : [ 0>=1+C ], cost: 1 16.67/7.81 16.67/7.81 5: evalfbb2in -> evalfbb3in : [ C>=0 ], cost: 1 16.67/7.81 16.67/7.81 6: evalfbb3in -> evalfbb1in : [ 0>=1+free ], cost: 1 16.67/7.81 16.67/7.81 7: evalfbb3in -> evalfbb1in : [ free_1>=1 ], cost: 1 16.67/7.81 16.67/7.81 8: evalfbb3in -> evalfbb4in : [], cost: 1 16.67/7.81 16.67/7.81 9: evalfbb1in -> evalfbb2in : C'=-1+C, [], cost: 1 16.67/7.81 16.67/7.81 10: evalfbb4in -> evalfbb6in : D'=-1+B, E'=C, [], cost: 1 16.67/7.81 16.67/7.81 11: evalfbb6in -> evalfbb8in : A'=E, B'=D, [ E>=1+F ], cost: 1 16.67/7.81 16.67/7.81 12: evalfbb6in -> evalfbb7in : [ F>=E ], cost: 1 16.67/7.81 16.67/7.81 13: evalfbb7in -> evalfbb5in : [ 0>=1+free_2 ], cost: 1 16.67/7.81 16.67/7.81 14: evalfbb7in -> evalfbb5in : [ free_3>=1 ], cost: 1 16.67/7.81 16.67/7.81 15: evalfbb7in -> evalfbb8in : A'=E, B'=D, [], cost: 1 16.67/7.81 16.67/7.81 16: evalfbb5in -> evalfbb6in : E'=1+E, [], cost: 1 16.67/7.81 16.67/7.81 17: evalfreturnin -> evalfstop : [], cost: 1 16.67/7.81 16.67/7.81 16.67/7.81 16.67/7.81 Removed unreachable and leaf rules: 16.67/7.81 16.67/7.81 Start location: evalfstart 16.67/7.81 16.67/7.81 0: evalfstart -> evalfentryin : [], cost: 1 16.67/7.81 16.67/7.81 1: evalfentryin -> evalfbb8in : A'=B, B'=A, [], cost: 1 16.67/7.81 16.67/7.81 2: evalfbb8in -> evalfbb2in : C'=A, [ B>=0 ], cost: 1 16.67/7.81
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