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


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

(0)
Obligation:
Rules:
l0(xHAT0, yHAT0) -> l1(xHATpost, yHATpost) :|: yHATpost <= 0 && yHATpost = xHATpost && xHATpost = 5
l2(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
Start term: l2(xHAT0, yHAT0)

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

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

(2)
Obligation:
Rules:
l0(xHAT0, yHAT0) -> l1(xHATpost, yHATpost) :|: yHATpost <= 0 && yHATpost = xHATpost && xHATpost = 5
l2(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
Start term: l2(xHAT0, yHAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(xHAT0, yHAT0) -> l1(xHATpost, yHATpost) :|: yHATpost <= 0 && yHATpost = xHATpost && xHATpost = 5
(2) l2(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2

No arcs!

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

(4)
TRUE