Toniolo and Linder, Equation (7)

Percentage Accurate: 34.1% → 84.7%

Time: 11.8s

Alternatives: 14

Speedup: 85.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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: 34.1% 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.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = fma((t_m * t_m), 2.0, (l_m * l_m));
	double t_3 = t_2 / x;
	double t_4 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 5.2e-158) {
		tmp = t_4 / (sqrt((((((2.0 / x) + 2.0) / x) + 2.0) / x)) * l_m);
	} else if (t_m <= 7.2e+66) {
		tmp = t_4 / sqrt(fma((t_m * t_m), 2.0, (fma(2.0, t_2, (((t_3 + (t_2 + t_2)) + t_3) / x)) / x)));
	} else {
		tmp = t_4 / (sqrt(((1.0 + x) / (x - 1.0))) * t_4);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = fma(Float64(t_m * t_m), 2.0, Float64(l_m * l_m))
	t_3 = Float64(t_2 / x)
	t_4 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 5.2e-158)
		tmp = Float64(t_4 / Float64(sqrt(Float64(Float64(Float64(Float64(Float64(2.0 / x) + 2.0) / x) + 2.0) / x)) * l_m));
	elseif (t_m <= 7.2e+66)
		tmp = Float64(t_4 / sqrt(fma(Float64(t_m * t_m), 2.0, Float64(fma(2.0, t_2, Float64(Float64(Float64(t_3 + Float64(t_2 + t_2)) + t_3) / x)) / x))));
	else
		tmp = Float64(t_4 / Float64(sqrt(Float64(Float64(1.0 + x) / Float64(x - 1.0))) * t_4));
	end
	return Float64(t_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < 5.2000000000000001e-158

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.2

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

   5. Applied rewrites 2.2%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 19.7%

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

   if 5.2000000000000001e-158 < t < 7.2e66

   1. Initial program 58.7%

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

   3. Taylor expanded in x around -inf

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

   5. Applied rewrites 86.3%

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

   if 7.2e66 < t

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 93.0

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

   5. Applied rewrites 93.0%

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

4. Final simplification 45.4%

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

Alternative 2: 78.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0) {
		tmp = t_2 / (sqrt(((1.0 + x) / (x - 1.0))) * t_2);
	} else {
		tmp = t_2 / (sqrt((((2.0 / x) + 2.0) / x)) * l_m);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if ((t_2 / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l_m * l_m) + (2.0d0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0d0) then
        tmp = t_2 / (sqrt(((1.0d0 + x) / (x - 1.0d0))) * t_2)
    else
        tmp = t_2 / (sqrt((((2.0d0 / x) + 2.0d0) / x)) * l_m)
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

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)
	t_2 = sqrt(2.0) * t_m;
	tmp = 0.0;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0)
		tmp = t_2 / (sqrt(((1.0 + x) / (x - 1.0))) * t_2);
	else
		tmp = t_2 / (sqrt((((2.0 / x) + 2.0) / x)) * l_m);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.8%

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

Alternative 3: 78.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   7. Applied rewrites 38.9%

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

   9. Applied rewrites 38.9%

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

   11. Applied rewrites 38.9%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.8%

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

Alternative 4: 78.4% accurate, 0.5× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<=
         (/
          t_2
          (sqrt
           (-
            (* (/ (+ x 1.0) (- x 1.0)) (+ (* l_m l_m) (* 2.0 (* t_m t_m))))
            (* l_m l_m))))
         2.0)
      (/ t_2 (* (sqrt (/ (fma x 2.0 2.0) (- x 1.0))) t_m))
      (* (/ t_m (* (sqrt (/ (+ (/ 2.0 x) 2.0) x)) l_m)) (sqrt 2.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) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0) {
		tmp = t_2 / (sqrt((fma(x, 2.0, 2.0) / (x - 1.0))) * t_m);
	} else {
		tmp = (t_m / (sqrt((((2.0 / x) + 2.0) / x)) * l_m)) * sqrt(2.0);
	}
	return t_s * tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   7. Applied rewrites 38.9%

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

   9. Applied rewrites 38.9%

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

   11. Applied rewrites 38.9%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   10. Applied rewrites 39.8%

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

Alternative 5: 78.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   7. Applied rewrites 38.9%

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

   9. Applied rewrites 38.9%

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

   11. Applied rewrites 38.9%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 39.7

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

   10. Applied rewrites 39.7%

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

Alternative 6: 78.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   7. Applied rewrites 38.9%

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

   9. Applied rewrites 38.9%

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

   11. Applied rewrites 38.9%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.3%

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

Alternative 7: 84.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = fma((t_m * t_m), 2.0, (l_m * l_m));
	double t_3 = t_2 / x;
	double t_4 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 5.2e-158) {
		tmp = t_4 / (sqrt((((((2.0 / x) + 2.0) / x) + 2.0) / x)) * l_m);
	} else if (t_m <= 7.2e+66) {
		tmp = t_4 / sqrt(fma((t_m * t_m), 2.0, ((fma(2.0, t_2, t_3) + t_3) / x)));
	} else {
		tmp = t_4 / (sqrt(((1.0 + x) / (x - 1.0))) * t_4);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = fma(Float64(t_m * t_m), 2.0, Float64(l_m * l_m))
	t_3 = Float64(t_2 / x)
	t_4 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 5.2e-158)
		tmp = Float64(t_4 / Float64(sqrt(Float64(Float64(Float64(Float64(Float64(2.0 / x) + 2.0) / x) + 2.0) / x)) * l_m));
	elseif (t_m <= 7.2e+66)
		tmp = Float64(t_4 / sqrt(fma(Float64(t_m * t_m), 2.0, Float64(Float64(fma(2.0, t_2, t_3) + t_3) / x))));
	else
		tmp = Float64(t_4 / Float64(sqrt(Float64(Float64(1.0 + x) / Float64(x - 1.0))) * t_4));
	end
	return Float64(t_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < 5.2000000000000001e-158

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.2

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

   5. Applied rewrites 2.2%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 19.7%

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

   if 5.2000000000000001e-158 < t < 7.2e66

   1. Initial program 58.7%

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

   3. Taylor expanded in x around -inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 N/A

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

      6. mul-1-neg N/A

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

   5. Applied rewrites 86.3%

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

   if 7.2e66 < t

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 93.0

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

   5. Applied rewrites 93.0%

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

4. Final simplification 45.4%

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

Alternative 8: 77.5% accurate, 0.6× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0) {
		tmp = sqrt(((x - 1.0) / (1.0 + x))) * (sqrt(0.5) * sqrt(2.0));
	} else {
		tmp = t_2 / (sqrt((2.0 / x)) * l_m);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if ((t_2 / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l_m * l_m) + (2.0d0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0d0) then
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x))) * (sqrt(0.5d0) * sqrt(2.0d0))
    else
        tmp = t_2 / (sqrt((2.0d0 / x)) * l_m)
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

   1. Initial program 43.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 \color{blue}{\left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right) \cdot \sqrt{\frac{x - 1}{1 + x}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 38.3

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

   5. Applied rewrites 38.3%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.3%

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

Alternative 9: 77.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0) {
		tmp = t_2 / (sqrt(2.0) * ((t_m / x) + t_m));
	} else {
		tmp = t_2 / (sqrt((2.0 / x)) * l_m);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if ((t_2 / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l_m * l_m) + (2.0d0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0d0) then
        tmp = t_2 / (sqrt(2.0d0) * ((t_m / x) + t_m))
    else
        tmp = t_2 / (sqrt((2.0d0 / x)) * l_m)
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 38.0%

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

   10. Applied rewrites 38.0%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.3%

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

Alternative 10: 77.6% accurate, 0.6× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0) {
		tmp = (t_m / (sqrt(2.0) * ((t_m / x) + t_m))) * sqrt(2.0);
	} else {
		tmp = t_2 / (sqrt((2.0 / x)) * l_m);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if ((t_2 / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l_m * l_m) + (2.0d0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0d0) then
        tmp = (t_m / (sqrt(2.0d0) * ((t_m / x) + t_m))) * sqrt(2.0d0)
    else
        tmp = t_2 / (sqrt((2.0d0 / x)) * l_m)
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 38.9

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

   5. Applied rewrites 38.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 38.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   10. Applied rewrites 37.9%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.3%

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

Alternative 11: 77.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double tmp;
	if ((t_2 / sqrt(((((x + 1.0) / (x - 1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = t_2 / (sqrt((2.0 / x)) * l_m);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if ((t_2 / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l_m * l_m) + (2.0d0 * (t_m * t_m)))) - (l_m * l_m)))) <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = t_2 / (sqrt((2.0d0 / x)) * l_m)
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l)))) < 2

   1. Initial program 43.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 x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-sqrt.f64 36.7

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

   5. Applied rewrites 36.7%

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

   7. Applied rewrites 37.2%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (*.f64 l l) (*.f64 #s(literal 2 binary64) (*.f64 t t)))) (*.f64 l l))))

   1. Initial program 1.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.6

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

   5. Applied rewrites 2.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 39.3%

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

Alternative 12: 84.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = sqrt(2.0) * t_m;
	double t_3 = fma((t_m * t_m), 2.0, (l_m * l_m)) / x;
	double tmp;
	if (t_m <= 5.2e-158) {
		tmp = t_2 / (sqrt((((((2.0 / x) + 2.0) / x) + 2.0) / x)) * l_m);
	} else if (t_m <= 7.2e+66) {
		tmp = t_2 / sqrt((fma((t_m * t_m), 2.0, t_3) + t_3));
	} else {
		tmp = t_2 / (sqrt(((1.0 + x) / (x - 1.0))) * t_2);
	}
	return t_s * tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < 5.2000000000000001e-158

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.2

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

   5. Applied rewrites 2.2%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 19.7%

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

   if 5.2000000000000001e-158 < t < 7.2e66

   1. Initial program 58.7%

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

   3. Taylor expanded in x around inf

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

      1. fp-cancel-sub-sign-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. div-add 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) + 1 \cdot \color{blue}{\left(\frac{2 \cdot {t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right)}}} \]

      4. associate-*r/ 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) + 1 \cdot \left(\color{blue}{2 \cdot \frac{{t}^{2}}{x}} + \frac{{\ell}^{2}}{x}\right)}} \]

      5. *-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}{\left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right)}}} \]

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

   5. Applied rewrites 85.4%

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

   if 7.2e66 < t

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

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 93.0

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

   5. Applied rewrites 93.0%

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

4. Final simplification 45.2%

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

Alternative 13: 75.4% accurate, 1.6× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 1.8e+139) 1.0 (* t_m (sqrt (/ 2.0 (* (* (/ l_m x) l_m) 2.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) {
	double tmp;
	if (l_m <= 1.8e+139) {
		tmp = 1.0;
	} else {
		tmp = t_m * sqrt((2.0 / (((l_m / x) * l_m) * 2.0)));
	}
	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 (l_m <= 1.8d+139) then
        tmp = 1.0d0
    else
        tmp = t_m * sqrt((2.0d0 / (((l_m / x) * l_m) * 2.0d0)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < 1.79999999999999993e139

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

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-sqrt.f64 36.0

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

   5. Applied rewrites 36.0%

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

   7. Applied rewrites 36.5%

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

   if 1.79999999999999993e139 < l

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

      1. lift-/.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\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}} \]

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

      8. sqrt-undiv N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 0.2

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

      11. lift--.f64 N/A

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

   4. Applied rewrites 14.9%

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

   5. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower--.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 0.5

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

   7. Applied rewrites 0.5%

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

   8. Taylor expanded in x around inf

      \[\leadsto t \cdot \sqrt{\frac{2}{2 \cdot \color{blue}{\frac{{\ell}^{2}}{x}}}} \]
   9. Step-by-step derivation

   10. Applied rewrites 18.3%

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

   12. Applied rewrites 48.3%

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

4. Final simplification 37.8%

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

Alternative 14: 75.7% 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 30.5%

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

3. Taylor expanded in x around inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-sqrt.f64 33.8

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

5. Applied rewrites 33.8%

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

7. Applied rewrites 34.3%

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

Reproduce

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