/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: s, z
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) z + X => X
 (meta X)[is acc in z,X] [is positive in z] [is acc in X]  >>True
Checking  (2) s(Y) + U => Y + s(U)
 (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] 
 (fun plus>s)
 (meta U)[is acc in s(Y),U] [is positive in s(Y)] [is acc in U]  >>True
Checking  (3) (V + W) + P => V + (W + P)
 (fun plus=plus) subterm comparison of args w. LR LR
 (meta V)[is acc in V + W,P] [is positive in V + W] [is acc in V] 
 (fun plus=plus) subterm comparison of args w. LR LR
 (meta W)[is acc in V + W,P] [is positive in V + W] [is acc in W] 
 (meta P)[is acc in V + W,P] [is positive in V + W] [is acc in P]  >>True
Checking  (4) mult(z,X1) => z
 (fun mult>z) >>True
Checking  (5) mult(s(Y1),U1) => mult(Y1,U1) + U1
 (fun mult>plus)
 (fun mult=mult) subterm comparison of args w. LR LR
 (meta Y1)[is acc in s(Y1),U1] [is positive in s(Y1)] [is acc in Y1] 
 (meta U1)[is acc in s(Y1),U1] [is positive in s(Y1)] [is acc in U1] 
 (meta U1)[is acc in s(Y1),U1] [is positive in s(Y1)] [is acc in U1]  >>True
Checking  (6) mult(V1 + W1,P1) => mult(V1,P1) + mult(W1,P1)
 (fun mult>plus)
 (fun mult=mult) subterm comparison of args w. LR LR
 (meta V1)[is acc in V1 + W1,P1] [is positive in V1 + W1] [is acc in V1] 
 (meta P1)[is acc in V1 + W1,P1] [is positive in V1 + W1] [is acc in P1] 
 (fun mult=mult) subterm comparison of args w. LR LR
 (meta W1)[is acc in V1 + W1,P1] [is positive in V1 + W1] [is acc in W1] 
 (meta P1)[is acc in V1 + W1,P1] [is positive in V1 + W1] [is acc in P1]  >>True
#SN!
******** Signature ********
 mult : (N,N) -> N
 plus : (N,N) -> N
 s : N -> N
 z : N
******** Computation Rules ********
 (1)  z + X => X
 (2)  s(Y) + U => Y + s(U)
 (3)  (V + W) + P => V + (W + P)
 (4)  mult(z,X1) => z
 (5)  mult(s(Y1),U1) => mult(Y1,U1) + U1
 (6)  mult(V1 + W1,P1) => mult(V1,P1) + mult(W1,P1)

YES