YES Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_04/z108-rotate.srs

Termination w.r.t. Q of the given QTRS could be proven:

0 QTRS
↳1 QTRSRRRProof (⇔, 99 ms)
↳2 QTRS
↳3 Overlay + Local Confluence (⇔, 0 ms)
↳4 QTRS
↳5 DependencyPairsProof (⇔, 23 ms)
↳6 QDP
↳7 DependencyGraphProof (⇔, 0 ms)
↳8 AND
    ↳9 QDP
        ↳10 UsableRulesProof (⇔, 0 ms)
        ↳11 QDP
        ↳12 QReductionProof (⇔, 0 ms)
        ↳13 QDP
        ↳14 QDPSizeChangeProof (⇔, 0 ms)
        ↳15 YES
    ↳16 QDP
        ↳17 UsableRulesProof (⇔, 0 ms)
        ↳18 QDP
        ↳19 QReductionProof (⇔, 0 ms)
        ↳20 QDP
        ↳21 MRRProof (⇔, 55 ms)
        ↳22 QDP
        ↳23 PisEmptyProof (⇔, 0 ms)
        ↳24 YES
    ↳25 QDP
        ↳26 UsableRulesProof (⇔, 0 ms)
        ↳27 QDP
        ↳28 QReductionProof (⇔, 0 ms)
        ↳29 QDP
        ↳30 QDPSizeChangeProof (⇔, 0 ms)
        ↳31 YES

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

begin(end(x)) → rewrite(end(x))
begin(a(x)) → rotate(cut(Ca(guess(x))))
begin(b(x)) → rotate(cut(Cb(guess(x))))
begin(c(x)) → rotate(cut(Cc(guess(x))))
begin(d(x)) → rotate(cut(Cd(guess(x))))
guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
guess(a(x)) → moveleft(Ba(wait(x)))
guess(b(x)) → moveleft(Bb(wait(x)))
guess(c(x)) → moveleft(Bc(wait(x)))
guess(d(x)) → moveleft(Bd(wait(x)))
guess(end(x)) → finish(end(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
goright(wait(end(x))) → finish(end(x))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
cut(finish(x)) → finish2(x)
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))
rotate(finish2(x)) → rewrite(x)
rewrite(a(a(x))) → begin(b(c(x)))
rewrite(b(b(x))) → begin(c(d(x)))
rewrite(c(c(x))) → begin(d(d(d(x))))
rewrite(d(d(d(x)))) → begin(a(c(x)))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(Aa(x1)) = 180 + x1   
POL(Ab(x1)) = 162 + x1   
POL(Ac(x1)) = 192 + x1   
POL(Ad(x1)) = 126 + x1   
POL(Ba(x1)) = 180 + x1   
POL(Bb(x1)) = 162 + x1   
POL(Bc(x1)) = 192 + x1   
POL(Bd(x1)) = 126 + x1   
POL(Ca(x1)) = 180 + x1   
POL(Cb(x1)) = 162 + x1   
POL(Cc(x1)) = 192 + x1   
POL(Cd(x1)) = 126 + x1   
POL(Da(x1)) = 180 + x1   
POL(Db(x1)) = 162 + x1   
POL(Dc(x1)) = 192 + x1   
POL(Dd(x1)) = 126 + x1   
POL(a(x1)) = 180 + x1   
POL(b(x1)) = 162 + x1   
POL(begin(x1)) = 5 + x1   
POL(c(x1)) = 192 + x1   
POL(cut(x1)) = 2 + x1   
POL(d(x1)) = 126 + x1   
POL(end(x1)) = x1   
POL(finish(x1)) = x1   
POL(finish2(x1)) = 1 + x1   
POL(goright(x1)) = x1   
POL(guess(x1)) = 2 + x1   
POL(moveleft(x1)) = x1   
POL(rewrite(x1)) = x1   
POL(rotate(x1)) = x1   
POL(wait(x1)) = 1 + x1   
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

begin(end(x)) → rewrite(end(x))
begin(a(x)) → rotate(cut(Ca(guess(x))))
begin(b(x)) → rotate(cut(Cb(guess(x))))
begin(c(x)) → rotate(cut(Cc(guess(x))))
begin(d(x)) → rotate(cut(Cd(guess(x))))
guess(a(x)) → moveleft(Ba(wait(x)))
guess(b(x)) → moveleft(Bb(wait(x)))
guess(c(x)) → moveleft(Bc(wait(x)))
guess(d(x)) → moveleft(Bd(wait(x)))
guess(end(x)) → finish(end(x))
goright(wait(end(x))) → finish(end(x))
cut(finish(x)) → finish2(x)
rotate(finish2(x)) → rewrite(x)
rewrite(a(a(x))) → begin(b(c(x)))
rewrite(b(b(x))) → begin(c(d(x)))
rewrite(c(c(x))) → begin(d(d(d(x))))
rewrite(d(d(d(x)))) → begin(a(c(x)))


(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))

Q is empty.

(3) Overlay + Local Confluence (EQUIVALENT transformation)

The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.

(4) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))

The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(6) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GUESS(a(x)) → CA(guess(x))
GUESS(a(x)) → GUESS(x)
GUESS(b(x)) → CB(guess(x))
GUESS(b(x)) → GUESS(x)
GUESS(c(x)) → CC(guess(x))
GUESS(c(x)) → GUESS(x)
GUESS(d(x)) → CD(guess(x))
GUESS(d(x)) → GUESS(x)
CUT(moveleft(Ba(x))) → DA(cut(goright(x)))
CUT(moveleft(Ba(x))) → CUT(goright(x))
CUT(moveleft(Ba(x))) → GORIGHT(x)
CUT(moveleft(Bb(x))) → DB(cut(goright(x)))
CUT(moveleft(Bb(x))) → CUT(goright(x))
CUT(moveleft(Bb(x))) → GORIGHT(x)
CUT(moveleft(Bc(x))) → DC(cut(goright(x)))
CUT(moveleft(Bc(x))) → CUT(goright(x))
CUT(moveleft(Bc(x))) → GORIGHT(x)
CUT(moveleft(Bd(x))) → DD(cut(goright(x)))
CUT(moveleft(Bd(x))) → CUT(goright(x))
CUT(moveleft(Bd(x))) → GORIGHT(x)
GORIGHT(Aa(x)) → CA(goright(x))
GORIGHT(Aa(x)) → GORIGHT(x)
GORIGHT(Ab(x)) → CB(goright(x))
GORIGHT(Ab(x)) → GORIGHT(x)
GORIGHT(Ac(x)) → CC(goright(x))
GORIGHT(Ac(x)) → GORIGHT(x)
GORIGHT(Ad(x)) → CD(goright(x))
GORIGHT(Ad(x)) → GORIGHT(x)

The TRS R consists of the following rules:

guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))

The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 16 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GORIGHT(Ab(x)) → GORIGHT(x)
GORIGHT(Aa(x)) → GORIGHT(x)
GORIGHT(Ac(x)) → GORIGHT(x)
GORIGHT(Ad(x)) → GORIGHT(x)

The TRS R consists of the following rules:

guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))

The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(10) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GORIGHT(Ab(x)) → GORIGHT(x)
GORIGHT(Aa(x)) → GORIGHT(x)
GORIGHT(Ac(x)) → GORIGHT(x)
GORIGHT(Ad(x)) → GORIGHT(x)

R is empty.
The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(12) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

(13) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GORIGHT(Ab(x)) → GORIGHT(x)
GORIGHT(Aa(x)) → GORIGHT(x)
GORIGHT(Ac(x)) → GORIGHT(x)
GORIGHT(Ad(x)) → GORIGHT(x)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(14) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • GORIGHT(Ab(x)) → GORIGHT(x)
    The graph contains the following edges 1 > 1

  • GORIGHT(Aa(x)) → GORIGHT(x)
    The graph contains the following edges 1 > 1

  • GORIGHT(Ac(x)) → GORIGHT(x)
    The graph contains the following edges 1 > 1

  • GORIGHT(Ad(x)) → GORIGHT(x)
    The graph contains the following edges 1 > 1

(15) YES

(16) Obligation:

Q DP problem:
The TRS P consists of the following rules:

CUT(moveleft(Bb(x))) → CUT(goright(x))
CUT(moveleft(Ba(x))) → CUT(goright(x))
CUT(moveleft(Bc(x))) → CUT(goright(x))
CUT(moveleft(Bd(x))) → CUT(goright(x))

The TRS R consists of the following rules:

guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))

The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(17) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(18) Obligation:

Q DP problem:
The TRS P consists of the following rules:

CUT(moveleft(Bb(x))) → CUT(goright(x))
CUT(moveleft(Ba(x))) → CUT(goright(x))
CUT(moveleft(Bc(x))) → CUT(goright(x))
CUT(moveleft(Bd(x))) → CUT(goright(x))

The TRS R consists of the following rules:

goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
Cd(finish(x)) → finish(d(x))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cc(finish(x)) → finish(c(x))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cb(finish(x)) → finish(b(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Ca(finish(x)) → finish(a(x))

The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(19) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

CUT(moveleft(Bb(x))) → CUT(goright(x))
CUT(moveleft(Ba(x))) → CUT(goright(x))
CUT(moveleft(Bc(x))) → CUT(goright(x))
CUT(moveleft(Bd(x))) → CUT(goright(x))

The TRS R consists of the following rules:

goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
Cd(finish(x)) → finish(d(x))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cc(finish(x)) → finish(c(x))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cb(finish(x)) → finish(b(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Ca(finish(x)) → finish(a(x))

The set Q consists of the following terms:

Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))

We have to consider all minimal (P,Q,R)-chains.

(21) MRRProof (EQUIVALENT transformation)

By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

CUT(moveleft(Bb(x))) → CUT(goright(x))
CUT(moveleft(Ba(x))) → CUT(goright(x))
CUT(moveleft(Bc(x))) → CUT(goright(x))
CUT(moveleft(Bd(x))) → CUT(goright(x))

Strictly oriented rules of the TRS R:

goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cb(finish(x)) → finish(b(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))

Used ordering: Polynomial interpretation [POLO]:

POL(Aa(x1)) = 2·x1   
POL(Ab(x1)) = 2·x1   
POL(Ac(x1)) = 1 + x1   
POL(Ad(x1)) = 2·x1   
POL(Ba(x1)) = 2·x1   
POL(Bb(x1)) = 2 + 2·x1   
POL(Bc(x1)) = 2·x1   
POL(Bd(x1)) = 1 + 2·x1   
POL(CUT(x1)) = x1   
POL(Ca(x1)) = 2·x1   
POL(Cb(x1)) = 2·x1   
POL(Cc(x1)) = 2 + x1   
POL(Cd(x1)) = 2·x1   
POL(a(x1)) = 2 + x1   
POL(b(x1)) = 1 + x1   
POL(c(x1)) = 2 + x1   
POL(d(x1)) = 2 + x1   
POL(finish(x1)) = 2 + x1   
POL(goright(x1)) = 2·x1   
POL(moveleft(x1)) = 2 + x1   
POL(wait(x1)) = 2·x1   

(22) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
Cd(finish(x)) → finish(d(x))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cc(finish(x)) → finish(c(x))
Ca(finish(x)) → finish(a(x))

The set Q consists of the following terms:

Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))

We have to consider all minimal (P,Q,R)-chains.

(23) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(24) YES

(25) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GUESS(b(x)) → GUESS(x)
GUESS(a(x)) → GUESS(x)
GUESS(c(x)) → GUESS(x)
GUESS(d(x)) → GUESS(x)

The TRS R consists of the following rules:

guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(c(x)) → Cc(guess(x))
guess(d(x)) → Cd(guess(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cc(finish(x)) → finish(c(x))
Cd(finish(x)) → finish(d(x))
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dc(finish2(x)) → finish2(c(x))
Dd(finish2(x)) → finish2(d(x))

The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(26) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(27) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GUESS(b(x)) → GUESS(x)
GUESS(a(x)) → GUESS(x)
GUESS(c(x)) → GUESS(x)
GUESS(d(x)) → GUESS(x)

R is empty.
The set Q consists of the following terms:

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

We have to consider all minimal (P,Q,R)-chains.

(28) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

guess(a(x0))
guess(b(x0))
guess(c(x0))
guess(d(x0))
Ca(moveleft(Ba(x0)))
Cb(moveleft(Ba(x0)))
Cc(moveleft(Ba(x0)))
Cd(moveleft(Ba(x0)))
Ca(moveleft(Bb(x0)))
Cb(moveleft(Bb(x0)))
Cc(moveleft(Bb(x0)))
Cd(moveleft(Bb(x0)))
Ca(moveleft(Bc(x0)))
Cb(moveleft(Bc(x0)))
Cc(moveleft(Bc(x0)))
Cd(moveleft(Bc(x0)))
Ca(moveleft(Bd(x0)))
Cb(moveleft(Bd(x0)))
Cc(moveleft(Bd(x0)))
Cd(moveleft(Bd(x0)))
cut(moveleft(Ba(x0)))
cut(moveleft(Bb(x0)))
cut(moveleft(Bc(x0)))
cut(moveleft(Bd(x0)))
goright(Aa(x0))
goright(Ab(x0))
goright(Ac(x0))
goright(Ad(x0))
goright(wait(a(x0)))
goright(wait(b(x0)))
goright(wait(c(x0)))
goright(wait(d(x0)))
Ca(finish(x0))
Cb(finish(x0))
Cc(finish(x0))
Cd(finish(x0))
Da(finish2(x0))
Db(finish2(x0))
Dc(finish2(x0))
Dd(finish2(x0))

(29) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GUESS(b(x)) → GUESS(x)
GUESS(a(x)) → GUESS(x)
GUESS(c(x)) → GUESS(x)
GUESS(d(x)) → GUESS(x)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(30) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • GUESS(b(x)) → GUESS(x)
    The graph contains the following edges 1 > 1

  • GUESS(a(x)) → GUESS(x)
    The graph contains the following edges 1 > 1

  • GUESS(c(x)) → GUESS(x)
    The graph contains the following edges 1 > 1

  • GUESS(d(x)) → GUESS(x)
    The graph contains the following edges 1 > 1

(31) YES