3.57/1.72	WORST_CASE(NON_POLY, ?)
3.57/1.73	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
3.57/1.73	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.57/1.73	
3.57/1.73	
3.57/1.73	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
3.57/1.73	
3.57/1.73	(0) CpxIntTrs
3.57/1.73	(1) Loat Proof [FINISHED, 114 ms]
3.57/1.73	(2) BOUNDS(INF, INF)
3.57/1.73	
3.57/1.73	
3.57/1.73	----------------------------------------
3.57/1.73	
3.57/1.73	(0)
3.57/1.73	Obligation:
3.57/1.73	Complexity Int TRS consisting of the following rules:
3.57/1.73	f2(A, B, C) -> Com_1(f2(A + B, B - 2, C + 1)) :|: TRUE
3.57/1.73	f2(A, B, C) -> Com_1(f2(A + C, B, C - 2)) :|: TRUE
3.57/1.73	f0(A, B, C) -> Com_1(f2(A, B, C)) :|: A >= 0
3.57/1.73	
3.57/1.73	The start-symbols are:[f0_3]
3.57/1.73	
3.57/1.73	
3.57/1.73	----------------------------------------
3.57/1.73	
3.57/1.73	(1) Loat Proof (FINISHED)
3.57/1.73	
3.57/1.73	
3.57/1.73	### Pre-processing the ITS problem ###
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Initial linear ITS problem
3.57/1.73	
3.57/1.73	   Start location: f0
3.57/1.73	
3.57/1.73	      0: f2 -> f2 : A'=A+B, B'=-2+B, C'=1+C, [], cost: 1
3.57/1.73	
3.57/1.73	      1: f2 -> f2 : A'=C+A, C'=-2+C, [], cost: 1
3.57/1.73	
3.57/1.73	      2: f0 -> f2 : [ A>=0 ], cost: 1
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	### Simplification by acceleration and chaining ###
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Accelerating simple loops of location 0.
3.57/1.73	
3.57/1.73	   Accelerating the following rules:
3.57/1.73	
3.57/1.73	      0: f2 -> f2 : A'=A+B, B'=-2+B, C'=1+C, [], cost: 1
3.57/1.73	
3.57/1.73	      1: f2 -> f2 : A'=C+A, C'=-2+C, [], cost: 1
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	   Accelerated rule 0 with NONTERM, yielding the new rule 3.
3.57/1.73	
3.57/1.73	   Accelerated rule 1 with NONTERM, yielding the new rule 4.
3.57/1.73	
3.57/1.73	   Removing the simple loops: 0 1.
3.57/1.73	
3.57/1.73	   Also removing duplicate rules:.
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Accelerated all simple loops using metering functions (where possible):
3.57/1.73	
3.57/1.73	   Start location: f0
3.57/1.73	
3.57/1.73	      4: f2 -> [2] : [], cost: INF
3.57/1.73	
3.57/1.73	      2: f0 -> f2 : [ A>=0 ], cost: 1
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Chained accelerated rules (with incoming rules):
3.57/1.73	
3.57/1.73	   Start location: f0
3.57/1.73	
3.57/1.73	      2: f0 -> f2 : [ A>=0 ], cost: 1
3.57/1.73	
3.57/1.73	      5: f0 -> [2] : [ A>=0 ], cost: INF
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Removed unreachable locations (and leaf rules with constant cost):
3.57/1.73	
3.57/1.73	   Start location: f0
3.57/1.73	
3.57/1.73	      5: f0 -> [2] : [ A>=0 ], cost: INF
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	### Computing asymptotic complexity ###
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Fully simplified ITS problem
3.57/1.73	
3.57/1.73	   Start location: f0
3.57/1.73	
3.57/1.73	      5: f0 -> [2] : [ A>=0 ], cost: INF
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Computing asymptotic complexity for rule 5
3.57/1.73	
3.57/1.73	   Resulting cost INF has complexity: Nonterm
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Found new complexity Nonterm.
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	Obtained the following overall complexity (w.r.t. the length of the input n):
3.57/1.73	
3.57/1.73	   Complexity:  Nonterm
3.57/1.73	
3.57/1.73	   Cpx degree:  Nonterm
3.57/1.73	
3.57/1.73	   Solved cost: INF
3.57/1.73	
3.57/1.73	   Rule cost:   INF
3.57/1.73	
3.57/1.73	   Rule guard:  [ A>=0 ]
3.57/1.73	
3.57/1.73	
3.57/1.73	
3.57/1.73	NO
3.57/1.73	
3.57/1.73	
3.57/1.73	----------------------------------------
3.57/1.73	
3.57/1.73	(2)
3.57/1.73	BOUNDS(INF, INF)
3.57/1.75	EOF