Complexity_ITS 2019-03-21 04.46 pair #429990694

details

property	value
status	complete
benchmark	n-40.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n168.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	4.91133 seconds
cpu usage	11.2314
user time	10.7754
system time	0.455984
max virtual memory	1.886148E7
max residence set size	249296.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

11.07/4.86	WORST_CASE(NON_POLY, ?)
11.07/4.87	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
11.07/4.87	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.07/4.87	
11.07/4.87	
11.07/4.87	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
11.07/4.87	
11.07/4.87	(0) CpxIntTrs
11.07/4.87	(1) Loat Proof [FINISHED, 3231 ms]
11.07/4.87	(2) BOUNDS(INF, INF)
11.07/4.87	
11.07/4.87	
11.07/4.87	----------------------------------------
11.07/4.87	
11.07/4.87	(0)
11.07/4.87	Obligation:
11.07/4.87	Complexity Int TRS consisting of the following rules:
11.07/4.87	f2(A, B, C) -> Com_1(f300(A, B, D)) :|: A >= 3 && B >= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 2, C)) :|: 1 >= D && B >= 1 && B <= 1 && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 2, C)) :|: A >= 2 && 1 >= D && B >= 1 && B <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 2, C)) :|: 0 >= A && 1 >= D && B >= 1 && B <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: B >= 2 && 1 >= B && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: 0 >= B && 1 >= B && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && A >= 2 && B >= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && A >= 2 && 0 >= B
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && 0 >= A && B >= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && 0 >= A && 0 >= B
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: B >= 2 && 2 >= D && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: B >= 2 && 0 >= B && 2 >= D && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && A >= 2 && A <= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && 0 >= B && A >= 2 && A <= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && 2 >= A && 0 >= A
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && 2 >= A && 0 >= A && 0 >= B
11.07/4.87	f1(A, B, C) -> Com_1(f2(A, B, C)) :|: TRUE
11.07/4.87	
11.07/4.87	The start-symbols are:[f1_3]
11.07/4.87	
11.07/4.87	
11.07/4.87	----------------------------------------
11.07/4.87	
11.07/4.87	(1) Loat Proof (FINISHED)
11.07/4.87	
11.07/4.87	
11.07/4.87	### Pre-processing the ITS problem ###
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Initial linear ITS problem
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	      0: f2 -> f300 : C'=free, [ A>=3 && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ 1>=free_1 && B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && 1>=free_2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && 1>=free_3 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      4: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      6: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      7: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	      8: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      9: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     10: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 2>=free_4 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     11: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 0>=B && 2>=free_5 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     12: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     13: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 0>=B && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     14: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A ], cost: 1
11.07/4.87	
11.07/4.87	     15: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Removed unreachable and leaf rules:
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ 1>=free_1 && B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && 1>=free_2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && 1>=free_3 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      4: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && 1>=B && A==1 ], cost: 1

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Complexity_ITS 2019-03-21 04.46