4.70/2.02	YES
4.70/2.03	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
4.70/2.03	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.70/2.03	
4.70/2.03	
4.70/2.03	Termination of the given C Problem could be proven:
4.70/2.03	
4.70/2.03	(0) C Problem
4.70/2.03	(1) CToIRSProof [EQUIVALENT, 0 ms]
4.70/2.03	(2) IntTRS
4.70/2.03	(3) TerminationGraphProcessor [SOUND, 55 ms]
4.70/2.03	(4) IntTRS
4.70/2.03	(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
4.70/2.03	(6) IntTRS
4.70/2.03	(7) PolynomialOrderProcessor [EQUIVALENT, 12 ms]
4.70/2.03	(8) YES
4.70/2.03	
4.70/2.03	
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(0)
4.70/2.03	Obligation:
4.70/2.03	c file /export/starexec/sandbox/benchmark/theBenchmark.c
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(1) CToIRSProof (EQUIVALENT)
4.70/2.03	Parsed C Integer Program as IRS.
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(2)
4.70/2.03	Obligation:
4.70/2.03	Rules:
4.70/2.03	f1(x, y) -> f2(x_1, y) :|: TRUE
4.70/2.03	f2(x1, x2) -> f3(x1, x3) :|: TRUE
4.70/2.03	f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x5 - x4
4.70/2.03	f5(x14, x15) -> f6(x14, x16) :|: TRUE && x16 = x15 + 1
4.70/2.03	f3(x8, x9) -> f4(x8, x9) :|: x8 - x9 > 0
4.70/2.03	f6(x10, x11) -> f3(x10, x11) :|: TRUE
4.70/2.03	f3(x12, x13) -> f7(x12, x13) :|: x12 - x13 <= 0
4.70/2.03	Start term: f1(x, y)
4.70/2.03	
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(3) TerminationGraphProcessor (SOUND)
4.70/2.03	Constructed the termination graph and obtained one non-trivial SCC.
4.70/2.03	
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(4)
4.70/2.03	Obligation:
4.70/2.03	Rules:
4.70/2.03	f3(x8, x9) -> f4(x8, x9) :|: x8 - x9 > 0
4.70/2.03	f6(x10, x11) -> f3(x10, x11) :|: TRUE
4.70/2.03	f5(x14, x15) -> f6(x14, x16) :|: TRUE && x16 = x15 + 1
4.70/2.03	f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x5 - x4
4.70/2.03	
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(5) IntTRSCompressionProof (EQUIVALENT)
4.70/2.03	Compressed rules.
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(6)
4.70/2.03	Obligation:
4.70/2.03	Rules:
4.70/2.03	f5(x14:0, x15:0) -> f5(x15:0 + 1 - x14:0, x15:0 + 1) :|: x14:0 - (x15:0 + 1) > 0
4.70/2.03	
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(7) PolynomialOrderProcessor (EQUIVALENT)
4.70/2.03	Found the following polynomial interpretation:
4.70/2.03	[f5(x, x1)] = -4 + 2*x - 2*x1 + x1^2
4.70/2.03	
4.70/2.03	The following rules are decreasing:
4.70/2.03	f5(x14:0, x15:0) -> f5(x15:0 + 1 - x14:0, x15:0 + 1) :|: x14:0 - (x15:0 + 1) > 0
4.70/2.03	The following rules are bounded:
4.70/2.03	f5(x14:0, x15:0) -> f5(x15:0 + 1 - x14:0, x15:0 + 1) :|: x14:0 - (x15:0 + 1) > 0
4.70/2.03	
4.70/2.03	----------------------------------------
4.70/2.03	
4.70/2.03	(8)
4.70/2.03	YES
4.70/2.07	EOF