Toniolo and Linder, Equation (7)

Percentage Accurate: 33.4% → 84.8%

Time: 15.7s

Alternatives: 7

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.4% 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: 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 := t\_m \cdot \sqrt{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 6 \cdot 10^{-156}:\\ \;\;\;\;\frac{1}{l\_m \cdot \sqrt{2 \cdot \frac{1}{x}}} \cdot t\_2\\ \mathbf{elif}\;t\_m \leq 2.3 \cdot 10^{+24}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\mathsf{fma}\left(2, t\_m \cdot t\_m + \frac{t\_m \cdot t\_m}{x}, \frac{l\_m \cdot l\_m}{x}\right) + \frac{\mathsf{fma}\left(2, t\_m \cdot t\_m, l\_m \cdot l\_m\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \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 (* t_m (sqrt 2.0))))
   (*
    t_s
    (if (<= t_m 6e-156)
      (* (/ 1.0 (* l_m (sqrt (* 2.0 (/ 1.0 x))))) t_2)
      (if (<= t_m 2.3e+24)
        (/
         t_2
         (sqrt
          (+
           (fma 2.0 (+ (* t_m t_m) (/ (* t_m t_m) x)) (/ (* l_m l_m) x))
           (/ (fma 2.0 (* t_m t_m) (* l_m l_m)) x))))
        (sqrt (/ (+ x -1.0) (+ 1.0 x))))))))

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 = t_m * sqrt(2.0);
	double tmp;
	if (t_m <= 6e-156) {
		tmp = (1.0 / (l_m * sqrt((2.0 * (1.0 / x))))) * t_2;
	} else if (t_m <= 2.3e+24) {
		tmp = t_2 / sqrt((fma(2.0, ((t_m * t_m) + ((t_m * t_m) / x)), ((l_m * l_m) / x)) + (fma(2.0, (t_m * t_m), (l_m * l_m)) / x)));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	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(t_m * sqrt(2.0))
	tmp = 0.0
	if (t_m <= 6e-156)
		tmp = Float64(Float64(1.0 / Float64(l_m * sqrt(Float64(2.0 * Float64(1.0 / x))))) * t_2);
	elseif (t_m <= 2.3e+24)
		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_m * l_m) / x)) + Float64(fma(2.0, Float64(t_m * t_m), Float64(l_m * l_m)) / x))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	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[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 6e-156], N[(N[(1.0 / N[(l$95$m * N[Sqrt[N[(2.0 * N[(1.0 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$m, 2.3e+24], 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$95$m * l$95$m), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 6e-156

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

      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 7.8

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

   5. Applied rewrites 7.8%

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. associate--l+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. sub-neg N/A

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

      7. metadata-eval N/A

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

      8. lower-+.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. sub-neg N/A

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

      14. metadata-eval N/A

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

      15. lower-+.f64 11.3

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

   8. Applied rewrites 11.3%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 21.8%

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

       1. lift-/.f64 N/A

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

       2. clear-num N/A

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

       3. associate-/r/ N/A

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

       4. lower-*.f64 N/A

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

   13. Applied rewrites 21.7%

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

   if 6e-156 < t < 2.2999999999999999e24

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

      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 82.1%

      \[\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 2.2999999999999999e24 < t

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

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 96.6

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

   5. Applied rewrites 96.6%

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

   7. Applied rewrites 98.0%

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

4. Final simplification 50.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 6 \cdot 10^{-156}:\\ \;\;\;\;\frac{1}{\ell \cdot \sqrt{2 \cdot \frac{1}{x}}} \cdot \left(t \cdot \sqrt{2}\right)\\ \mathbf{elif}\;t \leq 2.3 \cdot 10^{+24}:\\ \;\;\;\;\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}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 81.7% accurate, 0.8× 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 := t\_m \cdot \sqrt{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.4 \cdot 10^{-178}:\\ \;\;\;\;\frac{1}{l\_m \cdot \sqrt{2 \cdot \frac{1}{x}}} \cdot t\_2\\ \mathbf{elif}\;t\_m \leq 1.02 \cdot 10^{-8}:\\ \;\;\;\;\frac{t\_2}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, t\_m \cdot t\_m, l\_m \cdot l\_m\right)}{x \cdot t\_2}, t\_2\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \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 (* t_m (sqrt 2.0))))
   (*
    t_s
    (if (<= t_m 1.4e-178)
      (* (/ 1.0 (* l_m (sqrt (* 2.0 (/ 1.0 x))))) t_2)
      (if (<= t_m 1.02e-8)
        (/
         t_2
         (fma 0.5 (/ (* 2.0 (fma 2.0 (* t_m t_m) (* l_m l_m))) (* x t_2)) t_2))
        (sqrt (/ (+ x -1.0) (+ 1.0 x))))))))

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 = t_m * sqrt(2.0);
	double tmp;
	if (t_m <= 1.4e-178) {
		tmp = (1.0 / (l_m * sqrt((2.0 * (1.0 / x))))) * t_2;
	} else if (t_m <= 1.02e-8) {
		tmp = t_2 / fma(0.5, ((2.0 * fma(2.0, (t_m * t_m), (l_m * l_m))) / (x * t_2)), t_2);
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	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(t_m * sqrt(2.0))
	tmp = 0.0
	if (t_m <= 1.4e-178)
		tmp = Float64(Float64(1.0 / Float64(l_m * sqrt(Float64(2.0 * Float64(1.0 / x))))) * t_2);
	elseif (t_m <= 1.02e-8)
		tmp = Float64(t_2 / fma(0.5, Float64(Float64(2.0 * fma(2.0, Float64(t_m * t_m), Float64(l_m * l_m))) / Float64(x * t_2)), t_2));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	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[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.4e-178], N[(N[(1.0 / N[(l$95$m * N[Sqrt[N[(2.0 * N[(1.0 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$m, 1.02e-8], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision] + N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x * t$95$2), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 1.4000000000000001e-178

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

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

   5. Applied rewrites 6.6%

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. associate--l+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. sub-neg N/A

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

      7. metadata-eval N/A

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

      8. lower-+.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. sub-neg N/A

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

      14. metadata-eval N/A

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

      15. lower-+.f64 11.3

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

   8. Applied rewrites 11.3%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 21.5%

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

       1. lift-/.f64 N/A

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

       2. clear-num N/A

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

       3. associate-/r/ N/A

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

       4. lower-*.f64 N/A

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

   13. Applied rewrites 21.5%

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

   if 1.4000000000000001e-178 < t < 1.02000000000000003e-8

   1. Initial program 38.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}{\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 68.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)}} \]

   if 1.02000000000000003e-8 < t

   1. Initial program 34.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 t around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 95.4

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

   5. Applied rewrites 95.4%

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

   7. Applied rewrites 96.8%

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

4. Final simplification 48.6%

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

Alternative 3: 80.1% 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}\;t\_m \leq 4.8 \cdot 10^{-141}:\\ \;\;\;\;\frac{1}{l\_m \cdot \sqrt{2 \cdot \frac{1}{x}}} \cdot \left(t\_m \cdot \sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \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 (<= t_m 4.8e-141)
    (* (/ 1.0 (* l_m (sqrt (* 2.0 (/ 1.0 x))))) (* t_m (sqrt 2.0)))
    (sqrt (/ (+ x -1.0) (+ 1.0 x))))))

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 (t_m <= 4.8e-141) {
		tmp = (1.0 / (l_m * sqrt((2.0 * (1.0 / x))))) * (t_m * sqrt(2.0));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    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 (t_m <= 4.8d-141) then
        tmp = (1.0d0 / (l_m * sqrt((2.0d0 * (1.0d0 / x))))) * (t_m * sqrt(2.0d0))
    else
        tmp = sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
    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 (t_m <= 4.8e-141) {
		tmp = (1.0 / (l_m * Math.sqrt((2.0 * (1.0 / x))))) * (t_m * Math.sqrt(2.0));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (1.0 + x)));
	}
	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 t_m <= 4.8e-141:
		tmp = (1.0 / (l_m * math.sqrt((2.0 * (1.0 / x))))) * (t_m * math.sqrt(2.0))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	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 (t_m <= 4.8e-141)
		tmp = Float64(Float64(1.0 / Float64(l_m * sqrt(Float64(2.0 * Float64(1.0 / x))))) * Float64(t_m * sqrt(2.0)));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	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 (t_m <= 4.8e-141)
		tmp = (1.0 / (l_m * sqrt((2.0 * (1.0 / x))))) * (t_m * sqrt(2.0));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	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[t$95$m, 4.8e-141], N[(N[(1.0 / N[(l$95$m * N[Sqrt[N[(2.0 * N[(1.0 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 4.8000000000000002e-141

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

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

   5. Applied rewrites 9.6%

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. associate--l+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. sub-neg N/A

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

      7. metadata-eval N/A

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

      8. lower-+.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. sub-neg N/A

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

      14. metadata-eval N/A

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

      15. lower-+.f64 11.1

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

   8. Applied rewrites 11.1%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 21.8%

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

       1. lift-/.f64 N/A

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

       2. clear-num N/A

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

       3. associate-/r/ N/A

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

       4. lower-*.f64 N/A

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

   13. Applied rewrites 21.7%

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

   if 4.8000000000000002e-141 < t

   1. Initial program 38.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 t around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 86.1

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

   5. Applied rewrites 86.1%

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

   7. Applied rewrites 87.4%

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

4. Final simplification 47.1%

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

Alternative 4: 80.1% accurate, 1.4× 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}\;t\_m \leq 4.8 \cdot 10^{-141}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2}}{l\_m \cdot \sqrt{\frac{2}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \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 (<= t_m 4.8e-141)
    (/ (* t_m (sqrt 2.0)) (* l_m (sqrt (/ 2.0 x))))
    (sqrt (/ (+ x -1.0) (+ 1.0 x))))))

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 (t_m <= 4.8e-141) {
		tmp = (t_m * sqrt(2.0)) / (l_m * sqrt((2.0 / x)));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    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 (t_m <= 4.8d-141) then
        tmp = (t_m * sqrt(2.0d0)) / (l_m * sqrt((2.0d0 / x)))
    else
        tmp = sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
    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 (t_m <= 4.8e-141) {
		tmp = (t_m * Math.sqrt(2.0)) / (l_m * Math.sqrt((2.0 / x)));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (1.0 + x)));
	}
	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 t_m <= 4.8e-141:
		tmp = (t_m * math.sqrt(2.0)) / (l_m * math.sqrt((2.0 / x)))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	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 (t_m <= 4.8e-141)
		tmp = Float64(Float64(t_m * sqrt(2.0)) / Float64(l_m * sqrt(Float64(2.0 / x))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	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 (t_m <= 4.8e-141)
		tmp = (t_m * sqrt(2.0)) / (l_m * sqrt((2.0 / x)));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	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[t$95$m, 4.8e-141], N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[(l$95$m * N[Sqrt[N[(2.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 4.8000000000000002e-141

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

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

   5. Applied rewrites 9.6%

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. associate--l+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. sub-neg N/A

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

      7. metadata-eval N/A

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

      8. lower-+.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. sub-neg N/A

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

      14. metadata-eval N/A

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

      15. lower-+.f64 11.1

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

   8. Applied rewrites 11.1%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 21.7%

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

   if 4.8000000000000002e-141 < t

   1. Initial program 38.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 t around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 86.1

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

   5. Applied rewrites 86.1%

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

   7. Applied rewrites 87.4%

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

4. Final simplification 47.1%

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

Alternative 5: 77.6% accurate, 3.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 \sqrt{\frac{x + -1}{1 + x}} \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 (sqrt (/ (+ x -1.0) (+ 1.0 x)))))

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 * sqrt(((x + -1.0) / (1.0 + x)));
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    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 * sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
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 * Math.sqrt(((x + -1.0) / (1.0 + x)));
}

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 * math.sqrt(((x + -1.0) / (1.0 + x)))

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 * sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x))))
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 * sqrt(((x + -1.0) / (1.0 + x)));
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 * N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. sub-neg N/A

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

   9. metadata-eval N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 39.1

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

5. Applied rewrites 39.1%

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

7. Applied rewrites 39.7%

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

8. Final simplification 39.7%

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

Alternative 6: 77.0% accurate, 5.7× 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 \left(1 + \frac{-1}{x}\right) \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 (/ -1.0 x))))

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 + (-1.0 / x));
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    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 + ((-1.0d0) / x))
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 + (-1.0 / x));
}

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 + (-1.0 / x))

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 * Float64(1.0 + Float64(-1.0 / x)))
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 + (-1.0 / x));
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 * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. sub-neg N/A

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

   9. metadata-eval N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 39.1

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

5. Applied rewrites 39.1%

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

7. Applied rewrites 39.7%

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

8. Taylor expanded in x around inf

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

10. Applied rewrites 39.3%

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

Alternative 7: 76.4% 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 = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    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 29.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 \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 38.4

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

5. Applied rewrites 38.4%

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

7. Applied rewrites 39.0%

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

Reproduce

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