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, 72 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 17 ms]
(6) IRSwT
(7) TempFilterProof [SOUND, 15 ms]
(8) IntTRS
(9) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(10) YES


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

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2) -> f217_0_quot_LE(arg1P, arg2P) :|: 0 <= arg2P - 1 && 1 <= arg2 - 1 && -1 <= x2 - 1 && 0 <= arg1 - 1 && x2 + 1 = arg1P
f217_0_quot_LE(x, x1) -> f217_0_quot_LE(x3, x4) :|: x1 - 1 - (x - 1) = x4 && x = x3 && 0 <= x - 1 && 0 <= x1 - 1
__init(x5, x6) -> f1_0_main_Load(x7, x8) :|: 0 <= 0
Start term: __init(arg1, arg2)

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

(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) -> f217_0_quot_LE(arg1P, arg2P) :|: 0 <= arg2P - 1 && 1 <= arg2 - 1 && -1 <= x2 - 1 && 0 <= arg1 - 1 && x2 + 1 = arg1P
f217_0_quot_LE(x, x1) -> f217_0_quot_LE(x3, x4) :|: x1 - 1 - (x - 1) = x4 && x = x3 && 0 <= x - 1 && 0 <= x1 - 1
__init(x5, x6) -> f1_0_main_Load(x7, x8) :|: 0 <= 0
Start term: __init(arg1, arg2)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_Load(arg1, arg2) -> f217_0_quot_LE(arg1P, arg2P) :|: 0 <= arg2P - 1 && 1 <= arg2 - 1 && -1 <= x2 - 1 && 0 <= arg1 - 1 && x2 + 1 = arg1P
(2) f217_0_quot_LE(x, x1) -> f217_0_quot_LE(x3, x4) :|: x1 - 1 - (x - 1) = x4 && x = x3 && 0 <= x - 1 && 0 <= x1 - 1
(3) __init(x5, x6) -> f1_0_main_Load(x7, x8) :|: 0 <= 0

Arcs:
(1) -> (2)
(2) -> (2)
(3) -> (1)

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f217_0_quot_LE(x, x1) -> f217_0_quot_LE(x3, x4) :|: x1 - 1 - (x - 1) = x4 && x = x3 && 0 <= x - 1 && 0 <= x1 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f217_0_quot_LE(x3:0, x1:0) -> f217_0_quot_LE(x3:0, x1:0 - 1 - (x3:0 - 1)) :|: x1:0 > 0 && x3:0 > 0

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

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

(8)
Obligation:
Rules:
f217_0_quot_LE(x3:0, x1:0) -> f217_0_quot_LE(x3:0, c) :|: c = x1:0 - 1 - (x3:0 - 1) && (x1:0 > 0 && x3:0 > 0)

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

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

The following rules are decreasing:
f217_0_quot_LE(x3:0, x1:0) -> f217_0_quot_LE(x3:0, c) :|: c = x1:0 - 1 - (x3:0 - 1) && (x1:0 > 0 && x3:0 > 0)
The following rules are bounded:
f217_0_quot_LE(x3:0, x1:0) -> f217_0_quot_LE(x3:0, c) :|: c = x1:0 - 1 - (x3:0 - 1) && (x1:0 > 0 && x3:0 > 0)

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

(10)
YES