Toniolo and Linder, Equation (7)

Percentage Accurate: 33.7% → 85.0%

Time: 10.7s

Alternatives: 14

Speedup: 85.0×

Specification

Math

\[\begin{array}{l} \\ \frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \end{array} \]

FPCore

(FPCore (x l t)
 :precision binary64
 (/
  (* (sqrt 2.0) t)
  (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))

C

double code(double x, double l, double t) {
	return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

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(x, l, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

public static double code(double x, double l, double t) {
	return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Python

def code(x, l, t):
	return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))

Julia

function code(x, l, t)
	return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l))))
end

MATLAB

function tmp = code(x, l, t)
	tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
end

Wolfram

code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 33.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \end{array} \]

FPCore

(FPCore (x l t)
 :precision binary64
 (/
  (* (sqrt 2.0) t)
  (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))

C

double code(double x, double l, double t) {
	return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

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(x, l, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

public static double code(double x, double l, double t) {
	return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Python

def code(x, l, t):
	return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))

Julia

function code(x, l, t)
	return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l))))
end

MATLAB

function tmp = code(x, l, t)
	tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
end

Wolfram

code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 85.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \mathsf{fma}\left(t\_m \cdot t\_m, 2, l\_m \cdot l\_m\right)\\ t_3 := \mathsf{fma}\left(2 \cdot t\_m, t\_m, \mathsf{fma}\left(l\_m, l\_m, t\_2\right)\right)\\ t_4 := \frac{t\_2}{x}\\ t_5 := \sqrt{2} \cdot t\_m\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 8.8 \cdot 10^{-255}:\\ \;\;\;\;\frac{t\_5}{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, \frac{l\_m}{\sqrt{2}}, \sqrt{\frac{1}{x}} \cdot \left(\sqrt{2} \cdot l\_m\right)\right)}\\ \mathbf{elif}\;t\_m \leq 1.85 \cdot 10^{-200}:\\ \;\;\;\;\frac{t\_5}{\mathsf{fma}\left(\frac{t\_3}{\left(\sqrt{2} \cdot x\right) \cdot t\_m}, 0.5, t\_5\right)}\\ \mathbf{elif}\;t\_m \leq 3.8 \cdot 10^{+23}:\\ \;\;\;\;\frac{t\_5}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{\left(t\_4 + t\_3\right) + t\_4}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_5}{\sqrt{\frac{1 + x}{x - 1}} \cdot t\_5}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (fma (* t_m t_m) 2.0 (* l_m l_m)))
        (t_3 (fma (* 2.0 t_m) t_m (fma l_m l_m t_2)))
        (t_4 (/ t_2 x))
        (t_5 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= t_m 8.8e-255)
      (/
       t_5
       (fma
        (sqrt (/ 1.0 (pow x 3.0)))
        (/ l_m (sqrt 2.0))
        (* (sqrt (/ 1.0 x)) (* (sqrt 2.0) l_m))))
      (if (<= t_m 1.85e-200)
        (/ t_5 (fma (/ t_3 (* (* (sqrt 2.0) x) t_m)) 0.5 t_5))
        (if (<= t_m 3.8e+23)
          (/ t_5 (sqrt (fma (* 2.0 t_m) t_m (/ (+ (+ t_4 t_3) t_4) x))))
          (/ t_5 (* (sqrt (/ (+ 1.0 x) (- x 1.0))) t_5))))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = fma((t_m * t_m), 2.0, (l_m * l_m));
	double t_3 = fma((2.0 * t_m), t_m, fma(l_m, l_m, t_2));
	double t_4 = t_2 / x;
	double t_5 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 8.8e-255) {
		tmp = t_5 / fma(sqrt((1.0 / pow(x, 3.0))), (l_m / sqrt(2.0)), (sqrt((1.0 / x)) * (sqrt(2.0) * l_m)));
	} else if (t_m <= 1.85e-200) {
		tmp = t_5 / fma((t_3 / ((sqrt(2.0) * x) * t_m)), 0.5, t_5);
	} else if (t_m <= 3.8e+23) {
		tmp = t_5 / sqrt(fma((2.0 * t_m), t_m, (((t_4 + t_3) + t_4) / x)));
	} else {
		tmp = t_5 / (sqrt(((1.0 + x) / (x - 1.0))) * t_5);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = fma(Float64(t_m * t_m), 2.0, Float64(l_m * l_m))
	t_3 = fma(Float64(2.0 * t_m), t_m, fma(l_m, l_m, t_2))
	t_4 = Float64(t_2 / x)
	t_5 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 8.8e-255)
		tmp = Float64(t_5 / fma(sqrt(Float64(1.0 / (x ^ 3.0))), Float64(l_m / sqrt(2.0)), Float64(sqrt(Float64(1.0 / x)) * Float64(sqrt(2.0) * l_m))));
	elseif (t_m <= 1.85e-200)
		tmp = Float64(t_5 / fma(Float64(t_3 / Float64(Float64(sqrt(2.0) * x) * t_m)), 0.5, t_5));
	elseif (t_m <= 3.8e+23)
		tmp = Float64(t_5 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(Float64(t_4 + t_3) + t_4) / x))));
	else
		tmp = Float64(t_5 / Float64(sqrt(Float64(Float64(1.0 + x) / Float64(x - 1.0))) * t_5));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[(t$95$m * t$95$m), $MachinePrecision] * 2.0 + N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(l$95$m * l$95$m + t$95$2), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 / x), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 8.8e-255], N[(t$95$5 / N[(N[Sqrt[N[(1.0 / N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.85e-200], N[(t$95$5 / N[(N[(t$95$3 / N[(N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * 0.5 + t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.8e+23], N[(t$95$5 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(N[(t$95$4 + t$95$3), $MachinePrecision] + t$95$4), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$5 / N[(N[Sqrt[N[(N[(1.0 + x), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$5), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if t < 8.7999999999999997e-255

   1. Initial program 31.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 16.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, \color{blue}{\frac{\ell}{\sqrt{2}}}, \sqrt{\frac{1}{x}} \cdot \left(\sqrt{2} \cdot \ell\right)\right)} \]

   if 8.7999999999999997e-255 < t < 1.85000000000000005e-200

   1. Initial program 2.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 88.8%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, 1 \cdot \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t}, 0.5, \sqrt{2} \cdot t\right)}} \]

   if 1.85000000000000005e-200 < t < 3.79999999999999975e23

   1. Initial program 48.7%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

   5. Applied rewrites 81.0%

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

   if 3.79999999999999975e23 < t

   1. Initial program 41.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 90.6%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 49.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 8.8 \cdot 10^{-255}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, \frac{\ell}{\sqrt{2}}, \sqrt{\frac{1}{x}} \cdot \left(\sqrt{2} \cdot \ell\right)\right)}\\ \mathbf{elif}\;t \leq 1.85 \cdot 10^{-200}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t}, 0.5, \sqrt{2} \cdot t\right)}\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{+23}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{\left(\frac{\mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)}{x} + \mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)\right) + \frac{\mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)}{x}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 84.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t_3 := \mathsf{fma}\left(t\_m \cdot t\_m, 2, l\_m \cdot l\_m\right)\\ t_4 := \mathsf{fma}\left(2 \cdot t\_m, t\_m, \mathsf{fma}\left(l\_m, l\_m, t\_3\right)\right)\\ t_5 := \frac{t\_3}{x}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 8.8 \cdot 10^{-255}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot l\_m}\\ \mathbf{elif}\;t\_m \leq 1.85 \cdot 10^{-200}:\\ \;\;\;\;\frac{t\_2}{\mathsf{fma}\left(\frac{t\_4}{\left(\sqrt{2} \cdot x\right) \cdot t\_m}, 0.5, t\_2\right)}\\ \mathbf{elif}\;t\_m \leq 3.8 \cdot 10^{+23}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{\left(t\_5 + t\_4\right) + t\_5}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{1 + x}{x - 1}} \cdot t\_2}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m))
        (t_3 (fma (* t_m t_m) 2.0 (* l_m l_m)))
        (t_4 (fma (* 2.0 t_m) t_m (fma l_m l_m t_3)))
        (t_5 (/ t_3 x)))
   (*
    t_s
    (if (<= t_m 8.8e-255)
      (/ t_2 (* (sqrt (/ (- (/ 2.0 x) -2.0) x)) l_m))
      (if (<= t_m 1.85e-200)
        (/ t_2 (fma (/ t_4 (* (* (sqrt 2.0) x) t_m)) 0.5 t_2))
        (if (<= t_m 3.8e+23)
          (/ t_2 (sqrt (fma (* 2.0 t_m) t_m (/ (+ (+ t_5 t_4) t_5) x))))
          (/ t_2 (* (sqrt (/ (+ 1.0 x) (- x 1.0))) t_2))))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double t_3 = fma((t_m * t_m), 2.0, (l_m * l_m));
	double t_4 = fma((2.0 * t_m), t_m, fma(l_m, l_m, t_3));
	double t_5 = t_3 / x;
	double tmp;
	if (t_m <= 8.8e-255) {
		tmp = t_2 / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	} else if (t_m <= 1.85e-200) {
		tmp = t_2 / fma((t_4 / ((sqrt(2.0) * x) * t_m)), 0.5, t_2);
	} else if (t_m <= 3.8e+23) {
		tmp = t_2 / sqrt(fma((2.0 * t_m), t_m, (((t_5 + t_4) + t_5) / x)));
	} else {
		tmp = t_2 / (sqrt(((1.0 + x) / (x - 1.0))) * t_2);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	t_3 = fma(Float64(t_m * t_m), 2.0, Float64(l_m * l_m))
	t_4 = fma(Float64(2.0 * t_m), t_m, fma(l_m, l_m, t_3))
	t_5 = Float64(t_3 / x)
	tmp = 0.0
	if (t_m <= 8.8e-255)
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(Float64(2.0 / x) - -2.0) / x)) * l_m));
	elseif (t_m <= 1.85e-200)
		tmp = Float64(t_2 / fma(Float64(t_4 / Float64(Float64(sqrt(2.0) * x) * t_m)), 0.5, t_2));
	elseif (t_m <= 3.8e+23)
		tmp = Float64(t_2 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(Float64(t_5 + t_4) + t_5) / x))));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(1.0 + x) / Float64(x - 1.0))) * t_2));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, Block[{t$95$3 = N[(N[(t$95$m * t$95$m), $MachinePrecision] * 2.0 + N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(l$95$m * l$95$m + t$95$3), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$3 / x), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 8.8e-255], N[(t$95$2 / N[(N[Sqrt[N[(N[(N[(2.0 / x), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.85e-200], N[(t$95$2 / N[(N[(t$95$4 / N[(N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * 0.5 + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.8e+23], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(N[(t$95$5 + t$95$4), $MachinePrecision] + t$95$5), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(1.0 + x), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if t < 8.7999999999999997e-255

   1. Initial program 31.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{2 + 2 \cdot \frac{1}{x}}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 16.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell} \]

   if 8.7999999999999997e-255 < t < 1.85000000000000005e-200

   1. Initial program 2.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 88.8%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, 1 \cdot \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t}, 0.5, \sqrt{2} \cdot t\right)}} \]

   if 1.85000000000000005e-200 < t < 3.79999999999999975e23

   1. Initial program 48.7%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

   5. Applied rewrites 81.0%

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

   if 3.79999999999999975e23 < t

   1. Initial program 41.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 90.6%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 49.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 8.8 \cdot 10^{-255}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell}\\ \mathbf{elif}\;t \leq 1.85 \cdot 10^{-200}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t}, 0.5, \sqrt{2} \cdot t\right)}\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{+23}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{\left(\frac{\mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)}{x} + \mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)\right) + \frac{\mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)}{x}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 4 \cdot 10^{+79}:\\ \;\;\;\;\frac{t\_2}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\_m\right) \cdot \sqrt{2}}\\ \mathbf{elif}\;l\_m \cdot l\_m \leq 10^{+269}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{-2 \cdot \left(l\_m \cdot l\_m\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{\mathsf{fma}\left(\frac{\left(\frac{2}{x \cdot x} + \frac{2}{x}\right) - -2}{x}, -1, -2\right)}{-x}} \cdot l\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= (* l_m l_m) 4e+79)
      (/ t_2 (* (* (sqrt (/ (- x -1.0) (- x 1.0))) t_m) (sqrt 2.0)))
      (if (<= (* l_m l_m) 1e+269)
        (/ t_2 (sqrt (fma (* 2.0 t_m) t_m (/ (* -2.0 (* l_m l_m)) (- x)))))
        (/
         t_2
         (*
          (sqrt
           (/
            (fma (/ (- (+ (/ 2.0 (* x x)) (/ 2.0 x)) -2.0) x) -1.0 -2.0)
            (- x)))
          l_m)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((l_m * l_m) <= 4e+79) {
		tmp = t_2 / ((sqrt(((x - -1.0) / (x - 1.0))) * t_m) * sqrt(2.0));
	} else if ((l_m * l_m) <= 1e+269) {
		tmp = t_2 / sqrt(fma((2.0 * t_m), t_m, ((-2.0 * (l_m * l_m)) / -x)));
	} else {
		tmp = t_2 / (sqrt((fma(((((2.0 / (x * x)) + (2.0 / x)) - -2.0) / x), -1.0, -2.0) / -x)) * l_m);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 4e+79)
		tmp = Float64(t_2 / Float64(Float64(sqrt(Float64(Float64(x - -1.0) / Float64(x - 1.0))) * t_m) * sqrt(2.0)));
	elseif (Float64(l_m * l_m) <= 1e+269)
		tmp = Float64(t_2 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(-2.0 * Float64(l_m * l_m)) / Float64(-x)))));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(fma(Float64(Float64(Float64(Float64(2.0 / Float64(x * x)) + Float64(2.0 / x)) - -2.0) / x), -1.0, -2.0) / Float64(-x))) * l_m));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 4e+79], N[(t$95$2 / N[(N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 1e+269], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(-2.0 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] / (-x)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(N[(N[(N[(N[(2.0 / N[(x * x), $MachinePrecision]), $MachinePrecision] + N[(2.0 / x), $MachinePrecision]), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision] * -1.0 + -2.0), $MachinePrecision] / (-x)), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 l l) < 3.99999999999999987e79

   1. Initial program 50.2%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 46.3%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 46.3%

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

   if 3.99999999999999987e79 < (*.f64 l l) < 1e269

   1. Initial program 21.4%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 75.5%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, -\frac{-2 \cdot {\ell}^{2}}{x}\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 75.7%

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

   if 1e269 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around -inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{-1 \cdot \frac{-1 \cdot \frac{2 + \left(2 \cdot \frac{1}{x} + \frac{2}{{x}^{2}}\right)}{x} - 2}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.4%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{-\frac{\mathsf{fma}\left(\frac{\left(\frac{2}{x \cdot x} + \frac{2}{x}\right) - -2}{x}, -1, -2\right)}{x}} \cdot \ell} \]
3. Recombined 3 regimes into one program.

4. Final simplification 49.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 4 \cdot 10^{+79}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\right) \cdot \sqrt{2}}\\ \mathbf{elif}\;\ell \cdot \ell \leq 10^{+269}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{-2 \cdot \left(\ell \cdot \ell\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\mathsf{fma}\left(\frac{\left(\frac{2}{x \cdot x} + \frac{2}{x}\right) - -2}{x}, -1, -2\right)}{-x}} \cdot \ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t_3 := \mathsf{fma}\left(t\_m \cdot t\_m, 2, l\_m \cdot l\_m\right)\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 8.8 \cdot 10^{-255}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot l\_m}\\ \mathbf{elif}\;t\_m \leq 1.85 \cdot 10^{-200}:\\ \;\;\;\;\frac{t\_2}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \mathsf{fma}\left(l\_m, l\_m, t\_3\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t\_m}, 0.5, t\_2\right)}\\ \mathbf{elif}\;t\_m \leq 3.8 \cdot 10^{+23}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{t\_3 + t\_3}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{1 + x}{x - 1}} \cdot t\_2}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m)) (t_3 (fma (* t_m t_m) 2.0 (* l_m l_m))))
   (*
    t_s
    (if (<= t_m 8.8e-255)
      (/ t_2 (* (sqrt (/ (- (/ 2.0 x) -2.0) x)) l_m))
      (if (<= t_m 1.85e-200)
        (/
         t_2
         (fma
          (/ (fma (* 2.0 t_m) t_m (fma l_m l_m t_3)) (* (* (sqrt 2.0) x) t_m))
          0.5
          t_2))
        (if (<= t_m 3.8e+23)
          (/ t_2 (sqrt (fma (* 2.0 t_m) t_m (/ (+ t_3 t_3) x))))
          (/ t_2 (* (sqrt (/ (+ 1.0 x) (- x 1.0))) t_2))))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double t_3 = fma((t_m * t_m), 2.0, (l_m * l_m));
	double tmp;
	if (t_m <= 8.8e-255) {
		tmp = t_2 / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	} else if (t_m <= 1.85e-200) {
		tmp = t_2 / fma((fma((2.0 * t_m), t_m, fma(l_m, l_m, t_3)) / ((sqrt(2.0) * x) * t_m)), 0.5, t_2);
	} else if (t_m <= 3.8e+23) {
		tmp = t_2 / sqrt(fma((2.0 * t_m), t_m, ((t_3 + t_3) / x)));
	} else {
		tmp = t_2 / (sqrt(((1.0 + x) / (x - 1.0))) * t_2);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	t_3 = fma(Float64(t_m * t_m), 2.0, Float64(l_m * l_m))
	tmp = 0.0
	if (t_m <= 8.8e-255)
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(Float64(2.0 / x) - -2.0) / x)) * l_m));
	elseif (t_m <= 1.85e-200)
		tmp = Float64(t_2 / fma(Float64(fma(Float64(2.0 * t_m), t_m, fma(l_m, l_m, t_3)) / Float64(Float64(sqrt(2.0) * x) * t_m)), 0.5, t_2));
	elseif (t_m <= 3.8e+23)
		tmp = Float64(t_2 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(t_3 + t_3) / x))));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(1.0 + x) / Float64(x - 1.0))) * t_2));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, Block[{t$95$3 = N[(N[(t$95$m * t$95$m), $MachinePrecision] * 2.0 + N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 8.8e-255], N[(t$95$2 / N[(N[Sqrt[N[(N[(N[(2.0 / x), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.85e-200], N[(t$95$2 / N[(N[(N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(l$95$m * l$95$m + t$95$3), $MachinePrecision]), $MachinePrecision] / N[(N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * 0.5 + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.8e+23], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(t$95$3 + t$95$3), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(1.0 + x), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]

Derivation

1. Split input into 4 regimes

2. if t < 8.7999999999999997e-255

   1. Initial program 31.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{2 + 2 \cdot \frac{1}{x}}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 16.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell} \]

   if 8.7999999999999997e-255 < t < 1.85000000000000005e-200

   1. Initial program 2.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 88.8%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, 1 \cdot \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t}, 0.5, \sqrt{2} \cdot t\right)}} \]

   if 1.85000000000000005e-200 < t < 3.79999999999999975e23

   1. Initial program 48.7%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 80.5%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 80.5%

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

   if 3.79999999999999975e23 < t

   1. Initial program 41.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 90.6%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 49.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 8.8 \cdot 10^{-255}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell}\\ \mathbf{elif}\;t \leq 1.85 \cdot 10^{-200}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2 \cdot t, t, \mathsf{fma}\left(\ell, \ell, \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)\right)\right)}{\left(\sqrt{2} \cdot x\right) \cdot t}, 0.5, \sqrt{2} \cdot t\right)}\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{+23}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{\mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right) + \mathsf{fma}\left(t \cdot t, 2, \ell \cdot \ell\right)}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 79.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 4 \cdot 10^{+79}:\\ \;\;\;\;\frac{t\_2}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\_m\right) \cdot \sqrt{2}}\\ \mathbf{elif}\;l\_m \cdot l\_m \leq 10^{+269}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{-2 \cdot \left(l\_m \cdot l\_m\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot l\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= (* l_m l_m) 4e+79)
      (/ t_2 (* (* (sqrt (/ (- x -1.0) (- x 1.0))) t_m) (sqrt 2.0)))
      (if (<= (* l_m l_m) 1e+269)
        (/ t_2 (sqrt (fma (* 2.0 t_m) t_m (/ (* -2.0 (* l_m l_m)) (- x)))))
        (/ t_2 (* (sqrt (/ (- (/ 2.0 x) -2.0) x)) l_m)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((l_m * l_m) <= 4e+79) {
		tmp = t_2 / ((sqrt(((x - -1.0) / (x - 1.0))) * t_m) * sqrt(2.0));
	} else if ((l_m * l_m) <= 1e+269) {
		tmp = t_2 / sqrt(fma((2.0 * t_m), t_m, ((-2.0 * (l_m * l_m)) / -x)));
	} else {
		tmp = t_2 / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 4e+79)
		tmp = Float64(t_2 / Float64(Float64(sqrt(Float64(Float64(x - -1.0) / Float64(x - 1.0))) * t_m) * sqrt(2.0)));
	elseif (Float64(l_m * l_m) <= 1e+269)
		tmp = Float64(t_2 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(-2.0 * Float64(l_m * l_m)) / Float64(-x)))));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(Float64(2.0 / x) - -2.0) / x)) * l_m));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 4e+79], N[(t$95$2 / N[(N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 1e+269], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(-2.0 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] / (-x)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(N[(2.0 / x), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 l l) < 3.99999999999999987e79

   1. Initial program 50.2%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 46.3%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 46.3%

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

   if 3.99999999999999987e79 < (*.f64 l l) < 1e269

   1. Initial program 21.4%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 75.5%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, -\frac{-2 \cdot {\ell}^{2}}{x}\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 75.7%

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

   if 1e269 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{2 + 2 \cdot \frac{1}{x}}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.4%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell} \]
3. Recombined 3 regimes into one program.

4. Final simplification 49.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 4 \cdot 10^{+79}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\right) \cdot \sqrt{2}}\\ \mathbf{elif}\;\ell \cdot \ell \leq 10^{+269}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{-2 \cdot \left(\ell \cdot \ell\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 79.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \leq 3.8 \cdot 10^{+40}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{1 + x}{x - 1}} \cdot t\_2}\\ \mathbf{elif}\;l\_m \leq 1.75 \cdot 10^{+135}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{-2 \cdot \left(l\_m \cdot l\_m\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot l\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= l_m 3.8e+40)
      (/ t_2 (* (sqrt (/ (+ 1.0 x) (- x 1.0))) t_2))
      (if (<= l_m 1.75e+135)
        (/ t_2 (sqrt (fma (* 2.0 t_m) t_m (/ (* -2.0 (* l_m l_m)) (- x)))))
        (/ t_2 (* (sqrt (/ (- (/ 2.0 x) -2.0) x)) l_m)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if (l_m <= 3.8e+40) {
		tmp = t_2 / (sqrt(((1.0 + x) / (x - 1.0))) * t_2);
	} else if (l_m <= 1.75e+135) {
		tmp = t_2 / sqrt(fma((2.0 * t_m), t_m, ((-2.0 * (l_m * l_m)) / -x)));
	} else {
		tmp = t_2 / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (l_m <= 3.8e+40)
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(1.0 + x) / Float64(x - 1.0))) * t_2));
	elseif (l_m <= 1.75e+135)
		tmp = Float64(t_2 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(-2.0 * Float64(l_m * l_m)) / Float64(-x)))));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(Float64(2.0 / x) - -2.0) / x)) * l_m));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[l$95$m, 3.8e+40], N[(t$95$2 / N[(N[Sqrt[N[(N[(1.0 + x), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.75e+135], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(-2.0 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] / (-x)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(N[(2.0 / x), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if l < 3.80000000000000004e40

   1. Initial program 41.7%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 40.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]

   if 3.80000000000000004e40 < l < 1.7500000000000001e135

   1. Initial program 22.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 75.2%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 75.2%

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

   9. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, -\frac{-2 \cdot {\ell}^{2}}{x}\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 75.4%

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

   if 1.7500000000000001e135 < l

   1. Initial program 0.6%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 4.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{2 + 2 \cdot \frac{1}{x}}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 58.5%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell} \]
3. Recombined 3 regimes into one program.

4. Final simplification 44.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 3.8 \cdot 10^{+40}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}\\ \mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+135}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{-2 \cdot \left(\ell \cdot \ell\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 79.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \leq 3.8 \cdot 10^{+40}:\\ \;\;\;\;\frac{t\_m}{\sqrt{\left(x - -1\right) \cdot \frac{2}{x - 1}} \cdot t\_m} \cdot \sqrt{2}\\ \mathbf{elif}\;l\_m \leq 1.75 \cdot 10^{+135}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \frac{-2 \cdot \left(l\_m \cdot l\_m\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot l\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= l_m 3.8e+40)
      (* (/ t_m (* (sqrt (* (- x -1.0) (/ 2.0 (- x 1.0)))) t_m)) (sqrt 2.0))
      (if (<= l_m 1.75e+135)
        (/ t_2 (sqrt (fma (* 2.0 t_m) t_m (/ (* -2.0 (* l_m l_m)) (- x)))))
        (/ t_2 (* (sqrt (/ (- (/ 2.0 x) -2.0) x)) l_m)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if (l_m <= 3.8e+40) {
		tmp = (t_m / (sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * sqrt(2.0);
	} else if (l_m <= 1.75e+135) {
		tmp = t_2 / sqrt(fma((2.0 * t_m), t_m, ((-2.0 * (l_m * l_m)) / -x)));
	} else {
		tmp = t_2 / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (l_m <= 3.8e+40)
		tmp = Float64(Float64(t_m / Float64(sqrt(Float64(Float64(x - -1.0) * Float64(2.0 / Float64(x - 1.0)))) * t_m)) * sqrt(2.0));
	elseif (l_m <= 1.75e+135)
		tmp = Float64(t_2 / sqrt(fma(Float64(2.0 * t_m), t_m, Float64(Float64(-2.0 * Float64(l_m * l_m)) / Float64(-x)))));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(Float64(2.0 / x) - -2.0) / x)) * l_m));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[l$95$m, 3.8e+40], N[(N[(t$95$m / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] * N[(2.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.75e+135], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(N[(-2.0 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] / (-x)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(N[(2.0 / x), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if l < 3.80000000000000004e40

   1. Initial program 41.7%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 40.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 40.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\right) \cdot \color{blue}{\sqrt{2}}} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   9. Applied rewrites 39.9%

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

   if 3.80000000000000004e40 < l < 1.7500000000000001e135

   1. Initial program 22.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 75.2%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 75.2%

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

   9. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, -\frac{-2 \cdot {\ell}^{2}}{x}\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 75.4%

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

   if 1.7500000000000001e135 < l

   1. Initial program 0.6%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 4.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{2 + 2 \cdot \frac{1}{x}}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 58.5%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell} \]
3. Recombined 3 regimes into one program.

4. Final simplification 44.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 3.8 \cdot 10^{+40}:\\ \;\;\;\;\frac{t}{\sqrt{\left(x - -1\right) \cdot \frac{2}{x - 1}} \cdot t} \cdot \sqrt{2}\\ \mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+135}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\mathsf{fma}\left(2 \cdot t, t, \frac{-2 \cdot \left(\ell \cdot \ell\right)}{-x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 79.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 5 \cdot 10^{+270}:\\ \;\;\;\;\frac{t\_m}{\sqrt{\left(x - -1\right) \cdot \frac{2}{x - 1}} \cdot t\_m} \cdot \sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{l\_m} \cdot t\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 5e+270)
    (* (/ t_m (* (sqrt (* (- x -1.0) (/ 2.0 (- x 1.0)))) t_m)) (sqrt 2.0))
    (* (/ (sqrt x) l_m) t_m))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = (t_m / (sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * sqrt(2.0);
	} else {
		tmp = (sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if ((l_m * l_m) <= 5d+270) then
        tmp = (t_m / (sqrt(((x - (-1.0d0)) * (2.0d0 / (x - 1.0d0)))) * t_m)) * sqrt(2.0d0)
    else
        tmp = (sqrt(x) / l_m) * t_m
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = (t_m / (Math.sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * Math.sqrt(2.0);
	} else {
		tmp = (Math.sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if (l_m * l_m) <= 5e+270:
		tmp = (t_m / (math.sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * math.sqrt(2.0)
	else:
		tmp = (math.sqrt(x) / l_m) * t_m
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 5e+270)
		tmp = Float64(Float64(t_m / Float64(sqrt(Float64(Float64(x - -1.0) * Float64(2.0 / Float64(x - 1.0)))) * t_m)) * sqrt(2.0));
	else
		tmp = Float64(Float64(sqrt(x) / l_m) * t_m);
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if ((l_m * l_m) <= 5e+270)
		tmp = (t_m / (sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * sqrt(2.0);
	else
		tmp = (sqrt(x) / l_m) * t_m;
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 5e+270], N[(N[(t$95$m / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] * N[(2.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision] * t$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.99999999999999976e270

   1. Initial program 44.9%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 44.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\right) \cdot \color{blue}{\sqrt{2}}} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   9. Applied rewrites 44.6%

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

   if 4.99999999999999976e270 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{2}}{\ell} \cdot \sqrt{\frac{1}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{\frac{1 + x}{x - 1} - 1}} \cdot \frac{\sqrt{2} \cdot t}{\ell}} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.6%

      \[\leadsto \frac{\left(\left(t \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\right) \cdot \sqrt{x}}{\color{blue}{\ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 43.8%

       \[\leadsto \color{blue}{\frac{\sqrt{x}}{\ell} \cdot \left(1 \cdot t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{+270}:\\ \;\;\;\;\frac{t}{\sqrt{\left(x - -1\right) \cdot \frac{2}{x - 1}} \cdot t} \cdot \sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{\ell} \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 79.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 5 \cdot 10^{+270}:\\ \;\;\;\;t\_m \cdot \frac{\sqrt{2}}{\sqrt{\frac{x - -1}{x - 1} \cdot 2} \cdot t\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{l\_m} \cdot t\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 5e+270)
    (* t_m (/ (sqrt 2.0) (* (sqrt (* (/ (- x -1.0) (- x 1.0)) 2.0)) t_m)))
    (* (/ (sqrt x) l_m) t_m))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = t_m * (sqrt(2.0) / (sqrt((((x - -1.0) / (x - 1.0)) * 2.0)) * t_m));
	} else {
		tmp = (sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if ((l_m * l_m) <= 5d+270) then
        tmp = t_m * (sqrt(2.0d0) / (sqrt((((x - (-1.0d0)) / (x - 1.0d0)) * 2.0d0)) * t_m))
    else
        tmp = (sqrt(x) / l_m) * t_m
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = t_m * (Math.sqrt(2.0) / (Math.sqrt((((x - -1.0) / (x - 1.0)) * 2.0)) * t_m));
	} else {
		tmp = (Math.sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if (l_m * l_m) <= 5e+270:
		tmp = t_m * (math.sqrt(2.0) / (math.sqrt((((x - -1.0) / (x - 1.0)) * 2.0)) * t_m))
	else:
		tmp = (math.sqrt(x) / l_m) * t_m
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 5e+270)
		tmp = Float64(t_m * Float64(sqrt(2.0) / Float64(sqrt(Float64(Float64(Float64(x - -1.0) / Float64(x - 1.0)) * 2.0)) * t_m)));
	else
		tmp = Float64(Float64(sqrt(x) / l_m) * t_m);
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if ((l_m * l_m) <= 5e+270)
		tmp = t_m * (sqrt(2.0) / (sqrt((((x - -1.0) / (x - 1.0)) * 2.0)) * t_m));
	else
		tmp = (sqrt(x) / l_m) * t_m;
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 5e+270], N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / N[(N[Sqrt[N[(N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision] * t$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.99999999999999976e270

   1. Initial program 44.9%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 44.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\sqrt{2} \cdot t}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\sqrt{2} \cdot t}}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{t \cdot \sqrt{2}}}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)} \]

      4. associate-/l* N/A

         \[\leadsto \color{blue}{t \cdot \frac{\sqrt{2}}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{t \cdot \frac{\sqrt{2}}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]

      6. lower-/.f64 44.5

         \[\leadsto t \cdot \color{blue}{\frac{\sqrt{2}}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]

   7. Applied rewrites 44.5%

      \[\leadsto \color{blue}{t \cdot \frac{\sqrt{2}}{\sqrt{\frac{x - -1}{x - 1} \cdot 2} \cdot t}} \]

   if 4.99999999999999976e270 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{2}}{\ell} \cdot \sqrt{\frac{1}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{\frac{1 + x}{x - 1} - 1}} \cdot \frac{\sqrt{2} \cdot t}{\ell}} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.6%

      \[\leadsto \frac{\left(\left(t \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\right) \cdot \sqrt{x}}{\color{blue}{\ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 43.8%

       \[\leadsto \color{blue}{\frac{\sqrt{x}}{\ell} \cdot \left(1 \cdot t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{+270}:\\ \;\;\;\;t \cdot \frac{\sqrt{2}}{\sqrt{\frac{x - -1}{x - 1} \cdot 2} \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{\ell} \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 79.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \leq 1.9 \cdot 10^{+138}:\\ \;\;\;\;\frac{t\_m}{\sqrt{\left(x - -1\right) \cdot \frac{2}{x - 1}} \cdot t\_m} \cdot \sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2} \cdot t\_m}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot l\_m}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 1.9e+138)
    (* (/ t_m (* (sqrt (* (- x -1.0) (/ 2.0 (- x 1.0)))) t_m)) (sqrt 2.0))
    (/ (* (sqrt 2.0) t_m) (* (sqrt (/ (- (/ 2.0 x) -2.0) x)) l_m)))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 1.9e+138) {
		tmp = (t_m / (sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * sqrt(2.0);
	} else {
		tmp = (sqrt(2.0) * t_m) / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	}
	return t_s * tmp;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (l_m <= 1.9d+138) then
        tmp = (t_m / (sqrt(((x - (-1.0d0)) * (2.0d0 / (x - 1.0d0)))) * t_m)) * sqrt(2.0d0)
    else
        tmp = (sqrt(2.0d0) * t_m) / (sqrt((((2.0d0 / x) - (-2.0d0)) / x)) * l_m)
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 1.9e+138) {
		tmp = (t_m / (Math.sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * Math.sqrt(2.0);
	} else {
		tmp = (Math.sqrt(2.0) * t_m) / (Math.sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if l_m <= 1.9e+138:
		tmp = (t_m / (math.sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * math.sqrt(2.0)
	else:
		tmp = (math.sqrt(2.0) * t_m) / (math.sqrt((((2.0 / x) - -2.0) / x)) * l_m)
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (l_m <= 1.9e+138)
		tmp = Float64(Float64(t_m / Float64(sqrt(Float64(Float64(x - -1.0) * Float64(2.0 / Float64(x - 1.0)))) * t_m)) * sqrt(2.0));
	else
		tmp = Float64(Float64(sqrt(2.0) * t_m) / Float64(sqrt(Float64(Float64(Float64(2.0 / x) - -2.0) / x)) * l_m));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (l_m <= 1.9e+138)
		tmp = (t_m / (sqrt(((x - -1.0) * (2.0 / (x - 1.0)))) * t_m)) * sqrt(2.0);
	else
		tmp = (sqrt(2.0) * t_m) / (sqrt((((2.0 / x) - -2.0) / x)) * l_m);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[l$95$m, 1.9e+138], N[(N[(t$95$m / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] * N[(2.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision] / N[(N[Sqrt[N[(N[(N[(2.0 / x), $MachinePrecision] - -2.0), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 1.90000000000000006e138

   1. Initial program 39.8%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 40.4%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 40.4%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\right) \cdot \color{blue}{\sqrt{2}}} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   9. Applied rewrites 40.3%

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

   if 1.90000000000000006e138 < l

   1. Initial program 0.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 4.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1} - 1} \cdot \ell}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{2 + 2 \cdot \frac{1}{x}}{x}} \cdot \ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 60.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\frac{2}{x} - -2}{x}} \cdot \ell} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 79.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 5 \cdot 10^{+270}:\\ \;\;\;\;\left(\sqrt{\frac{x - 1}{1 + x}} \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{l\_m} \cdot t\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 5e+270)
    (* (* (sqrt (/ (- x 1.0) (+ 1.0 x))) (sqrt 0.5)) (sqrt 2.0))
    (* (/ (sqrt x) l_m) t_m))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = (sqrt(((x - 1.0) / (1.0 + x))) * sqrt(0.5)) * sqrt(2.0);
	} else {
		tmp = (sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if ((l_m * l_m) <= 5d+270) then
        tmp = (sqrt(((x - 1.0d0) / (1.0d0 + x))) * sqrt(0.5d0)) * sqrt(2.0d0)
    else
        tmp = (sqrt(x) / l_m) * t_m
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = (Math.sqrt(((x - 1.0) / (1.0 + x))) * Math.sqrt(0.5)) * Math.sqrt(2.0);
	} else {
		tmp = (Math.sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if (l_m * l_m) <= 5e+270:
		tmp = (math.sqrt(((x - 1.0) / (1.0 + x))) * math.sqrt(0.5)) * math.sqrt(2.0)
	else:
		tmp = (math.sqrt(x) / l_m) * t_m
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 5e+270)
		tmp = Float64(Float64(sqrt(Float64(Float64(x - 1.0) / Float64(1.0 + x))) * sqrt(0.5)) * sqrt(2.0));
	else
		tmp = Float64(Float64(sqrt(x) / l_m) * t_m);
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if ((l_m * l_m) <= 5e+270)
		tmp = (sqrt(((x - 1.0) / (1.0 + x))) * sqrt(0.5)) * sqrt(2.0);
	else
		tmp = (sqrt(x) / l_m) * t_m;
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 5e+270], N[(N[(N[Sqrt[N[(N[(x - 1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision] * t$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.99999999999999976e270

   1. Initial program 44.9%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 44.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\sqrt{\frac{1 + x}{x - 1}} \cdot \left(\sqrt{2} \cdot t\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\left(\sqrt{\frac{x - -1}{x - 1}} \cdot t\right) \cdot \color{blue}{\sqrt{2}}} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   9. Applied rewrites 44.6%

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

   10. Taylor expanded in l around 0

       \[\leadsto \color{blue}{\left(\sqrt{\frac{1}{2}} \cdot \sqrt{\frac{x - 1}{1 + x}}\right)} \cdot \sqrt{2} \]
   11. Step-by-step derivation

   12. Applied rewrites 44.1%

       \[\leadsto \color{blue}{\left(\sqrt{\frac{x - 1}{1 + x}} \cdot \sqrt{0.5}\right)} \cdot \sqrt{2} \]

   if 4.99999999999999976e270 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{2}}{\ell} \cdot \sqrt{\frac{1}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{\frac{1 + x}{x - 1} - 1}} \cdot \frac{\sqrt{2} \cdot t}{\ell}} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.6%

      \[\leadsto \frac{\left(\left(t \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\right) \cdot \sqrt{x}}{\color{blue}{\ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 43.8%

       \[\leadsto \color{blue}{\frac{\sqrt{x}}{\ell} \cdot \left(1 \cdot t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{+270}:\\ \;\;\;\;\left(\sqrt{\frac{x - 1}{1 + x}} \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{\ell} \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 79.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 5 \cdot 10^{+270}:\\ \;\;\;\;\sqrt{\frac{x - 1}{1 + x}} \cdot \left(\sqrt{0.5} \cdot \sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{l\_m} \cdot t\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 5e+270)
    (* (sqrt (/ (- x 1.0) (+ 1.0 x))) (* (sqrt 0.5) (sqrt 2.0)))
    (* (/ (sqrt x) l_m) t_m))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = sqrt(((x - 1.0) / (1.0 + x))) * (sqrt(0.5) * sqrt(2.0));
	} else {
		tmp = (sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if ((l_m * l_m) <= 5d+270) then
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x))) * (sqrt(0.5d0) * sqrt(2.0d0))
    else
        tmp = (sqrt(x) / l_m) * t_m
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = Math.sqrt(((x - 1.0) / (1.0 + x))) * (Math.sqrt(0.5) * Math.sqrt(2.0));
	} else {
		tmp = (Math.sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if (l_m * l_m) <= 5e+270:
		tmp = math.sqrt(((x - 1.0) / (1.0 + x))) * (math.sqrt(0.5) * math.sqrt(2.0))
	else:
		tmp = (math.sqrt(x) / l_m) * t_m
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 5e+270)
		tmp = Float64(sqrt(Float64(Float64(x - 1.0) / Float64(1.0 + x))) * Float64(sqrt(0.5) * sqrt(2.0)));
	else
		tmp = Float64(Float64(sqrt(x) / l_m) * t_m);
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if ((l_m * l_m) <= 5e+270)
		tmp = sqrt(((x - 1.0) / (1.0 + x))) * (sqrt(0.5) * sqrt(2.0));
	else
		tmp = (sqrt(x) / l_m) * t_m;
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 5e+270], N[(N[Sqrt[N[(N[(x - 1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[0.5], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision] * t$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.99999999999999976e270

   1. Initial program 44.9%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around 0

      \[\leadsto \color{blue}{\left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right) \cdot \sqrt{\frac{x - 1}{1 + x}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 44.0%

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}} \cdot \left(\sqrt{0.5} \cdot \sqrt{2}\right)} \]

   if 4.99999999999999976e270 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{2}}{\ell} \cdot \sqrt{\frac{1}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{\frac{1 + x}{x - 1} - 1}} \cdot \frac{\sqrt{2} \cdot t}{\ell}} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.6%

      \[\leadsto \frac{\left(\left(t \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\right) \cdot \sqrt{x}}{\color{blue}{\ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 43.8%

       \[\leadsto \color{blue}{\frac{\sqrt{x}}{\ell} \cdot \left(1 \cdot t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{+270}:\\ \;\;\;\;\sqrt{\frac{x - 1}{1 + x}} \cdot \left(\sqrt{0.5} \cdot \sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{\ell} \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 78.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 5 \cdot 10^{+270}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{l\_m} \cdot t\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (if (<= (* l_m l_m) 5e+270) 1.0 (* (/ (sqrt x) l_m) t_m))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = 1.0;
	} else {
		tmp = (sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if ((l_m * l_m) <= 5d+270) then
        tmp = 1.0d0
    else
        tmp = (sqrt(x) / l_m) * t_m
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((l_m * l_m) <= 5e+270) {
		tmp = 1.0;
	} else {
		tmp = (Math.sqrt(x) / l_m) * t_m;
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if (l_m * l_m) <= 5e+270:
		tmp = 1.0
	else:
		tmp = (math.sqrt(x) / l_m) * t_m
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (Float64(l_m * l_m) <= 5e+270)
		tmp = 1.0;
	else
		tmp = Float64(Float64(sqrt(x) / l_m) * t_m);
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if ((l_m * l_m) <= 5e+270)
		tmp = 1.0;
	else
		tmp = (sqrt(x) / l_m) * t_m;
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[N[(l$95$m * l$95$m), $MachinePrecision], 5e+270], 1.0, N[(N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision] * t$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.99999999999999976e270

   1. Initial program 44.9%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\sqrt{\frac{1}{2}} \cdot \sqrt{2}} \]
   4. Step-by-step derivation

   5. Applied rewrites 43.3%

      \[\leadsto \color{blue}{\sqrt{0.5} \cdot \sqrt{2}} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.0%

      \[\leadsto \color{blue}{1} \]

   if 4.99999999999999976e270 < (*.f64 l l)

   1. Initial program 0.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{2}}{\ell} \cdot \sqrt{\frac{1}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 2.2%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{\frac{1 + x}{x - 1} - 1}} \cdot \frac{\sqrt{2} \cdot t}{\ell}} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.6%

      \[\leadsto \frac{\left(\left(t \cdot \sqrt{0.5}\right) \cdot \sqrt{2}\right) \cdot \sqrt{x}}{\color{blue}{\ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 43.8%

       \[\leadsto \color{blue}{\frac{\sqrt{x}}{\ell} \cdot \left(1 \cdot t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 43.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot \ell \leq 5 \cdot 10^{+270}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{x}}{\ell} \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 76.5% accurate, 85.0× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot 1 \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m) :precision binary64 (* t_s 1.0))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	return t_s * 1.0;
}

Fortran

l_m =     private
t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(t_s, x, l_m, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    code = t_s * 1.0d0
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	return t_s * 1.0;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	return t_s * 1.0

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	return Float64(t_s * 1.0)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l_m, t_m)
	tmp = t_s * 1.0;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 36.0%

   \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\sqrt{\frac{1}{2}} \cdot \sqrt{2}} \]
4. Step-by-step derivation

5. Applied rewrites 37.6%

   \[\leadsto \color{blue}{\sqrt{0.5} \cdot \sqrt{2}} \]
6. Step-by-step derivation

7. Applied rewrites 38.1%

   \[\leadsto \color{blue}{1} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025024 
(FPCore (x l t)
  :name "Toniolo and Linder, Equation (7)"
  :precision binary64
  (/ (* (sqrt 2.0) t) (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))