Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989530
details
property
value
status
complete
benchmark
exclusive_phases.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n130.star.cs.uiowa.edu
space
Other
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.77917 seconds
cpu usage
2.72408
user time
2.49239
system time
0.231687
max virtual memory
1.8553496E7
max residence set size
180512.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^2))
output
2.61/1.74 WORST_CASE(?, O(n^2)) 2.61/1.75 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.61/1.75 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.61/1.75 2.61/1.75 2.61/1.75 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^2). 2.61/1.75 2.61/1.75 (0) CpxIntTrs 2.61/1.75 (1) Koat Proof [FINISHED, 476 ms] 2.61/1.75 (2) BOUNDS(1, n^2) 2.61/1.75 2.61/1.75 2.61/1.75 ---------------------------------------- 2.61/1.75 2.61/1.75 (0) 2.61/1.75 Obligation: 2.61/1.75 Complexity Int TRS consisting of the following rules: 2.61/1.75 eval_ex_paper1_start(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb0_in(v_.0, v_fwd, v_i, v_n)) :|: TRUE 2.61/1.75 eval_ex_paper1_bb0_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb1_in(v_i, v_fwd, v_i, v_n)) :|: TRUE 2.61/1.75 eval_ex_paper1_bb1_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb2_in(v_.0, v_fwd, v_i, v_n)) :|: 0 < v_.0 && v_.0 < v_n 2.61/1.75 eval_ex_paper1_bb1_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb3_in(v_.0, v_fwd, v_i, v_n)) :|: 0 >= v_.0 2.61/1.75 eval_ex_paper1_bb1_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb3_in(v_.0, v_fwd, v_i, v_n)) :|: v_.0 >= v_n 2.61/1.75 eval_ex_paper1_bb2_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb1_in(v_.0 + 1, v_fwd, v_i, v_n)) :|: v_fwd > 0 2.61/1.75 eval_ex_paper1_bb2_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb1_in(v_.0 - 1, v_fwd, v_i, v_n)) :|: v_fwd <= 0 2.61/1.75 eval_ex_paper1_bb3_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_stop(v_.0, v_fwd, v_i, v_n)) :|: TRUE 2.61/1.75 2.61/1.75 The start-symbols are:[eval_ex_paper1_start_4] 2.61/1.75 2.61/1.75 2.61/1.75 ---------------------------------------- 2.61/1.75 2.61/1.75 (1) Koat Proof (FINISHED) 2.61/1.75 YES(?, 4*ar_1^2 + 4*ar_1*ar_2 + 4*ar_1 + 13) 2.61/1.75 2.61/1.75 2.61/1.75 2.61/1.75 Initial complexity problem: 2.61/1.75 2.61/1.75 1: T: 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3)) 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_1, ar_1, ar_2, ar_3)) 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 /\ ar_2 >= ar_0 + 1 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_3 >= 1 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) [ 0 >= ar_3 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1stop(ar_0, ar_1, ar_2, ar_3)) 2.61/1.75 2.61/1.75 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.61/1.75 2.61/1.75 start location: koat_start 2.61/1.75 2.61/1.75 leaf cost: 0 2.61/1.75 2.61/1.75 2.61/1.75 2.61/1.75 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.61/1.75 2.61/1.75 2: T: 2.61/1.75 2.61/1.75 (Comp: 1, Cost: 1) evalexpaper1start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3)) 2.61/1.75 2.61/1.75 (Comp: 1, Cost: 1) evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_1, ar_1, ar_2, ar_3)) 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 /\ ar_2 >= ar_0 + 1 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_3 >= 1 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) [ 0 >= ar_3 ] 2.61/1.75 2.61/1.75 (Comp: ?, Cost: 1) evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1stop(ar_0, ar_1, ar_2, ar_3)) 2.61/1.75 2.61/1.75 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.61/1.75 2.61/1.75 start location: koat_start 2.61/1.75 2.61/1.75 leaf cost: 0 2.61/1.75 2.61/1.75 2.61/1.75 2.61/1.75 A polynomial rank function with 2.61/1.75 2.61/1.75 Pol(evalexpaper1start) = 2 2.61/1.75 2.61/1.75 Pol(evalexpaper1bb0in) = 2 2.61/1.75 2.61/1.75 Pol(evalexpaper1bb1in) = 2 2.61/1.75
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38