Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744079
details
property
value
status
complete
benchmark
poly4.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
VMCAI05
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.70107412338 seconds
cpu usage
5.822369479
max memory
2.80563712E8
stage attributes
key
value
output-size
9344
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
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^1), O(n^1)) 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^1, max(1, 1 + Arg_0 + -1 * Arg_1) + nat(2 * Arg_2 + -2 * Arg_3) + nat(Arg_0 + -1 * Arg_1)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 804 ms] (2) BOUNDS(1, max(1, 1 + Arg_0 + -1 * Arg_1) + nat(2 * Arg_2 + -2 * Arg_3) + nat(Arg_0 + -1 * Arg_1)) (3) Loat Proof [FINISHED, 990 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval(A, B, C, D, E) -> Com_1(eval(A, B + 1, C, D, E + 1)) :|: A >= B + 1 && C >= D + 1 eval(A, B, C, D, E) -> Com_1(eval(A, B, C, D + 1, E + 1)) :|: A >= B + 1 && C >= D + 1 eval(A, B, C, D, E) -> Com_1(eval(A, B, C, D + 1, E + 1)) :|: B >= A && C >= D + 1 eval(A, B, C, D, E) -> Com_1(eval(A, B + 1, C, D, E + 1)) :|: A >= B + 1 && D >= C start(A, B, C, D, E) -> Com_1(eval(A, B, C, D, E)) :|: TRUE The start-symbols are:[start_5] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, 1+max([0, Arg_0-Arg_1])+max([0, Arg_2-Arg_3])+max([0, Arg_2-Arg_3])+max([0, Arg_0-Arg_1]) {O(n)}) Initial Complexity Problem: Start: start Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4 Temp_Vars: Locations: eval, start Transitions: eval(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> eval(Arg_0,Arg_1+1,Arg_2,Arg_3,Arg_4+1):|:Arg_1+1 <= Arg_0 && Arg_3+1 <= Arg_2 eval(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> eval(Arg_0,Arg_1,Arg_2,Arg_3+1,Arg_4+1):|:Arg_1+1 <= Arg_0 && Arg_3+1 <= Arg_2 eval(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> eval(Arg_0,Arg_1,Arg_2,Arg_3+1,Arg_4+1):|:Arg_0 <= Arg_1 && Arg_3+1 <= Arg_2 eval(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> eval(Arg_0,Arg_1+1,Arg_2,Arg_3,Arg_4+1):|:Arg_1+1 <= Arg_0 && Arg_2 <= Arg_3 start(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> eval(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|: Timebounds: Overall timebound: 1+max([0, Arg_0-Arg_1])+max([0, Arg_2-Arg_3])+max([0, Arg_2-Arg_3])+max([0, Arg_0-Arg_1]) {O(n)} 0: eval->eval: max([0, Arg_0-Arg_1]) {O(n)} 1: eval->eval: max([0, Arg_2-Arg_3]) {O(n)} 2: eval->eval: max([0, Arg_2-Arg_3]) {O(n)} 3: eval->eval: max([0, Arg_0-Arg_1]) {O(n)} 4: start->eval: 1 {O(1)} Costbounds: Overall costbound: 1+max([0, Arg_0-Arg_1])+max([0, Arg_2-Arg_3])+max([0, Arg_2-Arg_3])+max([0, Arg_0-Arg_1]) {O(n)} 0: eval->eval: max([0, Arg_0-Arg_1]) {O(n)} 1: eval->eval: max([0, Arg_2-Arg_3]) {O(n)} 2: eval->eval: max([0, Arg_2-Arg_3]) {O(n)} 3: eval->eval: max([0, Arg_0-Arg_1]) {O(n)} 4: start->eval: 1 {O(1)} Sizebounds: `Lower:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843