Platform claims not to support CPU time, falling back to wall time.
Cannot find out cpu time on external processes, falling back to wall time!
proof of /home/fs5/ayamada/tpdb/relative/Relative_05/rt3-7.trs
# AProVE Commit ID: 2b684c7cda508b1711f707cb42f127e64fe1df88 ffrohn 20140415 dirty
Termination of the given RelTRS could be proven:
(0) RelTRS
(1) RelTRSRRRProof [EQUIVALENT, 297 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 212 ms]
(4) RelTRS
(5) RIsEmptyProof [EQUIVALENT, 0 ms]
(6) YES
----------------------------------------
(0)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:
f(b(x), y) -> f(x, b(y))
f(x, a(y)) -> f(a(x), y)
The relative TRS consists of the following S rules:
f(x, y) -> f(a(x), y)
f(x, y) -> f(x, b(y))
----------------------------------------
(1) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :
<<<
POL(f(x_1, x_2)) = [[1], [1]] + [[1, 1], [1, 1]] * x_1 + [[1, 0], [1, 0]] * x_2
>>>
<<<
POL(b(x_1)) = [[0], [1]] + [[1, 0], [1, 1]] * x_1
>>>
<<<
POL(a(x_1)) = [[0], [0]] + [[1, 1], [0, 0]] * x_1
>>>
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
f(b(x), y) -> f(x, b(y))
Rules from S:
none
----------------------------------------
(2)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:
f(x, a(y)) -> f(a(x), y)
The relative TRS consists of the following S rules:
f(x, y) -> f(a(x), y)
f(x, y) -> f(x, b(y))
----------------------------------------
(3) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :
<<<
POL(f(x_1, x_2)) = [[0], [1]] + [[1, 0], [1, 0]] * x_1 + [[1, 1], [1, 1]] * x_2
>>>
<<<
POL(a(x_1)) = [[0], [1]] + [[1, 0], [0, 1]] * x_1
>>>
<<<
POL(b(x_1)) = [[0], [0]] + [[1, 1], [0, 0]] * x_1
>>>
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
f(x, a(y)) -> f(a(x), y)
Rules from S:
none
----------------------------------------
(4)
Obligation:
Relative term rewrite system:
R is empty.
The relative TRS consists of the following S rules:
f(x, y) -> f(a(x), y)
f(x, y) -> f(x, b(y))
----------------------------------------
(5) RIsEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------
(6)
YES