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