4 let n = Random.int (List.length l) in
9 let n1 = List.length l1 in
10 let n = Random.int (n1 + List.length l2) in
11 if n >= n1 then List.nth l2 (n - n1) else List.nth l1 n
18 | x::xs -> x :: (take xs (n-1))
22 let rec aux n inerts lams =
23 if n = 0 then take (Util.sort_uniq inerts) 5
24 else let inerts, lams = if Random.int 2 = 0
25 then inerts, ("(" ^ acaso vars ^ ". " ^ acaso2 inerts lams ^ ")") :: lams
26 else ("(" ^ acaso inerts ^ " " ^ acaso2 inerts lams^ ")") :: inerts, lams
27 in aux (n-1) inerts lams
37 | x1::x2::xs -> let a, b = take' xs (n-1) in x1::a,x2::b in
38 let rec aux n inerts lams =
39 if n = 0 then List.hd inerts, take' (Util.sort_uniq (List.tl inerts)) 5
40 else let inerts, lams = if Random.int 2 = 0
41 then inerts, ("(" ^ acaso vars ^ ". " ^ acaso2 inerts lams ^ ")") :: lams
42 else ("(" ^ acaso inerts ^ " " ^ acaso2 inerts lams^ ")") :: inerts, lams
43 in aux (n-1) inerts lams
49 prerr_endline "\n*************************** NEW TEST ***************************";
51 if n > 0 then repeat f (n-1)
54 (* let call_main3 tms =
56 List.iter prerr_endline tms; prerr_newline ();
57 ) in Lambda3.main [Lambda3.magic tms ["*"]]
59 let call_main4 div convs nums =
61 (match div with Some div -> prerr_endline ("DIV: " ^ div) | None -> ());
62 print_endline "CONV:"; List.iter prerr_endline convs;
63 print_endline "NUMS:"; List.iter prerr_endline nums;
65 ) in Lambda4.solve (Lambda4.problem_of div convs nums)
72 let vars = ["x"; "y"; "z"; "v" ; "w"; "a"; "b"; "c"] in
74 (* let open Parser in *)
76 (* if three then repeat (fun _ ->
77 let tms = test3 complex vars in
82 let div, (conv, nums) = test4 complex vars in
83 call_main4 (Some div) conv nums
87 prerr_endline "\n---- ALL TESTS COMPLETED ----"