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


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


YES

******** General Schema criterion ********
Found constructors: 0, s
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) 0 + X => X
 (meta X)[is acc in 0,X] [is positive in 0] [is acc in X]  >>True
Checking  (2) s(Y) + U => s(Y + U)
 (fun plus>s)
 (fun plus=plus) subterm comparison of args w. LR LR
 (meta Y)[is acc in s(Y),U] [is positive in s(Y)] [is acc in Y] 
 (meta U)[is acc in s(Y),U] [is positive in s(Y)] [is acc in U]  >>True
Checking  (3) curry(H,W,P) => H[W,P]
 (meta H)[is acc in H,W,P] [is acc in H] 
 (meta W)[is acc in H,W,P] [is acc in W] 
 (meta P)[is acc in H,W,P] [is acc in P]  >>True
Checking  (4) add => curry(plus)
 (fun add>curry)
 (fun add>plus) >>True
#SN!
******** Signature ********
 0 : a
 add : (a,a) -> a
 curry : (((a,a) -> a),a,a) -> a
 plus : (a,a) -> a
 s : a -> a
******** Computation Rules ********
 (1)  0 + X => X
 (2)  s(Y) + U => s(Y + U)
 (3)  curry(H,W,P) => H[W,P]
 (4)  add => curry(plus)

YES