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


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

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

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_Load(arg1, arg2) -> f1_0_main_Load'(arg1P, arg2P) :|: -1 <= x2 - 1 && 0 <= arg2 - 1 && 0 <= arg1 - 1 && arg1 = arg1P && arg2 = arg2P
(2) f1_0_main_Load'(x, x1) -> f134_0_test_GT(x3, x4) :|: -1 <= x5 - 1 && 0 <= x1 - 1 && 0 <= x - 1 && x5 - 100 * x6 <= 99 && 0 <= x5 - 100 * x6 && x5 - 100 * x6 = x3 && x1 = x4
(3) f134_0_test_GT(x9, x10) -> f134_0_test_GT(x11, x12) :|: x10 = x12 && x9 - 1 = x11 && 0 <= x9 - 1 && x9 - 1 <= x9 - 1 && 0 <= x10 - 1
(4) __init(x13, x14) -> f1_0_main_Load(x15, x16) :|: 0 <= 0

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f134_0_test_GT(x9, x10) -> f134_0_test_GT(x11, x12) :|: x10 = x12 && x9 - 1 = x11 && 0 <= x9 - 1 && x9 - 1 <= x9 - 1 && 0 <= x10 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f134_0_test_GT(x9:0, x10:0) -> f134_0_test_GT(x9:0 - 1, x10:0) :|: x10:0 > 0 && x9:0 > 0

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

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

(8)
Obligation:
Rules:
f134_0_test_GT(x9:0, x10:0) -> f134_0_test_GT(c, x10:0) :|: c = x9:0 - 1 && (x10:0 > 0 && x9:0 > 0)

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

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

The following rules are decreasing:
f134_0_test_GT(x9:0, x10:0) -> f134_0_test_GT(c, x10:0) :|: c = x9:0 - 1 && (x10:0 > 0 && x9:0 > 0)
The following rules are bounded:
f134_0_test_GT(x9:0, x10:0) -> f134_0_test_GT(c, x10:0) :|: c = x9:0 - 1 && (x10:0 > 0 && x9:0 > 0)

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

(10)
YES