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