Toniolo and Linder, Equation (13)

Percentage Accurate: 50.9% → 62.4%

Time: 10.9s

Alternatives: 20

Speedup: 1.4×

Specification

Math

\[\begin{array}{l} \\ \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (sqrt
  (*
   (* (* 2.0 n) U)
   (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}

Python

def code(n, U, t, l, Om, U_42_):
	return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))

Julia

function code(n, U, t, l, Om, U_42_)
	return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))))
end

MATLAB

function tmp = code(n, U, t, l, Om, U_42_)
	tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_)))));
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Initial Program: 50.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (sqrt
  (*
   (* (* 2.0 n) U)
   (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}

Python

def code(n, U, t, l, Om, U_42_):
	return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))

Julia

function code(n, U, t, l, Om, U_42_)
	return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))))
end

MATLAB

function tmp = code(n, U, t, l, Om, U_42_)
	tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_)))));
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 62.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\ t_2 := \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}\\ \mathbf{if}\;t\_1 \leq 10^{-244}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+306}:\\ \;\;\;\;\sqrt{t\_1}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (*
          (* (* 2.0 n) U)
          (-
           (- t (* 2.0 (/ (* l l) Om)))
           (* (* n (pow (/ l Om) 2.0)) (- U U*)))))
        (t_2
         (sqrt
          (*
           (+ n n)
           (*
            U
            (-
             (fma -2.0 (* l (/ l Om)) t)
             (* n (* (* (/ l Om) (/ l Om)) (- U U*)))))))))
   (if (<= t_1 1e-244)
     t_2
     (if (<= t_1 2e+306)
       (sqrt t_1)
       (if (<= t_1 INFINITY)
         t_2
         (sqrt
          (*
           -2.0
           (* U (* (* l l) (* n (/ (+ 2.0 (/ (* n (- U U*)) Om)) Om)))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
	double t_2 = sqrt(((n + n) * (U * (fma(-2.0, (l * (l / Om)), t) - (n * (((l / Om) * (l / Om)) * (U - U_42_)))))));
	double tmp;
	if (t_1 <= 1e-244) {
		tmp = t_2;
	} else if (t_1 <= 2e+306) {
		tmp = sqrt(t_1);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = sqrt((-2.0 * (U * ((l * l) * (n * ((2.0 + ((n * (U - U_42_)) / Om)) / Om))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))
	t_2 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(fma(-2.0, Float64(l * Float64(l / Om)), t) - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(U - U_42_)))))))
	tmp = 0.0
	if (t_1 <= 1e-244)
		tmp = t_2;
	elseif (t_1 <= 2e+306)
		tmp = sqrt(t_1);
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(l * l) * Float64(n * Float64(Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om)) / Om))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision] - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, 1e-244], t$95$2, If[LessEqual[t$95$1, 2e+306], N[Sqrt[t$95$1], $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[Sqrt[N[(-2.0 * N[(U * N[(N[(l * l), $MachinePrecision] * N[(n * N[(N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.9999999999999993e-245 or 2.00000000000000003e306 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 29.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 41.5%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   if 9.9999999999999993e-245 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 2.00000000000000003e306

   1. Initial program 97.9%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in l around inf

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \color{blue}{\left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \color{blue}{\left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \color{blue}{\left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)}\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \color{blue}{\left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)}\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \color{blue}{\frac{1}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{\color{blue}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      11. lift--.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      12. pow2 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

      13. lift-*.f64 32.9

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

   6. Applied rewrites 32.9%

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)}} \]

   7. Taylor expanded in Om around inf

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      5. lift-*.f64 38.8

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

   9. Applied rewrites 38.8%

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 57.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\\ t_2 := \left(2 \cdot n\right) \cdot U\\ t_3 := t\_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - t\_1\right)\\ \mathbf{if}\;t\_3 \leq 10^{-244}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot U*\right)\right)\right)\right)}\\ \mathbf{elif}\;t\_3 \leq 500000:\\ \;\;\;\;\sqrt{t\_2 \cdot \left(\left(-\frac{\mathsf{fma}\left(\ell \cdot \ell, \frac{\left(U - U*\right) \cdot n}{Om}, \left(\ell \cdot \ell\right) \cdot 2\right)}{Om}\right) + t\right)}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\sqrt{t\_2 \cdot \left(t - t\_1\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (* (* n (pow (/ l Om) 2.0)) (- U U*)))
        (t_2 (* (* 2.0 n) U))
        (t_3 (* t_2 (- (- t (* 2.0 (/ (* l l) Om))) t_1))))
   (if (<= t_3 1e-244)
     (sqrt (* (+ n n) (* U (- t (* n (* (* (/ l Om) (/ l Om)) (* -1.0 U*)))))))
     (if (<= t_3 500000.0)
       (sqrt
        (*
         t_2
         (+ (- (/ (fma (* l l) (/ (* (- U U*) n) Om) (* (* l l) 2.0)) Om)) t)))
       (if (<= t_3 INFINITY)
         (sqrt (* t_2 (- t t_1)))
         (sqrt
          (*
           -2.0
           (* U (* (* l l) (* n (/ (+ 2.0 (/ (* n (- U U*)) Om)) Om)))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = (n * pow((l / Om), 2.0)) * (U - U_42_);
	double t_2 = (2.0 * n) * U;
	double t_3 = t_2 * ((t - (2.0 * ((l * l) / Om))) - t_1);
	double tmp;
	if (t_3 <= 1e-244) {
		tmp = sqrt(((n + n) * (U * (t - (n * (((l / Om) * (l / Om)) * (-1.0 * U_42_)))))));
	} else if (t_3 <= 500000.0) {
		tmp = sqrt((t_2 * (-(fma((l * l), (((U - U_42_) * n) / Om), ((l * l) * 2.0)) / Om) + t)));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = sqrt((t_2 * (t - t_1)));
	} else {
		tmp = sqrt((-2.0 * (U * ((l * l) * (n * ((2.0 + ((n * (U - U_42_)) / Om)) / Om))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))
	t_2 = Float64(Float64(2.0 * n) * U)
	t_3 = Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - t_1))
	tmp = 0.0
	if (t_3 <= 1e-244)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(-1.0 * U_42_)))))));
	elseif (t_3 <= 500000.0)
		tmp = sqrt(Float64(t_2 * Float64(Float64(-Float64(fma(Float64(l * l), Float64(Float64(Float64(U - U_42_) * n) / Om), Float64(Float64(l * l) * 2.0)) / Om)) + t)));
	elseif (t_3 <= Inf)
		tmp = sqrt(Float64(t_2 * Float64(t - t_1)));
	else
		tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(l * l) * Float64(n * Float64(Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om)) / Om))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 1e-244], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(-1.0 * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, 500000.0], N[Sqrt[N[(t$95$2 * N[((-N[(N[(N[(l * l), $MachinePrecision] * N[(N[(N[(U - U$42$), $MachinePrecision] * n), $MachinePrecision] / Om), $MachinePrecision] + N[(N[(l * l), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]) + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * N[(t - t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(U * N[(N[(l * l), $MachinePrecision] * N[(n * N[(N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.9999999999999993e-245

   1. Initial program 23.5%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 41.1%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 36.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

   7. Taylor expanded in U around 0

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 36.1

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot \color{blue}{U*}\right)\right)\right)\right)} \]

   9. Applied rewrites 36.1%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]

   if 9.9999999999999993e-245 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 5e5

   1. Initial program 96.9%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around -inf

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(t + -1 \cdot \frac{\frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om} - -2 \cdot {\ell}^{2}}{Om}\right)}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-1 \cdot \frac{\frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om} - -2 \cdot {\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-1 \cdot \frac{\frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om} - -2 \cdot {\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

   4. Applied rewrites 90.2%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(\left(-\frac{\mathsf{fma}\left(\ell \cdot \ell, \frac{\left(U - U*\right) \cdot n}{Om}, \left(\ell \cdot \ell\right) \cdot 2\right)}{Om}\right) + t\right)}} \]

   if 5e5 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 59.2%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{t} - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]
   3. Step-by-step derivation

   4. Applied rewrites 56.9%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{t} - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in l around inf

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \color{blue}{\left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \color{blue}{\left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \color{blue}{\left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)}\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \color{blue}{\left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)}\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \color{blue}{\frac{1}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{\color{blue}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      11. lift--.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      12. pow2 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

      13. lift-*.f64 32.9

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

   6. Applied rewrites 32.9%

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)}} \]

   7. Taylor expanded in Om around inf

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      5. lift-*.f64 38.8

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

   9. Applied rewrites 38.8%

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 56.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right) \leq \infty:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<=
      (*
       (* (* 2.0 n) U)
       (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))
      INFINITY)
   (sqrt
    (*
     (+ n n)
     (*
      U
      (-
       (fma -2.0 (* l (/ l Om)) t)
       (* n (* (* (/ l Om) (/ l Om)) (- U U*)))))))
   (sqrt
    (* -2.0 (* U (* (* l l) (* n (/ (+ 2.0 (/ (* n (- U U*)) Om)) Om))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if ((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))) <= ((double) INFINITY)) {
		tmp = sqrt(((n + n) * (U * (fma(-2.0, (l * (l / Om)), t) - (n * (((l / Om) * (l / Om)) * (U - U_42_)))))));
	} else {
		tmp = sqrt((-2.0 * (U * ((l * l) * (n * ((2.0 + ((n * (U - U_42_)) / Om)) / Om))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	tmp = 0.0
	if (Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) <= Inf)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(fma(-2.0, Float64(l * Float64(l / Om)), t) - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(U - U_42_)))))));
	else
		tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(l * l) * Float64(n * Float64(Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om)) / Om))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision] - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(U * N[(N[(l * l), $MachinePrecision] * N[(n * N[(N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 59.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 61.1%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in l around inf

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \color{blue}{\left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \color{blue}{\left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \color{blue}{\left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)}\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \color{blue}{\left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)}\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \color{blue}{\frac{1}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{\color{blue}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      11. lift--.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      12. pow2 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

      13. lift-*.f64 32.9

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

   6. Applied rewrites 32.9%

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)}} \]

   7. Taylor expanded in Om around inf

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      5. lift-*.f64 38.8

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

   9. Applied rewrites 38.8%

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 56.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(2 \cdot n\right) \cdot U\\ t_2 := t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\ t_3 := \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot U*\right)\right)\right)\right)}\\ \mathbf{if}\;t\_2 \leq 10^{-244}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 500000:\\ \;\;\;\;\sqrt{t\_1 \cdot \left(\left(-\frac{\mathsf{fma}\left(\ell \cdot \ell, \frac{\left(U - U*\right) \cdot n}{Om}, \left(\ell \cdot \ell\right) \cdot 2\right)}{Om}\right) + t\right)}\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (* (* 2.0 n) U))
        (t_2
         (*
          t_1
          (-
           (- t (* 2.0 (/ (* l l) Om)))
           (* (* n (pow (/ l Om) 2.0)) (- U U*)))))
        (t_3
         (sqrt
          (*
           (+ n n)
           (* U (- t (* n (* (* (/ l Om) (/ l Om)) (* -1.0 U*)))))))))
   (if (<= t_2 1e-244)
     t_3
     (if (<= t_2 500000.0)
       (sqrt
        (*
         t_1
         (+ (- (/ (fma (* l l) (/ (* (- U U*) n) Om) (* (* l l) 2.0)) Om)) t)))
       (if (<= t_2 INFINITY)
         t_3
         (sqrt
          (*
           -2.0
           (* U (* (* l l) (* n (/ (+ 2.0 (/ (* n (- U U*)) Om)) Om)))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = (2.0 * n) * U;
	double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
	double t_3 = sqrt(((n + n) * (U * (t - (n * (((l / Om) * (l / Om)) * (-1.0 * U_42_)))))));
	double tmp;
	if (t_2 <= 1e-244) {
		tmp = t_3;
	} else if (t_2 <= 500000.0) {
		tmp = sqrt((t_1 * (-(fma((l * l), (((U - U_42_) * n) / Om), ((l * l) * 2.0)) / Om) + t)));
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = sqrt((-2.0 * (U * ((l * l) * (n * ((2.0 + ((n * (U - U_42_)) / Om)) / Om))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = Float64(Float64(2.0 * n) * U)
	t_2 = Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))
	t_3 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(-1.0 * U_42_)))))))
	tmp = 0.0
	if (t_2 <= 1e-244)
		tmp = t_3;
	elseif (t_2 <= 500000.0)
		tmp = sqrt(Float64(t_1 * Float64(Float64(-Float64(fma(Float64(l * l), Float64(Float64(Float64(U - U_42_) * n) / Om), Float64(Float64(l * l) * 2.0)) / Om)) + t)));
	elseif (t_2 <= Inf)
		tmp = t_3;
	else
		tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(l * l) * Float64(n * Float64(Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om)) / Om))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(-1.0 * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 1e-244], t$95$3, If[LessEqual[t$95$2, 500000.0], N[Sqrt[N[(t$95$1 * N[((-N[(N[(N[(l * l), $MachinePrecision] * N[(N[(N[(U - U$42$), $MachinePrecision] * n), $MachinePrecision] / Om), $MachinePrecision] + N[(N[(l * l), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]) + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, N[Sqrt[N[(-2.0 * N[(U * N[(N[(l * l), $MachinePrecision] * N[(n * N[(N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 9.9999999999999993e-245 or 5e5 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 50.2%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 53.7%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 48.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

   7. Taylor expanded in U around 0

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 48.1

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot \color{blue}{U*}\right)\right)\right)\right)} \]

   9. Applied rewrites 48.1%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]

   if 9.9999999999999993e-245 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 5e5

   1. Initial program 96.9%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around -inf

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(t + -1 \cdot \frac{\frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om} - -2 \cdot {\ell}^{2}}{Om}\right)}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-1 \cdot \frac{\frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om} - -2 \cdot {\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-1 \cdot \frac{\frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om} - -2 \cdot {\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

   4. Applied rewrites 90.2%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(\left(-\frac{\mathsf{fma}\left(\ell \cdot \ell, \frac{\left(U - U*\right) \cdot n}{Om}, \left(\ell \cdot \ell\right) \cdot 2\right)}{Om}\right) + t\right)}} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in l around inf

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \color{blue}{\left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \color{blue}{\left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \color{blue}{\left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)}\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \color{blue}{\left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)}\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \color{blue}{\frac{1}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{\color{blue}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      11. lift--.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      12. pow2 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

      13. lift-*.f64 32.9

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

   6. Applied rewrites 32.9%

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)}} \]

   7. Taylor expanded in Om around inf

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      5. lift-*.f64 38.8

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

   9. Applied rewrites 38.8%

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 54.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\\ t_2 := \left(2 \cdot n\right) \cdot U\\ t_3 := t\_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - t\_1\right)\\ t_4 := n \cdot \left(U - U*\right)\\ \mathbf{if}\;t\_3 \leq 5 \cdot 10^{-41}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{\left(\ell \cdot \ell\right) \cdot t\_4}{Om}\right)}{Om}\right)\right)}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\sqrt{t\_2 \cdot \left(t - t\_1\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{t\_4}{Om}}{Om}\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (* (* n (pow (/ l Om) 2.0)) (- U U*)))
        (t_2 (* (* 2.0 n) U))
        (t_3 (* t_2 (- (- t (* 2.0 (/ (* l l) Om))) t_1)))
        (t_4 (* n (- U U*))))
   (if (<= t_3 5e-41)
     (sqrt
      (*
       (+ n n)
       (* U (+ t (* -1.0 (/ (fma 2.0 (* l l) (/ (* (* l l) t_4) Om)) Om))))))
     (if (<= t_3 INFINITY)
       (sqrt (* t_2 (- t t_1)))
       (sqrt (* -2.0 (* U (* (* l l) (* n (/ (+ 2.0 (/ t_4 Om)) Om))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = (n * pow((l / Om), 2.0)) * (U - U_42_);
	double t_2 = (2.0 * n) * U;
	double t_3 = t_2 * ((t - (2.0 * ((l * l) / Om))) - t_1);
	double t_4 = n * (U - U_42_);
	double tmp;
	if (t_3 <= 5e-41) {
		tmp = sqrt(((n + n) * (U * (t + (-1.0 * (fma(2.0, (l * l), (((l * l) * t_4) / Om)) / Om))))));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = sqrt((t_2 * (t - t_1)));
	} else {
		tmp = sqrt((-2.0 * (U * ((l * l) * (n * ((2.0 + (t_4 / Om)) / Om))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))
	t_2 = Float64(Float64(2.0 * n) * U)
	t_3 = Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - t_1))
	t_4 = Float64(n * Float64(U - U_42_))
	tmp = 0.0
	if (t_3 <= 5e-41)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t + Float64(-1.0 * Float64(fma(2.0, Float64(l * l), Float64(Float64(Float64(l * l) * t_4) / Om)) / Om))))));
	elseif (t_3 <= Inf)
		tmp = sqrt(Float64(t_2 * Float64(t - t_1)));
	else
		tmp = sqrt(Float64(-2.0 * Float64(U * Float64(Float64(l * l) * Float64(n * Float64(Float64(2.0 + Float64(t_4 / Om)) / Om))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 5e-41], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t + N[(-1.0 * N[(N[(2.0 * N[(l * l), $MachinePrecision] + N[(N[(N[(l * l), $MachinePrecision] * t$95$4), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * N[(t - t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(U * N[(N[(l * l), $MachinePrecision] * N[(n * N[(N[(2.0 + N[(t$95$4 / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 4.9999999999999996e-41

   1. Initial program 54.8%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 62.3%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in Om around -inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{\left(t + -1 \cdot \frac{2 \cdot {\ell}^{2} + \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}}{Om}\right)}\right)} \]
   5. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + \color{blue}{-1 \cdot \frac{2 \cdot {\ell}^{2} + \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}}{Om}}\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \color{blue}{\frac{2 \cdot {\ell}^{2} + \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}}{Om}}\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{2 \cdot {\ell}^{2} + \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}}{\color{blue}{Om}}\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, {\ell}^{2}, \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      5. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      6. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      7. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      8. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{{\ell}^{2} \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      9. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{\left(\ell \cdot \ell\right) \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      10. lift-*.f64 N/A

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{\left(\ell \cdot \ell\right) \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      11. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{\left(\ell \cdot \ell\right) \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

      12. lift--.f64 59.8

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{\left(\ell \cdot \ell\right) \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)\right)} \]

   6. Applied rewrites 59.8%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{\left(t + -1 \cdot \frac{\mathsf{fma}\left(2, \ell \cdot \ell, \frac{\left(\ell \cdot \ell\right) \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}\right)}{Om}\right)}\right)} \]

   if 4.9999999999999996e-41 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 61.9%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{t} - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]
   3. Step-by-step derivation

   4. Applied rewrites 58.9%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{t} - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in l around inf

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \color{blue}{\left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \color{blue}{\left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \color{blue}{\left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)}\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \color{blue}{\left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)}\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \color{blue}{\frac{1}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{\color{blue}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      11. lift--.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      12. pow2 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

      13. lift-*.f64 32.9

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

   6. Applied rewrites 32.9%

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)}} \]

   7. Taylor expanded in Om around inf

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

      5. lift-*.f64 38.8

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{Om}\right)\right)\right)} \]

   9. Applied rewrites 38.8%

      \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \frac{2 + \frac{n \cdot \left(U - U*\right)}{Om}}{\color{blue}{Om}}\right)\right)\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 54.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq -1 \cdot 10^{-163}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot U*\right)\right)\right)\right)}\\ \mathbf{elif}\;n \leq 4.7 \cdot 10^{-153}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{n + n} \cdot \sqrt{U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<= n -1e-163)
   (sqrt (* (+ n n) (* U (- t (* n (* (* (/ l Om) (/ l Om)) (* -1.0 U*)))))))
   (if (<= n 4.7e-153)
     (sqrt (fma (/ (* (* (* l l) n) U) Om) -4.0 (* (* (* t n) U) 2.0)))
     (*
      (sqrt (+ n n))
      (sqrt (* U (- t (* n (* (/ (* l l) (* Om Om)) (- U U*))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (n <= -1e-163) {
		tmp = sqrt(((n + n) * (U * (t - (n * (((l / Om) * (l / Om)) * (-1.0 * U_42_)))))));
	} else if (n <= 4.7e-153) {
		tmp = sqrt(fma(((((l * l) * n) * U) / Om), -4.0, (((t * n) * U) * 2.0)));
	} else {
		tmp = sqrt((n + n)) * sqrt((U * (t - (n * (((l * l) / (Om * Om)) * (U - U_42_))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	tmp = 0.0
	if (n <= -1e-163)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(-1.0 * U_42_)))))));
	elseif (n <= 4.7e-153)
		tmp = sqrt(fma(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om), -4.0, Float64(Float64(Float64(t * n) * U) * 2.0)));
	else
		tmp = Float64(sqrt(Float64(n + n)) * sqrt(Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l * l) / Float64(Om * Om)) * Float64(U - U_42_)))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, -1e-163], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(-1.0 * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 4.7e-153], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0 + N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n + n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t - N[(n * N[(N[(N[(l * l), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if n < -9.99999999999999923e-164

   1. Initial program 53.1%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 55.5%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 54.5%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

   7. Taylor expanded in U around 0

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 54.6

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot \color{blue}{U*}\right)\right)\right)\right)} \]

   9. Applied rewrites 54.6%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]

   if -9.99999999999999923e-164 < n < 4.6999999999999999e-153

   1. Initial program 42.2%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around inf

      \[\leadsto \sqrt{\color{blue}{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} \cdot -4 + \color{blue}{2} \cdot \left(U \cdot \left(n \cdot t\right)\right)} \]

      2. lower-fma.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, \color{blue}{-4}, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      11. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      13. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

      14. lower-*.f64 46.8

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

   4. Applied rewrites 46.8%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}} \]

   if 4.6999999999999999e-153 < n

   1. Initial program 55.3%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 58.7%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 57.4%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

      3. sqrt-prod N/A

         \[\leadsto \color{blue}{\sqrt{n + n} \cdot \sqrt{U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\sqrt{n + n} \cdot \sqrt{U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{n + n}} \cdot \sqrt{U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)} \]

      6. lower-sqrt.f64 64.1

         \[\leadsto \sqrt{n + n} \cdot \color{blue}{\sqrt{U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)}} \]

   8. Applied rewrites 56.2%

      \[\leadsto \color{blue}{\sqrt{n + n} \cdot \sqrt{U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 53.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot U*\right)\right)\right)\right)}\\ \mathbf{if}\;n \leq -1 \cdot 10^{-163}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;n \leq 1.9 \cdot 10^{-53}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (sqrt
          (*
           (+ n n)
           (* U (- t (* n (* (* (/ l Om) (/ l Om)) (* -1.0 U*)))))))))
   (if (<= n -1e-163)
     t_1
     (if (<= n 1.9e-53)
       (sqrt (fma (/ (* (* (* l l) n) U) Om) -4.0 (* (* (* t n) U) 2.0)))
       t_1))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = sqrt(((n + n) * (U * (t - (n * (((l / Om) * (l / Om)) * (-1.0 * U_42_)))))));
	double tmp;
	if (n <= -1e-163) {
		tmp = t_1;
	} else if (n <= 1.9e-53) {
		tmp = sqrt(fma(((((l * l) * n) * U) / Om), -4.0, (((t * n) * U) * 2.0)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(-1.0 * U_42_)))))))
	tmp = 0.0
	if (n <= -1e-163)
		tmp = t_1;
	elseif (n <= 1.9e-53)
		tmp = sqrt(fma(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om), -4.0, Float64(Float64(Float64(t * n) * U) * 2.0)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(-1.0 * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -1e-163], t$95$1, If[LessEqual[n, 1.9e-53], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0 + N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if n < -9.99999999999999923e-164 or 1.8999999999999999e-53 < n

   1. Initial program 54.7%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 57.3%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 56.9%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

   7. Taylor expanded in U around 0

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 57.0

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(-1 \cdot \color{blue}{U*}\right)\right)\right)\right)} \]

   9. Applied rewrites 57.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \color{blue}{\left(-1 \cdot U*\right)}\right)\right)\right)} \]

   if -9.99999999999999923e-164 < n < 1.8999999999999999e-53

   1. Initial program 44.1%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around inf

      \[\leadsto \sqrt{\color{blue}{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} \cdot -4 + \color{blue}{2} \cdot \left(U \cdot \left(n \cdot t\right)\right)} \]

      2. lower-fma.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, \color{blue}{-4}, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      11. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      13. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

      14. lower-*.f64 47.4

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

   4. Applied rewrites 47.4%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 53.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}\\ \mathbf{if}\;n \leq -1 \cdot 10^{-163}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;n \leq 1.9 \cdot 10^{-53}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (sqrt
          (* (+ n n) (* U (- t (* n (* (* (/ l Om) (/ l Om)) (- U U*)))))))))
   (if (<= n -1e-163)
     t_1
     (if (<= n 1.9e-53)
       (sqrt (fma (/ (* (* (* l l) n) U) Om) -4.0 (* (* (* t n) U) 2.0)))
       t_1))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = sqrt(((n + n) * (U * (t - (n * (((l / Om) * (l / Om)) * (U - U_42_)))))));
	double tmp;
	if (n <= -1e-163) {
		tmp = t_1;
	} else if (n <= 1.9e-53) {
		tmp = sqrt(fma(((((l * l) * n) * U) / Om), -4.0, (((t * n) * U) * 2.0)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(U - U_42_)))))))
	tmp = 0.0
	if (n <= -1e-163)
		tmp = t_1;
	elseif (n <= 1.9e-53)
		tmp = sqrt(fma(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om), -4.0, Float64(Float64(Float64(t * n) * U) * 2.0)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l / Om), $MachinePrecision] * N[(l / Om), $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -1e-163], t$95$1, If[LessEqual[n, 1.9e-53], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0 + N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if n < -9.99999999999999923e-164 or 1.8999999999999999e-53 < n

   1. Initial program 54.7%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 57.3%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 56.9%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

   if -9.99999999999999923e-164 < n < 1.8999999999999999e-53

   1. Initial program 44.1%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around inf

      \[\leadsto \sqrt{\color{blue}{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} \cdot -4 + \color{blue}{2} \cdot \left(U \cdot \left(n \cdot t\right)\right)} \]

      2. lower-fma.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, \color{blue}{-4}, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      11. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      13. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

      14. lower-*.f64 47.4

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

   4. Applied rewrites 47.4%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 53.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\ell \cdot \ell}{Om \cdot Om}\\ \mathbf{if}\;n \leq -4.6 \cdot 10^{-19}:\\ \;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot t\_1\right) \cdot \left(U - U*\right)\right)}\\ \mathbf{elif}\;n \leq 1.9 \cdot 10^{+29}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(t\_1 \cdot \left(U - U*\right)\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (/ (* l l) (* Om Om))))
   (if (<= n -4.6e-19)
     (sqrt (* (* (* 2.0 n) U) (- t (* (* n t_1) (- U U*)))))
     (if (<= n 1.9e+29)
       (sqrt (fma (/ (* (* (* l l) n) U) Om) -4.0 (* (* (* t n) U) 2.0)))
       (sqrt (* (+ n n) (* U (- t (* n (* t_1 (- U U*)))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = (l * l) / (Om * Om);
	double tmp;
	if (n <= -4.6e-19) {
		tmp = sqrt((((2.0 * n) * U) * (t - ((n * t_1) * (U - U_42_)))));
	} else if (n <= 1.9e+29) {
		tmp = sqrt(fma(((((l * l) * n) * U) / Om), -4.0, (((t * n) * U) * 2.0)));
	} else {
		tmp = sqrt(((n + n) * (U * (t - (n * (t_1 * (U - U_42_)))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = Float64(Float64(l * l) / Float64(Om * Om))
	tmp = 0.0
	if (n <= -4.6e-19)
		tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(Float64(n * t_1) * Float64(U - U_42_)))));
	elseif (n <= 1.9e+29)
		tmp = sqrt(fma(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om), -4.0, Float64(Float64(Float64(t * n) * U) * 2.0)));
	else
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(t_1 * Float64(U - U_42_)))))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * l), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -4.6e-19], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(N[(n * t$95$1), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 1.9e+29], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0 + N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(t$95$1 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if n < -4.5999999999999996e-19

   1. Initial program 55.2%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{t} - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]
   3. Step-by-step derivation

   4. Applied rewrites 59.8%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{t} - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]
   5. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \color{blue}{{\left(\frac{\ell}{Om}\right)}^{2}}\right) \cdot \left(U - U*\right)\right)} \]

      2. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \color{blue}{\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)}\right) \cdot \left(U - U*\right)\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \left(\color{blue}{\frac{\ell}{Om}} \cdot \frac{\ell}{Om}\right)\right) \cdot \left(U - U*\right)\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \left(\frac{\ell}{Om} \cdot \color{blue}{\frac{\ell}{Om}}\right)\right) \cdot \left(U - U*\right)\right)} \]

      5. frac-times N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \color{blue}{\frac{\ell \cdot \ell}{Om \cdot Om}}\right) \cdot \left(U - U*\right)\right)} \]

      6. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{\color{blue}{{\ell}^{2}}}{Om \cdot Om}\right) \cdot \left(U - U*\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{{\ell}^{2}}{\color{blue}{{Om}^{2}}}\right) \cdot \left(U - U*\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \color{blue}{\frac{{\ell}^{2}}{{Om}^{2}}}\right) \cdot \left(U - U*\right)\right)} \]

      9. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{\color{blue}{\ell \cdot \ell}}{{Om}^{2}}\right) \cdot \left(U - U*\right)\right)} \]

      10. lift-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{\color{blue}{\ell \cdot \ell}}{{Om}^{2}}\right) \cdot \left(U - U*\right)\right)} \]

      11. pow2 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{\ell \cdot \ell}{\color{blue}{Om \cdot Om}}\right) \cdot \left(U - U*\right)\right)} \]

      12. lift-*.f64 52.8

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{\ell \cdot \ell}{\color{blue}{Om \cdot Om}}\right) \cdot \left(U - U*\right)\right)} \]

   6. Applied rewrites 52.8%

      \[\leadsto \color{blue}{\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \frac{\ell \cdot \ell}{Om \cdot Om}\right) \cdot \left(U - U*\right)\right)}} \]

   if -4.5999999999999996e-19 < n < 1.89999999999999985e29

   1. Initial program 47.3%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around inf

      \[\leadsto \sqrt{\color{blue}{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} \cdot -4 + \color{blue}{2} \cdot \left(U \cdot \left(n \cdot t\right)\right)} \]

      2. lower-fma.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, \color{blue}{-4}, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      11. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      13. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

      14. lower-*.f64 48.0

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

   4. Applied rewrites 48.0%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}} \]

   if 1.89999999999999985e29 < n

   1. Initial program 55.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 58.2%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 60.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\color{blue}{\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)} \cdot \left(U - U*\right)\right)\right)\right)} \]

      2. lift-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\color{blue}{\frac{\ell}{Om}} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \color{blue}{\frac{\ell}{Om}}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

      4. frac-times N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\color{blue}{\frac{\ell \cdot \ell}{Om \cdot Om}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      5. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\color{blue}{{\ell}^{2}}}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)\right)} \]

      6. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{{\ell}^{2}}{\color{blue}{{Om}^{2}}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      7. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\color{blue}{\frac{{\ell}^{2}}{{Om}^{2}}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      8. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\color{blue}{\ell \cdot \ell}}{{Om}^{2}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      9. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\color{blue}{\ell \cdot \ell}}{{Om}^{2}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      10. pow2 N/A

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{\color{blue}{Om \cdot Om}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      11. lift-*.f64 53.1

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{\color{blue}{Om \cdot Om}} \cdot \left(U - U*\right)\right)\right)\right)} \]

   8. Applied rewrites 53.1%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \color{blue}{\left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)\right)}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 53.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)\right)}\\ \mathbf{if}\;n \leq -3.45 \cdot 10^{-31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;n \leq 2.6 \cdot 10^{+30}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (sqrt
          (* (+ n n) (* U (- t (* n (* (/ (* l l) (* Om Om)) (- U U*)))))))))
   (if (<= n -3.45e-31)
     t_1
     (if (<= n 2.6e+30)
       (sqrt (fma (/ (* (* (* l l) n) U) Om) -4.0 (* (* (* t n) U) 2.0)))
       t_1))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = sqrt(((n + n) * (U * (t - (n * (((l * l) / (Om * Om)) * (U - U_42_)))))));
	double tmp;
	if (n <= -3.45e-31) {
		tmp = t_1;
	} else if (n <= 2.6e+30) {
		tmp = sqrt(fma(((((l * l) * n) * U) / Om), -4.0, (((t * n) * U) * 2.0)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l * l) / Float64(Om * Om)) * Float64(U - U_42_)))))))
	tmp = 0.0
	if (n <= -3.45e-31)
		tmp = t_1;
	elseif (n <= 2.6e+30)
		tmp = sqrt(fma(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om), -4.0, Float64(Float64(Float64(t * n) * U) * 2.0)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l * l), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -3.45e-31], t$95$1, If[LessEqual[n, 2.6e+30], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0 + N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if n < -3.4500000000000002e-31 or 2.59999999999999988e30 < n

   1. Initial program 55.1%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 57.3%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 59.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\color{blue}{\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)} \cdot \left(U - U*\right)\right)\right)\right)} \]

      2. lift-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\color{blue}{\frac{\ell}{Om}} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\left(\frac{\ell}{Om} \cdot \color{blue}{\frac{\ell}{Om}}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

      4. frac-times N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\color{blue}{\frac{\ell \cdot \ell}{Om \cdot Om}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      5. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\color{blue}{{\ell}^{2}}}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)\right)} \]

      6. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{{\ell}^{2}}{\color{blue}{{Om}^{2}}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      7. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\color{blue}{\frac{{\ell}^{2}}{{Om}^{2}}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      8. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\color{blue}{\ell \cdot \ell}}{{Om}^{2}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      9. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\color{blue}{\ell \cdot \ell}}{{Om}^{2}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      10. pow2 N/A

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{\color{blue}{Om \cdot Om}} \cdot \left(U - U*\right)\right)\right)\right)} \]

      11. lift-*.f64 52.1

          \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{\color{blue}{Om \cdot Om}} \cdot \left(U - U*\right)\right)\right)\right)} \]

   8. Applied rewrites 52.1%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \color{blue}{\left(U \cdot \left(t - n \cdot \left(\frac{\ell \cdot \ell}{Om \cdot Om} \cdot \left(U - U*\right)\right)\right)\right)}} \]

   if -3.4500000000000002e-31 < n < 2.59999999999999988e30

   1. Initial program 47.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around inf

      \[\leadsto \sqrt{\color{blue}{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} \cdot -4 + \color{blue}{2} \cdot \left(U \cdot \left(n \cdot t\right)\right)} \]

      2. lower-fma.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, \color{blue}{-4}, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      11. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      13. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

      14. lower-*.f64 48.1

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

   4. Applied rewrites 48.1%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 53.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)}\\ \mathbf{if}\;n \leq -3.1 \cdot 10^{-24}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;n \leq 4.1 \cdot 10^{+30}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (sqrt
          (* (+ n n) (* U (- t (* n (/ (* (* l l) (- U U*)) (* Om Om)))))))))
   (if (<= n -3.1e-24)
     t_1
     (if (<= n 4.1e+30)
       (sqrt (fma (/ (* (* (* l l) n) U) Om) -4.0 (* (* (* t n) U) 2.0)))
       t_1))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = sqrt(((n + n) * (U * (t - (n * (((l * l) * (U - U_42_)) / (Om * Om)))))));
	double tmp;
	if (n <= -3.1e-24) {
		tmp = t_1;
	} else if (n <= 4.1e+30) {
		tmp = sqrt(fma(((((l * l) * n) * U) / Om), -4.0, (((t * n) * U) * 2.0)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l * l) * Float64(U - U_42_)) / Float64(Om * Om)))))))
	tmp = 0.0
	if (n <= -3.1e-24)
		tmp = t_1;
	elseif (n <= 4.1e+30)
		tmp = sqrt(fma(Float64(Float64(Float64(Float64(l * l) * n) * U) / Om), -4.0, Float64(Float64(Float64(t * n) * U) * 2.0)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(t - N[(n * N[(N[(N[(l * l), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[n, -3.1e-24], t$95$1, If[LessEqual[n, 4.1e+30], N[Sqrt[N[(N[(N[(N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] / Om), $MachinePrecision] * -4.0 + N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if n < -3.1e-24 or 4.10000000000000005e30 < n

   1. Initial program 55.2%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 57.4%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 59.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(\color{blue}{t} - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)} \]

   7. Taylor expanded in l around 0

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \color{blue}{\frac{{\ell}^{2} \cdot \left(U - U*\right)}{{Om}^{2}}}\right)\right)} \]
   8. Step-by-step derivation

      1. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{\color{blue}{{Om}^{2}}}\right)\right)} \]

      3. lift--.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{{\color{blue}{Om}}^{2}}\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)} \]

      6. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{Om \cdot \color{blue}{Om}}\right)\right)} \]

      7. lift-*.f64 51.4

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{Om \cdot \color{blue}{Om}}\right)\right)} \]

   9. Applied rewrites 51.4%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \left(t - n \cdot \color{blue}{\frac{\left(\ell \cdot \ell\right) \cdot \left(U - U*\right)}{Om \cdot Om}}\right)\right)} \]

   if -3.1e-24 < n < 4.10000000000000005e30

   1. Initial program 47.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in Om around inf

      \[\leadsto \sqrt{\color{blue}{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} + 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om} \cdot -4 + \color{blue}{2} \cdot \left(U \cdot \left(n \cdot t\right)\right)} \]

      2. lower-fma.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, \color{blue}{-4}, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      3. lower-/.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left({\ell}^{2} \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, 2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(U \cdot \left(n \cdot t\right)\right) \cdot 2\right)} \]

      11. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(n \cdot t\right) \cdot U\right) \cdot 2\right)} \]

      13. *-commutative N/A

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

      14. lower-*.f64 48.0

          \[\leadsto \sqrt{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)} \]

   4. Applied rewrites 48.0%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{\left(\left(\ell \cdot \ell\right) \cdot n\right) \cdot U}{Om}, -4, \left(\left(t \cdot n\right) \cdot U\right) \cdot 2\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 50.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)\\ t_2 := \left(2 \cdot n\right) \cdot U\\ t_3 := t\_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\ \mathbf{if}\;t\_3 \leq 0:\\ \;\;\;\;\sqrt{\left(\left(t\_1 \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\sqrt{t\_2 \cdot t\_1}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{Om \cdot Om}}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (fma -2.0 (* l (/ l Om)) t))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (*
          t_2
          (-
           (- t (* 2.0 (/ (* l l) Om)))
           (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
   (if (<= t_3 0.0)
     (sqrt (* (* (* t_1 n) U) 2.0))
     (if (<= t_3 INFINITY)
       (sqrt (* t_2 t_1))
       (sqrt (* (+ n n) (/ (* U (* U* (* (* l l) n))) (* Om Om))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = fma(-2.0, (l * (l / Om)), t);
	double t_2 = (2.0 * n) * U;
	double t_3 = t_2 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
	double tmp;
	if (t_3 <= 0.0) {
		tmp = sqrt((((t_1 * n) * U) * 2.0));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = sqrt((t_2 * t_1));
	} else {
		tmp = sqrt(((n + n) * ((U * (U_42_ * ((l * l) * n))) / (Om * Om))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = fma(-2.0, Float64(l * Float64(l / Om)), t)
	t_2 = Float64(Float64(2.0 * n) * U)
	t_3 = Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))
	tmp = 0.0
	if (t_3 <= 0.0)
		tmp = sqrt(Float64(Float64(Float64(t_1 * n) * U) * 2.0));
	elseif (t_3 <= Inf)
		tmp = sqrt(Float64(t_2 * t_1));
	else
		tmp = sqrt(Float64(Float64(n + n) * Float64(Float64(U * Float64(U_42_ * Float64(Float64(l * l) * n))) / Float64(Om * Om))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(N[(N[(t$95$1 * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * t$95$1), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(N[(U * N[(U$42$ * N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0

   1. Initial program 9.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      7. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(\left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(\left(t + -2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      9. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(-2 \cdot \frac{{\ell}^{2}}{Om} + t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      10. lower-fma.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{{\ell}^{2}}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      11. pow2 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      12. associate-/l* N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      13. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      14. lift-/.f64 34.1

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

   4. Applied rewrites 34.1%

      \[\leadsto \sqrt{\color{blue}{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}} \]

   if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 69.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)}} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{\color{blue}{{\ell}^{2}}}{Om}\right)} \]

      2. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \color{blue}{-2 \cdot \frac{{\ell}^{2}}{Om}}\right)} \]

      3. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-2 \cdot \frac{{\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \color{blue}{\frac{{\ell}^{2}}{Om}}, t\right)} \]

      5. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right)} \]

      6. associate-/l* N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \color{blue}{\frac{\ell}{Om}}, t\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \color{blue}{\frac{\ell}{Om}}, t\right)} \]

      8. lift-/.f64 63.2

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{\color{blue}{Om}}, t\right)} \]

   4. Applied rewrites 63.2%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)}} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in U* around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \color{blue}{\frac{U \cdot \left(U* \cdot \left({\ell}^{2} \cdot n\right)\right)}{{Om}^{2}}}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left({\ell}^{2} \cdot n\right)\right)}{\color{blue}{{Om}^{2}}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left({\ell}^{2} \cdot n\right)\right)}{{\color{blue}{Om}}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left({\ell}^{2} \cdot n\right)\right)}{{Om}^{2}}} \]

      4. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{{Om}^{2}}} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{{Om}^{2}}} \]

      6. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{{Om}^{2}}} \]

      7. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{Om \cdot \color{blue}{Om}}} \]

      8. lift-*.f64 29.0

         \[\leadsto \sqrt{\left(n + n\right) \cdot \frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{Om \cdot \color{blue}{Om}}} \]

   6. Applied rewrites 29.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \color{blue}{\frac{U \cdot \left(U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)\right)}{Om \cdot Om}}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 13: 50.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)\\ t_2 := \left(2 \cdot n\right) \cdot U\\ t_3 := t\_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\ \mathbf{if}\;t\_3 \leq 0:\\ \;\;\;\;\sqrt{\left(\left(t\_1 \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\sqrt{t\_2 \cdot t\_1}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om \cdot Om}\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (fma -2.0 (* l (/ l Om)) t))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (*
          t_2
          (-
           (- t (* 2.0 (/ (* l l) Om)))
           (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
   (if (<= t_3 0.0)
     (sqrt (* (* (* t_1 n) U) 2.0))
     (if (<= t_3 INFINITY)
       (sqrt (* t_2 t_1))
       (sqrt (* (+ n n) (* U (/ (* U* (* (* l l) n)) (* Om Om)))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = fma(-2.0, (l * (l / Om)), t);
	double t_2 = (2.0 * n) * U;
	double t_3 = t_2 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
	double tmp;
	if (t_3 <= 0.0) {
		tmp = sqrt((((t_1 * n) * U) * 2.0));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = sqrt((t_2 * t_1));
	} else {
		tmp = sqrt(((n + n) * (U * ((U_42_ * ((l * l) * n)) / (Om * Om)))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = fma(-2.0, Float64(l * Float64(l / Om)), t)
	t_2 = Float64(Float64(2.0 * n) * U)
	t_3 = Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))
	tmp = 0.0
	if (t_3 <= 0.0)
		tmp = sqrt(Float64(Float64(Float64(t_1 * n) * U) * 2.0));
	elseif (t_3 <= Inf)
		tmp = sqrt(Float64(t_2 * t_1));
	else
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(Float64(U_42_ * Float64(Float64(l * l) * n)) / Float64(Om * Om)))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(N[(N[(t$95$1 * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * t$95$1), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * N[(N[(U$42$ * N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0

   1. Initial program 9.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      7. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(\left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(\left(t + -2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      9. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(-2 \cdot \frac{{\ell}^{2}}{Om} + t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      10. lower-fma.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{{\ell}^{2}}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      11. pow2 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      12. associate-/l* N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      13. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      14. lift-/.f64 34.1

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

   4. Applied rewrites 34.1%

      \[\leadsto \sqrt{\color{blue}{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}} \]

   if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 69.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)}} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{\color{blue}{{\ell}^{2}}}{Om}\right)} \]

      2. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \color{blue}{-2 \cdot \frac{{\ell}^{2}}{Om}}\right)} \]

      3. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-2 \cdot \frac{{\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \color{blue}{\frac{{\ell}^{2}}{Om}}, t\right)} \]

      5. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right)} \]

      6. associate-/l* N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \color{blue}{\frac{\ell}{Om}}, t\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \color{blue}{\frac{\ell}{Om}}, t\right)} \]

      8. lift-/.f64 63.2

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{\color{blue}{Om}}, t\right)} \]

   4. Applied rewrites 63.2%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)}} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 6.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in U* around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{\frac{U* \cdot \left({\ell}^{2} \cdot n\right)}{{Om}^{2}}}\right)} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left({\ell}^{2} \cdot n\right)}{\color{blue}{{Om}^{2}}}\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left({\ell}^{2} \cdot n\right)}{{\color{blue}{Om}}^{2}}\right)} \]

      3. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{{Om}^{2}}\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{{Om}^{2}}\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{{Om}^{2}}\right)} \]

      6. pow2 N/A

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om \cdot \color{blue}{Om}}\right)} \]

      7. lift-*.f64 28.4

         \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om \cdot \color{blue}{Om}}\right)} \]

   6. Applied rewrites 28.4%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{\frac{U* \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om \cdot Om}}\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 14: 49.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)\\ t_2 := \left(2 \cdot n\right) \cdot U\\ t_3 := t\_2 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)\\ \mathbf{if}\;t\_3 \leq 0:\\ \;\;\;\;\sqrt{\left(\left(t\_1 \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\sqrt{t\_2 \cdot t\_1}\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (fma -2.0 (* l (/ l Om)) t))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (*
          t_2
          (-
           (- t (* 2.0 (/ (* l l) Om)))
           (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
   (if (<= t_3 0.0)
     (sqrt (* (* (* t_1 n) U) 2.0))
     (if (<= t_3 INFINITY)
       (sqrt (* t_2 t_1))
       (* -1.0 (* (/ (* l (* n (sqrt 2.0))) Om) (sqrt (* U U*))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = fma(-2.0, (l * (l / Om)), t);
	double t_2 = (2.0 * n) * U;
	double t_3 = t_2 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
	double tmp;
	if (t_3 <= 0.0) {
		tmp = sqrt((((t_1 * n) * U) * 2.0));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = sqrt((t_2 * t_1));
	} else {
		tmp = -1.0 * (((l * (n * sqrt(2.0))) / Om) * sqrt((U * U_42_)));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = fma(-2.0, Float64(l * Float64(l / Om)), t)
	t_2 = Float64(Float64(2.0 * n) * U)
	t_3 = Float64(t_2 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))
	tmp = 0.0
	if (t_3 <= 0.0)
		tmp = sqrt(Float64(Float64(Float64(t_1 * n) * U) * 2.0));
	elseif (t_3 <= Inf)
		tmp = sqrt(Float64(t_2 * t_1));
	else
		tmp = Float64(-1.0 * Float64(Float64(Float64(l * Float64(n * sqrt(2.0))) / Om) * sqrt(Float64(U * U_42_))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[Sqrt[N[(N[(N[(t$95$1 * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(t$95$2 * t$95$1), $MachinePrecision]], $MachinePrecision], N[(-1.0 * N[(N[(N[(l * N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0

   1. Initial program 9.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      7. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(\left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(\left(t + -2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      9. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(-2 \cdot \frac{{\ell}^{2}}{Om} + t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      10. lower-fma.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{{\ell}^{2}}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      11. pow2 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      12. associate-/l* N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      13. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      14. lift-/.f64 34.1

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

   4. Applied rewrites 34.1%

      \[\leadsto \sqrt{\color{blue}{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}} \]

   if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 69.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)}} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{\color{blue}{{\ell}^{2}}}{Om}\right)} \]

      2. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \color{blue}{-2 \cdot \frac{{\ell}^{2}}{Om}}\right)} \]

      3. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(-2 \cdot \frac{{\ell}^{2}}{Om} + \color{blue}{t}\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \color{blue}{\frac{{\ell}^{2}}{Om}}, t\right)} \]

      5. pow2 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right)} \]

      6. associate-/l* N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \color{blue}{\frac{\ell}{Om}}, t\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \color{blue}{\frac{\ell}{Om}}, t\right)} \]

      8. lift-/.f64 63.2

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{\color{blue}{Om}}, t\right)} \]

   4. Applied rewrites 63.2%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)}} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 1.6%

      \[\leadsto \color{blue}{e^{\log \left(\left(\left(n + n\right) \cdot U\right) \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right) \cdot 0.5}} \]

   4. Taylor expanded in U* around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\ell \cdot \left(n \cdot \left(\sqrt{-2} \cdot \sqrt{-1}\right)\right)}{Om} \cdot \sqrt{U \cdot U*}\right)} \]
   5. Step-by-step derivation

      1. sqrt-unprod N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{-2 \cdot -1}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      2. metadata-eval N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{\left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right)} \]

      4. lower-*.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \color{blue}{\sqrt{U \cdot U*}}\right) \]

      5. lower-/.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{\color{blue}{U \cdot U*}}\right) \]

      6. lower-*.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{\color{blue}{U} \cdot U*}\right) \]

      7. lower-*.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      8. lower-sqrt.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      9. lower-sqrt.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      10. lower-*.f64 22.6

          \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

   6. Applied rewrites 22.6%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 15: 49.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right) \leq \infty:\\ \;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<=
      (*
       (* (* 2.0 n) U)
       (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))
      INFINITY)
   (sqrt (* (* (* (fma -2.0 (* l (/ l Om)) t) n) U) 2.0))
   (* -1.0 (* (/ (* l (* n (sqrt 2.0))) Om) (sqrt (* U U*))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if ((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))) <= ((double) INFINITY)) {
		tmp = sqrt((((fma(-2.0, (l * (l / Om)), t) * n) * U) * 2.0));
	} else {
		tmp = -1.0 * (((l * (n * sqrt(2.0))) / Om) * sqrt((U * U_42_)));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	tmp = 0.0
	if (Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_)))) <= Inf)
		tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(l * Float64(l / Om)), t) * n) * U) * 2.0));
	else
		tmp = Float64(-1.0 * Float64(Float64(Float64(l * Float64(n * sqrt(2.0))) / Om) * sqrt(Float64(U * U_42_))));
	end
	return tmp
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[Sqrt[N[(N[(N[(N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision] * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], N[(-1.0 * N[(N[(N[(l * N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision] * N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0

   1. Initial program 59.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in n around 0

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right)\right) \cdot \color{blue}{2}} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(n \cdot \left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right)\right) \cdot U\right) \cdot 2} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(\left(t - 2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      7. metadata-eval N/A

         \[\leadsto \sqrt{\left(\left(\left(t - \left(\mathsf{neg}\left(-2\right)\right) \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      8. fp-cancel-sign-sub-inv N/A

         \[\leadsto \sqrt{\left(\left(\left(t + -2 \cdot \frac{{\ell}^{2}}{Om}\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      9. +-commutative N/A

         \[\leadsto \sqrt{\left(\left(\left(-2 \cdot \frac{{\ell}^{2}}{Om} + t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      10. lower-fma.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{{\ell}^{2}}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      11. pow2 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \frac{\ell \cdot \ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      12. associate-/l* N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      13. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

      14. lift-/.f64 54.7

          \[\leadsto \sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2} \]

   4. Applied rewrites 54.7%

      \[\leadsto \sqrt{\color{blue}{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}} \]

   if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))

   1. Initial program 0.0%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 1.6%

      \[\leadsto \color{blue}{e^{\log \left(\left(\left(n + n\right) \cdot U\right) \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right) \cdot 0.5}} \]

   4. Taylor expanded in U* around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\ell \cdot \left(n \cdot \left(\sqrt{-2} \cdot \sqrt{-1}\right)\right)}{Om} \cdot \sqrt{U \cdot U*}\right)} \]
   5. Step-by-step derivation

      1. sqrt-unprod N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{-2 \cdot -1}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      2. metadata-eval N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{\left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right)} \]

      4. lower-*.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \color{blue}{\sqrt{U \cdot U*}}\right) \]

      5. lower-/.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{\color{blue}{U \cdot U*}}\right) \]

      6. lower-*.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{\color{blue}{U} \cdot U*}\right) \]

      7. lower-*.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      8. lower-sqrt.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      9. lower-sqrt.f64 N/A

         \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

      10. lower-*.f64 22.6

          \[\leadsto -1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right) \]

   6. Applied rewrites 22.6%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\ell \cdot \left(n \cdot \sqrt{2}\right)}{Om} \cdot \sqrt{U \cdot U*}\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 16: 39.3% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq 1.7 \cdot 10^{+65}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot t\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{-4 \cdot \frac{U \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om}}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<= l 1.7e+65)
   (sqrt (* (+ n n) (* U t)))
   (sqrt (* -4.0 (/ (* U (* (* l l) n)) Om)))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (l <= 1.7e+65) {
		tmp = sqrt(((n + n) * (U * t)));
	} else {
		tmp = sqrt((-4.0 * ((U * ((l * l) * n)) / Om)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: tmp
    if (l <= 1.7d+65) then
        tmp = sqrt(((n + n) * (u * t)))
    else
        tmp = sqrt(((-4.0d0) * ((u * ((l * l) * n)) / om)))
    end if
    code = tmp
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (l <= 1.7e+65) {
		tmp = Math.sqrt(((n + n) * (U * t)));
	} else {
		tmp = Math.sqrt((-4.0 * ((U * ((l * l) * n)) / Om)));
	}
	return tmp;
}

Python

def code(n, U, t, l, Om, U_42_):
	tmp = 0
	if l <= 1.7e+65:
		tmp = math.sqrt(((n + n) * (U * t)))
	else:
		tmp = math.sqrt((-4.0 * ((U * ((l * l) * n)) / Om)))
	return tmp

Julia

function code(n, U, t, l, Om, U_42_)
	tmp = 0.0
	if (l <= 1.7e+65)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * t)));
	else
		tmp = sqrt(Float64(-4.0 * Float64(Float64(U * Float64(Float64(l * l) * n)) / Om)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(n, U, t, l, Om, U_42_)
	tmp = 0.0;
	if (l <= 1.7e+65)
		tmp = sqrt(((n + n) * (U * t)));
	else
		tmp = sqrt((-4.0 * ((U * ((l * l) * n)) / Om)));
	end
	tmp_2 = tmp;
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.7e+65], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(-4.0 * N[(N[(U * N[(N[(l * l), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if l < 1.7e65

   1. Initial program 55.1%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 56.1%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 41.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]

   if 1.7e65 < l

   1. Initial program 30.6%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 39.6%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in l around inf

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \color{blue}{\left(U \cdot \left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \color{blue}{\left({\ell}^{2} \cdot \left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left({\ell}^{2} \cdot \color{blue}{\left(n \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)}\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(\color{blue}{n} \cdot \left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \color{blue}{\left(2 \cdot \frac{1}{Om} + \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)}\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \color{blue}{\frac{1}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{\color{blue}{Om}}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      11. lift--.f64 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{{Om}^{2}}\right)\right)\right)\right)} \]

      12. pow2 N/A

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

      13. lift-*.f64 32.7

          \[\leadsto \sqrt{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)} \]

   6. Applied rewrites 32.7%

      \[\leadsto \sqrt{\color{blue}{-2 \cdot \left(U \cdot \left(\left(\ell \cdot \ell\right) \cdot \left(n \cdot \mathsf{fma}\left(2, \frac{1}{Om}, \frac{n \cdot \left(U - U*\right)}{Om \cdot Om}\right)\right)\right)\right)}} \]

   7. Taylor expanded in n around 0

      \[\leadsto \sqrt{-4 \cdot \color{blue}{\frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}}} \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{\color{blue}{Om}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{-4 \cdot \frac{U \cdot \left({\ell}^{2} \cdot n\right)}{Om}} \]

      5. pow2 N/A

         \[\leadsto \sqrt{-4 \cdot \frac{U \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om}} \]

      6. lift-*.f64 22.6

         \[\leadsto \sqrt{-4 \cdot \frac{U \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om}} \]

   9. Applied rewrites 22.6%

      \[\leadsto \sqrt{-4 \cdot \color{blue}{\frac{U \cdot \left(\left(\ell \cdot \ell\right) \cdot n\right)}{Om}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 39.0% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq 2.6 \cdot 10^{-299}:\\ \;\;\;\;\sqrt{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{n + n} \cdot \sqrt{U \cdot t}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<= n 2.6e-299)
   (sqrt (* (* (* t n) U) 2.0))
   (* (sqrt (+ n n)) (sqrt (* U t)))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (n <= 2.6e-299) {
		tmp = sqrt((((t * n) * U) * 2.0));
	} else {
		tmp = sqrt((n + n)) * sqrt((U * t));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: tmp
    if (n <= 2.6d-299) then
        tmp = sqrt((((t * n) * u) * 2.0d0))
    else
        tmp = sqrt((n + n)) * sqrt((u * t))
    end if
    code = tmp
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (n <= 2.6e-299) {
		tmp = Math.sqrt((((t * n) * U) * 2.0));
	} else {
		tmp = Math.sqrt((n + n)) * Math.sqrt((U * t));
	}
	return tmp;
}

Python

def code(n, U, t, l, Om, U_42_):
	tmp = 0
	if n <= 2.6e-299:
		tmp = math.sqrt((((t * n) * U) * 2.0))
	else:
		tmp = math.sqrt((n + n)) * math.sqrt((U * t))
	return tmp

Julia

function code(n, U, t, l, Om, U_42_)
	tmp = 0.0
	if (n <= 2.6e-299)
		tmp = sqrt(Float64(Float64(Float64(t * n) * U) * 2.0));
	else
		tmp = Float64(sqrt(Float64(n + n)) * sqrt(Float64(U * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(n, U, t, l, Om, U_42_)
	tmp = 0.0;
	if (n <= 2.6e-299)
		tmp = sqrt((((t * n) * U) * 2.0));
	else
		tmp = sqrt((n + n)) * sqrt((U * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, 2.6e-299], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n + n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if n < 2.5999999999999999e-299

   1. Initial program 50.3%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in t around inf

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot t\right)\right) \cdot \color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot t\right)\right) \cdot \color{blue}{2}} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(n \cdot t\right) \cdot U\right) \cdot 2} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(n \cdot t\right) \cdot U\right) \cdot 2} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2} \]

      6. lower-*.f64 35.6

         \[\leadsto \sqrt{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2} \]

   4. Applied rewrites 35.6%

      \[\leadsto \sqrt{\color{blue}{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2}} \]

   if 2.5999999999999999e-299 < n

   1. Initial program 51.4%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 54.2%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 37.0%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\left(n + n\right) \cdot \left(U \cdot t\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot t\right)}} \]

      3. sqrt-prod N/A

         \[\leadsto \color{blue}{\sqrt{n + n} \cdot \sqrt{U \cdot t}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\sqrt{n + n} \cdot \sqrt{U \cdot t}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{n + n}} \cdot \sqrt{U \cdot t} \]

      6. lower-sqrt.f64 43.0

         \[\leadsto \sqrt{n + n} \cdot \color{blue}{\sqrt{U \cdot t}} \]

   8. Applied rewrites 43.0%

      \[\leadsto \color{blue}{\sqrt{n + n} \cdot \sqrt{U \cdot t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 18: 37.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(2 \cdot n\right) \cdot U\\ \mathbf{if}\;\sqrt{t\_1 \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \leq 10^{-126}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot t\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{t\_1 \cdot t}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (* (* 2.0 n) U)))
   (if (<=
        (sqrt
         (*
          t_1
          (-
           (- t (* 2.0 (/ (* l l) Om)))
           (* (* n (pow (/ l Om) 2.0)) (- U U*)))))
        1e-126)
     (sqrt (* (+ n n) (* U t)))
     (sqrt (* t_1 t)))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = (2.0 * n) * U;
	double tmp;
	if (sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_))))) <= 1e-126) {
		tmp = sqrt(((n + n) * (U * t)));
	} else {
		tmp = sqrt((t_1 * t));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (2.0d0 * n) * u
    if (sqrt((t_1 * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42))))) <= 1d-126) then
        tmp = sqrt(((n + n) * (u * t)))
    else
        tmp = sqrt((t_1 * t))
    end if
    code = tmp
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = (2.0 * n) * U;
	double tmp;
	if (Math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_))))) <= 1e-126) {
		tmp = Math.sqrt(((n + n) * (U * t)));
	} else {
		tmp = Math.sqrt((t_1 * t));
	}
	return tmp;
}

Python

def code(n, U, t, l, Om, U_42_):
	t_1 = (2.0 * n) * U
	tmp = 0
	if math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_))))) <= 1e-126:
		tmp = math.sqrt(((n + n) * (U * t)))
	else:
		tmp = math.sqrt((t_1 * t))
	return tmp

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = Float64(Float64(2.0 * n) * U)
	tmp = 0.0
	if (sqrt(Float64(t_1 * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) <= 1e-126)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * t)));
	else
		tmp = sqrt(Float64(t_1 * t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(n, U, t, l, Om, U_42_)
	t_1 = (2.0 * n) * U;
	tmp = 0.0;
	if (sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))) <= 1e-126)
		tmp = sqrt(((n + n) * (U * t)));
	else
		tmp = sqrt((t_1 * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, If[LessEqual[N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1e-126], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 9.9999999999999995e-127

   1. Initial program 24.9%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 42.3%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 35.6%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]

   if 9.9999999999999995e-127 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))))

   1. Initial program 55.5%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{t}} \]
   3. Step-by-step derivation

   4. Applied rewrites 39.7%

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 19: 36.7% accurate, 3.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 2.45 \cdot 10^{-164}:\\ \;\;\;\;\sqrt{\left(n + n\right) \cdot \left(U \cdot t\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<= t 2.45e-164) (sqrt (* (+ n n) (* U t))) (sqrt (* (* (* t n) U) 2.0))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (t <= 2.45e-164) {
		tmp = sqrt(((n + n) * (U * t)));
	} else {
		tmp = sqrt((((t * n) * U) * 2.0));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: tmp
    if (t <= 2.45d-164) then
        tmp = sqrt(((n + n) * (u * t)))
    else
        tmp = sqrt((((t * n) * u) * 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	double tmp;
	if (t <= 2.45e-164) {
		tmp = Math.sqrt(((n + n) * (U * t)));
	} else {
		tmp = Math.sqrt((((t * n) * U) * 2.0));
	}
	return tmp;
}

Python

def code(n, U, t, l, Om, U_42_):
	tmp = 0
	if t <= 2.45e-164:
		tmp = math.sqrt(((n + n) * (U * t)))
	else:
		tmp = math.sqrt((((t * n) * U) * 2.0))
	return tmp

Julia

function code(n, U, t, l, Om, U_42_)
	tmp = 0.0
	if (t <= 2.45e-164)
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * t)));
	else
		tmp = sqrt(Float64(Float64(Float64(t * n) * U) * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(n, U, t, l, Om, U_42_)
	tmp = 0.0;
	if (t <= 2.45e-164)
		tmp = sqrt(((n + n) * (U * t)));
	else
		tmp = sqrt((((t * n) * U) * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[t, 2.45e-164], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 2.4499999999999998e-164

   1. Initial program 50.7%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   3. Applied rewrites 53.3%

      \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

   4. Taylor expanded in t around inf

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 33.8%

      \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]

   if 2.4499999999999998e-164 < t

   1. Initial program 51.1%

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

   2. Taylor expanded in t around inf

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot t\right)\right) \cdot \color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n \cdot t\right)\right) \cdot \color{blue}{2}} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(n \cdot t\right) \cdot U\right) \cdot 2} \]

      4. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(n \cdot t\right) \cdot U\right) \cdot 2} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2} \]

      6. lower-*.f64 41.2

         \[\leadsto \sqrt{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2} \]

   4. Applied rewrites 41.2%

      \[\leadsto \sqrt{\color{blue}{\left(\left(t \cdot n\right) \cdot U\right) \cdot 2}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 20: 35.9% accurate, 4.7× speedup

Math

\[\begin{array}{l} \\ \sqrt{\left(n + n\right) \cdot \left(U \cdot t\right)} \end{array} \]

FPCore

(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (+ n n) (* U t))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	return sqrt(((n + n) * (U * t)));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n, u, t, l, om, u_42)
use fmin_fmax_functions
    real(8), intent (in) :: n
    real(8), intent (in) :: u
    real(8), intent (in) :: t
    real(8), intent (in) :: l
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    code = sqrt(((n + n) * (u * t)))
end function

Java

public static double code(double n, double U, double t, double l, double Om, double U_42_) {
	return Math.sqrt(((n + n) * (U * t)));
}

Python

def code(n, U, t, l, Om, U_42_):
	return math.sqrt(((n + n) * (U * t)))

Julia

function code(n, U, t, l, Om, U_42_)
	return sqrt(Float64(Float64(n + n) * Float64(U * t)))
end

MATLAB

function tmp = code(n, U, t, l, Om, U_42_)
	tmp = sqrt(((n + n) * (U * t)));
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 50.9%

   \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \]

3. Applied rewrites 53.3%

   \[\leadsto \sqrt{\color{blue}{\left(n + n\right) \cdot \left(U \cdot \left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) - n \cdot \left(\left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right) \cdot \left(U - U*\right)\right)\right)\right)}} \]

4. Taylor expanded in t around inf

   \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
5. Step-by-step derivation

6. Applied rewrites 35.9%

   \[\leadsto \sqrt{\left(n + n\right) \cdot \left(U \cdot \color{blue}{t}\right)} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2025110 
(FPCore (n U t l Om U*)
  :name "Toniolo and Linder, Equation (13)"
  :precision binary64
  (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))