/export/starexec/sandbox/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
We consider the system theBenchmark.

We are asked to determine termination of the following first-order TRS.

  app : [o * o] --> o 
  branch : [] --> o 
  leaf : [] --> o 
  mapbt : [] --> o 

  app(app(mapbt, X), app(leaf, Y)) => app(leaf, app(X, Y)) 
  app(app(mapbt, X), app(app(app(branch, Y), Z), U)) => app(app(app(branch, app(X, Y)), app(app(mapbt, X), Z)), app(app(mapbt, X), U)) 

We use the dependency pair framework as described in [Kop12, Ch. 6/7], with static dependency pairs (see [KusIsoSakBla09] and the adaptation for AFSMs in [Kop12, Ch. 7.8]).

We thus obtain the following dependency pair problem (P_0, R_0, minimal, formative):

  Dependency Pairs P_0:

    0] app#(app(mapbt, X), app(leaf, Y)) =#> app#(leaf, app(X, Y))   
    1] app#(app(mapbt, X), app(leaf, Y)) =#> app#(X, Y)   
    2] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(app(branch, app(X, Y)), app(app(mapbt, X), Z)), app(app(mapbt, X), U))   
    3] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(branch, app(X, Y)), app(app(mapbt, X), Z))   
    4] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(branch, app(X, Y))   
    5] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(X, Y)   
    6] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(mapbt, X), Z)   
    7] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(mapbt, X)   
    8] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(mapbt, X), U)   
    9] app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(mapbt, X)   

  Rules R_0:

    app(app(mapbt, X), app(leaf, Y)) => app(leaf, app(X, Y)) 
    app(app(mapbt, X), app(app(app(branch, Y), Z), U)) => app(app(app(branch, app(X, Y)), app(app(mapbt, X), Z)), app(app(mapbt, X), U)) 

Thus, the original system is terminating if (P_0, R_0, minimal, formative) is finite.

We consider the dependency pair problem (P_0, R_0, minimal, formative).

We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows:

    * 0 :  
    * 1 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 
    * 2 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 
    * 3 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 
    * 4 :  
    * 5 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 
    * 6 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 
    * 7 :  
    * 8 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 
    * 9 :  

This graph has the following strongly connected components:

  P_1:

    app#(app(mapbt, X), app(leaf, Y)) =#> app#(X, Y)   
    app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(app(branch, app(X, Y)), app(app(mapbt, X), Z)), app(app(mapbt, X), U))   
    app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(branch, app(X, Y)), app(app(mapbt, X), Z))   
    app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(X, Y)   
    app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(mapbt, X), Z)   
    app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(mapbt, X), U)   

By [Kop12, Thm. 7.31], we may replace any dependency pair problem (P_0, R_0, m, f) by (P_1, R_0, m, f).

Thus, the original system is terminating if (P_1, R_0, minimal, formative) is finite.

We consider the dependency pair problem (P_1, R_0, minimal, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  app#(app(mapbt, X), app(leaf, Y)) >? app#(X, Y) 
  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) >? app#(app(app(branch, app(X, Y)), app(app(mapbt, X), Z)), app(app(mapbt, X), U)) 
  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) >? app#(app(branch, app(X, Y)), app(app(mapbt, X), Z)) 
  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) >? app#(X, Y) 
  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) >? app#(app(mapbt, X), Z) 
  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) >? app#(app(mapbt, X), U) 
  app(app(mapbt, X), app(leaf, Y)) >= app(leaf, app(X, Y)) 
  app(app(mapbt, X), app(app(app(branch, Y), Z), U)) >= app(app(app(branch, app(X, Y)), app(app(mapbt, X), Z)), app(app(mapbt, X), U)) 

We orient these requirements with a polynomial interpretation in the natural numbers.

The following interpretation satisfies the requirements:

  app = \y0y1.2y0 + y0y1 
  app# = \y0y1.y0 
  branch = 0 
  leaf = 0 
  mapbt = 1 

Using this interpretation, the requirements translate to:

  [[app#(app(mapbt, _x0), app(leaf, _x1))]] = 2 + x0 > x0 = [[app#(_x0, _x1)]] 
  [[app#(app(mapbt, _x0), app(app(app(branch, _x1), _x2), _x3))]] = 2 + x0 > 0 = [[app#(app(app(branch, app(_x0, _x1)), app(app(mapbt, _x0), _x2)), app(app(mapbt, _x0), _x3))]] 
  [[app#(app(mapbt, _x0), app(app(app(branch, _x1), _x2), _x3))]] = 2 + x0 > 0 = [[app#(app(branch, app(_x0, _x1)), app(app(mapbt, _x0), _x2))]] 
  [[app#(app(mapbt, _x0), app(app(app(branch, _x1), _x2), _x3))]] = 2 + x0 > x0 = [[app#(_x0, _x1)]] 
  [[app#(app(mapbt, _x0), app(app(app(branch, _x1), _x2), _x3))]] = 2 + x0 >= 2 + x0 = [[app#(app(mapbt, _x0), _x2)]] 
  [[app#(app(mapbt, _x0), app(app(app(branch, _x1), _x2), _x3))]] = 2 + x0 >= 2 + x0 = [[app#(app(mapbt, _x0), _x3)]] 
  [[app(app(mapbt, _x0), app(leaf, _x1))]] = 4 + 2x0 >= 0 = [[app(leaf, app(_x0, _x1))]] 
  [[app(app(mapbt, _x0), app(app(app(branch, _x1), _x2), _x3))]] = 4 + 2x0 >= 0 = [[app(app(app(branch, app(_x0, _x1)), app(app(mapbt, _x0), _x2)), app(app(mapbt, _x0), _x3))]] 

By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_1, R_0, minimal, formative) by (P_2, R_0, minimal, formative), where P_2 consists of:

  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(mapbt, X), Z)   
  app#(app(mapbt, X), app(app(app(branch, Y), Z), U)) =#> app#(app(mapbt, X), U)   

Thus, the original system is terminating if (P_2, R_0, minimal, formative) is finite.

We consider the dependency pair problem (P_2, R_0, minimal, formative).

We apply the subterm criterion with the following projection function:

  nu(app#) = 2 

Thus, we can orient the dependency pairs as follows:

  nu(app#(app(mapbt, X), app(app(app(branch, Y), Z), U))) = app(app(app(branch, Y), Z), U) |> Z = nu(app#(app(mapbt, X), Z)) 
  nu(app#(app(mapbt, X), app(app(app(branch, Y), Z), U))) = app(app(app(branch, Y), Z), U) |> U = nu(app#(app(mapbt, X), U)) 

By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_2, R_0, minimal, f) by ({}, R_0, minimal, f).  By the empty set processor [Kop12, Thm. 7.15] this problem may be immediately removed.

As all dependency pair problems were succesfully simplified with sound (and complete) processors until nothing remained, we conclude termination.


+++ Citations +++

[Kop12]  C. Kop.  Higher Order Termination.  PhD Thesis, 2012.
[KusIsoSakBla09]  K. Kusakari, Y. Isogai, M. Sakai, and F. Blanqui.  Static Dependency Pair Method Based On Strong Computability for Higher-Order Rewrite Systems.  In volume 92(10) of IEICE Transactions on Information and Systems.  2007--2015, 2009.