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, 77 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 32 ms]
(6) IRSwT
(7) FilterProof [EQUIVALENT, 0 ms]
(8) IntTRS
(9) IntTRSPeriodicNontermProof [COMPLETE, 0 ms]
(10) NO


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

(0)
Obligation:
Rules:
l0(xHAT0, yHAT0) -> l1(xHATpost, yHATpost) :|: yHAT0 = yHATpost && xHATpost = xHAT0 && yHAT0 <= xHAT0 && xHAT0 <= yHAT0
l1(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
l2(x4, x5) -> l0(x6, x7) :|: x5 = x7 && x4 = x6
l3(x8, x9) -> l2(x10, x11) :|: x9 = x11 && x8 = x10
Start term: l3(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) :|: yHAT0 = yHATpost && xHATpost = xHAT0 && yHAT0 <= xHAT0 && xHAT0 <= yHAT0
l1(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
l2(x4, x5) -> l0(x6, x7) :|: x5 = x7 && x4 = x6
l3(x8, x9) -> l2(x10, x11) :|: x9 = x11 && x8 = x10
Start term: l3(xHAT0, yHAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(xHAT0, yHAT0) -> l1(xHATpost, yHATpost) :|: yHAT0 = yHATpost && xHATpost = xHAT0 && yHAT0 <= xHAT0 && xHAT0 <= yHAT0
(2) l1(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
(3) l2(x4, x5) -> l0(x6, x7) :|: x5 = x7 && x4 = x6
(4) l3(x8, x9) -> l2(x10, x11) :|: x9 = x11 && x8 = x10

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) l0(xHAT0, yHAT0) -> l1(xHATpost, yHATpost) :|: yHAT0 = yHATpost && xHATpost = xHAT0 && yHAT0 <= xHAT0 && xHAT0 <= yHAT0
(2) l1(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
l0(x2:0, x2:0) -> l0(x2:0, x2:0) :|: TRUE

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

(7) FilterProof (EQUIVALENT)
Used the following sort dictionary for filtering: 
l0(VARIABLE, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(8)
Obligation:
Rules:
l0(x2:0, x2:0) -> l0(x2:0, x2:0) :|: TRUE

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

(9) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x2:0, x2:0) -> f(1, x2:0, x2:0) :|: pc = 1 && TRUE
Witness term starting non-terminating reduction: f(1, -8, -8)
----------------------------------------

(10)
NO