/export/starexec/sandbox2/solver/bin/starexec_run_HigherOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


MAYBE
We consider the system theBenchmark.

  Alphabet:

    0 : [] --> nat 
    app : [list * list] --> list 
    cons : [nat * list] --> list 
    head : [list] --> nat 
    hrepeat : [nat * list -> list * list] --> list 
    hshuffle : [list] --> list 
    nil : [] --> list 
    reverse : [list] --> list 
    s : [nat] --> nat 
    shuffle : [list] --> list 
    tail : [list] --> list 
    uhalf : [nat] --> nat 

  Rules:

    app(nil, x) => x 
    app(cons(x, y), z) => cons(x, app(y, z)) 
    reverse(nil) => nil 
    reverse(cons(x, y)) => app(reverse(y), cons(x, nil)) 
    shuffle(nil) => nil 
    shuffle(cons(x, y)) => cons(x, shuffle(reverse(y))) 
    uhalf(0) => 0 
    uhalf(s(0)) => s(0) 
    uhalf(s(s(x))) => s(uhalf(x)) 
    hrepeat(0, f, x) => x 
    hrepeat(s(x), f, y) => hrepeat(uhalf(x), f, f y) 
    tail(cons(x, y)) => y 
    head(cons(x, y)) => x 
    hshuffle(x) => hrepeat(head(x), /\y.shuffle(y), tail(x)) 

This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).