4.75/2.01	YES
4.83/2.03	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
4.83/2.03	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.83/2.03	
4.83/2.03	
4.83/2.03	Termination of the given C Problem could be proven:
4.83/2.03	
4.83/2.03	(0) C Problem
4.83/2.03	(1) CToIRSProof [EQUIVALENT, 0 ms]
4.83/2.03	(2) IntTRS
4.83/2.03	(3) TerminationGraphProcessor [SOUND, 44 ms]
4.83/2.03	(4) IntTRS
4.83/2.03	(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
4.83/2.03	(6) IntTRS
4.83/2.03	(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
4.83/2.03	(8) IntTRS
4.83/2.03	(9) PolynomialOrderProcessor [EQUIVALENT, 1 ms]
4.83/2.03	(10) YES
4.83/2.03	
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(0)
4.83/2.03	Obligation:
4.83/2.03	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(1) CToIRSProof (EQUIVALENT)
4.83/2.03	Parsed C Integer Program as IRS.
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(2)
4.83/2.03	Obligation:
4.83/2.03	Rules:
4.83/2.03	f1(c, x, y, z) -> f2(c, x_1, y, z) :|: TRUE
4.83/2.03	f2(x1, x2, x3, x4) -> f3(x1, x2, x5, x4) :|: TRUE
4.83/2.03	f3(x6, x7, x8, x9) -> f4(x6, x7, x8, x10) :|: TRUE
4.83/2.03	f4(x11, x12, x13, x14) -> f5(0, x12, x13, x14) :|: TRUE
4.83/2.03	f6(x15, x16, x17, x18) -> f7(x15, x16, arith, x18) :|: TRUE && arith = x17 + 1
4.83/2.03	f7(x39, x40, x41, x42) -> f8(x39, x40, x41, x43) :|: TRUE && x43 = x42 + 1
4.83/2.03	f8(x44, x45, x46, x47) -> f9(x48, x45, x46, x47) :|: TRUE && x48 = x44 + 1
4.83/2.03	f5(x27, x28, x29, x30) -> f6(x27, x28, x29, x30) :|: x28 > x29 && x28 > x30
4.83/2.03	f9(x31, x32, x33, x34) -> f5(x31, x32, x33, x34) :|: TRUE
4.83/2.03	f5(x35, x36, x37, x38) -> f10(x35, x36, x37, x38) :|: x36 <= x37
4.83/2.03	f5(x49, x50, x51, x52) -> f10(x49, x50, x51, x52) :|: x50 <= x52
4.83/2.03	Start term: f1(c, x, y, z)
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(3) TerminationGraphProcessor (SOUND)
4.83/2.03	Constructed the termination graph and obtained one non-trivial SCC.
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(4)
4.83/2.03	Obligation:
4.83/2.03	Rules:
4.83/2.03	f5(x27, x28, x29, x30) -> f6(x27, x28, x29, x30) :|: x28 > x29 && x28 > x30
4.83/2.03	f9(x31, x32, x33, x34) -> f5(x31, x32, x33, x34) :|: TRUE
4.83/2.03	f8(x44, x45, x46, x47) -> f9(x48, x45, x46, x47) :|: TRUE && x48 = x44 + 1
4.83/2.03	f7(x39, x40, x41, x42) -> f8(x39, x40, x41, x43) :|: TRUE && x43 = x42 + 1
4.83/2.03	f6(x15, x16, x17, x18) -> f7(x15, x16, arith, x18) :|: TRUE && arith = x17 + 1
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(5) IntTRSCompressionProof (EQUIVALENT)
4.83/2.03	Compressed rules.
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(6)
4.83/2.03	Obligation:
4.83/2.03	Rules:
4.83/2.03	f7(x39:0, x40:0, x41:0, x42:0) -> f7(x39:0 + 1, x40:0, x41:0 + 1, x42:0 + 1) :|: x41:0 < x40:0 && x42:0 + 1 < x40:0
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
4.83/2.03	Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:
4.83/2.03	
4.83/2.03	   f7(x1, x2, x3, x4) -> f7(x2, x3, x4)
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(8)
4.83/2.03	Obligation:
4.83/2.03	Rules:
4.83/2.03	f7(x40:0, x41:0, x42:0) -> f7(x40:0, x41:0 + 1, x42:0 + 1) :|: x41:0 < x40:0 && x42:0 + 1 < x40:0
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(9) PolynomialOrderProcessor (EQUIVALENT)
4.83/2.03	Found the following polynomial interpretation:
4.83/2.03	[f7(x, x1, x2)] = x - x2
4.83/2.03	
4.83/2.03	The following rules are decreasing:
4.83/2.03	f7(x40:0, x41:0, x42:0) -> f7(x40:0, x41:0 + 1, x42:0 + 1) :|: x41:0 < x40:0 && x42:0 + 1 < x40:0
4.83/2.03	The following rules are bounded:
4.83/2.03	f7(x40:0, x41:0, x42:0) -> f7(x40:0, x41:0 + 1, x42:0 + 1) :|: x41:0 < x40:0 && x42:0 + 1 < x40:0
4.83/2.03	
4.83/2.03	----------------------------------------
4.83/2.03	
4.83/2.03	(10)
4.83/2.03	YES
4.83/2.06	EOF