3.55/1.76	WORST_CASE(Omega(n^1), O(n^1))
3.55/1.77	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
3.55/1.77	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.55/1.77	
3.55/1.77	
3.55/1.77	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(1, 1 + Arg_0 + -1 * Arg_1)).
3.55/1.77	
3.55/1.77	(0) CpxIntTrs
3.55/1.77	(1) Koat2 Proof [FINISHED, 48 ms]
3.55/1.77	(2) BOUNDS(1, max(1, 1 + Arg_0 + -1 * Arg_1))
3.55/1.77	(3) Loat Proof [FINISHED, 136 ms]
3.55/1.77	(4) BOUNDS(n^1, INF)
3.55/1.77	
3.55/1.77	
3.55/1.77	----------------------------------------
3.55/1.77	
3.55/1.77	(0)
3.55/1.77	Obligation:
3.55/1.77	Complexity Int TRS consisting of the following rules:
3.55/1.77	eval(A, B) -> Com_1(eval(A, B + 1)) :|: A >= B + 1
3.55/1.77	start(A, B) -> Com_1(eval(A, B)) :|: TRUE
3.55/1.77	
3.55/1.77	The start-symbols are:[start_2]
3.55/1.77	
3.55/1.77	
3.55/1.77	----------------------------------------
3.55/1.77	
3.55/1.77	(1) Koat2 Proof (FINISHED)
3.55/1.77	YES( ?, max([1, 1+Arg_0-Arg_1]) {O(n)})
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Initial Complexity Problem:
3.55/1.77	
3.55/1.77	  Start:  start  
3.55/1.77	
3.55/1.77	  Program_Vars:  Arg_0, Arg_1  
3.55/1.77	
3.55/1.77	  Temp_Vars:    
3.55/1.77	
3.55/1.77	  Locations:  eval, start  
3.55/1.77	
3.55/1.77	  Transitions:
3.55/1.77	
3.55/1.77	  eval(Arg_0,Arg_1) -> eval(Arg_0,Arg_1+1):|:Arg_1+1 <= Arg_0
3.55/1.77	
3.55/1.77	  start(Arg_0,Arg_1) -> eval(Arg_0,Arg_1):|:  
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Timebounds: 
3.55/1.77	
3.55/1.77	  Overall timebound: max([1, 1+Arg_0-Arg_1]) {O(n)}
3.55/1.77	
3.55/1.77	  0: eval->eval: max([0, Arg_0-Arg_1]) {O(n)}
3.55/1.77	
3.55/1.77	  1: start->eval: 1 {O(1)}
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Costbounds:
3.55/1.77	
3.55/1.77	  Overall costbound: max([1, 1+Arg_0-Arg_1]) {O(n)}
3.55/1.77	
3.55/1.77	  0: eval->eval: max([0, Arg_0-Arg_1]) {O(n)}
3.55/1.77	
3.55/1.77	  1: start->eval: 1 {O(1)}
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Sizebounds:
3.55/1.77	
3.55/1.77	`Lower:
3.55/1.77	
3.55/1.77	  0: eval->eval, Arg_0: Arg_0 {O(n)}
3.55/1.77	
3.55/1.77	  0: eval->eval, Arg_1: Arg_1 {O(n)}
3.55/1.77	
3.55/1.77	  1: start->eval, Arg_0: Arg_0 {O(n)}
3.55/1.77	
3.55/1.77	  1: start->eval, Arg_1: Arg_1 {O(n)}
3.55/1.77	
3.55/1.77	`Upper:
3.55/1.77	
3.55/1.77	  0: eval->eval, Arg_0: Arg_0 {O(n)}
3.55/1.77	
3.55/1.77	  0: eval->eval, Arg_1: Arg_1+max([0, Arg_0-Arg_1]) {O(n)}
3.55/1.77	
3.55/1.77	  1: start->eval, Arg_0: Arg_0 {O(n)}
3.55/1.77	
3.55/1.77	  1: start->eval, Arg_1: Arg_1 {O(n)}
3.55/1.77	
3.55/1.77	
3.55/1.77	----------------------------------------
3.55/1.77	
3.55/1.77	(2)
3.55/1.77	BOUNDS(1, max(1, 1 + Arg_0 + -1 * Arg_1))
3.55/1.77	
3.55/1.77	----------------------------------------
3.55/1.77	
3.55/1.77	(3) Loat Proof (FINISHED)
3.55/1.77	
3.55/1.77	
3.55/1.77	### Pre-processing the ITS problem ###
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Initial linear ITS problem
3.55/1.77	
3.55/1.77	   Start location: start
3.55/1.77	
3.55/1.77	      0: eval -> eval : B'=1+B, [ A>=1+B ], cost: 1
3.55/1.77	
3.55/1.77	      1: start -> eval : [], cost: 1
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	### Simplification by acceleration and chaining ###
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Accelerating simple loops of location 0.
3.55/1.77	
3.55/1.77	   Accelerating the following rules:
3.55/1.77	
3.55/1.77	      0: eval -> eval : B'=1+B, [ A>=1+B ], cost: 1
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	   Accelerated rule 0 with metering function A-B, yielding the new rule 2.
3.55/1.77	
3.55/1.77	   Removing the simple loops: 0.
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Accelerated all simple loops using metering functions (where possible):
3.55/1.77	
3.55/1.77	   Start location: start
3.55/1.77	
3.55/1.77	      2: eval -> eval : B'=A, [ A>=1+B ], cost: A-B
3.55/1.77	
3.55/1.77	      1: start -> eval : [], cost: 1
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Chained accelerated rules (with incoming rules):
3.55/1.77	
3.55/1.77	   Start location: start
3.55/1.77	
3.55/1.77	      1: start -> eval : [], cost: 1
3.55/1.77	
3.55/1.77	      3: start -> eval : B'=A, [ A>=1+B ], cost: 1+A-B
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Removed unreachable locations (and leaf rules with constant cost):
3.55/1.77	
3.55/1.77	   Start location: start
3.55/1.77	
3.55/1.77	      3: start -> eval : B'=A, [ A>=1+B ], cost: 1+A-B
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	### Computing asymptotic complexity ###
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Fully simplified ITS problem
3.55/1.77	
3.55/1.77	   Start location: start
3.55/1.77	
3.55/1.77	      3: start -> eval : B'=A, [ A>=1+B ], cost: 1+A-B
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Computing asymptotic complexity for rule 3
3.55/1.77	
3.55/1.77	   Solved the limit problem by the following transformations:
3.55/1.77	
3.55/1.77	      Created initial limit problem:
3.55/1.77	
3.55/1.77	      1+A-B (+), A-B (+/+!) [not solved]
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	      removing all constraints (solved by SMT)
3.55/1.77	
3.55/1.77	      resulting limit problem: [solved]
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	      applying transformation rule (C) using substitution {A==0,B==-n}
3.55/1.77	
3.55/1.77	      resulting limit problem:
3.55/1.77	
3.55/1.77	      [solved]
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	   Solution:
3.55/1.77	
3.55/1.77	      A / 0
3.55/1.77	
3.55/1.77	      B / -n
3.55/1.77	
3.55/1.77	   Resulting cost 1+n has complexity: Poly(n^1)
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Found new complexity Poly(n^1).
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	Obtained the following overall complexity (w.r.t. the length of the input n):
3.55/1.77	
3.55/1.77	   Complexity:  Poly(n^1)
3.55/1.77	
3.55/1.77	   Cpx degree:  1
3.55/1.77	
3.55/1.77	   Solved cost: 1+n
3.55/1.77	
3.55/1.77	   Rule cost:   1+A-B
3.55/1.77	
3.55/1.77	   Rule guard:  [ A>=1+B ]
3.55/1.77	
3.55/1.77	
3.55/1.77	
3.55/1.77	WORST_CASE(Omega(n^1),?)
3.55/1.77	
3.55/1.77	
3.55/1.77	----------------------------------------
3.55/1.77	
3.55/1.77	(4)
3.55/1.77	BOUNDS(n^1, INF)
3.68/1.79	EOF