Toniolo and Linder, Equation (13)

Percentage Accurate: 49.9% → 68.3%

Time: 10.0s

Alternatives: 15

Speedup: 1.2×

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: 49.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: 68.3% accurate, 0.3× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1 (/ (* l_m l_m) Om))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (sqrt
          (*
           t_2
           (- (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))))
   (if (<= t_3 4e-115)
     (sqrt
      (-
       (*
        (*
         U
         (-
          (*
           -1.0
           (/
            (fma
             -2.0
             (pow l_m 2.0)
             (* -1.0 (/ (* (pow l_m 2.0) (* n (- U U*))) Om)))
            Om))
          t))
        (+ n n))))
     (if (<= t_3 4e+152)
       (sqrt
        (*
         t_2
         (fma (* (- U* U) (/ l_m Om)) (* (/ l_m Om) n) (fma -2.0 t_1 t))))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
	double t_1 = (l_m * l_m) / Om;
	double t_2 = (2.0 * n) * U;
	double t_3 = sqrt((t_2 * ((t - (2.0 * t_1)) - ((n * pow((l_m / Om), 2.0)) * (U - U_42_)))));
	double tmp;
	if (t_3 <= 4e-115) {
		tmp = sqrt(-((U * ((-1.0 * (fma(-2.0, pow(l_m, 2.0), (-1.0 * ((pow(l_m, 2.0) * (n * (U - U_42_))) / Om))) / Om)) - t)) * (n + n)));
	} else if (t_3 <= 4e+152) {
		tmp = sqrt((t_2 * fma(((U_42_ - U) * (l_m / Om)), ((l_m / Om) * n), fma(-2.0, t_1, t))));
	} else {
		tmp = sqrt(((((fma((n / Om), (U - U_42_), 2.0) / Om) * U) * -2.0) * n)) * l_m;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 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*))))) < 4.0000000000000002e-115

   1. Initial program 49.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 46.1%

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

   4. Taylor expanded in Om around -inf

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

      1. lower--.f64 N/A

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

   6. Applied rewrites 45.2%

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

   if 4.0000000000000002e-115 < (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*))))) < 4.0000000000000002e152

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\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. lift-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. distribute-lft-neg-in N/A

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

      8. lift--.f64 N/A

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

      9. sub-negate-rev N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lift-pow.f64 N/A

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

      13. unpow2 N/A

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

      14. associate-*l* N/A

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

      15. associate-*r* N/A

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

   3. Applied rewrites 51.8%

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

   if 4.0000000000000002e152 < (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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 2: 68.3% accurate, 0.3× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1 (/ (* l_m l_m) Om))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (sqrt
          (*
           t_2
           (- (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))))
   (if (<= t_3 0.0)
     (sqrt
      (*
       (*
        (+
         t
         (*
          -1.0
          (/
           (fma
            -1.0
            (/ (* (pow l_m 2.0) (* n (- U* U))) Om)
            (* 2.0 (pow l_m 2.0)))
           Om)))
        (+ n n))
       U))
     (if (<= t_3 4e+152)
       (sqrt
        (*
         t_2
         (fma (* (- U* U) (/ l_m Om)) (* (/ l_m Om) n) (fma -2.0 t_1 t))))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 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*))))) < 0.0

   1. Initial program 49.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. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\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. *-commutative N/A

         \[\leadsto \sqrt{\color{blue}{\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) \cdot \left(\left(2 \cdot n\right) \cdot U\right)}} \]

      3. lift-*.f64 N/A

         \[\leadsto \sqrt{\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) \cdot \color{blue}{\left(\left(2 \cdot n\right) \cdot U\right)}} \]

      4. associate-*r* N/A

         \[\leadsto \sqrt{\color{blue}{\left(\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) \cdot \left(2 \cdot n\right)\right) \cdot U}} \]

      5. lower-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\left(\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) \cdot \left(2 \cdot n\right)\right) \cdot U}} \]

   3. Applied rewrites 42.7%

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

   4. Taylor expanded in Om around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

   6. Applied rewrites 45.7%

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

   if 0.0 < (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*))))) < 4.0000000000000002e152

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\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. lift-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. distribute-lft-neg-in N/A

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

      8. lift--.f64 N/A

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

      9. sub-negate-rev N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lift-pow.f64 N/A

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

      13. unpow2 N/A

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

      14. associate-*l* N/A

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

      15. associate-*r* N/A

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

   3. Applied rewrites 51.8%

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

   if 4.0000000000000002e152 < (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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 3: 68.1% accurate, 0.3× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1 (/ (* l_m l_m) Om))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (sqrt
          (*
           t_2
           (- (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))))
   (if (<= t_3 0.0)
     (* (sqrt (* (- (* 2.0 (/ (pow l_m 2.0) Om)) t) U)) (sqrt (* -2.0 n)))
     (if (<= t_3 4e+152)
       (sqrt
        (*
         t_2
         (fma (* (- U* U) (/ l_m Om)) (* (/ l_m Om) n) (fma -2.0 t_1 t))))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 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*))))) < 0.0

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{\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. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - \color{blue}{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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 54.0

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

   3. Applied rewrites 54.0%

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

   5. Applied rewrites 27.1%

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

   6. Taylor expanded in n around 0

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

      1. lower--.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-pow.f64 26.3

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

   8. Applied rewrites 26.3%

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

   if 0.0 < (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*))))) < 4.0000000000000002e152

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\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. lift-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. distribute-lft-neg-in N/A

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

      8. lift--.f64 N/A

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

      9. sub-negate-rev N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lift-pow.f64 N/A

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

      13. unpow2 N/A

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

      14. associate-*l* N/A

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

      15. associate-*r* N/A

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

   3. Applied rewrites 51.8%

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

   if 4.0000000000000002e152 < (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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 4: 67.4% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1 (/ (* l_m l_m) Om))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (sqrt
          (*
           t_2
           (- (- t (* 2.0 t_1)) (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))))
   (if (<= t_3 0.0)
     (* (sqrt (* (- (* 2.0 (/ (pow l_m 2.0) Om)) t) U)) (sqrt (* -2.0 n)))
     (if (<= t_3 4e+152)
       (sqrt (* t_2 (fma (* U* (/ l_m Om)) (* (/ l_m Om) n) (fma -2.0 t_1 t))))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 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*))))) < 0.0

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{\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. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - \color{blue}{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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 54.0

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

   3. Applied rewrites 54.0%

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

   5. Applied rewrites 27.1%

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

   6. Taylor expanded in n around 0

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

      1. lower--.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-pow.f64 26.3

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

   8. Applied rewrites 26.3%

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

   if 0.0 < (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*))))) < 4.0000000000000002e152

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{\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. lift-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. distribute-lft-neg-in N/A

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

      8. lift--.f64 N/A

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

      9. sub-negate-rev N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lift-pow.f64 N/A

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

      13. unpow2 N/A

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

      14. associate-*l* N/A

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

      15. associate-*r* N/A

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

   3. Applied rewrites 51.8%

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

   4. Taylor expanded in U around 0

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

   6. Applied rewrites 51.8%

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

   if 4.0000000000000002e152 < (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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 5: 64.3% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1 (* 2.0 (/ (pow l_m 2.0) Om)))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (sqrt
          (*
           t_2
           (-
            (- t (* 2.0 (/ (* l_m l_m) Om)))
            (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))))
   (if (<= t_3 0.0)
     (* (sqrt (* (- t_1 t) U)) (sqrt (* -2.0 n)))
     (if (<= t_3 4e+152)
       (sqrt (* t_2 (- t t_1)))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 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*))))) < 0.0

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{\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. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - \color{blue}{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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 54.0

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

   3. Applied rewrites 54.0%

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

   5. Applied rewrites 27.1%

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

   6. Taylor expanded in n around 0

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

      1. lower--.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-pow.f64 26.3

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

   8. Applied rewrites 26.3%

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

   if 0.0 < (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*))))) < 4.0000000000000002e152

   1. Initial program 49.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 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. lower--.f64 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)} \]

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-pow.f64 44.2

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

   4. Applied rewrites 44.2%

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

   if 4.0000000000000002e152 < (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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 6: 63.9% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1 (- t (* 2.0 (/ (pow l_m 2.0) Om))))
        (t_2 (* (* 2.0 n) U))
        (t_3
         (sqrt
          (*
           t_2
           (-
            (- t (* 2.0 (/ (* l_m l_m) Om)))
            (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))))
   (if (<= t_3 0.0)
     (sqrt (* 2.0 (* U (* n t_1))))
     (if (<= t_3 4e+152)
       (sqrt (* t_2 t_1))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 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*))))) < 0.0

   1. Initial program 49.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 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. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-pow.f64 45.0

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

   4. Applied rewrites 45.0%

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

   if 0.0 < (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*))))) < 4.0000000000000002e152

   1. Initial program 49.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 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. lower--.f64 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)} \]

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-pow.f64 44.2

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

   4. Applied rewrites 44.2%

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

   if 4.0000000000000002e152 < (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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 7: 58.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ \begin{array}{l} \mathbf{if}\;l\_m \leq 1.9 \cdot 10^{-100}:\\ \;\;\;\;\sqrt{\left|t \cdot \left(U \cdot \left(n + n\right)\right)\right|}\\ \mathbf{elif}\;l\_m \leq 3.1 \cdot 10^{+87}:\\ \;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(\left(\frac{\mathsf{fma}\left(\frac{n}{Om}, U - U*, 2\right)}{Om} \cdot U\right) \cdot -2\right) \cdot n} \cdot l\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (if (<= l_m 1.9e-100)
   (sqrt (fabs (* t (* U (+ n n)))))
   (if (<= l_m 3.1e+87)
     (sqrt (* 2.0 (* U (* n (- t (* 2.0 (/ (pow l_m 2.0) Om)))))))
     (* (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n)) l_m))))

C

l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
	double tmp;
	if (l_m <= 1.9e-100) {
		tmp = sqrt(fabs((t * (U * (n + n)))));
	} else if (l_m <= 3.1e+87) {
		tmp = sqrt((2.0 * (U * (n * (t - (2.0 * (pow(l_m, 2.0) / Om)))))));
	} else {
		tmp = sqrt(((((fma((n / Om), (U - U_42_), 2.0) / Om) * U) * -2.0) * n)) * l_m;
	}
	return tmp;
}

Julia

l_m = abs(l)
function code(n, U, t, l_m, Om, U_42_)
	tmp = 0.0
	if (l_m <= 1.9e-100)
		tmp = sqrt(abs(Float64(t * Float64(U * Float64(n + n)))));
	elseif (l_m <= 3.1e+87)
		tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(2.0 * Float64((l_m ^ 2.0) / Om)))))));
	else
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(fma(Float64(n / Om), Float64(U - U_42_), 2.0) / Om) * U) * -2.0) * n)) * l_m);
	end
	return tmp
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 1.9e-100], N[Sqrt[N[Abs[N[(t * N[(U * N[(n + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 3.1e+87], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] / Om), $MachinePrecision] * U), $MachinePrecision] * -2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if l < 1.89999999999999999e-100

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

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

      23. associate-*r* N/A

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

      24. *-commutative N/A

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

      25. lower-*.f64 N/A

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

      26. count-2-rev N/A

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

      27. lower-+.f64 36.5

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

   6. Applied rewrites 36.5%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

   8. Applied rewrites 38.9%

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

   if 1.89999999999999999e-100 < l < 3.1e87

   1. Initial program 49.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 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. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-pow.f64 45.0

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

   4. Applied rewrites 45.0%

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

   if 3.1e87 < l

   1. Initial program 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 8: 57.1% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1
         (*
          (* (* 2.0 n) U)
          (-
           (- t (* 2.0 (/ (* l_m l_m) Om)))
           (* (* n (pow (/ l_m Om) 2.0)) (- U U*))))))
   (if (<= t_1 0.0)
     (* (sqrt (* (* -1.0 t) U)) (sqrt (* -2.0 n)))
     (if (<= t_1 1e+305)
       (sqrt (fabs (* t (* U (+ n n)))))
       (*
        (sqrt (* (* (* (/ (fma (/ n Om) (- U U*) 2.0) Om) U) -2.0) n))
        l_m)))))

C

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

Julia

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, 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$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[Sqrt[N[(N[(-1.0 * t), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(-2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+305], N[Sqrt[N[Abs[N[(t * N[(U * N[(n + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(N[(n / Om), $MachinePrecision] * N[(U - U$42$), $MachinePrecision] + 2.0), $MachinePrecision] / Om), $MachinePrecision] * U), $MachinePrecision] * -2.0), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision] * l$95$m), $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 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{\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. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - \color{blue}{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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 54.0

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

   3. Applied rewrites 54.0%

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

   5. Applied rewrites 27.1%

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

   6. Taylor expanded in t around inf

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

      1. lower-*.f64 21.3

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

   8. Applied rewrites 21.3%

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

   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*)))) < 9.9999999999999994e304

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

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

      23. associate-*r* N/A

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

      24. *-commutative N/A

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

      25. lower-*.f64 N/A

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

      26. count-2-rev N/A

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

      27. lower-+.f64 36.5

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

   6. Applied rewrites 36.5%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

   8. Applied rewrites 38.9%

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

   if 9.9999999999999994e304 < (*.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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

   6. Applied rewrites 28.8%

      \[\leadsto \ell \cdot \sqrt{-2 \cdot \left(\left(U \cdot \mathsf{fma}\left(U - U*, \frac{n}{Om \cdot Om}, \frac{2}{Om}\right)\right) \cdot n\right)} \]
   7. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

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

      6. lower-unsound-*.f64 N/A

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

   8. Applied rewrites 18.2%

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

   10. Applied rewrites 33.0%

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

Alternative 9: 45.9% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1
         (*
          (* (* 2.0 n) U)
          (-
           (- t (* 2.0 (/ (* l_m l_m) Om)))
           (* (* n (pow (/ l_m Om) 2.0)) (- U U*))))))
   (if (<= t_1 0.0)
     (* (sqrt (* (* -1.0 t) U)) (sqrt (* -2.0 n)))
     (if (<= t_1 1e+305)
       (sqrt (fabs (* t (* U (+ n n)))))
       (* l_m (sqrt (* -2.0 (* U (* n (/ 2.0 Om))))))))))

C

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

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) - ((n * ((l_m / om) ** 2.0d0)) * (u - u_42)))
    if (t_1 <= 0.0d0) then
        tmp = sqrt((((-1.0d0) * t) * u)) * sqrt(((-2.0d0) * n))
    else if (t_1 <= 1d+305) then
        tmp = sqrt(abs((t * (u * (n + n)))))
    else
        tmp = l_m * sqrt(((-2.0d0) * (u * (n * (2.0d0 / om)))))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, 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$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[Sqrt[N[(N[(-1.0 * t), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(-2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+305], N[Sqrt[N[Abs[N[(t * N[(U * N[(n + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(-2.0 * N[(U * N[(n * N[(2.0 / 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*)))) < 0.0

   1. Initial program 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{\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. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - \color{blue}{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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 54.0

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

   3. Applied rewrites 54.0%

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

   5. Applied rewrites 27.1%

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

   6. Taylor expanded in t around inf

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

      1. lower-*.f64 21.3

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

   8. Applied rewrites 21.3%

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

   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*)))) < 9.9999999999999994e304

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

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

      23. associate-*r* N/A

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

      24. *-commutative N/A

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

      25. lower-*.f64 N/A

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

      26. count-2-rev N/A

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

      27. lower-+.f64 36.5

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

   6. Applied rewrites 36.5%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

   8. Applied rewrites 38.9%

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

   if 9.9999999999999994e304 < (*.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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

   5. Taylor expanded in n around 0

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

      1. lower-/.f64 17.6

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

   7. Applied rewrites 17.6%

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

Alternative 10: 45.7% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1
         (*
          (* (* 2.0 n) U)
          (-
           (- t (* 2.0 (/ (* l_m l_m) Om)))
           (* (* n (pow (/ l_m Om) 2.0)) (- U U*))))))
   (if (<= t_1 0.0)
     (* (sqrt (* (* -1.0 t) U)) (sqrt (* -2.0 n)))
     (if (<= t_1 1e+305)
       (sqrt (fabs (* t (* U (+ n n)))))
       (* l_m (sqrt (* -4.0 (/ (* U n) Om))))))))

C

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

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) - ((n * ((l_m / om) ** 2.0d0)) * (u - u_42)))
    if (t_1 <= 0.0d0) then
        tmp = sqrt((((-1.0d0) * t) * u)) * sqrt(((-2.0d0) * n))
    else if (t_1 <= 1d+305) then
        tmp = sqrt(abs((t * (u * (n + n)))))
    else
        tmp = l_m * sqrt(((-4.0d0) * ((u * n) / om)))
    end if
    code = tmp
end function

Java

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

Python

l_m = math.fabs(l)
def code(n, U, t, l_m, Om, U_42_):
	t_1 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) - ((n * math.pow((l_m / Om), 2.0)) * (U - U_42_)))
	tmp = 0
	if t_1 <= 0.0:
		tmp = math.sqrt(((-1.0 * t) * U)) * math.sqrt((-2.0 * n))
	elif t_1 <= 1e+305:
		tmp = math.sqrt(math.fabs((t * (U * (n + n)))))
	else:
		tmp = l_m * math.sqrt((-4.0 * ((U * n) / Om)))
	return tmp

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, 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$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[Sqrt[N[(N[(-1.0 * t), $MachinePrecision] * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(-2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+305], N[Sqrt[N[Abs[N[(t * N[(U * N[(n + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(-4.0 * N[(N[(U * n), $MachinePrecision] / 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 49.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\color{blue}{\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. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - \color{blue}{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. fp-cancel-sub-sign-inv N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 54.0

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

   3. Applied rewrites 54.0%

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

   5. Applied rewrites 27.1%

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

   6. Taylor expanded in t around inf

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

      1. lower-*.f64 21.3

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

   8. Applied rewrites 21.3%

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

   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*)))) < 9.9999999999999994e304

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

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

      23. associate-*r* N/A

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

      24. *-commutative N/A

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

      25. lower-*.f64 N/A

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

      26. count-2-rev N/A

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

      27. lower-+.f64 36.5

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

   6. Applied rewrites 36.5%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

   8. Applied rewrites 38.9%

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

   if 9.9999999999999994e304 < (*.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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

   5. Taylor expanded in n around 0

      \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]

      2. lower-/.f64 N/A

         \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]

      3. lower-*.f64 17.6

         \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]

   7. Applied rewrites 17.6%

      \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 45.4% accurate, 0.4× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (let* ((t_1
         (*
          (* (* 2.0 n) U)
          (-
           (- t (* 2.0 (/ (* l_m l_m) Om)))
           (* (* n (pow (/ l_m Om) 2.0)) (- U U*))))))
   (if (<= t_1 0.0)
     (sqrt (* (* (+ U U) t) n))
     (if (<= t_1 1e+305)
       (sqrt (fabs (* t (* U (+ n n)))))
       (* l_m (sqrt (* -4.0 (/ (* U n) Om))))))))

C

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

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) - ((n * ((l_m / om) ** 2.0d0)) * (u - u_42)))
    if (t_1 <= 0.0d0) then
        tmp = sqrt((((u + u) * t) * n))
    else if (t_1 <= 1d+305) then
        tmp = sqrt(abs((t * (u * (n + n)))))
    else
        tmp = l_m * sqrt(((-4.0d0) * ((u * n) / om)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, 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$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[Sqrt[N[(N[(N[(U + U), $MachinePrecision] * t), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$1, 1e+305], N[Sqrt[N[Abs[N[(t * N[(U * N[(n + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(l$95$m * N[Sqrt[N[(-4.0 * N[(N[(U * n), $MachinePrecision] / 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 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. count-2-rev N/A

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

      10. lower-+.f64 35.9

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

   6. Applied rewrites 35.9%

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

   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*)))) < 9.9999999999999994e304

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

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

      23. associate-*r* N/A

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

      24. *-commutative N/A

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

      25. lower-*.f64 N/A

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

      26. count-2-rev N/A

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

      27. lower-+.f64 36.5

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

   6. Applied rewrites 36.5%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

   8. Applied rewrites 38.9%

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

   if 9.9999999999999994e304 < (*.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 49.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 l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-pow.f64 27.5

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

   4. Applied rewrites 27.5%

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

   5. Taylor expanded in n around 0

      \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]

      2. lower-/.f64 N/A

         \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]

      3. lower-*.f64 17.6

         \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]

   7. Applied rewrites 17.6%

      \[\leadsto \ell \cdot \sqrt{-4 \cdot \frac{U \cdot n}{Om}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 12: 41.7% accurate, 0.8× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (if (<=
      (sqrt
       (*
        (* (* 2.0 n) U)
        (-
         (- t (* 2.0 (/ (* l_m l_m) Om)))
         (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))
      0.0)
   (sqrt (* (+ U U) (* t n)))
   (sqrt (fabs (* t (* U (+ n n)))))))

C

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

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: tmp
    if (sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) - ((n * ((l_m / om) ** 2.0d0)) * (u - u_42))))) <= 0.0d0) then
        tmp = sqrt(((u + u) * (t * n)))
    else
        tmp = sqrt(abs((t * (u * (n + n)))))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[Sqrt[N[(N[(U + U), $MachinePrecision] * N[(t * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(t * N[(U * N[(n + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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*))))) < 0.0

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 36.8

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 36.8

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

   6. Applied rewrites 36.8%

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

   if 0.0 < (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 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

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

      23. associate-*r* N/A

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

      24. *-commutative N/A

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

      25. lower-*.f64 N/A

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

      26. count-2-rev N/A

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

      27. lower-+.f64 36.5

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

   6. Applied rewrites 36.5%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

   8. Applied rewrites 38.9%

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

Alternative 13: 39.3% accurate, 0.8× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (if (<=
      (sqrt
       (*
        (* (* 2.0 n) U)
        (-
         (- t (* 2.0 (/ (* l_m l_m) Om)))
         (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))
      0.0)
   (sqrt (* (+ U U) (* t n)))
   (sqrt (* (* (+ U U) n) t))))

C

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

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: tmp
    if (sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) - ((n * ((l_m / om) ** 2.0d0)) * (u - u_42))))) <= 0.0d0) then
        tmp = sqrt(((u + u) * (t * n)))
    else
        tmp = sqrt((((u + u) * n) * t))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[Sqrt[N[(N[(U + U), $MachinePrecision] * N[(t * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(U + U), $MachinePrecision] * n), $MachinePrecision] * 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*))))) < 0.0

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 36.8

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 36.8

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

   6. Applied rewrites 36.8%

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

   if 0.0 < (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 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 36.8

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

   4. Applied rewrites 36.8%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. count-2-rev N/A

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

      9. lift-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. count-2-rev N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 36.5

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

      16. lift-*.f64 N/A

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

      17. lift-*.f64 N/A

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

      18. count-2-rev N/A

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

      19. lift-+.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-+.f64 N/A

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

      22. count-2-rev N/A

          \[\leadsto \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t} \]

      23. associate-*r* N/A

          \[\leadsto \sqrt{\left(\left(U \cdot 2\right) \cdot n\right) \cdot t} \]

      24. *-commutative N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot t} \]

      25. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot t} \]

      26. count-2-rev N/A

          \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \]

      27. lower-+.f64 36.5

          \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \]

   6. Applied rewrites 36.5%

      \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot \color{blue}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 39.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ \begin{array}{l} \mathbf{if}\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) - \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)} \leq 0:\\ \;\;\;\;\sqrt{\left(\left(U + U\right) \cdot t\right) \cdot n}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
 :precision binary64
 (if (<=
      (sqrt
       (*
        (* (* 2.0 n) U)
        (-
         (- t (* 2.0 (/ (* l_m l_m) Om)))
         (* (* n (pow (/ l_m Om) 2.0)) (- U U*)))))
      0.0)
   (sqrt (* (* (+ U U) t) n))
   (sqrt (* (* (+ U U) n) t))))

C

l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
	double tmp;
	if (sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) - ((n * pow((l_m / Om), 2.0)) * (U - U_42_))))) <= 0.0) {
		tmp = sqrt((((U + U) * t) * n));
	} else {
		tmp = sqrt((((U + U) * n) * t));
	}
	return tmp;
}

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    real(8) :: tmp
    if (sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) - ((n * ((l_m / om) ** 2.0d0)) * (u - u_42))))) <= 0.0d0) then
        tmp = sqrt((((u + u) * t) * n))
    else
        tmp = sqrt((((u + u) * n) * t))
    end if
    code = tmp
end function

Java

l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
	double tmp;
	if (Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) - ((n * Math.pow((l_m / Om), 2.0)) * (U - U_42_))))) <= 0.0) {
		tmp = Math.sqrt((((U + U) * t) * n));
	} else {
		tmp = Math.sqrt((((U + U) * n) * t));
	}
	return tmp;
}

Python

l_m = math.fabs(l)
def code(n, U, t, l_m, Om, U_42_):
	tmp = 0
	if math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) - ((n * math.pow((l_m / Om), 2.0)) * (U - U_42_))))) <= 0.0:
		tmp = math.sqrt((((U + U) * t) * n))
	else:
		tmp = math.sqrt((((U + U) * n) * t))
	return tmp

Julia

l_m = abs(l)
function code(n, U, t, l_m, Om, U_42_)
	tmp = 0.0
	if (sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) - Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U - U_42_))))) <= 0.0)
		tmp = sqrt(Float64(Float64(Float64(U + U) * t) * n));
	else
		tmp = sqrt(Float64(Float64(Float64(U + U) * n) * t));
	end
	return tmp
end

MATLAB

l_m = abs(l);
function tmp_2 = code(n, U, t, l_m, Om, U_42_)
	tmp = 0.0;
	if (sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) - ((n * ((l_m / Om) ^ 2.0)) * (U - U_42_))))) <= 0.0)
		tmp = sqrt((((U + U) * t) * n));
	else
		tmp = sqrt((((U + U) * n) * t));
	end
	tmp_2 = tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[Sqrt[N[(N[(N[(U + U), $MachinePrecision] * t), $MachinePrecision] * n), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(U + U), $MachinePrecision] * n), $MachinePrecision] * 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*))))) < 0.0

   1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \color{blue}{\left(U \cdot \left(n \cdot t\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \left(U \cdot \color{blue}{\left(n \cdot t\right)}\right)} \]

      3. lower-*.f64 36.8

         \[\leadsto \sqrt{2 \cdot \left(U \cdot \left(n \cdot \color{blue}{t}\right)\right)} \]

   4. Applied rewrites 36.8%

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \color{blue}{\left(U \cdot \left(n \cdot t\right)\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \left(U \cdot \color{blue}{\left(n \cdot t\right)}\right)} \]

      3. associate-*r* N/A

         \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \color{blue}{\left(n \cdot t\right)}} \]

      4. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \color{blue}{t}\right)} \]

      5. *-commutative N/A

         \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \left(t \cdot \color{blue}{n}\right)} \]

      6. associate-*r* N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot t\right) \cdot \color{blue}{n}} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot t\right) \cdot \color{blue}{n}} \]

      8. lower-*.f64 N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot t\right) \cdot n} \]

      9. count-2-rev N/A

         \[\leadsto \sqrt{\left(\left(U + U\right) \cdot t\right) \cdot n} \]

      10. lower-+.f64 35.9

          \[\leadsto \sqrt{\left(\left(U + U\right) \cdot t\right) \cdot n} \]

   6. Applied rewrites 35.9%

      \[\leadsto \sqrt{\left(\left(U + U\right) \cdot t\right) \cdot \color{blue}{n}} \]

   if 0.0 < (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 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \color{blue}{\left(U \cdot \left(n \cdot t\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \left(U \cdot \color{blue}{\left(n \cdot t\right)}\right)} \]

      3. lower-*.f64 36.8

         \[\leadsto \sqrt{2 \cdot \left(U \cdot \left(n \cdot \color{blue}{t}\right)\right)} \]

   4. Applied rewrites 36.8%

      \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \color{blue}{\left(U \cdot \left(n \cdot t\right)\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{2 \cdot \left(U \cdot \color{blue}{\left(n \cdot t\right)}\right)} \]

      3. associate-*r* N/A

         \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \color{blue}{\left(n \cdot t\right)}} \]

      4. lift-*.f64 N/A

         \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \color{blue}{t}\right)} \]

      5. associate-*r* N/A

         \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot \color{blue}{t}} \]

      6. *-commutative N/A

         \[\leadsto \sqrt{\left(\left(U \cdot 2\right) \cdot n\right) \cdot t} \]

      7. associate-*r* N/A

         \[\leadsto \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t} \]

      8. count-2-rev N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

      9. lift-+.f64 N/A

         \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

      10. *-commutative N/A

          \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

      11. lift-+.f64 N/A

          \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

      12. count-2-rev N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

      13. lift-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

      14. lift-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

      15. lower-*.f64 36.5

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{t}} \]

      16. lift-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

      17. lift-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

      18. count-2-rev N/A

          \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

      19. lift-+.f64 N/A

          \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

      20. *-commutative N/A

          \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

      21. lift-+.f64 N/A

          \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

      22. count-2-rev N/A

          \[\leadsto \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t} \]

      23. associate-*r* N/A

          \[\leadsto \sqrt{\left(\left(U \cdot 2\right) \cdot n\right) \cdot t} \]

      24. *-commutative N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot t} \]

      25. lower-*.f64 N/A

          \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot t} \]

      26. count-2-rev N/A

          \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \]

      27. lower-+.f64 36.5

          \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \]

   6. Applied rewrites 36.5%

      \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot \color{blue}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 36.5% accurate, 4.7× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \end{array} \]

FPCore

l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* (* (+ U U) n) t)))

C

l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
	return sqrt((((U + U) * n) * t));
}

Fortran

l_m =     private
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_m, 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_m
    real(8), intent (in) :: om
    real(8), intent (in) :: u_42
    code = sqrt((((u + u) * n) * t))
end function

Java

l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
	return Math.sqrt((((U + U) * n) * t));
}

Python

l_m = math.fabs(l)
def code(n, U, t, l_m, Om, U_42_):
	return math.sqrt((((U + U) * n) * t))

Julia

l_m = abs(l)
function code(n, U, t, l_m, Om, U_42_)
	return sqrt(Float64(Float64(Float64(U + U) * n) * t))
end

MATLAB

l_m = abs(l);
function tmp = code(n, U, t, l_m, Om, U_42_)
	tmp = sqrt((((U + U) * n) * t));
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(U + U), $MachinePrecision] * n), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 49.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{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
3. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \sqrt{2 \cdot \color{blue}{\left(U \cdot \left(n \cdot t\right)\right)}} \]

   2. lower-*.f64 N/A

      \[\leadsto \sqrt{2 \cdot \left(U \cdot \color{blue}{\left(n \cdot t\right)}\right)} \]

   3. lower-*.f64 36.8

      \[\leadsto \sqrt{2 \cdot \left(U \cdot \left(n \cdot \color{blue}{t}\right)\right)} \]

4. Applied rewrites 36.8%

   \[\leadsto \sqrt{\color{blue}{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}} \]
5. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \sqrt{2 \cdot \color{blue}{\left(U \cdot \left(n \cdot t\right)\right)}} \]

   2. lift-*.f64 N/A

      \[\leadsto \sqrt{2 \cdot \left(U \cdot \color{blue}{\left(n \cdot t\right)}\right)} \]

   3. associate-*r* N/A

      \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \color{blue}{\left(n \cdot t\right)}} \]

   4. lift-*.f64 N/A

      \[\leadsto \sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \color{blue}{t}\right)} \]

   5. associate-*r* N/A

      \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot \color{blue}{t}} \]

   6. *-commutative N/A

      \[\leadsto \sqrt{\left(\left(U \cdot 2\right) \cdot n\right) \cdot t} \]

   7. associate-*r* N/A

      \[\leadsto \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t} \]

   8. count-2-rev N/A

      \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

   9. lift-+.f64 N/A

      \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

   10. *-commutative N/A

       \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

   11. lift-+.f64 N/A

       \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

   12. count-2-rev N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

   13. lift-*.f64 N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

   14. lift-*.f64 N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

   15. lower-*.f64 36.5

       \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \color{blue}{t}} \]

   16. lift-*.f64 N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

   17. lift-*.f64 N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t} \]

   18. count-2-rev N/A

       \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

   19. lift-+.f64 N/A

       \[\leadsto \sqrt{\left(\left(n + n\right) \cdot U\right) \cdot t} \]

   20. *-commutative N/A

       \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

   21. lift-+.f64 N/A

       \[\leadsto \sqrt{\left(U \cdot \left(n + n\right)\right) \cdot t} \]

   22. count-2-rev N/A

       \[\leadsto \sqrt{\left(U \cdot \left(2 \cdot n\right)\right) \cdot t} \]

   23. associate-*r* N/A

       \[\leadsto \sqrt{\left(\left(U \cdot 2\right) \cdot n\right) \cdot t} \]

   24. *-commutative N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot t} \]

   25. lower-*.f64 N/A

       \[\leadsto \sqrt{\left(\left(2 \cdot U\right) \cdot n\right) \cdot t} \]

   26. count-2-rev N/A

       \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \]

   27. lower-+.f64 36.5

       \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot t} \]

6. Applied rewrites 36.5%

   \[\leadsto \sqrt{\left(\left(U + U\right) \cdot n\right) \cdot \color{blue}{t}} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2025154 
(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*))))))