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, 77 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 39 ms]
(6) IRSwT
(7) FilterProof [EQUIVALENT, 0 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 22 ms]
(12) YES


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

(0)
Obligation:
Rules:
f1_0_main_New(arg1, arg2) -> f536_0_copy_InvokeMethod(arg1P, arg2P) :|: 4 <= arg1P - 1 && 0 <= arg2P - 1
f536_0_copy_InvokeMethod(x, x1) -> f536_0_copy_InvokeMethod(x2, x3) :|: -1 <= x3 - 1 && 0 <= x2 - 1 && 0 <= x1 - 1 && 2 <= x - 1 && x3 + 3 <= x && x2 + 2 <= x
__init(x4, x5) -> f1_0_main_New(x6, x7) :|: 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_New(arg1, arg2) -> f536_0_copy_InvokeMethod(arg1P, arg2P) :|: 4 <= arg1P - 1 && 0 <= arg2P - 1
f536_0_copy_InvokeMethod(x, x1) -> f536_0_copy_InvokeMethod(x2, x3) :|: -1 <= x3 - 1 && 0 <= x2 - 1 && 0 <= x1 - 1 && 2 <= x - 1 && x3 + 3 <= x && x2 + 2 <= x
__init(x4, x5) -> f1_0_main_New(x6, x7) :|: 0 <= 0
Start term: __init(arg1, arg2)

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

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

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f536_0_copy_InvokeMethod(x, x1) -> f536_0_copy_InvokeMethod(x2, x3) :|: -1 <= x3 - 1 && 0 <= x2 - 1 && 0 <= x1 - 1 && 2 <= x - 1 && x3 + 3 <= x && x2 + 2 <= x

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f536_0_copy_InvokeMethod(x:0, x1:0) -> f536_0_copy_InvokeMethod(x2:0, x3:0) :|: x:0 >= x3:0 + 3 && x:0 >= x2:0 + 2 && x:0 > 2 && x1:0 > 0 && x2:0 > 0 && x3:0 > -1

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

(7) FilterProof (EQUIVALENT)
Used the following sort dictionary for filtering: 
f536_0_copy_InvokeMethod(INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(8)
Obligation:
Rules:
f536_0_copy_InvokeMethod(x:0, x1:0) -> f536_0_copy_InvokeMethod(x2:0, x3:0) :|: x:0 >= x3:0 + 3 && x:0 >= x2:0 + 2 && x:0 > 2 && x1:0 > 0 && x2:0 > 0 && x3:0 > -1

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

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

(10)
Obligation:
Rules:
f536_0_copy_InvokeMethod(x:0:0, x1:0:0) -> f536_0_copy_InvokeMethod(x2:0:0, x3:0:0) :|: x2:0:0 > 0 && x3:0:0 > -1 && x1:0:0 > 0 && x:0:0 > 2 && x:0:0 >= x2:0:0 + 2 && x:0:0 >= x3:0:0 + 3

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f536_0_copy_InvokeMethod ] = 1/2*f536_0_copy_InvokeMethod_1

The following rules are decreasing:
f536_0_copy_InvokeMethod(x:0:0, x1:0:0) -> f536_0_copy_InvokeMethod(x2:0:0, x3:0:0) :|: x2:0:0 > 0 && x3:0:0 > -1 && x1:0:0 > 0 && x:0:0 > 2 && x:0:0 >= x2:0:0 + 2 && x:0:0 >= x3:0:0 + 3

The following rules are bounded:
f536_0_copy_InvokeMethod(x:0:0, x1:0:0) -> f536_0_copy_InvokeMethod(x2:0:0, x3:0:0) :|: x2:0:0 > 0 && x3:0:0 > -1 && x1:0:0 > 0 && x:0:0 > 2 && x:0:0 >= x2:0:0 + 2 && x:0:0 >= x3:0:0 + 3


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

(12)
YES