Toniolo and Linder, Equation (13)

Percentage Accurate: 49.9% → 61.5%

Time: 8.7s

Alternatives: 16

Speedup: 1.6×

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: 61.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (fma -2.0 (* l (/ l Om)) t)) (t_2 (* (/ l Om) (/ l Om))))
   (if (<= n -7.5e-44)
     (sqrt (* (* (* 2.0 n) U) (- t (* (* n t_2) (- U U*)))))
     (if (<= n 6e-47)
       (sqrt (* (* (* t_1 n) U) 2.0))
       (* (pow (+ n n) 0.5) (pow (* U (- t_1 (* n (* t_2 (- U U*))))) 0.5))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = fma(-2.0, (l * (l / Om)), t);
	double t_2 = (l / Om) * (l / Om);
	double tmp;
	if (n <= -7.5e-44) {
		tmp = sqrt((((2.0 * n) * U) * (t - ((n * t_2) * (U - U_42_)))));
	} else if (n <= 6e-47) {
		tmp = sqrt((((t_1 * n) * U) * 2.0));
	} else {
		tmp = pow((n + n), 0.5) * pow((U * (t_1 - (n * (t_2 * (U - U_42_))))), 0.5);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if n < -7.50000000000000008e-44

   1. Initial program 54.8%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 59.9%

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

      1. lift-/.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. pow2 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 59.9

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

   6. Applied rewrites 59.9%

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

   if -7.50000000000000008e-44 < n < 6.00000000000000033e-47

   1. Initial program 43.8%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 52.5

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

   4. Applied rewrites 52.5%

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

   if 6.00000000000000033e-47 < n

   1. Initial program 56.3%

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

   3. Applied rewrites 66.7%

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

Alternative 2: 58.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 24.3%

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

   3. Applied rewrites 41.5%

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

   4. Taylor expanded in n around 0

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

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

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

      2. metadata-eval N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 40.7

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

   6. Applied rewrites 40.7%

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

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

   1. Initial program 97.7%

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

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

   1. Initial program 31.8%

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

   3. Applied rewrites 43.6%

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

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

   1. Initial program 0.0%

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

   2. Taylor expanded in U* around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 26.5

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

   4. Applied rewrites 26.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unswap-sqr N/A

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

      12. lower-*.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-*.f64 34.4

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

   6. Applied rewrites 34.4%

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

Alternative 3: 56.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if n < -7.50000000000000008e-44

   1. Initial program 54.8%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 59.9%

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

      1. lift-/.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. pow2 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 59.9

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

   6. Applied rewrites 59.9%

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

   if -7.50000000000000008e-44 < n < 7.50000000000000007e-24

   1. Initial program 44.3%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 52.6

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

   4. Applied rewrites 52.6%

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

   if 7.50000000000000007e-24 < n

   1. Initial program 56.3%

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

   3. Applied rewrites 58.5%

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

   5. Applied rewrites 55.8%

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

Alternative 4: 56.1% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (fma -2.0 (* l (/ l Om)) t)) (t_2 (* (/ l Om) (/ l Om))))
   (if (<= n -7.5e-44)
     (sqrt (* (* (* 2.0 n) U) (- t (* (* n t_2) (- U U*)))))
     (if (<= n 2.45e-27)
       (sqrt (* (* (* t_1 n) U) 2.0))
       (sqrt (* (+ n n) (* U (- t_1 (* n (* t_2 (- U U*)))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = fma(-2.0, (l * (l / Om)), t);
	double t_2 = (l / Om) * (l / Om);
	double tmp;
	if (n <= -7.5e-44) {
		tmp = sqrt((((2.0 * n) * U) * (t - ((n * t_2) * (U - U_42_)))));
	} else if (n <= 2.45e-27) {
		tmp = sqrt((((t_1 * n) * U) * 2.0));
	} else {
		tmp = sqrt(((n + n) * (U * (t_1 - (n * (t_2 * (U - U_42_)))))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = fma(-2.0, Float64(l * Float64(l / Om)), t)
	t_2 = Float64(Float64(l / Om) * Float64(l / Om))
	tmp = 0.0
	if (n <= -7.5e-44)
		tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(Float64(n * t_2) * Float64(U - U_42_)))));
	elseif (n <= 2.45e-27)
		tmp = sqrt(Float64(Float64(Float64(t_1 * n) * U) * 2.0));
	else
		tmp = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t_1 - Float64(n * Float64(t_2 * Float64(U - U_42_)))))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if n < -7.50000000000000008e-44

   1. Initial program 54.8%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 59.9%

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

      1. lift-/.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. pow2 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 59.9

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

   6. Applied rewrites 59.9%

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

   if -7.50000000000000008e-44 < n < 2.44999999999999988e-27

   1. Initial program 44.3%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 52.7

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

   4. Applied rewrites 52.7%

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

   if 2.44999999999999988e-27 < n

   1. Initial program 56.2%

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

   3. Applied rewrites 58.4%

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

Alternative 5: 55.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - \left(n \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right) \cdot \left(U - U*\right)\right)}\\ \mathbf{if}\;n \leq -7.5 \cdot 10^{-44}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;n \leq 7.6 \cdot 10^{-63}:\\ \;\;\;\;\sqrt{\left(\left(\mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right) \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (sqrt
          (* (* (* 2.0 n) U) (- t (* (* n (* (/ l Om) (/ l Om))) (- U U*)))))))
   (if (<= n -7.5e-44)
     t_1
     (if (<= n 7.6e-63)
       (sqrt (* (* (* (fma -2.0 (* l (/ l Om)) t) n) U) 2.0))
       t_1))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = sqrt((((2.0 * n) * U) * (t - ((n * ((l / Om) * (l / Om))) * (U - U_42_)))));
	double tmp;
	if (n <= -7.5e-44) {
		tmp = t_1;
	} else if (n <= 7.6e-63) {
		tmp = sqrt((((fma(-2.0, (l * (l / Om)), t) * n) * U) * 2.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(Float64(n * Float64(Float64(l / Om) * Float64(l / Om))) * Float64(U - U_42_)))))
	tmp = 0.0
	if (n <= -7.5e-44)
		tmp = t_1;
	elseif (n <= 7.6e-63)
		tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(l * Float64(l / Om)), t) * n) * U) * 2.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if n < -7.50000000000000008e-44 or 7.60000000000000034e-63 < n

   1. Initial program 55.6%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.6%

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

      1. lift-/.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. pow2 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 60.6

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

   6. Applied rewrites 60.6%

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

   if -7.50000000000000008e-44 < n < 7.60000000000000034e-63

   1. Initial program 43.4%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 52.3

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

   4. Applied rewrites 52.3%

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

Alternative 6: 55.3% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1
         (sqrt
          (* (+ n n) (* U (- t (* n (* (* (/ l Om) (/ l Om)) (- U U*)))))))))
   (if (<= n -7.5e-44)
     t_1
     (if (<= n 3.2e-92)
       (sqrt (* (* (* (fma -2.0 (* l (/ l Om)) t) n) U) 2.0))
       t_1))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = sqrt(((n + n) * (U * (t - (n * (((l / Om) * (l / Om)) * (U - U_42_)))))));
	double tmp;
	if (n <= -7.5e-44) {
		tmp = t_1;
	} else if (n <= 3.2e-92) {
		tmp = sqrt((((fma(-2.0, (l * (l / Om)), t) * n) * U) * 2.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = sqrt(Float64(Float64(n + n) * Float64(U * Float64(t - Float64(n * Float64(Float64(Float64(l / Om) * Float64(l / Om)) * Float64(U - U_42_)))))))
	tmp = 0.0
	if (n <= -7.5e-44)
		tmp = t_1;
	elseif (n <= 3.2e-92)
		tmp = sqrt(Float64(Float64(Float64(fma(-2.0, Float64(l * Float64(l / Om)), t) * n) * U) * 2.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if n < -7.50000000000000008e-44 or 3.1999999999999997e-92 < n

   1. Initial program 55.6%

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

   3. Applied rewrites 58.9%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 59.5%

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

   if -7.50000000000000008e-44 < n < 3.1999999999999997e-92

   1. Initial program 42.7%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 52.0

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

   4. Applied rewrites 52.0%

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

Alternative 7: 52.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 * N[(t$95$2 - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 2e-245], N[Sqrt[N[(N[(n + n), $MachinePrecision] * N[(U * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, 1e+307], N[Sqrt[N[(t$95$1 * N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(N[(U$42$ * U), $MachinePrecision] / Om), $MachinePrecision] * N[(N[(N[(n * l), $MachinePrecision] * N[(n * l), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * 2.0), $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*)))) < 1.9999999999999999e-245

   1. Initial program 24.3%

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

   3. Applied rewrites 41.5%

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

   4. Taylor expanded in n around 0

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

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

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

      2. metadata-eval N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 40.7

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

   6. Applied rewrites 40.7%

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

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

   1. Initial program 97.7%

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

   2. Taylor expanded in n around 0

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

      1. metadata-eval N/A

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

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

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. pow2 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lift-/.f64 85.1

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

   4. Applied rewrites 85.1%

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

   if 9.99999999999999986e306 < (*.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 21.4%

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

   2. Taylor expanded in U* around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 25.2

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

   4. Applied rewrites 25.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unswap-sqr N/A

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

      12. lower-*.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-*.f64 31.6

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

   6. Applied rewrites 31.6%

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

Alternative 8: 52.6% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-2, \ell \cdot \frac{\ell}{Om}, t\right)\\ \mathbf{if}\;n \leq -5 \cdot 10^{+78}:\\ \;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\_1}\\ \mathbf{elif}\;n \leq 3.5 \cdot 10^{-45}:\\ \;\;\;\;\sqrt{\left(\left(t\_1 \cdot n\right) \cdot U\right) \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{n + n} \cdot \sqrt{U \cdot \left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (fma -2.0 (* l (/ l Om)) t)))
   (if (<= n -5e+78)
     (sqrt (* (* (* 2.0 n) U) t_1))
     (if (<= n 3.5e-45)
       (sqrt (* (* (* t_1 n) U) 2.0))
       (* (sqrt (+ n n)) (sqrt (* U (- t (* 2.0 (/ (* l l) Om))))))))))

C

double code(double n, double U, double t, double l, double Om, double U_42_) {
	double t_1 = fma(-2.0, (l * (l / Om)), t);
	double tmp;
	if (n <= -5e+78) {
		tmp = sqrt((((2.0 * n) * U) * t_1));
	} else if (n <= 3.5e-45) {
		tmp = sqrt((((t_1 * n) * U) * 2.0));
	} else {
		tmp = sqrt((n + n)) * sqrt((U * (t - (2.0 * ((l * l) / Om)))));
	}
	return tmp;
}

Julia

function code(n, U, t, l, Om, U_42_)
	t_1 = fma(-2.0, Float64(l * Float64(l / Om)), t)
	tmp = 0.0
	if (n <= -5e+78)
		tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1));
	elseif (n <= 3.5e-45)
		tmp = sqrt(Float64(Float64(Float64(t_1 * n) * U) * 2.0));
	else
		tmp = Float64(sqrt(Float64(n + n)) * sqrt(Float64(U * Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if n < -4.99999999999999984e78

   1. Initial program 54.8%

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

   2. Taylor expanded in n around 0

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

      1. metadata-eval N/A

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

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

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. pow2 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lift-/.f64 46.2

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

   4. Applied rewrites 46.2%

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

   if -4.99999999999999984e78 < n < 3.5e-45

   1. Initial program 45.7%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 52.3

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

   4. Applied rewrites 52.3%

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

   if 3.5e-45 < n

   1. Initial program 56.3%

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

   3. Applied rewrites 58.5%

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

   4. Taylor expanded in n around 0

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

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

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

      2. metadata-eval N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 43.6

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

   6. Applied rewrites 43.6%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. sqrt-prod N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 47.7

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

   8. Applied rewrites 47.7%

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

Alternative 9: 52.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 24.3%

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

   3. Applied rewrites 41.5%

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

   4. Taylor expanded in n around 0

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

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

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

      2. metadata-eval N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 40.7

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

   6. Applied rewrites 40.7%

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

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

   1. Initial program 67.7%

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

   2. Taylor expanded in n around 0

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

      1. metadata-eval N/A

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

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

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. pow2 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lift-/.f64 62.2

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

   4. Applied rewrites 62.2%

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

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

   1. Initial program 0.0%

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

   2. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 7.3

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

   4. Applied rewrites 7.3%

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

      1. lift-sqrt.f64 N/A

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

      2. pow1/2 N/A

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

      3. lower-pow.f64 10.9

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

   6. Applied rewrites 10.9%

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

   7. Taylor expanded in U* around -inf

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

      1. sqrt-unprod N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 23.5

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

   9. Applied rewrites 23.5%

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

Alternative 10: 50.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 31.8%

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

   2. Taylor expanded in n around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 45.6

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

   4. Applied rewrites 45.6%

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

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

   1. Initial program 66.8%

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

   2. Taylor expanded in n around 0

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

      1. metadata-eval N/A

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

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

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. pow2 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lift-/.f64 61.4

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

   4. Applied rewrites 61.4%

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

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

   1. Initial program 0.0%

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

   2. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 7.3

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

   4. Applied rewrites 7.3%

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

      1. lift-sqrt.f64 N/A

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

      2. pow1/2 N/A

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

      3. lower-pow.f64 10.9

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

   6. Applied rewrites 10.9%

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

   7. Taylor expanded in U* around -inf

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

      1. sqrt-unprod N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 23.5

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

   9. Applied rewrites 23.5%

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

Alternative 11: 46.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 66.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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. pow2 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lift-/.f64 64.9

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

   4. Applied rewrites 64.9%

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

   if 9.9999999999999992e124 < (*.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.99999999999999986e306

   1. Initial program 99.3%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 77.2%

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

   if 9.99999999999999986e306 < (*.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 21.4%

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

   2. Taylor expanded in U* around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-sqrt.f64 21.2

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

   4. Applied rewrites 21.2%

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

Alternative 12: 42.8% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (let* ((t_1 (* (* 2.0 n) U))
        (t_2
         (sqrt
          (*
           t_1
           (-
            (- t (* 2.0 (/ (* l l) Om)))
            (* (* n (pow (/ l Om) 2.0)) (- U U*)))))))
   (if (<= t_2 5e-101)
     (sqrt (* (* (* t n) U) 2.0))
     (if (<= t_2 4e+153)
       (sqrt (* t_1 t))
       (* (sqrt (* U* U)) (/ (* (* (sqrt 2.0) n) l) Om))))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(n, U, t, l, Om, U_42_):
	t_1 = (2.0 * n) * U
	t_2 = math.sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
	tmp = 0
	if t_2 <= 5e-101:
		tmp = math.sqrt((((t * n) * U) * 2.0))
	elif t_2 <= 4e+153:
		tmp = math.sqrt((t_1 * t))
	else:
		tmp = math.sqrt((U_42_ * U)) * (((math.sqrt(2.0) * n) * l) / Om)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(n, U, t, l, Om, U_42_)
	t_1 = (2.0 * n) * U;
	t_2 = sqrt((t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_)))));
	tmp = 0.0;
	if (t_2 <= 5e-101)
		tmp = sqrt((((t * n) * U) * 2.0));
	elseif (t_2 <= 4e+153)
		tmp = sqrt((t_1 * t));
	else
		tmp = sqrt((U_42_ * U)) * (((sqrt(2.0) * n) * l) / Om);
	end
	tmp_2 = tmp;
end

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(t$95$1 * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 5e-101], N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, 4e+153], N[Sqrt[N[(t$95$1 * t), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U$42$ * U), $MachinePrecision]], $MachinePrecision] * N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * n), $MachinePrecision] * l), $MachinePrecision] / Om), $MachinePrecision]), $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*))))) < 5.0000000000000001e-101

   1. Initial program 34.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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 39.7

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

   4. Applied rewrites 39.7%

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

   if 5.0000000000000001e-101 < (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*))))) < 4e153

   1. Initial program 97.8%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 74.8%

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

   if 4e153 < (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 20.6%

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

   2. Taylor expanded in U* around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-sqrt.f64 20.7

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

   4. Applied rewrites 20.7%

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

Alternative 13: 39.2% accurate, 3.1× speedup

Math

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

FPCore

(FPCore (n U t l Om U*)
 :precision binary64
 (if (<= t 1.08e-302)
   (sqrt (* (* (* t n) U) 2.0))
   (* (sqrt (* (* 2.0 n) U)) (sqrt t))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.07999999999999994e-302

   1. Initial program 50.0%

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

   2. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 36.3

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

   4. Applied rewrites 36.3%

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

   if 1.07999999999999994e-302 < t

   1. Initial program 49.7%

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

   2. Taylor expanded in Om around 0

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 25.7%

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

   5. Taylor expanded in t around inf

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

   7. Applied rewrites 35.7%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. sqrt-prod N/A

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

      4. lower-*.f64 N/A

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

   9. Applied rewrites 42.2%

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

Alternative 14: 37.5% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if n < 5.3999999999999997e-45

   1. Initial program 47.6%

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

   2. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 36.6

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

   4. Applied rewrites 36.6%

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

   if 5.3999999999999997e-45 < n

   1. Initial program 56.3%

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

   3. Applied rewrites 58.5%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 35.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. sqrt-prod N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 40.1

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

   8. Applied rewrites 40.1%

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

Alternative 15: 36.0% accurate, 4.6× speedup

Math

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

FPCore

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

C

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

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((((t * n) * u) * 2.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(t * n), $MachinePrecision] * U), $MachinePrecision] * 2.0), $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. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 36.0

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

4. Applied rewrites 36.0%

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

Alternative 16: 35.5% accurate, 4.7× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

4. Taylor expanded in t around inf

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

6. Applied rewrites 35.5%

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

Reproduce

herbie shell --seed 2025119 
(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*))))))