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