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


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


YES

******** General Schema criterion ********
Found constructors: cons, nil, true
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) if(true,X,Y) => X
 (meta X)[is acc in true,X,Y] [is positive in true] [is acc in X]  >>True
Checking  (2) if(true,U,V) => V
 (meta V)[is acc in true,U,V] [is positive in true] [is acc in V]  >>True
Checking  (3) takeWhile(I,nil) => nil
 (fun takeWhile>nil) >>True
Checking  (4) takeWhile(J,cons(X1,Y1)) => if(J[X1],cons(X1,takeWhile(J,Y1)),nil)
 (fun takeWhile>if)
 (meta J)[is acc in J,cons(X1,Y1)] [is acc in J] 
 (meta X1)[is acc in J,cons(X1,Y1)] [is positive in cons(X1,Y1)] [is acc in X1] 
 (fun takeWhile>cons)
 (meta X1)[is acc in J,cons(X1,Y1)] [is positive in cons(X1,Y1)] [is acc in X1] 
 (fun takeWhile=takeWhile) subterm comparison of args w. LR LR
 (meta J)[is acc in J,cons(X1,Y1)] [is acc in J] 
 (meta Y1)[is acc in J,cons(X1,Y1)] [is positive in cons(X1,Y1)] [is acc in Y1] 
 (fun takeWhile>nil) >>True
Checking  (5) dropWhile(G1,nil) => nil
 (fun dropWhile>nil) >>True
Checking  (6) dropWhile(H1,cons(W1,P1)) => if(H1[W1],dropWhile(H1,P1),cons(W1,P1))
 (fun dropWhile>if)
 (meta H1)[is acc in H1,cons(W1,P1)] [is acc in H1] 
 (meta W1)[is acc in H1,cons(W1,P1)] [is positive in cons(W1,P1)] [is acc in W1] 
 (fun dropWhile=dropWhile) subterm comparison of args w. LR LR
 (meta H1)[is acc in H1,cons(W1,P1)] [is acc in H1] 
 (meta P1)[is acc in H1,cons(W1,P1)] [is positive in cons(W1,P1)] [is acc in P1] 
 (fun dropWhile>cons)
 (meta W1)[is acc in H1,cons(W1,P1)] [is positive in cons(W1,P1)] [is acc in W1] 
 (meta P1)[is acc in H1,cons(W1,P1)] [is positive in cons(W1,P1)] [is acc in P1]  >>True
#SN!
******** Signature ********
 cons : (a,c) -> c
 dropWhile : ((a -> b),c) -> c
 if : (b,c,c) -> c
 nil : c
 takeWhile : ((a -> b),c) -> c
 true : b
******** Computation Rules ********
 (1)  if(true,X,Y) => X
 (2)  if(true,U,V) => V
 (3)  takeWhile(I,nil) => nil
 (4)  takeWhile(J,cons(X1,Y1)) => if(J[X1],cons(X1,takeWhile(J,Y1)),nil)
 (5)  dropWhile(G1,nil) => nil
 (6)  dropWhile(H1,cons(W1,P1)) => if(H1[W1],dropWhile(H1,P1),cons(W1,P1))

YES