NO
proof of prog.inttrs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given IRSwT could be disproven:

(0) IRSwT
(1) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(2) IRSwT
(3) IRSwTTerminationDigraphProof [EQUIVALENT, 206 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IRSwT
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTChainingProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
(12) AND
    (13) IRSwT
        (14) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (15) IRSwT
        (16) FilterProof [EQUIVALENT, 0 ms]
        (17) IntTRS
        (18) IntTRSPeriodicNontermProof [COMPLETE, 3 ms]
        (19) NO
    (20) IRSwT
        (21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (22) IRSwT


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

(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 && 20 - x_5HAT0 <= 0
l0(x, x1, x2) -> l2(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x = x3 && 0 <= 19 - x1
l3(x6, x7, x8) -> l0(x9, x10, x11) :|: x8 = x11 && x7 = x10 && x6 = x9
l2(x12, x13, x14) -> l0(x15, x16, x17) :|: x14 = x17 && x12 = x15 && x16 = -1 + x13 && 30 - x14 <= 0
l2(x18, x19, x20) -> l4(x21, x22, x23) :|: x20 = x23 && x18 = x21 && x22 = -1 + x19 && 0 <= 29 - x20
l4(x24, x25, x26) -> l2(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
l5(x30, x31, x32) -> l3(x33, x34, x35) :|: x32 = x35 && x31 = x34 && x30 = x33
Start term: l5(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 && 20 - x_5HAT0 <= 0
l0(x, x1, x2) -> l2(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x = x3 && 0 <= 19 - x1
l3(x6, x7, x8) -> l0(x9, x10, x11) :|: x8 = x11 && x7 = x10 && x6 = x9
l2(x12, x13, x14) -> l0(x15, x16, x17) :|: x14 = x17 && x12 = x15 && x16 = -1 + x13 && 30 - x14 <= 0
l2(x18, x19, x20) -> l4(x21, x22, x23) :|: x20 = x23 && x18 = x21 && x22 = -1 + x19 && 0 <= 29 - x20
l4(x24, x25, x26) -> l2(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
l5(x30, x31, x32) -> l3(x33, x34, x35) :|: x32 = x35 && x31 = x34 && x30 = x33
Start term: l5(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 && 20 - x_5HAT0 <= 0
(2) l0(x, x1, x2) -> l2(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x = x3 && 0 <= 19 - x1
(3) l3(x6, x7, x8) -> l0(x9, x10, x11) :|: x8 = x11 && x7 = x10 && x6 = x9
(4) l2(x12, x13, x14) -> l0(x15, x16, x17) :|: x14 = x17 && x12 = x15 && x16 = -1 + x13 && 30 - x14 <= 0
(5) l2(x18, x19, x20) -> l4(x21, x22, x23) :|: x20 = x23 && x18 = x21 && x22 = -1 + x19 && 0 <= 29 - x20
(6) l4(x24, x25, x26) -> l2(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
(7) l5(x30, x31, x32) -> l3(x33, x34, x35) :|: x32 = x35 && x31 = x34 && x30 = x33

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) l0(x, x1, x2) -> l2(x3, x4, x5) :|: x2 = x5 && x1 = x4 && x = x3 && 0 <= 19 - x1
(2) l2(x12, x13, x14) -> l0(x15, x16, x17) :|: x14 = x17 && x12 = x15 && x16 = -1 + x13 && 30 - x14 <= 0
(3) l4(x24, x25, x26) -> l2(x27, x28, x29) :|: x26 = x29 && x25 = x28 && x24 = x27
(4) l2(x18, x19, x20) -> l4(x21, x22, x23) :|: x20 = x23 && x18 = x21 && x22 = -1 + x19 && 0 <= 29 - x20

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
l2(x12:0, x13:0, x14:0) -> l2(x12:0, -1 + x13:0, x14:0) :|: x14:0 > 29 && x13:0 < 21
l2(x18:0, x19:0, x20:0) -> l2(x18:0, -1 + x19:0, x20:0) :|: x20:0 < 30

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

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

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

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

(8)
Obligation:
Rules:
l2(x13:0, x14:0) -> l2(-1 + x13:0, x14:0) :|: x14:0 > 29 && x13:0 < 21
l2(x19:0, x20:0) -> l2(-1 + x19:0, x20:0) :|: x20:0 < 30

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

(9) IRSwTChainingProof (EQUIVALENT)
Chaining!
----------------------------------------

(10)
Obligation:
Rules:
l2(x, x1) -> l2(-2 + x, x1) :|: TRUE && x1 >= 30 && x <= 20
l2(x19:0, x20:0) -> l2(-1 + x19:0, x20:0) :|: x20:0 < 30

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l2(x, x1) -> l2(-2 + x, x1) :|: TRUE && x1 >= 30 && x <= 20
(2) l2(x19:0, x20:0) -> l2(-1 + x19:0, x20:0) :|: x20:0 < 30

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

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

(12)
Complex Obligation (AND)

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

(13)
Obligation:

Termination digraph:
Nodes:
(1) l2(x19:0, x20:0) -> l2(-1 + x19:0, x20:0) :|: x20:0 < 30

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

   l2(x1, x2) -> l2(x2)

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

(15)
Obligation:
Rules:
l2(x20:0) -> l2(x20:0) :|: x20:0 < 30

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

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

(17)
Obligation:
Rules:
l2(x20:0) -> l2(x20:0) :|: x20:0 < 30

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

(18) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x20:0) -> f(1, x20:0) :|: pc = 1 && x20:0 < 30
Witness term starting non-terminating reduction: f(1, 29)
----------------------------------------

(19)
NO

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

(20)
Obligation:

Termination digraph:
Nodes:
(1) l2(x, x1) -> l2(-2 + x, x1) :|: TRUE && x1 >= 30 && x <= 20

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(22)
Obligation:
Rules:
l2(x:0, x1:0) -> l2(-2 + x:0, x1:0) :|: x:0 < 21 && x1:0 > 29