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


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

(0)
Obligation:
Rules:
l0(nondetEXCL13HAT0, resultEXCL12HAT0, temp0EXCL15HAT0, xEXCL14HAT0, xEXCL20HAT0) -> l1(nondetEXCL13HATpost, resultEXCL12HATpost, temp0EXCL15HATpost, xEXCL14HATpost, xEXCL20HATpost) :|: nondetEXCL13HAT1 = nondetEXCL13HAT1 && xEXCL14HATpost = nondetEXCL13HAT1 && nondetEXCL13HATpost = nondetEXCL13HATpost && resultEXCL12HAT0 = resultEXCL12HATpost && temp0EXCL15HAT0 = temp0EXCL15HATpost && xEXCL20HAT0 = xEXCL20HATpost
l1(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x = x5 && x6 = x2 && x3 <= 0
l1(x10, x11, x12, x13, x14) -> l3(x15, x16, x17, x18, x19) :|: x14 = x19 && x12 = x17 && x11 = x16 && x10 = x15 && 1 <= x14 && -1 + x14 <= x18 && x18 <= -1 + x14 && x18 = -1 + x13 && 1 <= x13
l3(x20, x21, x22, x23, x24) -> l1(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25
l4(x30, x31, x32, x33, x34) -> l0(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x32 = x37 && x31 = x36 && x30 = x35
Start term: l4(nondetEXCL13HAT0, resultEXCL12HAT0, temp0EXCL15HAT0, xEXCL14HAT0, xEXCL20HAT0)

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

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

(2)
Obligation:
Rules:
l0(nondetEXCL13HAT0, resultEXCL12HAT0, temp0EXCL15HAT0, xEXCL14HAT0, xEXCL20HAT0) -> l1(nondetEXCL13HATpost, resultEXCL12HATpost, temp0EXCL15HATpost, xEXCL14HATpost, xEXCL20HATpost) :|: nondetEXCL13HAT1 = nondetEXCL13HAT1 && xEXCL14HATpost = nondetEXCL13HAT1 && nondetEXCL13HATpost = nondetEXCL13HATpost && resultEXCL12HAT0 = resultEXCL12HATpost && temp0EXCL15HAT0 = temp0EXCL15HATpost && xEXCL20HAT0 = xEXCL20HATpost
l1(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x = x5 && x6 = x2 && x3 <= 0
l1(x10, x11, x12, x13, x14) -> l3(x15, x16, x17, x18, x19) :|: x14 = x19 && x12 = x17 && x11 = x16 && x10 = x15 && 1 <= x14 && -1 + x14 <= x18 && x18 <= -1 + x14 && x18 = -1 + x13 && 1 <= x13
l3(x20, x21, x22, x23, x24) -> l1(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25
l4(x30, x31, x32, x33, x34) -> l0(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x32 = x37 && x31 = x36 && x30 = x35
Start term: l4(nondetEXCL13HAT0, resultEXCL12HAT0, temp0EXCL15HAT0, xEXCL14HAT0, xEXCL20HAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(nondetEXCL13HAT0, resultEXCL12HAT0, temp0EXCL15HAT0, xEXCL14HAT0, xEXCL20HAT0) -> l1(nondetEXCL13HATpost, resultEXCL12HATpost, temp0EXCL15HATpost, xEXCL14HATpost, xEXCL20HATpost) :|: nondetEXCL13HAT1 = nondetEXCL13HAT1 && xEXCL14HATpost = nondetEXCL13HAT1 && nondetEXCL13HATpost = nondetEXCL13HATpost && resultEXCL12HAT0 = resultEXCL12HATpost && temp0EXCL15HAT0 = temp0EXCL15HATpost && xEXCL20HAT0 = xEXCL20HATpost
(2) l1(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x = x5 && x6 = x2 && x3 <= 0
(3) l1(x10, x11, x12, x13, x14) -> l3(x15, x16, x17, x18, x19) :|: x14 = x19 && x12 = x17 && x11 = x16 && x10 = x15 && 1 <= x14 && -1 + x14 <= x18 && x18 <= -1 + x14 && x18 = -1 + x13 && 1 <= x13
(4) l3(x20, x21, x22, x23, x24) -> l1(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25
(5) l4(x30, x31, x32, x33, x34) -> l0(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x32 = x37 && x31 = x36 && x30 = x35

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) l1(x10, x11, x12, x13, x14) -> l3(x15, x16, x17, x18, x19) :|: x14 = x19 && x12 = x17 && x11 = x16 && x10 = x15 && 1 <= x14 && -1 + x14 <= x18 && x18 <= -1 + x14 && x18 = -1 + x13 && 1 <= x13
(2) l3(x20, x21, x22, x23, x24) -> l1(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
l1(x10:0, x11:0, x12:0, x13:0, x14:0) -> l1(x10:0, x11:0, x12:0, -1 + x13:0, x14:0) :|: x14:0 > 0 && -1 + x14:0 = -1 + x13:0 && x13:0 > 0

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

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

   l1(x1, x2, x3, x4, x5) -> l1(x4, x5)

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

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

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

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

(10)
Obligation:
Rules:
l1(x13:0, x14:0) -> l1(c, x14:0) :|: c = -1 + x13:0 && (x14:0 > 0 && -1 + x14:0 = -1 + x13:0 && x13:0 > 0)

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

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

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

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

(12)
YES