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, 74 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IRSwT
(7) IRSwTChainingProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 2 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) FilterProof [EQUIVALENT, 0 ms]
(14) IntTRS
(15) IntTRSPeriodicNontermProof [COMPLETE, 0 ms]
(16) NO


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

(0)
Obligation:
Rules:
l0(xHAT0) -> l1(xHATpost) :|: xHATpost = 1 - xHAT0 && xHAT0 <= 1 && 0 <= xHAT0
l1(x) -> l0(x1) :|: x = x1
l2(x2) -> l0(x3) :|: x2 = x3
l3(x4) -> l2(x5) :|: x4 = x5
Start term: l3(xHAT0)

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

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

(2)
Obligation:
Rules:
l0(xHAT0) -> l1(xHATpost) :|: xHATpost = 1 - xHAT0 && xHAT0 <= 1 && 0 <= xHAT0
l1(x) -> l0(x1) :|: x = x1
l2(x2) -> l0(x3) :|: x2 = x3
l3(x4) -> l2(x5) :|: x4 = x5
Start term: l3(xHAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(xHAT0) -> l1(xHATpost) :|: xHATpost = 1 - xHAT0 && xHAT0 <= 1 && 0 <= xHAT0
(2) l1(x) -> l0(x1) :|: x = x1
(3) l2(x2) -> l0(x3) :|: x2 = x3
(4) l3(x4) -> l2(x5) :|: x4 = x5

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) l0(xHAT0) -> l1(xHATpost) :|: xHATpost = 1 - xHAT0 && xHAT0 <= 1 && 0 <= xHAT0
(2) l1(x) -> l0(x1) :|: x = x1

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

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
l0(xHAT0:0) -> l0(1 - xHAT0:0) :|: xHAT0:0 > -1 && xHAT0:0 < 2

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

(7) IRSwTChainingProof (EQUIVALENT)
Chaining!
----------------------------------------

(8)
Obligation:
Rules:
l0(x) -> l0(x) :|: TRUE && x >= 0 && x <= 1

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

(9) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(x) -> l0(x) :|: TRUE && x >= 0 && x <= 1

Arcs:
(1) -> (1)

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

(10)
Obligation:

Termination digraph:
Nodes:
(1) l0(x) -> l0(x) :|: TRUE && x >= 0 && x <= 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(12)
Obligation:
Rules:
l0(x:0) -> l0(x:0) :|: x:0 < 2 && x:0 > -1

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

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

(14)
Obligation:
Rules:
l0(x:0) -> l0(x:0) :|: x:0 < 2 && x:0 > -1

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

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

(16)
NO