6.70/2.50	YES
6.92/2.52	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
6.92/2.52	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.92/2.52	
6.92/2.52	
6.92/2.52	Termination of the given C Problem could be proven:
6.92/2.52	
6.92/2.52	(0) C Problem
6.92/2.52	(1) CToIRSProof [EQUIVALENT, 0 ms]
6.92/2.52	(2) IntTRS
6.92/2.52	(3) TerminationGraphProcessor [SOUND, 80 ms]
6.92/2.52	(4) IntTRS
6.92/2.52	(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.92/2.52	(6) IntTRS
6.92/2.52	(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 1 ms]
6.92/2.52	(8) IntTRS
6.92/2.52	(9) PolynomialOrderProcessor [EQUIVALENT, 1 ms]
6.92/2.52	(10) IntTRS
6.92/2.52	(11) PolynomialOrderProcessor [EQUIVALENT, 4 ms]
6.92/2.52	(12) YES
6.92/2.52	
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(0)
6.92/2.52	Obligation:
6.92/2.52	c file /export/starexec/sandbox/benchmark/theBenchmark.c
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(1) CToIRSProof (EQUIVALENT)
6.92/2.52	Parsed C Integer Program as IRS.
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(2)
6.92/2.52	Obligation:
6.92/2.52	Rules:
6.92/2.52	f1(x, y, z, i) -> f2(x_1, y, z, i) :|: TRUE
6.92/2.52	f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE
6.92/2.52	f3(x6, x7, x8, x9) -> f4(x6, x7, x10, x9) :|: TRUE
6.92/2.52	f4(x11, x12, x13, x14) -> f5(x11, x12, x13, x15) :|: TRUE
6.92/2.52	f6(x16, x17, x18, x19) -> f7(x16, x17, x18, arith) :|: TRUE && arith = x19 + 1
6.92/2.52	f8(x56, x57, x58, x59) -> f11(x60, x57, x58, x59) :|: TRUE && x60 = x56 + 1
6.92/2.52	f9(x61, x62, x63, x64) -> f12(x61, x62, x65, x64) :|: TRUE && x65 = x63 + 1
6.92/2.52	f7(x28, x29, x30, x31) -> f8(x28, x29, x30, x31) :|: x30 > x28
6.92/2.52	f7(x32, x33, x34, x35) -> f9(x32, x33, x34, x35) :|: x34 <= x32
6.92/2.52	f11(x36, x37, x38, x39) -> f10(x36, x37, x38, x39) :|: TRUE
6.92/2.52	f12(x40, x41, x42, x43) -> f10(x40, x41, x42, x43) :|: TRUE
6.92/2.52	f5(x44, x45, x46, x47) -> f6(x44, x45, x46, x47) :|: x44 < x45
6.92/2.52	f10(x48, x49, x50, x51) -> f5(x48, x49, x50, x51) :|: TRUE
6.92/2.52	f5(x52, x53, x54, x55) -> f13(x52, x53, x54, x55) :|: x52 >= x53
6.92/2.52	Start term: f1(x, y, z, i)
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(3) TerminationGraphProcessor (SOUND)
6.92/2.52	Constructed the termination graph and obtained one non-trivial SCC.
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(4)
6.92/2.52	Obligation:
6.92/2.52	Rules:
6.92/2.52	f5(x44, x45, x46, x47) -> f6(x44, x45, x46, x47) :|: x44 < x45
6.92/2.52	f10(x48, x49, x50, x51) -> f5(x48, x49, x50, x51) :|: TRUE
6.92/2.52	f11(x36, x37, x38, x39) -> f10(x36, x37, x38, x39) :|: TRUE
6.92/2.52	f8(x56, x57, x58, x59) -> f11(x60, x57, x58, x59) :|: TRUE && x60 = x56 + 1
6.92/2.52	f7(x28, x29, x30, x31) -> f8(x28, x29, x30, x31) :|: x30 > x28
6.92/2.52	f6(x16, x17, x18, x19) -> f7(x16, x17, x18, arith) :|: TRUE && arith = x19 + 1
6.92/2.52	f12(x40, x41, x42, x43) -> f10(x40, x41, x42, x43) :|: TRUE
6.92/2.52	f9(x61, x62, x63, x64) -> f12(x61, x62, x65, x64) :|: TRUE && x65 = x63 + 1
6.92/2.52	f7(x32, x33, x34, x35) -> f9(x32, x33, x34, x35) :|: x34 <= x32
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(5) IntTRSCompressionProof (EQUIVALENT)
6.92/2.52	Compressed rules.
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(6)
6.92/2.52	Obligation:
6.92/2.52	Rules:
6.92/2.52	f7(x32:0, x33:0, x34:0, x35:0) -> f7(x32:0, x33:0, x34:0 + 1, x35:0 + 1) :|: x34:0 <= x32:0 && x33:0 > x32:0
6.92/2.52	f7(x28:0, x29:0, x30:0, x31:0) -> f7(x28:0 + 1, x29:0, x30:0, x31:0 + 1) :|: x30:0 > x28:0 && x29:0 > x28:0 + 1
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
6.92/2.52	Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:
6.92/2.52	
6.92/2.52	   f7(x1, x2, x3, x4) -> f7(x1, x2, x3)
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(8)
6.92/2.52	Obligation:
6.92/2.52	Rules:
6.92/2.52	f7(x32:0, x33:0, x34:0) -> f7(x32:0, x33:0, x34:0 + 1) :|: x34:0 <= x32:0 && x33:0 > x32:0
6.92/2.52	f7(x28:0, x29:0, x30:0) -> f7(x28:0 + 1, x29:0, x30:0) :|: x30:0 > x28:0 && x29:0 > x28:0 + 1
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(9) PolynomialOrderProcessor (EQUIVALENT)
6.92/2.52	Found the following polynomial interpretation:
6.92/2.52	[f7(x, x1, x2)] = -x + x1
6.92/2.52	
6.92/2.52	The following rules are decreasing:
6.92/2.52	f7(x28:0, x29:0, x30:0) -> f7(x28:0 + 1, x29:0, x30:0) :|: x30:0 > x28:0 && x29:0 > x28:0 + 1
6.92/2.52	The following rules are bounded:
6.92/2.52	f7(x32:0, x33:0, x34:0) -> f7(x32:0, x33:0, x34:0 + 1) :|: x34:0 <= x32:0 && x33:0 > x32:0
6.92/2.52	f7(x28:0, x29:0, x30:0) -> f7(x28:0 + 1, x29:0, x30:0) :|: x30:0 > x28:0 && x29:0 > x28:0 + 1
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(10)
6.92/2.52	Obligation:
6.92/2.52	Rules:
6.92/2.52	f7(x32:0, x33:0, x34:0) -> f7(x32:0, x33:0, x34:0 + 1) :|: x34:0 <= x32:0 && x33:0 > x32:0
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(11) PolynomialOrderProcessor (EQUIVALENT)
6.92/2.52	Found the following polynomial interpretation:
6.92/2.52	[f7(x, x1, x2)] = x - x2
6.92/2.52	
6.92/2.52	The following rules are decreasing:
6.92/2.52	f7(x32:0, x33:0, x34:0) -> f7(x32:0, x33:0, x34:0 + 1) :|: x34:0 <= x32:0 && x33:0 > x32:0
6.92/2.52	The following rules are bounded:
6.92/2.52	f7(x32:0, x33:0, x34:0) -> f7(x32:0, x33:0, x34:0 + 1) :|: x34:0 <= x32:0 && x33:0 > x32:0
6.92/2.52	
6.92/2.52	----------------------------------------
6.92/2.52	
6.92/2.52	(12)
6.92/2.52	YES
6.92/2.55	EOF