190.33/42.15	YES
190.33/42.16	
190.33/42.16	Problem:
190.33/42.16	 a(b(x1)) -> x1
190.33/42.16	 a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	 b(c(x1)) -> a(b(x1))
190.33/42.16	
190.33/42.16	Proof:
190.33/42.16	 DP Processor:
190.33/42.16	  DPs:
190.33/42.16	   a#(c(x1)) -> a#(x1)
190.33/42.16	   a#(c(x1)) -> b#(a(x1))
190.33/42.16	   b#(c(x1)) -> b#(x1)
190.33/42.16	   b#(c(x1)) -> a#(b(x1))
190.33/42.16	  TRS:
190.33/42.16	   a(b(x1)) -> x1
190.33/42.16	   a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	   b(c(x1)) -> a(b(x1))
190.33/42.16	  TDG Processor:
190.33/42.16	   DPs:
190.33/42.16	    a#(c(x1)) -> a#(x1)
190.33/42.16	    a#(c(x1)) -> b#(a(x1))
190.33/42.16	    b#(c(x1)) -> b#(x1)
190.33/42.16	    b#(c(x1)) -> a#(b(x1))
190.33/42.16	   TRS:
190.33/42.16	    a(b(x1)) -> x1
190.33/42.16	    a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	    b(c(x1)) -> a(b(x1))
190.33/42.16	   graph:
190.33/42.16	    b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> a#(b(x1))
190.33/42.16	    b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> b#(x1)
190.33/42.16	    b#(c(x1)) -> a#(b(x1)) -> a#(c(x1)) -> b#(a(x1))
190.33/42.16	    b#(c(x1)) -> a#(b(x1)) -> a#(c(x1)) -> a#(x1)
190.33/42.16	    a#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> a#(b(x1))
190.33/42.16	    a#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> b#(x1)
190.33/42.16	    a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> b#(a(x1))
190.33/42.16	    a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> a#(x1)
190.33/42.16	   Arctic Interpretation Processor:
190.33/42.16	    dimension: 1
190.33/42.16	    usable rules:
190.33/42.16	     a(b(x1)) -> x1
190.33/42.16	     a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	     b(c(x1)) -> a(b(x1))
190.33/42.16	    interpretation:
190.33/42.16	     [b#](x0) = -2x0 + 0,
190.33/42.16	     
190.33/42.16	     [a#](x0) = x0 + 0,
190.33/42.16	     
190.33/42.16	     [c](x0) = 1x0 + 3,
190.33/42.16	     
190.33/42.16	     [a](x0) = 1x0 + 2,
190.33/42.16	     
190.33/42.16	     [b](x0) = -1x0 + 1
190.33/42.16	    orientation:
190.33/42.16	     a#(c(x1)) = 1x1 + 3 >= x1 + 0 = a#(x1)
190.33/42.16	     
190.33/42.16	     a#(c(x1)) = 1x1 + 3 >= -1x1 + 0 = b#(a(x1))
190.33/42.16	     
190.33/42.16	     b#(c(x1)) = -1x1 + 1 >= -2x1 + 0 = b#(x1)
190.33/42.16	     
190.33/42.16	     b#(c(x1)) = -1x1 + 1 >= -1x1 + 1 = a#(b(x1))
190.33/42.16	     
190.33/42.16	     a(b(x1)) = x1 + 2 >= x1 = x1
190.33/42.16	     
190.33/42.16	     a(c(x1)) = 2x1 + 4 >= 2x1 + 4 = c(c(b(a(x1))))
190.33/42.16	     
190.33/42.16	     b(c(x1)) = x1 + 2 >= x1 + 2 = a(b(x1))
190.33/42.16	    problem:
190.33/42.16	     DPs:
190.33/42.16	      b#(c(x1)) -> a#(b(x1))
190.33/42.16	     TRS:
190.33/42.16	      a(b(x1)) -> x1
190.33/42.16	      a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	      b(c(x1)) -> a(b(x1))
190.33/42.16	    Restore Modifier:
190.33/42.16	     DPs:
190.33/42.16	      b#(c(x1)) -> a#(b(x1))
190.33/42.16	     TRS:
190.33/42.16	      a(b(x1)) -> x1
190.33/42.16	      a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	      b(c(x1)) -> a(b(x1))
190.33/42.16	     EDG Processor:
190.33/42.16	      DPs:
190.33/42.16	       b#(c(x1)) -> a#(b(x1))
190.33/42.16	      TRS:
190.33/42.16	       a(b(x1)) -> x1
190.33/42.16	       a(c(x1)) -> c(c(b(a(x1))))
190.33/42.16	       b(c(x1)) -> a(b(x1))
190.33/42.16	      graph:
190.33/42.16	       
190.33/42.16	      SCC Processor:
190.33/42.16	       #sccs: 0
190.33/42.16	       #rules: 0
190.33/42.16	       #arcs: 0/1
190.33/42.16	       
190.33/42.16	EOF