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, 69 ms]
(4) TRUE


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

(0)
Obligation:
Rules:
l0(tmpHAT0) -> l1(tmpHATpost) :|: tmpHAT0 = tmpHATpost
l2(x) -> l0(x1) :|: x = x1
l3(x2) -> l2(x3) :|: x2 = x3
l3(x4) -> l0(x5) :|: x5 = x5
l4(x6) -> l3(x7) :|: x6 = x7
Start term: l4(tmpHAT0)

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

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

(2)
Obligation:
Rules:
l0(tmpHAT0) -> l1(tmpHATpost) :|: tmpHAT0 = tmpHATpost
l2(x) -> l0(x1) :|: x = x1
l3(x2) -> l2(x3) :|: x2 = x3
l3(x4) -> l0(x5) :|: x5 = x5
l4(x6) -> l3(x7) :|: x6 = x7
Start term: l4(tmpHAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(tmpHAT0) -> l1(tmpHATpost) :|: tmpHAT0 = tmpHATpost
(2) l2(x) -> l0(x1) :|: x = x1
(3) l3(x2) -> l2(x3) :|: x2 = x3
(4) l3(x4) -> l0(x5) :|: x5 = x5
(5) l4(x6) -> l3(x7) :|: x6 = x7

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

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

(4)
TRUE