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


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


NO

Problem 1: 

(VAR f n x xs)
(RULES
app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs))
app(app(map,f),nil) -> nil
app(app(f,0),n) -> app(app(hd,app(app(map,f),app(app(cons,0),nil))),n)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 APP(app(map,f),app(app(cons,x),xs)) -> APP(app(cons,app(f,x)),app(app(map,f),xs))
 APP(app(map,f),app(app(cons,x),xs)) -> APP(app(map,f),xs)
 APP(app(map,f),app(app(cons,x),xs)) -> APP(cons,app(f,x))
 APP(app(map,f),app(app(cons,x),xs)) -> APP(f,x)
 APP(app(f,0),n) -> APP(app(cons,0),nil)
 APP(app(f,0),n) -> APP(app(hd,app(app(map,f),app(app(cons,0),nil))),n)
 APP(app(f,0),n) -> APP(app(map,f),app(app(cons,0),nil))
 APP(app(f,0),n) -> APP(hd,app(app(map,f),app(app(cons,0),nil)))
-> Rules:
 app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs))
 app(app(map,f),nil) -> nil
 app(app(f,0),n) -> app(app(hd,app(app(map,f),app(app(cons,0),nil))),n)

Problem 1: 

Infinite Processor:
-> Pairs:
 APP(app(map,f),app(app(cons,x),xs)) -> APP(app(cons,app(f,x)),app(app(map,f),xs))
 APP(app(map,f),app(app(cons,x),xs)) -> APP(app(map,f),xs)
 APP(app(map,f),app(app(cons,x),xs)) -> APP(cons,app(f,x))
 APP(app(map,f),app(app(cons,x),xs)) -> APP(f,x)
 APP(app(f,0),n) -> APP(app(cons,0),nil)
 APP(app(f,0),n) -> APP(app(hd,app(app(map,f),app(app(cons,0),nil))),n)
 APP(app(f,0),n) -> APP(app(map,f),app(app(cons,0),nil))
 APP(app(f,0),n) -> APP(hd,app(app(map,f),app(app(cons,0),nil)))
-> Rules:
 app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs))
 app(app(map,f),nil) -> nil
 app(app(f,0),n) -> app(app(hd,app(app(map,f),app(app(cons,0),nil))),n)
-> Pairs in cycle:
 APP(app(f,0),n) -> APP(app(cons,0),nil)

The problem is infinite.