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, 134 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 20 ms]
(6) IRSwT
(7) TempFilterProof [SOUND, 63 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) -> f160_0_main_LE(arg1P, arg2P) :|: 1 = arg2P && 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1
f160_0_main_LE(x, x1) -> f160_0_main_LE(x2, x3) :|: x1 + 1 = x3 && x + 11 = x2 && 0 <= x1 - 1 && x <= 100
f160_0_main_LE(x4, x5) -> f160_0_main_LE(x6, x7) :|: x5 - 1 = x7 && x4 - 10 = x6 && 0 <= x5 - 1 && 100 <= x4 - 1
__init(x8, x9) -> f1_0_main_Load(x10, x11) :|: 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) -> f160_0_main_LE(arg1P, arg2P) :|: 1 = arg2P && 0 <= arg1 - 1 && -1 <= arg1P - 1 && -1 <= arg2 - 1
f160_0_main_LE(x, x1) -> f160_0_main_LE(x2, x3) :|: x1 + 1 = x3 && x + 11 = x2 && 0 <= x1 - 1 && x <= 100
f160_0_main_LE(x4, x5) -> f160_0_main_LE(x6, x7) :|: x5 - 1 = x7 && x4 - 10 = x6 && 0 <= x5 - 1 && 100 <= x4 - 1
__init(x8, x9) -> f1_0_main_Load(x10, x11) :|: 0 <= 0
Start term: __init(arg1, arg2)

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

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

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f160_0_main_LE(x, x1) -> f160_0_main_LE(x2, x3) :|: x1 + 1 = x3 && x + 11 = x2 && 0 <= x1 - 1 && x <= 100
(2) f160_0_main_LE(x4, x5) -> f160_0_main_LE(x6, x7) :|: x5 - 1 = x7 && x4 - 10 = x6 && 0 <= x5 - 1 && 100 <= x4 - 1

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f160_0_main_LE(x:0, x1:0) -> f160_0_main_LE(x:0 + 11, x1:0 + 1) :|: x:0 < 101 && x1:0 > 0
f160_0_main_LE(x4:0, x5:0) -> f160_0_main_LE(x4:0 - 10, x5:0 - 1) :|: x4:0 > 100 && x5:0 > 0

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

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

(8)
Obligation:
Rules:
f160_0_main_LE(x:0, x1:0) -> f160_0_main_LE(c, c1) :|: c1 = x1:0 + 1 && c = x:0 + 11 && (x:0 < 101 && x1:0 > 0)
f160_0_main_LE(x4:0, x5:0) -> f160_0_main_LE(c2, c3) :|: c3 = x5:0 - 1 && c2 = x4:0 - 10 && (x4:0 > 100 && x5:0 > 0)

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

(9) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f160_0_main_LE(x, x1)] = 90 - x + 10*x1

The following rules are decreasing:
f160_0_main_LE(x:0, x1:0) -> f160_0_main_LE(c, c1) :|: c1 = x1:0 + 1 && c = x:0 + 11 && (x:0 < 101 && x1:0 > 0)
The following rules are bounded:
f160_0_main_LE(x:0, x1:0) -> f160_0_main_LE(c, c1) :|: c1 = x1:0 + 1 && c = x:0 + 11 && (x:0 < 101 && x1:0 > 0)

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

(10)
Obligation:
Rules:
f160_0_main_LE(x4:0, x5:0) -> f160_0_main_LE(c2, c3) :|: c3 = x5:0 - 1 && c2 = x4:0 - 10 && (x4:0 > 100 && x5:0 > 0)

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f160_0_main_LE ] = f160_0_main_LE_2

The following rules are decreasing:
f160_0_main_LE(x4:0, x5:0) -> f160_0_main_LE(c2, c3) :|: c3 = x5:0 - 1 && c2 = x4:0 - 10 && (x4:0 > 100 && x5:0 > 0)

The following rules are bounded:
f160_0_main_LE(x4:0, x5:0) -> f160_0_main_LE(c2, c3) :|: c3 = x5:0 - 1 && c2 = x4:0 - 10 && (x4:0 > 100 && x5:0 > 0)


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

(12)
YES