Certification Problem

Input (COPS 240)

We consider the TRS containing the following rules:

a(x)	→	b(x)	(1)
a(x)	→	c(c(x))	(2)
b(x)	→	g(b(x))	(3)
c(x)	→	c(x)	(4)

The underlying signature is as follows:

{a/1, b/1, c/1, g/1}

Property / Task

Prove or disprove confluence.

Answer / Result

No.

Proof (by csi @ CoCo 2020)

1 Non-Joinable Fork

The system is not confluent due to the following forking derivations.

t₀	=	a(f4)
	→	b(f4)
	=	t₁

t₀	=	a(f4)
	→	c(c(f4))
	=	t₁

The two resulting terms cannot be joined for the following reason:

The reachable terms of these two terms are approximated via the following two tree automata, and the tree automata have an empty intersection.
- Automaton 1
  - final states:
    
    {4}
  - transitions:
    
    f4 → 5
    
    g(4) → 4
    
    b(5) → 4
  The automaton is closed under rewriting as it is compatible.
- Automaton 2
  - final states:
    
    {1}
  - transitions:
    
    f4 → 2
    
    c(3) → 1
    
    c(2) → 3
  The automaton is closed under rewriting as it is compatible.