YES

Problem:
 F(x,y) -> c(A())
 G(x) -> x
 h(x) -> c(x)

Proof:
 sorted: (order)
 0:F(x,y) -> c(A())
 1:G(x) -> x
 2:h(x) -> c(x)
 -----
 sorts
   [0>3, 0>8, 0>9, 1>7, 2>3, 3>4, 4>5, 4>6]
 sort attachment (non-strict)
   F : 8 x 9 -> 0
   c : 4 -> 3
   A : 5
   G : 7 -> 1
   h : 6 -> 2
 -----
 0:F(x,y) -> c(A())
   Church Rosser Transformation Processor (kb):
    F(x,y) -> c(A())
    critical peaks: joinable
     Matrix Interpretation Processor: dim=1
      
      interpretation:
       [A] = 0,
       
       [F](x0, x1) = 2x0 + 4x1 + 4,
       
       [c](x0) = 4x0
      orientation:
       F(x,y) = 2x + 4y + 4 >= 0 = c(A())
      problem:
       
      Qed
 
 
 1:G(x) -> x
   Church Rosser Transformation Processor (kb):
    G(x) -> x
    critical peaks: joinable
     Matrix Interpretation Processor: dim=1
      
      interpretation:
       [G](x0) = x0 + 4
      orientation:
       G(x) = x + 4 >= x = x
      problem:
       
      Qed
 
 
 2:h(x) -> c(x)
   Church Rosser Transformation Processor (kb):
    h(x) -> c(x)
    critical peaks: joinable
     Matrix Interpretation Processor: dim=1
      
      interpretation:
       [h](x0) = 4x0 + 1,
       
       [c](x0) = 4x0
      orientation:
       h(x) = 4x + 1 >= 4x = c(x)
      problem:
       
      Qed