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, 200 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 24 ms]
(6) IRSwT
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) TempFilterProof [SOUND, 17 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(12) YES


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

(0)
Obligation:
Rules:
l0(Result_4HAT0, x_5HAT0, y_6HAT0) -> l1(Result_4HATpost, x_5HATpost, y_6HATpost) :|: y_6HAT0 = y_6HATpost && x_5HAT0 = x_5HATpost && Result_4HATpost = Result_4HATpost && x_5HAT0 <= 0
l0(x, x1, x2) -> l1(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x3 = x3 && x2 <= 0 && 0 <= -1 + x1
l0(x6, x7, x8) -> l1(x9, x10, x11) :|: x8 = x11 && x7 = x10 && x9 = x9 && x7 + x8 <= 0 && 0 <= -1 + x8 && 0 <= -1 + x7
l0(x12, x13, x14) -> l2(x15, x16, x17) :|: x12 = x15 && x17 = 1 + x16 && x16 = -2 + x14 && 0 <= -1 + x13 + x14 && 0 <= -1 + x14 && 0 <= -1 + x13
l2(x18, x19, x20) -> l0(x21, x22, x23) :|: x20 = x23 && x19 = x22 && x18 = x21
l3(x24, x25, x26) -> l0(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
l4(x30, x31, x32) -> l3(x33, x34, x35) :|: x32 = x35 && x31 = x34 && x30 = x33
Start term: l4(Result_4HAT0, x_5HAT0, y_6HAT0)

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

(1) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(2)
Obligation:
Rules:
l0(Result_4HAT0, x_5HAT0, y_6HAT0) -> l1(Result_4HATpost, x_5HATpost, y_6HATpost) :|: y_6HAT0 = y_6HATpost && x_5HAT0 = x_5HATpost && Result_4HATpost = Result_4HATpost && x_5HAT0 <= 0
l0(x, x1, x2) -> l1(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x3 = x3 && x2 <= 0 && 0 <= -1 + x1
l0(x6, x7, x8) -> l1(x9, x10, x11) :|: x8 = x11 && x7 = x10 && x9 = x9 && x7 + x8 <= 0 && 0 <= -1 + x8 && 0 <= -1 + x7
l0(x12, x13, x14) -> l2(x15, x16, x17) :|: x12 = x15 && x17 = 1 + x16 && x16 = -2 + x14 && 0 <= -1 + x13 + x14 && 0 <= -1 + x14 && 0 <= -1 + x13
l2(x18, x19, x20) -> l0(x21, x22, x23) :|: x20 = x23 && x19 = x22 && x18 = x21
l3(x24, x25, x26) -> l0(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
l4(x30, x31, x32) -> l3(x33, x34, x35) :|: x32 = x35 && x31 = x34 && x30 = x33
Start term: l4(Result_4HAT0, x_5HAT0, y_6HAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(Result_4HAT0, x_5HAT0, y_6HAT0) -> l1(Result_4HATpost, x_5HATpost, y_6HATpost) :|: y_6HAT0 = y_6HATpost && x_5HAT0 = x_5HATpost && Result_4HATpost = Result_4HATpost && x_5HAT0 <= 0
(2) l0(x, x1, x2) -> l1(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x3 = x3 && x2 <= 0 && 0 <= -1 + x1
(3) l0(x6, x7, x8) -> l1(x9, x10, x11) :|: x8 = x11 && x7 = x10 && x9 = x9 && x7 + x8 <= 0 && 0 <= -1 + x8 && 0 <= -1 + x7
(4) l0(x12, x13, x14) -> l2(x15, x16, x17) :|: x12 = x15 && x17 = 1 + x16 && x16 = -2 + x14 && 0 <= -1 + x13 + x14 && 0 <= -1 + x14 && 0 <= -1 + x13
(5) l2(x18, x19, x20) -> l0(x21, x22, x23) :|: x20 = x23 && x19 = x22 && x18 = x21
(6) l3(x24, x25, x26) -> l0(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
(7) l4(x30, x31, x32) -> l3(x33, x34, x35) :|: x32 = x35 && x31 = x34 && x30 = x33

Arcs:
(4) -> (5)
(5) -> (1), (2), (4)
(6) -> (1), (2), (4)
(7) -> (6)

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) l0(x12, x13, x14) -> l2(x15, x16, x17) :|: x12 = x15 && x17 = 1 + x16 && x16 = -2 + x14 && 0 <= -1 + x13 + x14 && 0 <= -1 + x14 && 0 <= -1 + x13
(2) l2(x18, x19, x20) -> l0(x21, x22, x23) :|: x20 = x23 && x19 = x22 && x18 = x21

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
l0(x12:0, x13:0, x14:0) -> l0(x12:0, -2 + x14:0, 1 + (-2 + x14:0)) :|: x14:0 > 0 && 0 <= -1 + x13:0 + x14:0 && x13:0 > 0

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

(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   l0(x1, x2, x3) -> l0(x2, x3)

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

(8)
Obligation:
Rules:
l0(x13:0, x14:0) -> l0(-2 + x14:0, 1 + (-2 + x14:0)) :|: x14:0 > 0 && 0 <= -1 + x13:0 + x14:0 && x13:0 > 0

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

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

(10)
Obligation:
Rules:
l0(x13:0, x14:0) -> l0(c, c1) :|: c1 = 1 + (-2 + x14:0) && c = -2 + x14:0 && (x14:0 > 0 && 0 <= -1 + x13:0 + x14:0 && x13:0 > 0)

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

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

The following rules are decreasing:
l0(x13:0, x14:0) -> l0(c, c1) :|: c1 = 1 + (-2 + x14:0) && c = -2 + x14:0 && (x14:0 > 0 && 0 <= -1 + x13:0 + x14:0 && x13:0 > 0)
The following rules are bounded:
l0(x13:0, x14:0) -> l0(c, c1) :|: c1 = 1 + (-2 + x14:0) && c = -2 + x14:0 && (x14:0 > 0 && 0 <= -1 + x13:0 + x14:0 && x13:0 > 0)

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

(12)
YES