[Bool] it is LRA that should decide on its literals if fourier needs it

src_colibri2/theories/LRA/fourier.ml

@@ -259,7 +259,8 @@ let converter d (f:Ground.t) =
     IArray.iter ~f:attach args;
     Egraph.attach_value d (Ground.node f) Boolean.dom Daemon.key ();
     Datastructure.Push.push comparisons d f;
-    Egraph.register_delayed_event d Daemon.key ()
+    Egraph.register_delayed_event d Daemon.key ();
+    Egraph.register_decision d (Boolean.chobool (Ground.node f))
   | _ -> ()
 
 let init env =

src_colibri2/theories/bool/boolean.ml

@@ -323,9 +323,6 @@ let converter d (f:Ground.t) =
   | { app = {builtin = Expr.False}; tyargs = []; args; _ } ->
     assert ( IArray.is_empty args);
     reg _false
-  | { ty; _ }
-    when Ground.Ty.equal ty Ground.Ty.bool  ->
-    Egraph.register_decision d (chobool res)
   | _ -> ()