/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 : [] --> a 
    cons : [e * f] --> f 
    f : [a * a * a] --> b 
    false : [] --> d 
    filter : [e -> d * f] --> f 
    filter2 : [d * e -> d * e * f] --> f 
    g : [c * c] --> c 
    map : [e -> e * f] --> f 
    nil : [] --> f 
    plus : [a * a] --> a 
    s : [a] --> a 
    true : [] --> d 

  Rules:

    plus(x, 0) => x 
    plus(x, s(y)) => s(plus(x, y)) 
    f(0, s(0), x) => f(x, plus(x, x), x) 
    g(x, y) => x 
    g(x, y) => y 
    map(h, nil) => nil 
    map(h, cons(x, y)) => cons(h x, map(h, y)) 
    filter(h, nil) => nil 
    filter(h, cons(x, y)) => filter2(h x, h, x, y) 
    filter2(true, h, x, y) => cons(x, filter(h, y)) 
    filter2(false, h, x, y) => filter(h, y) 

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