4.71/2.05	YES
4.71/2.06	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
4.71/2.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.71/2.06	
4.71/2.06	
4.71/2.06	Termination of the given C Problem could be proven:
4.71/2.06	
4.71/2.06	(0) C Problem
4.71/2.06	(1) CToIRSProof [EQUIVALENT, 0 ms]
4.71/2.06	(2) IntTRS
4.71/2.06	(3) TerminationGraphProcessor [SOUND, 53 ms]
4.71/2.06	(4) IntTRS
4.71/2.06	(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
4.71/2.06	(6) IntTRS
4.71/2.06	(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 2 ms]
4.71/2.06	(8) IntTRS
4.71/2.06	(9) RankingReductionPairProof [EQUIVALENT, 18 ms]
4.71/2.06	(10) YES
4.71/2.06	
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(0)
4.71/2.06	Obligation:
4.71/2.06	c file /export/starexec/sandbox/benchmark/theBenchmark.c
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(1) CToIRSProof (EQUIVALENT)
4.71/2.06	Parsed C Integer Program as IRS.
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(2)
4.71/2.06	Obligation:
4.71/2.06	Rules:
4.71/2.06	f1(x, oldx) -> f2(x_1, oldx) :|: TRUE
4.71/2.06	f3(x1, x2) -> f4(x1, x1) :|: TRUE
4.71/2.06	f4(x3, x4) -> f5(x5, x4) :|: TRUE
4.71/2.06	f2(x6, x7) -> f3(x6, x7) :|: x6 > 0 && x6 < 100 && x6 >= 2 * x7 + 10
4.71/2.06	f5(x8, x9) -> f2(x8, x9) :|: TRUE
4.71/2.06	f2(x10, x11) -> f6(x10, x11) :|: x10 < 2 * x11 + 10
4.71/2.06	f2(x12, x13) -> f6(x12, x13) :|: x12 <= 0
4.71/2.06	f2(x14, x15) -> f6(x14, x15) :|: x14 >= 100
4.71/2.06	Start term: f1(x, oldx)
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(3) TerminationGraphProcessor (SOUND)
4.71/2.06	Constructed the termination graph and obtained one non-trivial SCC.
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(4)
4.71/2.06	Obligation:
4.71/2.06	Rules:
4.71/2.06	f2(x6, x7) -> f3(x6, x7) :|: x6 > 0 && x6 < 100 && x6 >= 2 * x7 + 10
4.71/2.06	f5(x8, x9) -> f2(x8, x9) :|: TRUE
4.71/2.06	f4(x3, x4) -> f5(x5, x4) :|: TRUE
4.71/2.06	f3(x1, x2) -> f4(x1, x1) :|: TRUE
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(5) IntTRSCompressionProof (EQUIVALENT)
4.71/2.06	Compressed rules.
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(6)
4.71/2.06	Obligation:
4.71/2.06	Rules:
4.71/2.06	f4(x3:0, x4:0) -> f4(x5:0, x5:0) :|: x5:0 > 0 && x5:0 < 100 && x5:0 >= 2 * x4:0 + 10
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
4.71/2.06	Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:
4.71/2.06	
4.71/2.06	   f4(x1, x2) -> f4(x2)
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(8)
4.71/2.06	Obligation:
4.71/2.06	Rules:
4.71/2.06	f4(x4:0) -> f4(x5:0) :|: x5:0 > 0 && x5:0 < 100 && x5:0 >= 2 * x4:0 + 10
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(9) RankingReductionPairProof (EQUIVALENT)
4.71/2.06	Interpretation:
4.71/2.06	[ f4 ] = -2/11*f4_1
4.71/2.06	
4.71/2.06	The following rules are decreasing:
4.71/2.06	f4(x4:0) -> f4(x5:0) :|: x5:0 > 0 && x5:0 < 100 && x5:0 >= 2 * x4:0 + 10
4.71/2.06	
4.71/2.06	The following rules are bounded:
4.71/2.06	f4(x4:0) -> f4(x5:0) :|: x5:0 > 0 && x5:0 < 100 && x5:0 >= 2 * x4:0 + 10
4.71/2.06	
4.71/2.06	
4.71/2.06	----------------------------------------
4.71/2.06	
4.71/2.06	(10)
4.71/2.06	YES
5.12/2.10	EOF