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


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


MAYBE
We consider the system theBenchmark.

  Alphabet:

    0 : [] --> a 
    1 : [] --> a 
    2 : [] --> a 
    cons : [d * e] --> e 
    f : [a * a * a] --> a 
    false : [] --> c 
    filter : [d -> c * e] --> e 
    filter2 : [c * d -> c * d * e] --> e 
    g : [b * b * b] --> b 
    map : [d -> d * e] --> e 
    nil : [] --> e 
    true : [] --> c 

  Rules:

    f(0, 1, x) => f(x, x, x) 
    f(x, y, z) => 2 
    0 => 2 
    1 => 2 
    g(x, x, y) => y 
    g(x, y, y) => x 
    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).