Toniolo and Linder, Equation (7)

Percentage Accurate: 33.2% → 85.3%

Time: 15.5s

Alternatives: 9

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

real(8) function code(x, l, t)
    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.2% 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

real(8) function code(x, l, t)
    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.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \mathsf{fma}\left(t\_m, t\_m, t\_m \cdot t\_m\right)\\ t_3 := \mathsf{fma}\left(\ell, \ell, \ell \cdot \ell\right)\\ t_4 := t\_m \cdot \sqrt{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 2.45 \cdot 10^{-157}:\\ \;\;\;\;\frac{t\_4}{\mathsf{fma}\left(0.5, \frac{2 \cdot \left(\ell \cdot \ell\right)}{t\_4 \cdot x}, t\_4\right)}\\ \mathbf{elif}\;t\_m \leq 6 \cdot 10^{+80}:\\ \;\;\;\;\frac{t\_4}{\sqrt{2 \cdot \left(t\_m \cdot t\_m\right) - \frac{\mathsf{fma}\left(-2, t\_2, -t\_3\right) - \frac{\mathsf{fma}\left(-2, -t\_2, t\_3\right)}{x}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (fma t_m t_m (* t_m t_m)))
        (t_3 (fma l l (* l l)))
        (t_4 (* t_m (sqrt 2.0))))
   (*
    t_s
    (if (<= t_m 2.45e-157)
      (/ t_4 (fma 0.5 (/ (* 2.0 (* l l)) (* t_4 x)) t_4))
      (if (<= t_m 6e+80)
        (/
         t_4
         (sqrt
          (-
           (* 2.0 (* t_m t_m))
           (/ (- (fma -2.0 t_2 (- t_3)) (/ (fma -2.0 (- t_2) t_3) x)) x))))
        (sqrt (/ (+ x -1.0) (+ x 1.0))))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = fma(t_m, t_m, (t_m * t_m));
	double t_3 = fma(l, l, (l * l));
	double t_4 = t_m * sqrt(2.0);
	double tmp;
	if (t_m <= 2.45e-157) {
		tmp = t_4 / fma(0.5, ((2.0 * (l * l)) / (t_4 * x)), t_4);
	} else if (t_m <= 6e+80) {
		tmp = t_4 / sqrt(((2.0 * (t_m * t_m)) - ((fma(-2.0, t_2, -t_3) - (fma(-2.0, -t_2, t_3) / x)) / x)));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = fma(t_m, t_m, Float64(t_m * t_m))
	t_3 = fma(l, l, Float64(l * l))
	t_4 = Float64(t_m * sqrt(2.0))
	tmp = 0.0
	if (t_m <= 2.45e-157)
		tmp = Float64(t_4 / fma(0.5, Float64(Float64(2.0 * Float64(l * l)) / Float64(t_4 * x)), t_4));
	elseif (t_m <= 6e+80)
		tmp = Float64(t_4 / sqrt(Float64(Float64(2.0 * Float64(t_m * t_m)) - Float64(Float64(fma(-2.0, t_2, Float64(-t_3)) - Float64(fma(-2.0, Float64(-t_2), t_3) / x)) / x))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

Wolfram

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_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * t$95$m + N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(l * l + N[(l * l), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.45e-157], N[(t$95$4 / N[(0.5 * N[(N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(t$95$4 * x), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 6e+80], N[(t$95$4 / N[Sqrt[N[(N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(-2.0 * t$95$2 + (-t$95$3)), $MachinePrecision] - N[(N[(-2.0 * (-t$95$2) + t$95$3), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if t < 2.4499999999999999e-157

   1. Initial program 28.1%

      \[\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

      1. lower-fma.f64 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{1}{2}, \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}\right)}} \]

   5. Applied rewrites 17.9%

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

   6. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 18.1

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

   8. Applied rewrites 18.1%

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

   if 2.4499999999999999e-157 < t < 5.99999999999999974e80

   1. Initial program 56.1%

      \[\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. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. distribute-rgt-in N/A

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

      8. lift-*.f64 N/A

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

      9. associate--l+ N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. associate-*r* N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 86.1%

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

   if 5.99999999999999974e80 < t

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
   7. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{x - 1}{1 + x}}} \]

      3. sub-neg N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right)}}{1 + x}} \]

      4. metadata-eval N/A

         \[\leadsto \sqrt{\frac{x + \color{blue}{-1}}{1 + x}} \]

      5. lower-+.f64 N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + -1}}{1 + x}} \]

      6. +-commutative N/A

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

      7. lower-+.f64 100.0

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 48.7%

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

Alternative 2: 85.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = t_m * sqrt(2.0);
	double tmp;
	if (t_m <= 2.45e-157) {
		tmp = t_2 / fma(0.5, ((2.0 * (l * l)) / (t_2 * x)), t_2);
	} else if (t_m <= 6e+80) {
		tmp = t_2 / sqrt((fma(2.0, ((t_m * t_m) + ((t_m * t_m) / x)), ((l * l) / x)) + (fma(2.0, (t_m * t_m), (l * l)) / x)));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(t_m * sqrt(2.0))
	tmp = 0.0
	if (t_m <= 2.45e-157)
		tmp = Float64(t_2 / fma(0.5, Float64(Float64(2.0 * Float64(l * l)) / Float64(t_2 * x)), t_2));
	elseif (t_m <= 6e+80)
		tmp = Float64(t_2 / sqrt(Float64(fma(2.0, Float64(Float64(t_m * t_m) + Float64(Float64(t_m * t_m) / x)), Float64(Float64(l * l) / x)) + Float64(fma(2.0, Float64(t_m * t_m), Float64(l * l)) / x))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

Wolfram

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_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.45e-157], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(t$95$2 * x), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 6e+80], N[(t$95$2 / N[Sqrt[N[(N[(2.0 * N[(N[(t$95$m * t$95$m), $MachinePrecision] + N[(N[(t$95$m * t$95$m), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(l * l), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + N[(l * l), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 2.4499999999999999e-157

   1. Initial program 28.1%

      \[\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

      1. lower-fma.f64 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{1}{2}, \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}\right)}} \]

   5. Applied rewrites 17.9%

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

   6. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 18.1

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

   8. Applied rewrites 18.1%

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

   if 2.4499999999999999e-157 < t < 5.99999999999999974e80

   1. Initial program 56.1%

      \[\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

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

         \[\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) + \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}}} \]

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower-+.f64 N/A

         \[\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) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}}} \]

   5. Applied rewrites 86.0%

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

   if 5.99999999999999974e80 < t

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
   7. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{x - 1}{1 + x}}} \]

      3. sub-neg N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right)}}{1 + x}} \]

      4. metadata-eval N/A

         \[\leadsto \sqrt{\frac{x + \color{blue}{-1}}{1 + x}} \]

      5. lower-+.f64 N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + -1}}{1 + x}} \]

      6. +-commutative N/A

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

      7. lower-+.f64 100.0

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 48.7%

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

Alternative 3: 85.1% accurate, 0.7× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* t_m (sqrt 2.0))) (t_3 (/ (* l l) x)))
   (*
    t_s
    (if (<= t_m 2.45e-157)
      (/ t_2 (fma 0.5 (/ (* 2.0 (* l l)) (* t_2 x)) t_2))
      (if (<= t_m 6e+80)
        (/
         t_2
         (sqrt
          (+
           t_3
           (fma 2.0 (+ (* t_m t_m) (/ (fma t_m t_m (* t_m t_m)) x)) t_3))))
        (sqrt (/ (+ x -1.0) (+ x 1.0))))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = t_m * sqrt(2.0);
	double t_3 = (l * l) / x;
	double tmp;
	if (t_m <= 2.45e-157) {
		tmp = t_2 / fma(0.5, ((2.0 * (l * l)) / (t_2 * x)), t_2);
	} else if (t_m <= 6e+80) {
		tmp = t_2 / sqrt((t_3 + fma(2.0, ((t_m * t_m) + (fma(t_m, t_m, (t_m * t_m)) / x)), t_3)));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(t_m * sqrt(2.0))
	t_3 = Float64(Float64(l * l) / x)
	tmp = 0.0
	if (t_m <= 2.45e-157)
		tmp = Float64(t_2 / fma(0.5, Float64(Float64(2.0 * Float64(l * l)) / Float64(t_2 * x)), t_2));
	elseif (t_m <= 6e+80)
		tmp = Float64(t_2 / sqrt(Float64(t_3 + fma(2.0, Float64(Float64(t_m * t_m) + Float64(fma(t_m, t_m, Float64(t_m * t_m)) / x)), t_3))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

Wolfram

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_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(l * l), $MachinePrecision] / x), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.45e-157], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(t$95$2 * x), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 6e+80], N[(t$95$2 / N[Sqrt[N[(t$95$3 + N[(2.0 * N[(N[(t$95$m * t$95$m), $MachinePrecision] + N[(N[(t$95$m * t$95$m + N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < 2.4499999999999999e-157

   1. Initial program 28.1%

      \[\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

      1. lower-fma.f64 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{1}{2}, \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}\right)}} \]

   5. Applied rewrites 17.9%

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

   6. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 18.1

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

   8. Applied rewrites 18.1%

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

   if 2.4499999999999999e-157 < t < 5.99999999999999974e80

   1. Initial program 56.1%

      \[\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. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. distribute-rgt-in N/A

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

      8. lift-*.f64 N/A

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

      9. associate--l+ N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. associate-*r* N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

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

   7. Applied rewrites 86.0%

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

   if 5.99999999999999974e80 < t

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
   7. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{x - 1}{1 + x}}} \]

      3. sub-neg N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right)}}{1 + x}} \]

      4. metadata-eval N/A

         \[\leadsto \sqrt{\frac{x + \color{blue}{-1}}{1 + x}} \]

      5. lower-+.f64 N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + -1}}{1 + x}} \]

      6. +-commutative N/A

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

      7. lower-+.f64 100.0

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 48.7%

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

Alternative 4: 85.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = t_m * sqrt(2.0);
	double tmp;
	if (t_m <= 2.45e-157) {
		tmp = t_2 / fma(0.5, ((2.0 * (l * l)) / (t_2 * x)), t_2);
	} else if (t_m <= 6e+80) {
		tmp = t_2 / sqrt(fma(2.0, (t_m * t_m), -(fma(-2.0, fma(t_m, t_m, (t_m * t_m)), -fma(l, l, (l * l))) / x)));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(t_m * sqrt(2.0))
	tmp = 0.0
	if (t_m <= 2.45e-157)
		tmp = Float64(t_2 / fma(0.5, Float64(Float64(2.0 * Float64(l * l)) / Float64(t_2 * x)), t_2));
	elseif (t_m <= 6e+80)
		tmp = Float64(t_2 / sqrt(fma(2.0, Float64(t_m * t_m), Float64(-Float64(fma(-2.0, fma(t_m, t_m, Float64(t_m * t_m)), Float64(-fma(l, l, Float64(l * l)))) / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

Wolfram

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_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.45e-157], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(t$95$2 * x), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 6e+80], N[(t$95$2 / N[Sqrt[N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + (-N[(N[(-2.0 * N[(t$95$m * t$95$m + N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision] + (-N[(l * l + N[(l * l), $MachinePrecision]), $MachinePrecision])), $MachinePrecision] / x), $MachinePrecision])), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 2.4499999999999999e-157

   1. Initial program 28.1%

      \[\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

      1. lower-fma.f64 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{1}{2}, \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}\right)}} \]

   5. Applied rewrites 17.9%

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

   6. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 18.1

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

   8. Applied rewrites 18.1%

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

   if 2.4499999999999999e-157 < t < 5.99999999999999974e80

   1. Initial program 56.1%

      \[\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. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. distribute-rgt-in N/A

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

      8. lift-*.f64 N/A

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

      9. associate--l+ N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. associate-*r* N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-frac2 N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

   7. Applied rewrites 86.0%

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

   if 5.99999999999999974e80 < t

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
   7. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{x - 1}{1 + x}}} \]

      3. sub-neg N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right)}}{1 + x}} \]

      4. metadata-eval N/A

         \[\leadsto \sqrt{\frac{x + \color{blue}{-1}}{1 + x}} \]

      5. lower-+.f64 N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + -1}}{1 + x}} \]

      6. +-commutative N/A

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

      7. lower-+.f64 100.0

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 48.7%

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

Alternative 5: 81.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 9.5e-85], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(l * l), $MachinePrecision]), $MachinePrecision] / N[(t$95$2 * x), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 9.49999999999999964e-85

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

      1. lower-fma.f64 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\mathsf{fma}\left(\frac{1}{2}, \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}\right)}} \]

   5. Applied rewrites 21.1%

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

   6. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 21.3

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

   8. Applied rewrites 21.3%

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

   if 9.49999999999999964e-85 < t

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 88.0

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

   5. Applied rewrites 88.0%

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

   6. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
   7. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{x - 1}{1 + x}}} \]

      3. sub-neg N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right)}}{1 + x}} \]

      4. metadata-eval N/A

         \[\leadsto \sqrt{\frac{x + \color{blue}{-1}}{1 + x}} \]

      5. lower-+.f64 N/A

         \[\leadsto \sqrt{\frac{\color{blue}{x + -1}}{1 + x}} \]

      6. +-commutative N/A

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

      7. lower-+.f64 88.0

         \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

   8. Applied rewrites 88.0%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 45.5%

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

Alternative 6: 76.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := t\_m \cdot \sqrt{2}\\ t\_s \cdot \frac{t\_2}{t\_2 \cdot \sqrt{\frac{x + 1}{x + -1}}} \end{array} \end{array} \]

FPCore

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

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = t_m * sqrt(2.0);
	return t_s * (t_2 / (t_2 * sqrt(((x + 1.0) / (x + -1.0)))));
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    t_2 = t_m * sqrt(2.0d0)
    code = t_s * (t_2 / (t_2 * sqrt(((x + 1.0d0) / (x + (-1.0d0))))))
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = t_m * Math.sqrt(2.0);
	return t_s * (t_2 / (t_2 * Math.sqrt(((x + 1.0) / (x + -1.0)))));
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = t_m * math.sqrt(2.0)
	return t_s * (t_2 / (t_2 * math.sqrt(((x + 1.0) / (x + -1.0)))))

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(t_m * sqrt(2.0))
	return Float64(t_s * Float64(t_2 / Float64(t_2 * sqrt(Float64(Float64(x + 1.0) / Float64(x + -1.0))))))
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l, t_m)
	t_2 = t_m * sqrt(2.0);
	tmp = t_s * (t_2 / (t_2 * sqrt(((x + 1.0) / (x + -1.0)))));
end

Wolfram

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_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * N[(t$95$2 / N[(t$95$2 * N[Sqrt[N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

   1. lower-*.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-+.f64 N/A

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

   7. sub-neg N/A

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

   8. metadata-eval N/A

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

   9. lower-+.f64 41.3

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

5. Applied rewrites 41.3%

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

6. Final simplification 41.3%

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

Alternative 7: 76.9% accurate, 3.0× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \sqrt{\frac{x + -1}{x + 1}} \end{array} \]

FPCore

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

C

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

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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

   1. lower-*.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-+.f64 N/A

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

   7. sub-neg N/A

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

   8. metadata-eval N/A

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

   9. lower-+.f64 41.3

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

5. Applied rewrites 41.3%

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

6. Taylor expanded in t around 0

   \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
7. Step-by-step derivation

   1. lower-sqrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

   2. lower-/.f64 N/A

      \[\leadsto \sqrt{\color{blue}{\frac{x - 1}{1 + x}}} \]

   3. sub-neg N/A

      \[\leadsto \sqrt{\frac{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right)}}{1 + x}} \]

   4. metadata-eval N/A

      \[\leadsto \sqrt{\frac{x + \color{blue}{-1}}{1 + x}} \]

   5. lower-+.f64 N/A

      \[\leadsto \sqrt{\frac{\color{blue}{x + -1}}{1 + x}} \]

   6. +-commutative N/A

      \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

   7. lower-+.f64 41.3

      \[\leadsto \sqrt{\frac{x + -1}{\color{blue}{x + 1}}} \]

8. Applied rewrites 41.3%

   \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
9. Add Preprocessing

Alternative 8: 76.3% accurate, 5.7× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \left(1 + \frac{-1}{x}\right) \end{array} \]

FPCore

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

C

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

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * (1.0d0 + ((-1.0d0) / x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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

   1. lower-*.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-+.f64 N/A

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

   7. sub-neg N/A

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

   8. metadata-eval N/A

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

   9. lower-+.f64 41.3

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

5. Applied rewrites 41.3%

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

6. Taylor expanded in x around inf

   \[\leadsto \color{blue}{1 - \frac{1}{x}} \]
7. Step-by-step derivation

   1. sub-neg N/A

      \[\leadsto \color{blue}{1 + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

   2. lower-+.f64 N/A

      \[\leadsto \color{blue}{1 + \left(\mathsf{neg}\left(\frac{1}{x}\right)\right)} \]

   3. distribute-neg-frac N/A

      \[\leadsto 1 + \color{blue}{\frac{\mathsf{neg}\left(1\right)}{x}} \]

   4. metadata-eval N/A

      \[\leadsto 1 + \frac{\color{blue}{-1}}{x} \]

   5. lower-/.f64 40.8

      \[\leadsto 1 + \color{blue}{\frac{-1}{x}} \]

8. Applied rewrites 40.8%

   \[\leadsto \color{blue}{1 + \frac{-1}{x}} \]
9. Add Preprocessing

Alternative 9: 75.6% accurate, 85.0× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 33.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 \color{blue}{\sqrt{\frac{1}{2}} \cdot \sqrt{2}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-sqrt.f64 39.8

      \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{0.5}} \]

5. Applied rewrites 39.8%

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

   1. sqrt-unprod N/A

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

   2. metadata-eval N/A

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

   3. metadata-eval 40.4

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

7. Applied rewrites 40.4%

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

Reproduce

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