5.60/2.22	YES
5.60/2.24	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
5.60/2.24	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.60/2.24	
5.60/2.24	
5.60/2.24	Termination of the given C Problem could be proven:
5.60/2.24	
5.60/2.24	(0) C Problem
5.60/2.24	(1) CToIRSProof [EQUIVALENT, 0 ms]
5.60/2.24	(2) IntTRS
5.60/2.24	(3) TerminationGraphProcessor [SOUND, 65 ms]
5.60/2.24	(4) IntTRS
5.60/2.24	(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
5.60/2.24	(6) IntTRS
5.60/2.24	(7) PolynomialOrderProcessor [EQUIVALENT, 1 ms]
5.60/2.24	(8) IntTRS
5.60/2.24	(9) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
5.60/2.24	(10) YES
5.60/2.24	
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(0)
5.60/2.24	Obligation:
5.60/2.24	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(1) CToIRSProof (EQUIVALENT)
5.60/2.24	Parsed C Integer Program as IRS.
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(2)
5.60/2.24	Obligation:
5.60/2.24	Rules:
5.60/2.24	f1(c, n) -> f2(1, n) :|: TRUE
5.60/2.24	f2(x, x1) -> f3(x, x2) :|: TRUE
5.60/2.24	f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 10
5.60/2.24	f8(x25, x26) -> f9(x27, x26) :|: TRUE && x27 = x25 - 1
5.60/2.24	f6(x28, x29) -> f10(x28, x30) :|: TRUE && x30 = x29 + 11
5.60/2.24	f10(x31, x32) -> f11(x33, x32) :|: TRUE && x33 = x31 + 1
5.60/2.24	f4(x11, x12) -> f5(x11, x12) :|: x12 > 100
5.60/2.24	f4(x13, x14) -> f6(x13, x14) :|: x14 <= 100
5.60/2.24	f9(x15, x16) -> f7(x15, x16) :|: TRUE
5.60/2.24	f11(x17, x18) -> f7(x17, x18) :|: TRUE
5.60/2.24	f3(x19, x20) -> f4(x19, x20) :|: x19 > 0
5.60/2.24	f7(x21, x22) -> f3(x21, x22) :|: TRUE
5.60/2.24	f3(x23, x24) -> f12(x23, x24) :|: x23 <= 0
5.60/2.24	Start term: f1(c, n)
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(3) TerminationGraphProcessor (SOUND)
5.60/2.24	Constructed the termination graph and obtained one non-trivial SCC.
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(4)
5.60/2.24	Obligation:
5.60/2.24	Rules:
5.60/2.24	f3(x19, x20) -> f4(x19, x20) :|: x19 > 0
5.60/2.24	f7(x21, x22) -> f3(x21, x22) :|: TRUE
5.60/2.24	f9(x15, x16) -> f7(x15, x16) :|: TRUE
5.60/2.24	f8(x25, x26) -> f9(x27, x26) :|: TRUE && x27 = x25 - 1
5.60/2.24	f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 10
5.60/2.24	f4(x11, x12) -> f5(x11, x12) :|: x12 > 100
5.60/2.24	f11(x17, x18) -> f7(x17, x18) :|: TRUE
5.60/2.24	f10(x31, x32) -> f11(x33, x32) :|: TRUE && x33 = x31 + 1
5.60/2.24	f6(x28, x29) -> f10(x28, x30) :|: TRUE && x30 = x29 + 11
5.60/2.24	f4(x13, x14) -> f6(x13, x14) :|: x14 <= 100
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(5) IntTRSCompressionProof (EQUIVALENT)
5.60/2.24	Compressed rules.
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(6)
5.60/2.24	Obligation:
5.60/2.24	Rules:
5.60/2.24	f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100
5.60/2.24	f7(x, x1) -> f7(x + 1, x1 + 11) :|: x > 0 && x1 < 101
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(7) PolynomialOrderProcessor (EQUIVALENT)
5.60/2.24	Found the following polynomial interpretation:
5.60/2.24	[f7(x, x1)] = 90 + 10*x - x1
5.60/2.24	
5.60/2.24	The following rules are decreasing:
5.60/2.24	f7(x, x1) -> f7(x + 1, x1 + 11) :|: x > 0 && x1 < 101
5.60/2.24	The following rules are bounded:
5.60/2.24	f7(x, x1) -> f7(x + 1, x1 + 11) :|: x > 0 && x1 < 101
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(8)
5.60/2.24	Obligation:
5.60/2.24	Rules:
5.60/2.24	f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(9) PolynomialOrderProcessor (EQUIVALENT)
5.60/2.24	Found the following polynomial interpretation:
5.60/2.24	[f7(x, x1)] = -1 + x
5.60/2.24	
5.60/2.24	The following rules are decreasing:
5.60/2.24	f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100
5.60/2.24	The following rules are bounded:
5.60/2.24	f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100
5.60/2.24	
5.60/2.24	----------------------------------------
5.60/2.24	
5.60/2.24	(10)
5.60/2.24	YES
5.60/2.26	EOF