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