Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381745128
details
property
value
status
complete
benchmark
sas2.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
38.7476730347 seconds
cpu usage
66.878688464
max memory
5.55225088E8
stage attributes
key
value
output-size
23691
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 17.8 s] (2) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f5(A, B, C, D, E, F) -> Com_1(f7(A, B, C, D, E, F)) :|: 0 >= A f5(A, B, C, D, E, F) -> Com_1(f7(A, B, C, D, E, F)) :|: A >= 2 f7(A, B, C, D, E, F) -> Com_1(f9(A, 0, C, D, E, F)) :|: B >= 0 && B <= 0 f16(A, B, C, D, E, F) -> Com_1(f5(A, B, C, G, E, F)) :|: 255 >= C f25(A, B, C, D, E, F) -> Com_1(f5(A, B, C, G, E, F)) :|: C >= 0 f0(A, B, C, D, E, F) -> Com_1(f5(4, 0, C, G, 0, F)) :|: TRUE f7(A, B, C, D, E, F) -> Com_1(f9(A - 1, B, C, D, E, F)) :|: 0 >= B + 1 f7(A, B, C, D, E, F) -> Com_1(f9(A - 1, B, C, D, E, F)) :|: B >= 1 f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: 0 >= E && D >= 1 + F f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: E >= 2 && D >= 1 + F f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: 0 >= B + 1 && D >= 1 + F && E >= 1 && E <= 1 f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: B >= 1 && D >= 1 + F && E >= 1 && E <= 1 f9(A, B, C, D, E, F) -> Com_1(f16(A - 1, 1, C + A - 1, D, 2, F)) :|: D >= 1 + F && B >= 0 && B <= 0 && E >= 1 && E <= 1 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: 1 >= E && F >= D + 1 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: E >= 3 && F >= D + 1 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: 0 >= B + 1 && F >= D + 1 && E >= 2 && E <= 2 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: B >= 1 && F >= D + 1 && E >= 2 && E <= 2 f9(A, B, C, D, E, F) -> Com_1(f25(A - 1, 1, C - A + 1, D, 1, F)) :|: F >= D + 1 && B >= 0 && B <= 0 && E >= 2 && E <= 2 f5(A, B, C, D, E, F) -> Com_1(f30(1, B, C, D, E, F)) :|: A >= 1 && A <= 1 f16(A, B, C, D, E, F) -> Com_1(f30(A, B, C, D, E, F)) :|: C >= 256 f25(A, B, C, D, E, F) -> Com_1(f30(A, B, C, D, E, F)) :|: 0 >= C + 1 f9(A, B, C, D, E, F) -> Com_1(f30(A, B, C, D, E, D)) :|: D >= F && D <= F The start-symbols are:[f0_6] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f0 0: f5 -> f7 : [ 0>=A ], cost: 1 1: f5 -> f7 : [ A>=2 ], cost: 1 18: f5 -> f30 : A'=1, [ A==1 ], cost: 1 2: f7 -> f9 : B'=0, [ B==0 ], cost: 1 6: f7 -> f9 : A'=-1+A, [ 0>=1+B ], cost: 1 7: f7 -> f9 : A'=-1+A, [ B>=1 ], cost: 1 3: f16 -> f5 : D'=free, [ 255>=C ], cost: 1 19: f16 -> f30 : [ C>=256 ], cost: 1 4: f25 -> f5 : D'=free_1, [ C>=0 ], cost: 1 20: f25 -> f30 : [ 0>=1+C ], cost: 1 5: f0 -> f5 : A'=4, B'=0, D'=free_2, E'=0, [], cost: 1 8: f9 -> f16 : C'=C+A, E'=2, [ 0>=E && D>=1+F ], cost: 1 9: f9 -> f16 : C'=C+A, E'=2, [ E>=2 && D>=1+F ], cost: 1 10: f9 -> f16 : C'=C+A, E'=2, [ 0>=1+B && D>=1+F && E==1 ], cost: 1 11: f9 -> f16 : C'=C+A, E'=2, [ B>=1 && D>=1+F && E==1 ], cost: 1 12: f9 -> f16 : A'=-1+A, B'=1, C'=-1+C+A, E'=2, [ D>=1+F && B==0 && E==1 ], cost: 1 13: f9 -> f25 : C'=C-A, E'=1, [ 1>=E && F>=1+D ], cost: 1 14: f9 -> f25 : C'=C-A, E'=1, [ E>=3 && F>=1+D ], cost: 1 15: f9 -> f25 : C'=C-A, E'=1, [ 0>=1+B && F>=1+D && E==2 ], cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843