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