Toniolo and Linder, Equation (7)

Percentage Accurate: 32.6% → 82.4%

Time: 12.3s

Alternatives: 9

Speedup: 85.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 32.6% 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: 82.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} 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}\;t\_m \leq 6.4 \cdot 10^{-11}:\\ \;\;\;\;\frac{\sqrt{2}}{\sqrt{\mathsf{fma}\left(t\_m \cdot t\_m, 2, \frac{\mathsf{fma}\left(2 \cdot t\_m, t\_m, \ell \cdot \ell\right) \cdot -2}{-x}\right)}} \cdot t\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{x - -1}{x - 1}} \cdot t\_2}\\ \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 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= t_m 6.4e-11)
      (*
       (/
        (sqrt 2.0)
        (sqrt
         (fma
          (* t_m t_m)
          2.0
          (/ (* (fma (* 2.0 t_m) t_m (* l l)) -2.0) (- x)))))
       t_m)
      (/ t_2 (* (sqrt (/ (- x -1.0) (- x 1.0))) t_2))))))

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 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 6.4e-11) {
		tmp = (sqrt(2.0) / sqrt(fma((t_m * t_m), 2.0, ((fma((2.0 * t_m), t_m, (l * l)) * -2.0) / -x)))) * t_m;
	} else {
		tmp = t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 6.4e-11)
		tmp = Float64(Float64(sqrt(2.0) / sqrt(fma(Float64(t_m * t_m), 2.0, Float64(Float64(fma(Float64(2.0 * t_m), t_m, Float64(l * l)) * -2.0) / Float64(-x))))) * t_m);
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(x - -1.0) / Float64(x - 1.0))) * t_2));
	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[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 6.4e-11], N[(N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(N[(t$95$m * t$95$m), $MachinePrecision] * 2.0 + N[(N[(N[(N[(2.0 * t$95$m), $MachinePrecision] * t$95$m + N[(l * l), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision] / (-x)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$m), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 6.39999999999999987e-11

   1. Initial program 29.5%

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

   3. Taylor expanded in 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. unpow2 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{2 \cdot \color{blue}{\left(t \cdot t\right)} + -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. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 56.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

   10. Applied rewrites 56.9%

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

   if 6.39999999999999987e-11 < t

   1. Initial program 39.4%

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

   3. Taylor expanded in t around inf

      \[\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. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 90.5

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

   5. Applied rewrites 90.5%

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

4. Final simplification 67.4%

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

Alternative 2: 82.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} 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}\;t\_m \leq 6.4 \cdot 10^{-11}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\left(\frac{\mathsf{fma}\left(t\_m \cdot t\_m, 2, \ell \cdot \ell\right)}{x} + t\_m \cdot t\_m\right) \cdot 2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{x - -1}{x - 1}} \cdot t\_2}\\ \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 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= t_m 6.4e-11)
      (/
       t_2
       (sqrt (* (+ (/ (fma (* t_m t_m) 2.0 (* l l)) x) (* t_m t_m)) 2.0)))
      (/ t_2 (* (sqrt (/ (- x -1.0) (- x 1.0))) t_2))))))

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 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 6.4e-11) {
		tmp = t_2 / sqrt((((fma((t_m * t_m), 2.0, (l * l)) / x) + (t_m * t_m)) * 2.0));
	} else {
		tmp = t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 6.4e-11)
		tmp = Float64(t_2 / sqrt(Float64(Float64(Float64(fma(Float64(t_m * t_m), 2.0, Float64(l * l)) / x) + Float64(t_m * t_m)) * 2.0)));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(x - -1.0) / Float64(x - 1.0))) * t_2));
	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[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 6.4e-11], N[(t$95$2 / N[Sqrt[N[(N[(N[(N[(N[(t$95$m * t$95$m), $MachinePrecision] * 2.0 + N[(l * l), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] + N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 6.39999999999999987e-11

   1. Initial program 29.5%

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

   3. Taylor expanded in 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. unpow2 N/A

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{2 \cdot \color{blue}{\left(t \cdot t\right)} + -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. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 56.8%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 56.7%

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

   if 6.39999999999999987e-11 < t

   1. Initial program 39.4%

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

   3. Taylor expanded in t around inf

      \[\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. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 90.5

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

   5. Applied rewrites 90.5%

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

4. Final simplification 67.2%

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

Alternative 3: 76.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} 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}\;t\_m \leq 5.2 \cdot 10^{-246}:\\ \;\;\;\;\frac{t\_m}{\sqrt{\left(\frac{x}{x - 1} - 1\right) + \frac{1}{x - 1}} \cdot \ell} \cdot \sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{x - -1}{x - 1}} \cdot t\_2}\\ \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 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= t_m 5.2e-246)
      (*
       (/ t_m (* (sqrt (+ (- (/ x (- x 1.0)) 1.0) (/ 1.0 (- x 1.0)))) l))
       (sqrt 2.0))
      (/ t_2 (* (sqrt (/ (- x -1.0) (- x 1.0))) t_2))))))

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 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 5.2e-246) {
		tmp = (t_m / (sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * sqrt(2.0);
	} else {
		tmp = t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if (t_m <= 5.2d-246) then
        tmp = (t_m / (sqrt((((x / (x - 1.0d0)) - 1.0d0) + (1.0d0 / (x - 1.0d0)))) * l)) * sqrt(2.0d0)
    else
        tmp = t_2 / (sqrt(((x - (-1.0d0)) / (x - 1.0d0))) * t_2)
    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 t_2 = Math.sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 5.2e-246) {
		tmp = (t_m / (Math.sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * Math.sqrt(2.0);
	} else {
		tmp = t_2 / (Math.sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	}
	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):
	t_2 = math.sqrt(2.0) * t_m
	tmp = 0
	if t_m <= 5.2e-246:
		tmp = (t_m / (math.sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * math.sqrt(2.0)
	else:
		tmp = t_2 / (math.sqrt(((x - -1.0) / (x - 1.0))) * t_2)
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 5.2e-246)
		tmp = Float64(Float64(t_m / Float64(sqrt(Float64(Float64(Float64(x / Float64(x - 1.0)) - 1.0) + Float64(1.0 / Float64(x - 1.0)))) * l)) * sqrt(2.0));
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(x - -1.0) / Float64(x - 1.0))) * t_2));
	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)
	t_2 = sqrt(2.0) * t_m;
	tmp = 0.0;
	if (t_m <= 5.2e-246)
		tmp = (t_m / (sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * sqrt(2.0);
	else
		tmp = t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	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_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 5.2e-246], N[(N[(t$95$m / N[(N[Sqrt[N[(N[(N[(x / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] + N[(1.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 5.1999999999999997e-246

   1. Initial program 27.2%

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

   3. Taylor expanded in t around inf

      \[\leadsto \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. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 2.7

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

   5. Applied rewrites 2.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   7. Applied rewrites 2.7%

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

   8. Taylor expanded in l around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. associate--l+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 10.2

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

   10. Applied rewrites 10.2%

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

   if 5.1999999999999997e-246 < t

   1. Initial program 38.7%

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

   3. Taylor expanded in t around inf

      \[\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. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 81.1

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

   5. Applied rewrites 81.1%

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

4. Final simplification 43.7%

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

Alternative 4: 76.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} 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}\;t\_m \leq 5.2 \cdot 10^{-246}:\\ \;\;\;\;\frac{\sqrt{2}}{\sqrt{\left(\frac{x}{x - 1} - 1\right) + \frac{1}{x - 1}} \cdot \ell} \cdot t\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{\sqrt{\frac{x - -1}{x - 1}} \cdot t\_2}\\ \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 (* (sqrt 2.0) t_m)))
   (*
    t_s
    (if (<= t_m 5.2e-246)
      (*
       (/
        (sqrt 2.0)
        (* (sqrt (+ (- (/ x (- x 1.0)) 1.0) (/ 1.0 (- x 1.0)))) l))
       t_m)
      (/ t_2 (* (sqrt (/ (- x -1.0) (- x 1.0))) t_2))))))

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 = sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 5.2e-246) {
		tmp = (sqrt(2.0) / (sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * t_m;
	} else {
		tmp = t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	}
	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) :: t_2
    real(8) :: tmp
    t_2 = sqrt(2.0d0) * t_m
    if (t_m <= 5.2d-246) then
        tmp = (sqrt(2.0d0) / (sqrt((((x / (x - 1.0d0)) - 1.0d0) + (1.0d0 / (x - 1.0d0)))) * l)) * t_m
    else
        tmp = t_2 / (sqrt(((x - (-1.0d0)) / (x - 1.0d0))) * t_2)
    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 t_2 = Math.sqrt(2.0) * t_m;
	double tmp;
	if (t_m <= 5.2e-246) {
		tmp = (Math.sqrt(2.0) / (Math.sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * t_m;
	} else {
		tmp = t_2 / (Math.sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	}
	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):
	t_2 = math.sqrt(2.0) * t_m
	tmp = 0
	if t_m <= 5.2e-246:
		tmp = (math.sqrt(2.0) / (math.sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * t_m
	else:
		tmp = t_2 / (math.sqrt(((x - -1.0) / (x - 1.0))) * t_2)
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(sqrt(2.0) * t_m)
	tmp = 0.0
	if (t_m <= 5.2e-246)
		tmp = Float64(Float64(sqrt(2.0) / Float64(sqrt(Float64(Float64(Float64(x / Float64(x - 1.0)) - 1.0) + Float64(1.0 / Float64(x - 1.0)))) * l)) * t_m);
	else
		tmp = Float64(t_2 / Float64(sqrt(Float64(Float64(x - -1.0) / Float64(x - 1.0))) * t_2));
	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)
	t_2 = sqrt(2.0) * t_m;
	tmp = 0.0;
	if (t_m <= 5.2e-246)
		tmp = (sqrt(2.0) / (sqrt((((x / (x - 1.0)) - 1.0) + (1.0 / (x - 1.0)))) * l)) * t_m;
	else
		tmp = t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2);
	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_] := Block[{t$95$2 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 5.2e-246], N[(N[(N[Sqrt[2.0], $MachinePrecision] / N[(N[Sqrt[N[(N[(N[(x / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] + N[(1.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * t$95$m), $MachinePrecision], N[(t$95$2 / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 5.1999999999999997e-246

   1. Initial program 27.2%

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

   3. Taylor expanded in t around inf

      \[\leadsto \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. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 2.7

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

   5. Applied rewrites 2.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   7. Applied rewrites 2.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 2.7

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

   9. Applied rewrites 2.7%

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

   10. Taylor expanded in l around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. lower-sqrt.f64 N/A

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

       4. associate--l+ N/A

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

       5. lower-+.f64 N/A

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

       6. lower-/.f64 N/A

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

       7. lower--.f64 N/A

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

       8. lower--.f64 N/A

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

       9. lower-/.f64 N/A

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

       10. lower--.f64 10.2

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

   12. Applied rewrites 10.2%

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

   if 5.1999999999999997e-246 < t

   1. Initial program 38.7%

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

   3. Taylor expanded in t around inf

      \[\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. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 81.1

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

   5. Applied rewrites 81.1%

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

4. Final simplification 43.7%

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

Alternative 5: 76.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \sqrt{2} \cdot t\_m\\ t\_s \cdot \frac{t\_2}{\sqrt{\frac{x - -1}{x - 1}} \cdot t\_2} \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 (* (sqrt 2.0) t_m)))
   (* t_s (/ t_2 (* (sqrt (/ (- x -1.0) (- x 1.0))) t_2)))))

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 = sqrt(2.0) * t_m;
	return t_s * (t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2));
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l, t_m)
	t_2 = sqrt(2.0) * t_m;
	tmp = t_s * (t_2 / (sqrt(((x - -1.0) / (x - 1.0))) * t_2));
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[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * N[(t$95$2 / N[(N[Sqrt[N[(N[(x - -1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 32.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 \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. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. sub-neg N/A

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

   8. lower--.f64 N/A

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

   9. lower--.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-sqrt.f64 39.7

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

5. Applied rewrites 39.7%

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

Alternative 6: 75.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \frac{\sqrt{2} \cdot t\_m}{\sqrt{\frac{\mathsf{fma}\left(x, 2, 2\right)}{x - 1}} \cdot t\_m} \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 2.0) t_m) (* (sqrt (/ (fma x 2.0 2.0) (- x 1.0))) t_m))))

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(2.0) * t_m) / (sqrt((fma(x, 2.0, 2.0) / (x - 1.0))) * t_m));
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	return Float64(t_s * Float64(Float64(sqrt(2.0) * t_m) / Float64(sqrt(Float64(fma(x, 2.0, 2.0) / Float64(x - 1.0))) * t_m)))
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[(N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision] / N[(N[Sqrt[N[(N[(x * 2.0 + 2.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 32.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 \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. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. sub-neg N/A

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

   8. lower--.f64 N/A

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

   9. lower--.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-sqrt.f64 39.7

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

5. Applied rewrites 39.7%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

7. Applied rewrites 39.6%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-*l/ N/A

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

   4. associate-/l* N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 39.6

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

9. Applied rewrites 39.6%

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

    1. lift-*.f64 N/A

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

    2. lift-/.f64 N/A

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

    3. associate-*r/ N/A

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

    4. *-commutative N/A

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

    5. lift-*.f64 N/A

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

    6. lower-/.f64 39.7

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

11. Applied rewrites 39.7%

    \[\leadsto \color{blue}{\frac{\sqrt{2} \cdot t}{\sqrt{\frac{\mathsf{fma}\left(x, 2, 2\right)}{x - 1}} \cdot t}} \]
12. Add Preprocessing

Alternative 7: 75.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} 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 \frac{t\_2}{\left(\frac{1}{x} + 1\right) \cdot t\_2} \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 (* (sqrt 2.0) t_m))) (* t_s (/ t_2 (* (+ (/ 1.0 x) 1.0) t_2)))))

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 = sqrt(2.0) * t_m;
	return t_s * (t_2 / (((1.0 / x) + 1.0) * t_2));
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l, t_m)
	t_2 = sqrt(2.0) * t_m;
	tmp = t_s * (t_2 / (((1.0 / x) + 1.0) * t_2));
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[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, N[(t$95$s * N[(t$95$2 / N[(N[(N[(1.0 / x), $MachinePrecision] + 1.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 32.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 \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. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. sub-neg N/A

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

   8. lower--.f64 N/A

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

   9. lower--.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-sqrt.f64 39.7

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

5. Applied rewrites 39.7%

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

6. Taylor expanded in x around inf

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

8. Applied rewrites 39.6%

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

Alternative 8: 75.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \left(\frac{t\_m}{\sqrt{\frac{4}{x} + 2} \cdot t\_m} \cdot \sqrt{2}\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 (* (/ t_m (* (sqrt (+ (/ 4.0 x) 2.0)) t_m)) (sqrt 2.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 * ((t_m / (sqrt(((4.0 / x) + 2.0)) * t_m)) * sqrt(2.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 * ((t_m / (sqrt(((4.0d0 / x) + 2.0d0)) * t_m)) * sqrt(2.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 * ((t_m / (Math.sqrt(((4.0 / x) + 2.0)) * t_m)) * Math.sqrt(2.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 * ((t_m / (math.sqrt(((4.0 / x) + 2.0)) * t_m)) * math.sqrt(2.0))

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	return Float64(t_s * Float64(Float64(t_m / Float64(sqrt(Float64(Float64(4.0 / x) + 2.0)) * t_m)) * sqrt(2.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 * ((t_m / (sqrt(((4.0 / x) + 2.0)) * t_m)) * sqrt(2.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[(N[(t$95$m / N[(N[Sqrt[N[(N[(4.0 / x), $MachinePrecision] + 2.0), $MachinePrecision]], $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 32.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 \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. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. sub-neg N/A

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

   8. lower--.f64 N/A

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

   9. lower--.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-sqrt.f64 39.7

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

5. Applied rewrites 39.7%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

7. Applied rewrites 39.6%

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

8. Taylor expanded in x around inf

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

10. Applied rewrites 39.5%

    \[\leadsto \frac{t}{\sqrt{\frac{4}{x} + 2} \cdot t} \cdot \sqrt{2} \]
11. Add Preprocessing

Alternative 9: 74.8% 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 32.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 38.7

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

5. Applied rewrites 38.7%

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

7. Applied rewrites 39.3%

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

Reproduce

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