Toniolo and Linder, Equation (7)

Percentage Accurate: 33.8% → 84.5%

Time: 15.0s

Alternatives: 6

Speedup: 85.0×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, l, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 33.8% 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.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < 1.65000000000000007e-162

   1. Initial program 27.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-fma.f64 N/A

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

   5. Applied rewrites 20.1%

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

   if 1.65000000000000007e-162 < t < 5.0999999999999999e42

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. associate-*l/ N/A

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

      6. lift--.f64 N/A

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

      7. flip-- N/A

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

      8. lift-+.f64 N/A

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

      9. associate-/r/ N/A

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

      10. lower-fma.f64 N/A

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

   4. Applied rewrites 32.3%

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

   5. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-out N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 80.0

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

   7. Applied rewrites 80.0%

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

   if 5.0999999999999999e42 < t

   1. Initial program 31.1%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 97.0

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

   5. Applied rewrites 97.0%

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

   7. Applied rewrites 98.6%

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

4. Final simplification 49.3%

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

Alternative 2: 77.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 4.3d-218) then
        tmp = (t_m * sqrt(2.0d0)) / (l * (sqrt(2.0d0) * sqrt((1.0d0 / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 4.3e-218

   1. Initial program 29.3%

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

   3. Taylor expanded in l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. metadata-eval N/A

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

      6. associate-+l+ N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-+.f64 N/A

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

      12. lower-+.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. sub-neg N/A

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

      15. metadata-eval N/A

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

      16. lower-+.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 19.5%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 19.5%

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

   if 4.3e-218 < t

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

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 85.1

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

   5. Applied rewrites 85.1%

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

   7. Applied rewrites 86.4%

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

4. Final simplification 50.4%

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

Alternative 3: 77.6% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 4.3d-218) then
        tmp = t_m * (sqrt(2.0d0) / (l * sqrt((2.0d0 / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 4.3e-218

   1. Initial program 29.3%

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

   3. Taylor expanded in l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. metadata-eval N/A

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

      6. associate-+l+ N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. sub-neg N/A

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

      10. metadata-eval N/A

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

      11. lower-+.f64 N/A

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

      12. lower-+.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. sub-neg N/A

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

      15. metadata-eval N/A

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

      16. lower-+.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 19.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 19.5

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

   10. Applied rewrites 19.5%

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

   if 4.3e-218 < t

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

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 85.1

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

   5. Applied rewrites 85.1%

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

   7. Applied rewrites 86.4%

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

Alternative 4: 76.6% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 33.1%

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

3. Taylor expanded in t around inf

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. sub-neg N/A

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

   9. metadata-eval N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 41.8

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

5. Applied rewrites 41.8%

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

7. Applied rewrites 42.4%

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

Alternative 5: 76.0% accurate, 5.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 33.1%

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

3. Taylor expanded in t around inf

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. sub-neg N/A

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

   9. metadata-eval N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 41.8

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

5. Applied rewrites 41.8%

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

7. Applied rewrites 42.4%

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

8. Taylor expanded in x around inf

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

10. Applied rewrites 42.4%

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

Alternative 6: 75.3% accurate, 85.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 33.1%

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

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-sqrt.f64 41.2

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

5. Applied rewrites 41.2%

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

7. Applied rewrites 41.8%

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

Reproduce

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