Certification Problem

Input (COPS 241)

We consider the TRS containing the following rules:

a	→	c	(1)
a	→	f(c)	(2)
f(x)	→	f(g(x))	(3)

The underlying signature is as follows:

{a/0, c/0, f/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
	→	c
	=	t₁

t₀	=	a
	→	f(c)
	=	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:
    
    {3}
  - transitions:
    
    c → 3
  The automaton is closed under rewriting as it is compatible.
- Automaton 2
  - final states:
    
    {1}
  - transitions:
    
    g(2) → 2
    
    f(2) → 1
    
    c → 2
  The automaton is closed under rewriting as it is compatible.