4.78/2.08	YES
4.78/2.09	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
4.78/2.09	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.78/2.09	
4.78/2.09	
4.78/2.09	Termination of the given C Problem could be proven:
4.78/2.09	
4.78/2.09	(0) C Problem
4.78/2.09	(1) CToIRSProof [EQUIVALENT, 0 ms]
4.78/2.09	(2) IntTRS
4.78/2.09	(3) TerminationGraphProcessor [SOUND, 58 ms]
4.78/2.09	(4) IntTRS
4.78/2.09	(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
4.78/2.09	(6) IntTRS
4.78/2.09	(7) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
4.78/2.09	(8) YES
4.78/2.09	
4.78/2.09	
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(0)
4.78/2.09	Obligation:
4.78/2.09	c file /export/starexec/sandbox/benchmark/theBenchmark.c
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(1) CToIRSProof (EQUIVALENT)
4.78/2.09	Parsed C Integer Program as IRS.
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(2)
4.78/2.09	Obligation:
4.78/2.09	Rules:
4.78/2.09	f1(x, y, z) -> f2(x_1, y, z) :|: TRUE
4.78/2.09	f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
4.78/2.09	f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
4.78/2.09	f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1
4.78/2.09	f6(x24, x25, x26) -> f7(x24, x25, x27) :|: TRUE && x27 = x26 + 1
4.78/2.09	f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > x16 && x15 > x17
4.78/2.09	f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE
4.78/2.09	f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 <= x22
4.78/2.09	f4(x28, x29, x30) -> f8(x28, x29, x30) :|: x28 <= x30
4.78/2.09	Start term: f1(x, y, z)
4.78/2.09	
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(3) TerminationGraphProcessor (SOUND)
4.78/2.09	Constructed the termination graph and obtained one non-trivial SCC.
4.78/2.09	
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(4)
4.78/2.09	Obligation:
4.78/2.09	Rules:
4.78/2.09	f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > x16 && x15 > x17
4.78/2.09	f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE
4.78/2.09	f6(x24, x25, x26) -> f7(x24, x25, x27) :|: TRUE && x27 = x26 + 1
4.78/2.09	f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1
4.78/2.09	
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(5) IntTRSCompressionProof (EQUIVALENT)
4.78/2.09	Compressed rules.
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(6)
4.78/2.09	Obligation:
4.78/2.09	Rules:
4.78/2.09	f6(x24:0, x25:0, x26:0) -> f6(x24:0, x25:0 + 1, x26:0 + 1) :|: x25:0 < x24:0 && x26:0 + 1 < x24:0
4.78/2.09	
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(7) PolynomialOrderProcessor (EQUIVALENT)
4.78/2.09	Found the following polynomial interpretation:
4.78/2.09	[f6(x, x1, x2)] = x - x2
4.78/2.09	
4.78/2.09	The following rules are decreasing:
4.78/2.09	f6(x24:0, x25:0, x26:0) -> f6(x24:0, x25:0 + 1, x26:0 + 1) :|: x25:0 < x24:0 && x26:0 + 1 < x24:0
4.78/2.09	The following rules are bounded:
4.78/2.09	f6(x24:0, x25:0, x26:0) -> f6(x24:0, x25:0 + 1, x26:0 + 1) :|: x25:0 < x24:0 && x26:0 + 1 < x24:0
4.78/2.09	
4.78/2.09	----------------------------------------
4.78/2.09	
4.78/2.09	(8)
4.78/2.09	YES
5.13/2.13	EOF