YES
proof of prog.inttrs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given IRSwT could be proven:

(0) IRSwT
(1) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(2) IRSwT
(3) IRSwTTerminationDigraphProof [EQUIVALENT, 149 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 29 ms]
(6) IRSwT
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) TempFilterProof [SOUND, 16 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(12) YES


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

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3) -> f203_0_main_NE(arg1P, arg2P, arg3P) :|: 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1 && -1 <= arg2P - 1
f203_0_main_NE(x, x1, x2) -> f239_0_main_LE(x3, x4, x5) :|: x = x5 && x = x4 && x = x3 && x = x1 && 0 <= x - 1
f239_0_main_LE(x6, x7, x8) -> f203_0_main_NE(x9, x10, x11) :|: 0 = x10 && x6 = x9 && 0 = x8 && 0 = x7
f239_0_main_LE(x12, x13, x14) -> f239_0_main_LE(x15, x16, x17) :|: x13 - 1 = x17 && x13 - 1 = x16 && x12 - 1 = x15 && x13 = x14 && 0 <= x13 - 1
__init(x18, x19, x20) -> f1_0_main_Load(x21, x22, x23) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3)

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

(1) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(2)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3) -> f203_0_main_NE(arg1P, arg2P, arg3P) :|: 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1 && -1 <= arg2P - 1
f203_0_main_NE(x, x1, x2) -> f239_0_main_LE(x3, x4, x5) :|: x = x5 && x = x4 && x = x3 && x = x1 && 0 <= x - 1
f239_0_main_LE(x6, x7, x8) -> f203_0_main_NE(x9, x10, x11) :|: 0 = x10 && x6 = x9 && 0 = x8 && 0 = x7
f239_0_main_LE(x12, x13, x14) -> f239_0_main_LE(x15, x16, x17) :|: x13 - 1 = x17 && x13 - 1 = x16 && x12 - 1 = x15 && x13 = x14 && 0 <= x13 - 1
__init(x18, x19, x20) -> f1_0_main_Load(x21, x22, x23) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_Load(arg1, arg2, arg3) -> f203_0_main_NE(arg1P, arg2P, arg3P) :|: 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1 && -1 <= arg2P - 1
(2) f203_0_main_NE(x, x1, x2) -> f239_0_main_LE(x3, x4, x5) :|: x = x5 && x = x4 && x = x3 && x = x1 && 0 <= x - 1
(3) f239_0_main_LE(x6, x7, x8) -> f203_0_main_NE(x9, x10, x11) :|: 0 = x10 && x6 = x9 && 0 = x8 && 0 = x7
(4) f239_0_main_LE(x12, x13, x14) -> f239_0_main_LE(x15, x16, x17) :|: x13 - 1 = x17 && x13 - 1 = x16 && x12 - 1 = x15 && x13 = x14 && 0 <= x13 - 1
(5) __init(x18, x19, x20) -> f1_0_main_Load(x21, x22, x23) :|: 0 <= 0

Arcs:
(1) -> (2)
(2) -> (4)
(4) -> (3), (4)
(5) -> (1)

This digraph is fully evaluated!
----------------------------------------

(4)
Obligation:

Termination digraph:
Nodes:
(1) f239_0_main_LE(x12, x13, x14) -> f239_0_main_LE(x15, x16, x17) :|: x13 - 1 = x17 && x13 - 1 = x16 && x12 - 1 = x15 && x13 = x14 && 0 <= x13 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f239_0_main_LE(x12:0, x13:0, x13:0) -> f239_0_main_LE(x12:0 - 1, x13:0 - 1, x13:0 - 1) :|: x13:0 > 0

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

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

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

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

(8)
Obligation:
Rules:
f239_0_main_LE(x13:0, x13:0) -> f239_0_main_LE(x13:0 - 1, x13:0 - 1) :|: x13:0 > 0

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

(9) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f239_0_main_LE(INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(10)
Obligation:
Rules:
f239_0_main_LE(x13:0, x13:0) -> f239_0_main_LE(c, c1) :|: c1 = x13:0 - 1 && c = x13:0 - 1 && x13:0 > 0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f239_0_main_LE(x, x1)] = x1

The following rules are decreasing:
f239_0_main_LE(x13:0, x13:0) -> f239_0_main_LE(c, c1) :|: c1 = x13:0 - 1 && c = x13:0 - 1 && x13:0 > 0
The following rules are bounded:
f239_0_main_LE(x13:0, x13:0) -> f239_0_main_LE(c, c1) :|: c1 = x13:0 - 1 && c = x13:0 - 1 && x13:0 > 0

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

(12)
YES