remove some prints and warnings

rt/analysis/WCET_is_pWCET.v

@@ -145,5 +145,3 @@ Section WCETisAxiomaticPWCET.
   Qed.
 
 End WCETisAxiomaticPWCET.
-
-Print Assumptions WCET_is_axiomatic_pWCET.

rt/analysis/axiomatic_pWCET_full.v

@@ -105,5 +105,3 @@ Section MainLemma.
   Qed.
 
 End MainLemma.
-
-Print Assumptions probabilistic_rt_monotonicity_of_iid_pWCET.

rt/analysis/pRTA/pRTA.v

@@ -470,5 +470,3 @@ Section WCDFPIsBounded.
   Qed.
 
 End WCDFPIsBounded.
-
-Print Assumptions probabilistic_rta_fp.

rt/analysis/work_bound.v

@@ -33,9 +33,9 @@ Section PrTaskWorkloadBoundedNthCost.
 
   (** Assume that job costs are independent of the (prob.) arrival sequence. *)
   Let ξpart := partition_on_ξ μ : Ω_partition.
-  Hypothesis job_costs_independent_arr_seq :
+  Hypothesis H_job_costs_independent_arr_seq :
     let ξpart := partition_on_ξ μ : Ω_partition in
-    forall (ξ : I ξpart) `{!PosProb μ (ξpart◁{ξ})} (jobs : seq Job),
+    forall (ξ : I ξpart) `(!PosProb μ (ξpart◁{ξ})) (jobs : seq Job),
       indep2
         (mkRvar μ (fun ω => [seq job_cost j ω | j <- jobs]))
         (mkRvar μ (fun ω => ξpart◁{ξ} ω)).
@@ -61,7 +61,7 @@ Section PrTaskWorkloadBoundedNthCost.
       { by rewrite //= in IHjobs; rewrite //= !big_cons //= IHjobs. }
     }
     eapply indep2_fn_extl; first by intros; apply: EQ.
-    by apply job_costs_independent_arr_seq, PosProb0.
+    by apply H_job_costs_independent_arr_seq, PosProb0.
   Qed.