Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744123
details
property
value
status
complete
benchmark
sect5-sumSum.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
KoAT-2013
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.03402304649 seconds
cpu usage
4.579573069
max memory
2.7072512E8
stage attributes
key
value
output-size
12957
starexec-result
WORST_CASE(Omega(n^2), O(n^2))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^2), O(n^2)) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^2, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 20 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 326 ms] (4) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: l0(A, B, C, D) -> Com_1(l1(0, B, C, D)) :|: TRUE l1(A, B, C, D) -> Com_1(l2(A, B, 0, 0)) :|: B >= 1 l2(A, B, C, D) -> Com_1(l2(A, B, C + 1, D + C)) :|: B >= C + 1 l2(A, B, C, D) -> Com_1(l1(A + D, B - 1, C, D)) :|: C >= B The start-symbols are:[l0_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 8*ar_1 + 2*ar_1^2 + 7) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) l0(ar_0, ar_1, ar_2, ar_3) -> Com_1(l1(0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) l1(ar_0, ar_1, ar_2, ar_3) -> Com_1(l2(ar_0, ar_1, 0, 0)) [ ar_1 >= 1 ] (Comp: ?, Cost: 1) l2(ar_0, ar_1, ar_2, ar_3) -> Com_1(l2(ar_0, ar_1, ar_2 + 1, ar_3 + ar_2)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) l2(ar_0, ar_1, ar_2, ar_3) -> Com_1(l1(ar_0 + ar_3, ar_1 - 1, ar_2, ar_3)) [ ar_2 >= ar_1 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(l0(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) l0(ar_0, ar_1, ar_2, ar_3) -> Com_1(l1(0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) l1(ar_0, ar_1, ar_2, ar_3) -> Com_1(l2(ar_0, ar_1, 0, 0)) [ ar_1 >= 1 ] (Comp: ?, Cost: 1) l2(ar_0, ar_1, ar_2, ar_3) -> Com_1(l2(ar_0, ar_1, ar_2 + 1, ar_3 + ar_2)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) l2(ar_0, ar_1, ar_2, ar_3) -> Com_1(l1(ar_0 + ar_3, ar_1 - 1, ar_2, ar_3)) [ ar_2 >= ar_1 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(l0(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(l0) = V_2 + 1 Pol(l1) = V_2 + 1 Pol(l2) = V_2 Pol(koat_start) = V_2 + 1 orients all transitions weakly and the transition l1(ar_0, ar_1, ar_2, ar_3) -> Com_1(l2(ar_0, ar_1, 0, 0)) [ ar_1 >= 1 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) l0(ar_0, ar_1, ar_2, ar_3) -> Com_1(l1(0, ar_1, ar_2, ar_3))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843