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, 150 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 36 ms]
(6) IRSwT
(7) TempFilterProof [SOUND, 57 ms]
(8) IntTRS
(9) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 0 ms]
(12) YES


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

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2) -> f152_0_gcd_LE(arg1P, arg2P) :|: 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1 && -1 <= arg2P - 1
f152_0_gcd_LE(x, x1) -> f219_0_mod_LT(x2, x3) :|: x1 = x3 && x = x2 && 0 <= x - 1 && 0 <= x1 - 1
f219_0_mod_LT(x4, x5) -> f219_0_mod_LT(x6, x7) :|: x5 = x7 && x4 - x5 = x6 && 0 <= x5 - 1 && 0 <= x4 - 1 && x5 <= x4
f219_0_mod_LT(x8, x9) -> f152_0_gcd_LE(x10, x11) :|: x8 = x11 && x9 = x10 && x8 <= x9 - 1
__init(x12, x13) -> f1_0_main_Load(x14, x15) :|: 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) -> f152_0_gcd_LE(arg1P, arg2P) :|: 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1 && -1 <= arg2P - 1
f152_0_gcd_LE(x, x1) -> f219_0_mod_LT(x2, x3) :|: x1 = x3 && x = x2 && 0 <= x - 1 && 0 <= x1 - 1
f219_0_mod_LT(x4, x5) -> f219_0_mod_LT(x6, x7) :|: x5 = x7 && x4 - x5 = x6 && 0 <= x5 - 1 && 0 <= x4 - 1 && x5 <= x4
f219_0_mod_LT(x8, x9) -> f152_0_gcd_LE(x10, x11) :|: x8 = x11 && x9 = x10 && x8 <= x9 - 1
__init(x12, x13) -> f1_0_main_Load(x14, x15) :|: 0 <= 0
Start term: __init(arg1, arg2)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_Load(arg1, arg2) -> f152_0_gcd_LE(arg1P, arg2P) :|: 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1 && -1 <= arg2P - 1
(2) f152_0_gcd_LE(x, x1) -> f219_0_mod_LT(x2, x3) :|: x1 = x3 && x = x2 && 0 <= x - 1 && 0 <= x1 - 1
(3) f219_0_mod_LT(x4, x5) -> f219_0_mod_LT(x6, x7) :|: x5 = x7 && x4 - x5 = x6 && 0 <= x5 - 1 && 0 <= x4 - 1 && x5 <= x4
(4) f219_0_mod_LT(x8, x9) -> f152_0_gcd_LE(x10, x11) :|: x8 = x11 && x9 = x10 && x8 <= x9 - 1
(5) __init(x12, x13) -> f1_0_main_Load(x14, x15) :|: 0 <= 0

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f152_0_gcd_LE(x, x1) -> f219_0_mod_LT(x2, x3) :|: x1 = x3 && x = x2 && 0 <= x - 1 && 0 <= x1 - 1
(2) f219_0_mod_LT(x8, x9) -> f152_0_gcd_LE(x10, x11) :|: x8 = x11 && x9 = x10 && x8 <= x9 - 1
(3) f219_0_mod_LT(x4, x5) -> f219_0_mod_LT(x6, x7) :|: x5 = x7 && x4 - x5 = x6 && 0 <= x5 - 1 && 0 <= x4 - 1 && x5 <= x4

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f219_0_mod_LT(x4:0, x5:0) -> f219_0_mod_LT(x4:0 - x5:0, x5:0) :|: x4:0 > 0 && x5:0 > 0 && x5:0 <= x4:0
f219_0_mod_LT(x11:0, x10:0) -> f219_0_mod_LT(x10:0, x11:0) :|: x11:0 > 0 && x10:0 > 0 && x11:0 <= x10:0 - 1

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

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

(8)
Obligation:
Rules:
f219_0_mod_LT(x4:0, x5:0) -> f219_0_mod_LT(c, x5:0) :|: c = x4:0 - x5:0 && (x4:0 > 0 && x5:0 > 0 && x5:0 <= x4:0)
f219_0_mod_LT(x11:0, x10:0) -> f219_0_mod_LT(x10:0, x11:0) :|: x11:0 > 0 && x10:0 > 0 && x11:0 <= x10:0 - 1

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

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

The following rules are decreasing:
f219_0_mod_LT(x11:0, x10:0) -> f219_0_mod_LT(x10:0, x11:0) :|: x11:0 > 0 && x10:0 > 0 && x11:0 <= x10:0 - 1
The following rules are bounded:
f219_0_mod_LT(x11:0, x10:0) -> f219_0_mod_LT(x10:0, x11:0) :|: x11:0 > 0 && x10:0 > 0 && x11:0 <= x10:0 - 1

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

(10)
Obligation:
Rules:
f219_0_mod_LT(x4:0, x5:0) -> f219_0_mod_LT(c, x5:0) :|: c = x4:0 - x5:0 && (x4:0 > 0 && x5:0 > 0 && x5:0 <= x4:0)

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f219_0_mod_LT ] = f219_0_mod_LT_1

The following rules are decreasing:
f219_0_mod_LT(x4:0, x5:0) -> f219_0_mod_LT(c, x5:0) :|: c = x4:0 - x5:0 && (x4:0 > 0 && x5:0 > 0 && x5:0 <= x4:0)

The following rules are bounded:
f219_0_mod_LT(x4:0, x5:0) -> f219_0_mod_LT(c, x5:0) :|: c = x4:0 - x5:0 && (x4:0 > 0 && x5:0 > 0 && x5:0 <= x4:0)


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

(12)
YES