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


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

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3) -> f259_0_div_LT(arg1P, arg2P, arg3P) :|: 0 = arg1P && 0 <= arg1 - 1 && -1 <= arg2P - 1 && -1 <= arg2 - 1 && -1 <= arg3P - 1
f259_0_div_LT(x, x1, x2) -> f259_0_div_LT(x3, x4, x5) :|: x2 = x5 && x1 - x2 = x4 && x + 1 = x3 && -1 <= x - 1 && x2 <= x1 && 0 <= x2 - 1 && -1 <= x1 - 1
__init(x6, x7, x8) -> f1_0_main_Load(x9, x10, x11) :|: 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) -> f259_0_div_LT(arg1P, arg2P, arg3P) :|: 0 = arg1P && 0 <= arg1 - 1 && -1 <= arg2P - 1 && -1 <= arg2 - 1 && -1 <= arg3P - 1
f259_0_div_LT(x, x1, x2) -> f259_0_div_LT(x3, x4, x5) :|: x2 = x5 && x1 - x2 = x4 && x + 1 = x3 && -1 <= x - 1 && x2 <= x1 && 0 <= x2 - 1 && -1 <= x1 - 1
__init(x6, x7, x8) -> f1_0_main_Load(x9, x10, x11) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3)

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

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

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f259_0_div_LT(x, x1, x2) -> f259_0_div_LT(x3, x4, x5) :|: x2 = x5 && x1 - x2 = x4 && x + 1 = x3 && -1 <= x - 1 && x2 <= x1 && 0 <= x2 - 1 && -1 <= x1 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f259_0_div_LT(x:0, x1:0, x2:0) -> f259_0_div_LT(x:0 + 1, x1:0 - x2:0, x2:0) :|: x2:0 > 0 && x1:0 > -1 && x:0 > -1 && x2:0 <= x1:0

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

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

(8)
Obligation:
Rules:
f259_0_div_LT(x:0, x1:0, x2:0) -> f259_0_div_LT(c, c1, x2:0) :|: c1 = x1:0 - x2:0 && c = x:0 + 1 && (x2:0 > 0 && x1:0 > -1 && x:0 > -1 && x2:0 <= x1:0)

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

(9) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f259_0_div_LT ] = f259_0_div_LT_2

The following rules are decreasing:
f259_0_div_LT(x:0, x1:0, x2:0) -> f259_0_div_LT(c, c1, x2:0) :|: c1 = x1:0 - x2:0 && c = x:0 + 1 && (x2:0 > 0 && x1:0 > -1 && x:0 > -1 && x2:0 <= x1:0)

The following rules are bounded:
f259_0_div_LT(x:0, x1:0, x2:0) -> f259_0_div_LT(c, c1, x2:0) :|: c1 = x1:0 - x2:0 && c = x:0 + 1 && (x2:0 > 0 && x1:0 > -1 && x:0 > -1 && x2:0 <= x1:0)


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

(10)
YES