/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) 0 * V => 0
 (fun times>0) >>True
Checking  (4) s(W) * P => (W * P) + P
 (fun times>plus)
 (fun times=times) subterm comparison of args w. LR LR
 (meta W)[is acc in s(W),P] [is positive in s(W)] [is acc in W] 
 (meta P)[is acc in s(W),P] [is positive in s(W)] [is acc in P] 
 (meta P)[is acc in s(W),P] [is positive in s(W)] [is acc in P]  >>True
Checking  (5) comp(F1,Z1,U1) => F1[Z1[U1]]
 (meta F1)[is acc in F1,Z1,U1] [is acc in F1] 
 (meta Z1)[is acc in F1,Z1,U1] [is acc in Z1] 
 (meta U1)[is acc in F1,Z1,U1] [is acc in U1]  >>True
Checking  (6) twice(H1) => H1<>H1
 (fun twice>comp)
 (meta H1)[is acc in H1] [is acc in H1] 
 (meta H1)[is acc in H1] [is acc in H1]  >>True
#SN!
******** Signature ********
 0 : a
 comp : ((b -> b),(b -> b),b) -> b
 plus : (a,a) -> a
 s : a -> a
 times : (a,a) -> a
 twice : ((b -> b),b) -> b
******** Computation Rules ********
 (1)  0 + X => X
 (2)  s(Y) + U => s(Y + U)
 (3)  0 * V => 0
 (4)  s(W) * P => (W * P) + P
 (5)  comp(F1,Z1,U1) => F1[Z1[U1]]
 (6)  twice(H1) => H1<>H1

YES