/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: 0, cons, nil, s
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) sort(F,Z,nil) => nil
 (fun sort>nil) >>True
Checking  (2) sort(G,H,cons(W,P)) => insert(G,H,sort(G,H,P),W)
 (fun sort>insert)
 (meta G)[is acc in G,H,cons(W,P)] [is acc in G] 
 (meta H)[is acc in G,H,cons(W,P)] [is acc in H] 
 (fun sort=sort) subterm comparison of args w. LR LR
 (meta G)[is acc in G,H,cons(W,P)] [is acc in G] 
 (meta H)[is acc in G,H,cons(W,P)] [is acc in H] 
 (meta P)[is acc in G,H,cons(W,P)] [is positive in cons(W,P)] [is acc in P] 
 (meta W)[is acc in G,H,cons(W,P)] [is positive in cons(W,P)] [is acc in W]  >>True
Checking  (3) insert(F1,Z1,nil,U1) => cons(U1,nil)
 (fun insert>cons)
 (meta U1)[is acc in F1,Z1,nil,U1] [is positive in nil] [is acc in U1] 
 (fun insert>nil) >>True
Checking  (4) insert(H1,I1,cons(P1,Y2),X2) => cons(H1[P1,X2],insert(H1,I1,Y2,I1[P1,X2]))
 (fun insert>cons)
 (meta H1)[is acc in H1,I1,cons(P1,Y2),X2] [is acc in H1] 
 (meta P1)[is acc in H1,I1,cons(P1,Y2),X2] [is positive in cons(P1,Y2)] [is acc in P1] 
 (meta X2)[is acc in H1,I1,cons(P1,Y2),X2] [is positive in cons(P1,Y2)] [is acc in X2] 
 (fun insert=insert) subterm comparison of args w. LR LR
 (meta H1)[is acc in H1,I1,cons(P1,Y2),X2] [is acc in H1] 
 (meta I1)[is acc in H1,I1,cons(P1,Y2),X2] [is acc in I1] 
 (meta Y2)[is acc in H1,I1,cons(P1,Y2),X2] [is positive in cons(P1,Y2)] [is acc in Y2] 
 (meta I1)[is acc in H1,I1,cons(P1,Y2),X2] [is acc in I1] 
 (meta P1)[is acc in H1,I1,cons(P1,Y2),X2] [is positive in cons(P1,Y2)] [is acc in P1] 
 (meta X2)[is acc in H1,I1,cons(P1,Y2),X2] [is positive in cons(P1,Y2)] [is acc in X2]  >>True
Checking  (5) max(0,U2) => U2
 (meta U2)[is acc in 0,U2] [is positive in 0] [is acc in U2]  >>True
Checking  (6) max(V2,0) => V2
 (meta V2)[is acc in V2,0] [is acc in V2]  >>True
Checking  (7) max(s(W2),s(P2)) => max(W2,P2)
 (fun max=max) subterm comparison of args w. LR LR
 (meta W2)[is acc in s(W2),s(P2)] [is positive in s(W2)] [is acc in W2] 
 (meta P2)[is acc in s(W2),s(P2)] [is positive in s(W2)] [is positive in s(P2)] [is acc in P2]  >>True
Checking  (8) min(0,X3) => 0
 (fun min>0) >>True
Checking  (9) min(Y3,0) => 0
 (fun min>0) >>True
Checking  (10) min(s(U3),s(V3)) => min(U3,V3)
 (fun min=min) subterm comparison of args w. LR LR
 (meta U3)[is acc in s(U3),s(V3)] [is positive in s(U3)] [is acc in U3] 
 (meta V3)[is acc in s(U3),s(V3)] [is positive in s(U3)] [is positive in s(V3)] [is acc in V3]  >>True
Checking  (11) asort(W3) => sort(min,max,W3)
 (fun asort>sort)
 (fun asort>min)
 (fun asort>max)
 (meta W3)[is acc in W3] [is acc in W3]  >>True
Checking  (12) dsort(P3) => sort(max,min,P3)
 (fun dsort>sort)
 (fun dsort>max)
 (fun dsort>min)
 (meta P3)[is acc in P3] [is acc in P3]  >>True
#SN!
******** Signature ********
 0 : a
 asort : b -> b
 cons : (a,b) -> b
 dsort : b -> b
 insert : (((a,a) -> a),((a,a) -> a),b,a) -> b
 max : (a,a) -> a
 min : (a,a) -> a
 nil : b
 s : a -> a
 sort : (((a,a) -> a),((a,a) -> a),b) -> b
******** Computation Rules ********
 (1)  sort(F,Z,nil) => nil
 (2)  sort(G,H,cons(W,P)) => insert(G,H,sort(G,H,P),W)
 (3)  insert(F1,Z1,nil,U1) => cons(U1,nil)
 (4)  insert(H1,I1,cons(P1,Y2),X2) => cons(H1[P1,X2],insert(H1,I1,Y2,I1[P1,X2]))
 (5)  max(0,U2) => U2
 (6)  max(V2,0) => V2
 (7)  max(s(W2),s(P2)) => max(W2,P2)
 (8)  min(0,X3) => 0
 (9)  min(Y3,0) => 0
 (10)  min(s(U3),s(V3)) => min(U3,V3)
 (11)  asort(W3) => sort(min,max,W3)
 (12)  dsort(P3) => sort(max,min,P3)

YES