5.80/2.22	YES
5.80/2.23	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
5.80/2.23	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.80/2.23	
5.80/2.23	
5.80/2.23	Termination of the given C Problem could be proven:
5.80/2.23	
5.80/2.23	(0) C Problem
5.80/2.23	(1) CToIRSProof [EQUIVALENT, 0 ms]
5.80/2.23	(2) IntTRS
5.80/2.23	(3) TerminationGraphProcessor [SOUND, 47 ms]
5.80/2.23	(4) IntTRS
5.80/2.23	(5) IntTRSCompressionProof [EQUIVALENT, 33 ms]
5.80/2.23	(6) IntTRS
5.80/2.23	(7) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
5.80/2.23	(8) IntTRS
5.80/2.23	(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
5.80/2.23	(10) IntTRS
5.80/2.23	(11) RankingReductionPairProof [EQUIVALENT, 0 ms]
5.80/2.23	(12) YES
5.80/2.23	
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(0)
5.80/2.23	Obligation:
5.80/2.23	c file /export/starexec/sandbox/benchmark/theBenchmark.c
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(1) CToIRSProof (EQUIVALENT)
5.80/2.23	Parsed C Integer Program as IRS.
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(2)
5.80/2.23	Obligation:
5.80/2.23	Rules:
5.80/2.23	f1(x, y, z) -> f2(x_1, y, z) :|: TRUE
5.80/2.23	f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
5.80/2.23	f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
5.80/2.23	f6(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 + 1
5.80/2.23	f7(x36, x37, x38) -> f10(x36, x37, x39) :|: TRUE && x39 = x38 + 1
5.80/2.23	f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x15 < x17
5.80/2.23	f5(x18, x19, x20) -> f7(x18, x19, x20) :|: x18 >= x20
5.80/2.23	f9(x21, x22, x23) -> f8(x21, x22, x23) :|: TRUE
5.80/2.23	f10(x24, x25, x26) -> f8(x24, x25, x26) :|: TRUE
5.80/2.23	f4(x27, x28, x29) -> f5(x27, x28, x29) :|: x27 < x28
5.80/2.23	f8(x30, x31, x32) -> f4(x30, x31, x32) :|: TRUE
5.80/2.23	f4(x33, x34, x35) -> f11(x33, x34, x35) :|: x33 >= x34
5.80/2.23	Start term: f1(x, y, z)
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(3) TerminationGraphProcessor (SOUND)
5.80/2.23	Constructed the termination graph and obtained one non-trivial SCC.
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(4)
5.80/2.23	Obligation:
5.80/2.23	Rules:
5.80/2.23	f4(x27, x28, x29) -> f5(x27, x28, x29) :|: x27 < x28
5.80/2.23	f8(x30, x31, x32) -> f4(x30, x31, x32) :|: TRUE
5.80/2.23	f9(x21, x22, x23) -> f8(x21, x22, x23) :|: TRUE
5.80/2.23	f6(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 + 1
5.80/2.23	f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x15 < x17
5.80/2.23	f10(x24, x25, x26) -> f8(x24, x25, x26) :|: TRUE
5.80/2.23	f7(x36, x37, x38) -> f10(x36, x37, x39) :|: TRUE && x39 = x38 + 1
5.80/2.23	f5(x18, x19, x20) -> f7(x18, x19, x20) :|: x18 >= x20
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(5) IntTRSCompressionProof (EQUIVALENT)
5.80/2.23	Compressed rules.
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(6)
5.80/2.23	Obligation:
5.80/2.23	Rules:
5.80/2.23	f8(x30:0, x31:0, x32:0) -> f8(x30:0 + 1, x31:0, x32:0) :|: x31:0 > x30:0 && x32:0 > x30:0
5.80/2.23	f8(x, x1, x2) -> f8(x, x1, x2 + 1) :|: x1 > x && x2 <= x
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(7) PolynomialOrderProcessor (EQUIVALENT)
5.80/2.23	Found the following polynomial interpretation:
5.80/2.23	[f8(x, x1, x2)] = -x + x1
5.80/2.23	
5.80/2.23	The following rules are decreasing:
5.80/2.23	f8(x30:0, x31:0, x32:0) -> f8(x30:0 + 1, x31:0, x32:0) :|: x31:0 > x30:0 && x32:0 > x30:0
5.80/2.23	The following rules are bounded:
5.80/2.23	f8(x30:0, x31:0, x32:0) -> f8(x30:0 + 1, x31:0, x32:0) :|: x31:0 > x30:0 && x32:0 > x30:0
5.80/2.23	f8(x, x1, x2) -> f8(x, x1, x2 + 1) :|: x1 > x && x2 <= x
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(8)
5.80/2.23	Obligation:
5.80/2.23	Rules:
5.80/2.23	f8(x, x1, x2) -> f8(x, x1, x2 + 1) :|: x1 > x && x2 <= x
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(9) IntTRSCompressionProof (EQUIVALENT)
5.80/2.23	Compressed rules.
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(10)
5.80/2.23	Obligation:
5.80/2.23	Rules:
5.80/2.23	f8(x:0, x1:0, x2:0) -> f8(x:0, x1:0, x2:0 + 1) :|: x:0 < x1:0 && x:0 >= x2:0
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(11) RankingReductionPairProof (EQUIVALENT)
5.80/2.23	Interpretation:
5.80/2.23	[ f8 ] = f8_1 + -1*f8_3
5.80/2.23	
5.80/2.23	The following rules are decreasing:
5.80/2.23	f8(x:0, x1:0, x2:0) -> f8(x:0, x1:0, x2:0 + 1) :|: x:0 < x1:0 && x:0 >= x2:0
5.80/2.23	
5.80/2.23	The following rules are bounded:
5.80/2.23	f8(x:0, x1:0, x2:0) -> f8(x:0, x1:0, x2:0 + 1) :|: x:0 < x1:0 && x:0 >= x2:0
5.80/2.23	
5.80/2.23	
5.80/2.23	----------------------------------------
5.80/2.23	
5.80/2.23	(12)
5.80/2.23	YES
5.80/2.26	EOF