/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) TerminationGraphProcessor [SOUND, 52 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 30 ms]
(6) IntTRS
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IntTRS
(9) PolynomialOrderProcessor [EQUIVALENT, 7 ms]
(10) YES


----------------------------------------

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToIRSProof (EQUIVALENT)
Parsed C Integer Program as IRS.
----------------------------------------

(2)
Obligation:
Rules:
f1(x, y, z) -> f2(x_1, y, z) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
f6(x9, x10, x11) -> f7(arith, x10, x11) :|: TRUE && arith = x9 - 1
f7(x33, x34, x35) -> f8(x33, x36, x35) :|: TRUE && x36 = x34 - 1
f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x16 > x17
f8(x18, x19, x20) -> f5(x18, x19, x20) :|: TRUE
f5(x21, x22, x23) -> f9(x21, x22, x23) :|: x22 <= x23
f4(x24, x25, x26) -> f5(x24, x25, x26) :|: x24 = x25 && x24 > x26
f9(x27, x28, x29) -> f4(x27, x28, x29) :|: TRUE
f4(x30, x31, x32) -> f10(x30, x31, x32) :|: x30 <= x32
f4(x37, x38, x39) -> f10(x37, x38, x39) :|: x37 < x38
f4(x40, x41, x42) -> f10(x40, x41, x42) :|: x40 > x41
Start term: f1(x, y, z)

----------------------------------------

(3) TerminationGraphProcessor (SOUND)
Constructed the termination graph and obtained one non-trivial SCC.

----------------------------------------

(4)
Obligation:
Rules:
f4(x24, x25, x26) -> f5(x24, x25, x26) :|: x24 = x25 && x24 > x26
f9(x27, x28, x29) -> f4(x27, x28, x29) :|: TRUE
f5(x21, x22, x23) -> f9(x21, x22, x23) :|: x22 <= x23
f8(x18, x19, x20) -> f5(x18, x19, x20) :|: TRUE
f7(x33, x34, x35) -> f8(x33, x36, x35) :|: TRUE && x36 = x34 - 1
f6(x9, x10, x11) -> f7(arith, x10, x11) :|: TRUE && arith = x9 - 1
f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x16 > x17

----------------------------------------

(5) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(6)
Obligation:
Rules:
f5(x15:0, x16:0, x17:0) -> f5(x15:0 - 1, x16:0 - 1, x17:0) :|: x17:0 < x16:0

----------------------------------------

(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f5(x1, x2, x3) -> f5(x2, x3)

----------------------------------------

(8)
Obligation:
Rules:
f5(x16:0, x17:0) -> f5(x16:0 - 1, x17:0) :|: x17:0 < x16:0

----------------------------------------

(9) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f5(x, x1)] = x - x1

The following rules are decreasing:
f5(x16:0, x17:0) -> f5(x16:0 - 1, x17:0) :|: x17:0 < x16:0
The following rules are bounded:
f5(x16:0, x17:0) -> f5(x16:0 - 1, x17:0) :|: x17:0 < x16:0

----------------------------------------

(10)
YES