Toniolo and Linder, Equation (7)

Percentage Accurate: 32.8% → 84.2%

Time: 22.6s

Alternatives: 7

Speedup: 225.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.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.2% accurate, 0.2× speedup

Math

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

FPCore

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

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l_m, 2.0);
	double tmp;
	if (t_m <= 1.95e-199) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else if (t_m <= 1.3e-175) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_m <= 2e+22) {
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((((2.0 * (pow(t_m, 2.0) / x)) + (pow(l_m, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	} else {
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l_m ** 2.0d0)
    if (t_m <= 1.95d-199) then
        tmp = (t_m * sqrt(x)) / l_m
    else if (t_m <= 1.3d-175) then
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    else if (t_m <= 2d+22) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((t_2 + ((((2.0d0 * ((t_m ** 2.0d0) / x)) + ((l_m ** 2.0d0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))))
    else
        tmp = 1.0d0 + (((-1.0d0) - ((-0.5d0) / x)) / x)
    end if
    code = t_s * tmp
end function

Java

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

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l_m, 2.0)
	tmp = 0
	if t_m <= 1.95e-199:
		tmp = (t_m * math.sqrt(x)) / l_m
	elif t_m <= 1.3e-175:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	elif t_m <= 2e+22:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((t_2 + ((((2.0 * (math.pow(t_m, 2.0) / x)) + (math.pow(l_m, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))))
	else:
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x)
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.95e-199)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	elseif (t_m <= 1.3e-175)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	elseif (t_m <= 2e+22)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_2 + Float64(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l_m ^ 2.0) / x)) + Float64(Float64(t_3 + t_3) + Float64(t_3 / x))) / x)))));
	else
		tmp = Float64(1.0 + Float64(Float64(-1.0 - Float64(-0.5 / x)) / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 1.95e-199)
		tmp = (t_m * sqrt(x)) / l_m;
	elseif (t_m <= 1.3e-175)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	elseif (t_m <= 2e+22)
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((((2.0 * ((t_m ^ 2.0) / x)) + ((l_m ^ 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	else
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if t < 1.9500000000000001e-199

   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}} \]

   3. Simplified 29.5%

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

   5. Taylor expanded in l around inf 2.9%

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

      1. *-commutative 2.9%

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

      2. associate--l+ 10.5%

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

      3. sub-neg 10.5%

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

      4. metadata-eval 10.5%

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

      5. +-commutative 10.5%

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

      6. sub-neg 10.5%

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

      7. metadata-eval 10.5%

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

      8. +-commutative 10.5%

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

      9. associate-/l* 10.5%

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

   7. Simplified 10.5%

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

   8. Taylor expanded in x around inf 14.3%

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

      1. associate-*l/ 15.6%

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

      2. sqrt-unprod 15.7%

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

      3. metadata-eval 15.7%

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

      4. metadata-eval 15.7%

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

      5. *-commutative 15.7%

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

      6. *-un-lft-identity 15.7%

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

   10. Applied egg-rr 15.7%

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

   if 1.9500000000000001e-199 < t < 1.3e-175

   1. Initial program 2.9%

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

   3. Simplified 2.9%

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

   5. Taylor expanded in l around 0 83.4%

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

   6. Taylor expanded in t around 0 83.9%

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

   if 1.3e-175 < t < 2e22

   1. Initial program 43.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}} \]

   3. Simplified 43.6%

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

   5. Taylor expanded in x around -inf 80.6%

      \[\leadsto \sqrt{2} \cdot \frac{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}}}} \]

   if 2e22 < t

   1. Initial program 33.9%

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

   3. Simplified 33.9%

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

   5. Taylor expanded in l around 0 90.0%

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

   6. Taylor expanded in x around -inf 0.0%

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

   8. Simplified 90.3%

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

4. Final simplification 45.8%

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

Alternative 2: 84.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.9 \cdot 10^{-199}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\ \mathbf{elif}\;t\_m \leq 6.3 \cdot 10^{-174}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{elif}\;t\_m \leq 2.9 \cdot 10^{+22}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{x + -1}, 2 \cdot \frac{{l\_m}^{2}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1 - \frac{-0.5}{x}}{x}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.9e-199)
    (/ (* t_m (sqrt x)) l_m)
    (if (<= t_m 6.3e-174)
      (sqrt (/ (+ x -1.0) (+ x 1.0)))
      (if (<= t_m 2.9e+22)
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (fma
            2.0
            (* (pow t_m 2.0) (/ (+ x 1.0) (+ x -1.0)))
            (* 2.0 (/ (pow l_m 2.0) x))))))
        (+ 1.0 (/ (- -1.0 (/ -0.5 x)) x)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 1.9e-199) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else if (t_m <= 6.3e-174) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_m <= 2.9e+22) {
		tmp = sqrt(2.0) * (t_m / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (x + -1.0))), (2.0 * (pow(l_m, 2.0) / x)))));
	} else {
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 1.9e-199)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	elseif (t_m <= 6.3e-174)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	elseif (t_m <= 2.9e+22)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(x + -1.0))), Float64(2.0 * Float64((l_m ^ 2.0) / x))))));
	else
		tmp = Float64(1.0 + Float64(Float64(-1.0 - Float64(-0.5 / x)) / x));
	end
	return Float64(t_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if t < 1.8999999999999999e-199

   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}} \]

   3. Simplified 29.5%

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

   5. Taylor expanded in l around inf 2.9%

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

      1. *-commutative 2.9%

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

      2. associate--l+ 10.5%

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

      3. sub-neg 10.5%

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

      4. metadata-eval 10.5%

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

      5. +-commutative 10.5%

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

      6. sub-neg 10.5%

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

      7. metadata-eval 10.5%

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

      8. +-commutative 10.5%

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

      9. associate-/l* 10.5%

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

   7. Simplified 10.5%

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

   8. Taylor expanded in x around inf 14.3%

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

      1. associate-*l/ 15.6%

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

      2. sqrt-unprod 15.7%

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

      3. metadata-eval 15.7%

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

      4. metadata-eval 15.7%

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

      5. *-commutative 15.7%

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

      6. *-un-lft-identity 15.7%

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

   10. Applied egg-rr 15.7%

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

   if 1.8999999999999999e-199 < t < 6.29999999999999986e-174

   1. Initial program 2.9%

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

   3. Simplified 2.9%

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

   5. Taylor expanded in l around 0 83.4%

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

   6. Taylor expanded in t around 0 83.9%

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

   if 6.29999999999999986e-174 < t < 2.9e22

   1. Initial program 43.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}} \]

   3. Simplified 43.6%

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

   5. Taylor expanded in l around 0 59.2%

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

      1. fma-define 59.2%

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

      2. +-commutative 59.2%

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

      3. associate-*r/ 59.2%

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

      4. sub-neg 59.2%

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

      5. metadata-eval 59.2%

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

      6. +-commutative 59.2%

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

      7. associate--l+ 65.8%

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

      8. sub-neg 65.8%

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

      9. metadata-eval 65.8%

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

      10. +-commutative 65.8%

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

      11. sub-neg 65.8%

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

      12. metadata-eval 65.8%

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

      13. +-commutative 65.8%

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

   7. Simplified 65.8%

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

   8. Taylor expanded in x around inf 80.4%

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

   if 2.9e22 < t

   1. Initial program 33.9%

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

   3. Simplified 33.9%

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

   5. Taylor expanded in l around 0 90.0%

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

   6. Taylor expanded in x around -inf 0.0%

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

   8. Simplified 90.3%

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

4. Final simplification 45.8%

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

Alternative 3: 78.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \leq 2.45 \cdot 10^{+137}:\\ \;\;\;\;1 + \frac{-1 - \frac{-0.5}{x}}{x}\\ \mathbf{elif}\;l\_m \leq 8.5 \cdot 10^{+167} \lor \neg \left(l\_m \leq 6.2 \cdot 10^{+224}\right):\\ \;\;\;\;t\_m \cdot \frac{\sqrt{x}}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(2 + \frac{-1}{x}\right)\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 2.45e+137)
    (+ 1.0 (/ (- -1.0 (/ -0.5 x)) x))
    (if (or (<= l_m 8.5e+167) (not (<= l_m 6.2e+224)))
      (* t_m (/ (sqrt x) l_m))
      (+ -1.0 (+ 2.0 (/ -1.0 x)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 2.45e+137) {
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	} else if ((l_m <= 8.5e+167) || !(l_m <= 6.2e+224)) {
		tmp = t_m * (sqrt(x) / l_m);
	} else {
		tmp = -1.0 + (2.0 + (-1.0 / x));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (l_m <= 2.45d+137) then
        tmp = 1.0d0 + (((-1.0d0) - ((-0.5d0) / x)) / x)
    else if ((l_m <= 8.5d+167) .or. (.not. (l_m <= 6.2d+224))) then
        tmp = t_m * (sqrt(x) / l_m)
    else
        tmp = (-1.0d0) + (2.0d0 + ((-1.0d0) / x))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 2.45e+137) {
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	} else if ((l_m <= 8.5e+167) || !(l_m <= 6.2e+224)) {
		tmp = t_m * (Math.sqrt(x) / l_m);
	} else {
		tmp = -1.0 + (2.0 + (-1.0 / x));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if l_m <= 2.45e+137:
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x)
	elif (l_m <= 8.5e+167) or not (l_m <= 6.2e+224):
		tmp = t_m * (math.sqrt(x) / l_m)
	else:
		tmp = -1.0 + (2.0 + (-1.0 / x))
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (l_m <= 2.45e+137)
		tmp = Float64(1.0 + Float64(Float64(-1.0 - Float64(-0.5 / x)) / x));
	elseif ((l_m <= 8.5e+167) || !(l_m <= 6.2e+224))
		tmp = Float64(t_m * Float64(sqrt(x) / l_m));
	else
		tmp = Float64(-1.0 + Float64(2.0 + Float64(-1.0 / x)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (l_m <= 2.45e+137)
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	elseif ((l_m <= 8.5e+167) || ~((l_m <= 6.2e+224)))
		tmp = t_m * (sqrt(x) / l_m);
	else
		tmp = -1.0 + (2.0 + (-1.0 / x));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[l$95$m, 2.45e+137], N[(1.0 + N[(N[(-1.0 - N[(-0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[l$95$m, 8.5e+167], N[Not[LessEqual[l$95$m, 6.2e+224]], $MachinePrecision]], N[(t$95$m * N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], N[(-1.0 + N[(2.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if l < 2.45000000000000016e137

   1. Initial program 35.9%

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

   3. Simplified 35.9%

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

   5. Taylor expanded in l around 0 39.4%

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

   6. Taylor expanded in x around -inf 0.0%

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

   8. Simplified 39.5%

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

   if 2.45000000000000016e137 < l < 8.50000000000000007e167 or 6.1999999999999999e224 < l

   1. Initial program 0.2%

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

   3. Simplified 0.2%

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

   5. Taylor expanded in l around inf 4.8%

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

      1. *-commutative 4.8%

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

      2. associate--l+ 31.4%

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

      3. sub-neg 31.4%

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

      4. metadata-eval 31.4%

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

      5. +-commutative 31.4%

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

      6. sub-neg 31.4%

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

      7. metadata-eval 31.4%

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

      8. +-commutative 31.4%

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

      9. associate-/l* 31.4%

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

   7. Simplified 31.4%

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

   8. Taylor expanded in x around inf 69.3%

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

      1. associate-*l/ 75.0%

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

      2. sqrt-unprod 75.8%

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

      3. metadata-eval 75.8%

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

      4. metadata-eval 75.8%

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

      5. *-commutative 75.8%

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

      6. *-un-lft-identity 75.8%

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

   10. Applied egg-rr 75.8%

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

       1. associate-/l* 76.0%

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

   12. Simplified 76.0%

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

   if 8.50000000000000007e167 < l < 6.1999999999999999e224

   1. Initial program 0.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}} \]

   3. Simplified 0.0%

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

   5. Taylor expanded in l around 0 27.5%

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

   6. Taylor expanded in x around inf 27.5%

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

      1. expm1-log1p-u 27.5%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(1 - \frac{1}{x}\right)\right)} \]

   8. Applied egg-rr 27.5%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(1 - \frac{1}{x}\right)\right)} \]
   9. Step-by-step derivation

      1. expm1-undefine 27.5%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(1 - \frac{1}{x}\right)} - 1} \]

      2. sub-neg 27.5%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(1 - \frac{1}{x}\right)} + \left(-1\right)} \]

      3. log1p-undefine 27.5%

         \[\leadsto e^{\color{blue}{\log \left(1 + \left(1 - \frac{1}{x}\right)\right)}} + \left(-1\right) \]

      4. rem-exp-log 27.5%

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

      5. sub-neg 27.5%

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

      6. associate-+r+ 27.5%

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

      7. metadata-eval 27.5%

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

      8. distribute-neg-frac 27.5%

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

      9. metadata-eval 27.5%

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

      10. metadata-eval 27.5%

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

   10. Simplified 27.5%

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

4. Final simplification 41.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 2.45 \cdot 10^{+137}:\\ \;\;\;\;1 + \frac{-1 - \frac{-0.5}{x}}{x}\\ \mathbf{elif}\;\ell \leq 8.5 \cdot 10^{+167} \lor \neg \left(\ell \leq 6.2 \cdot 10^{+224}\right):\\ \;\;\;\;t \cdot \frac{\sqrt{x}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(2 + \frac{-1}{x}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 78.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;l\_m \leq 3.7 \cdot 10^{+136}:\\ \;\;\;\;1 + \frac{-1 - \frac{-0.5}{x}}{x}\\ \mathbf{elif}\;l\_m \leq 1.9 \cdot 10^{+167}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\ \mathbf{elif}\;l\_m \leq 1.25 \cdot 10^{+222}:\\ \;\;\;\;-1 + \left(2 + \frac{-1}{x}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_m \cdot \frac{\sqrt{x}}{l\_m}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 3.7e+136)
    (+ 1.0 (/ (- -1.0 (/ -0.5 x)) x))
    (if (<= l_m 1.9e+167)
      (/ (* t_m (sqrt x)) l_m)
      (if (<= l_m 1.25e+222)
        (+ -1.0 (+ 2.0 (/ -1.0 x)))
        (* t_m (/ (sqrt x) l_m)))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 3.7e+136) {
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	} else if (l_m <= 1.9e+167) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else if (l_m <= 1.25e+222) {
		tmp = -1.0 + (2.0 + (-1.0 / x));
	} else {
		tmp = t_m * (sqrt(x) / l_m);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (l_m <= 3.7d+136) then
        tmp = 1.0d0 + (((-1.0d0) - ((-0.5d0) / x)) / x)
    else if (l_m <= 1.9d+167) then
        tmp = (t_m * sqrt(x)) / l_m
    else if (l_m <= 1.25d+222) then
        tmp = (-1.0d0) + (2.0d0 + ((-1.0d0) / x))
    else
        tmp = t_m * (sqrt(x) / l_m)
    end if
    code = t_s * tmp
end function

Java

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

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if l_m <= 3.7e+136:
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x)
	elif l_m <= 1.9e+167:
		tmp = (t_m * math.sqrt(x)) / l_m
	elif l_m <= 1.25e+222:
		tmp = -1.0 + (2.0 + (-1.0 / x))
	else:
		tmp = t_m * (math.sqrt(x) / l_m)
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (l_m <= 3.7e+136)
		tmp = Float64(1.0 + Float64(Float64(-1.0 - Float64(-0.5 / x)) / x));
	elseif (l_m <= 1.9e+167)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	elseif (l_m <= 1.25e+222)
		tmp = Float64(-1.0 + Float64(2.0 + Float64(-1.0 / x)));
	else
		tmp = Float64(t_m * Float64(sqrt(x) / l_m));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (l_m <= 3.7e+136)
		tmp = 1.0 + ((-1.0 - (-0.5 / x)) / x);
	elseif (l_m <= 1.9e+167)
		tmp = (t_m * sqrt(x)) / l_m;
	elseif (l_m <= 1.25e+222)
		tmp = -1.0 + (2.0 + (-1.0 / x));
	else
		tmp = t_m * (sqrt(x) / l_m);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if l < 3.7000000000000001e136

   1. Initial program 35.9%

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

   3. Simplified 35.9%

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

   5. Taylor expanded in l around 0 39.4%

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

   6. Taylor expanded in x around -inf 0.0%

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

   8. Simplified 39.5%

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

   if 3.7000000000000001e136 < l < 1.89999999999999997e167

   1. Initial program 0.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}} \]

   3. Simplified 0.6%

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

   5. Taylor expanded in l around inf 2.4%

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

      1. *-commutative 2.4%

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

      2. associate--l+ 20.6%

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

      3. sub-neg 20.6%

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

      4. metadata-eval 20.6%

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

      5. +-commutative 20.6%

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

      6. sub-neg 20.6%

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

      7. metadata-eval 20.6%

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

      8. +-commutative 20.6%

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

      9. associate-/l* 20.6%

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

   7. Simplified 20.6%

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

   8. Taylor expanded in x around inf 65.0%

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

      1. associate-*l/ 72.2%

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

      2. sqrt-unprod 73.2%

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

      3. metadata-eval 73.2%

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

      4. metadata-eval 73.2%

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

      5. *-commutative 73.2%

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

      6. *-un-lft-identity 73.2%

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

   10. Applied egg-rr 73.2%

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

   if 1.89999999999999997e167 < l < 1.25000000000000006e222

   1. Initial program 0.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}} \]

   3. Simplified 0.0%

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

   5. Taylor expanded in l around 0 27.5%

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

   6. Taylor expanded in x around inf 27.5%

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

      1. expm1-log1p-u 27.5%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(1 - \frac{1}{x}\right)\right)} \]

   8. Applied egg-rr 27.5%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(1 - \frac{1}{x}\right)\right)} \]
   9. Step-by-step derivation

      1. expm1-undefine 27.5%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(1 - \frac{1}{x}\right)} - 1} \]

      2. sub-neg 27.5%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(1 - \frac{1}{x}\right)} + \left(-1\right)} \]

      3. log1p-undefine 27.5%

         \[\leadsto e^{\color{blue}{\log \left(1 + \left(1 - \frac{1}{x}\right)\right)}} + \left(-1\right) \]

      4. rem-exp-log 27.5%

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

      5. sub-neg 27.5%

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

      6. associate-+r+ 27.5%

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

      7. metadata-eval 27.5%

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

      8. distribute-neg-frac 27.5%

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

      9. metadata-eval 27.5%

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

      10. metadata-eval 27.5%

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

   10. Simplified 27.5%

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

   if 1.25000000000000006e222 < l

   1. Initial program 0.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}} \]

   3. Simplified 0.0%

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

   5. Taylor expanded in l around inf 6.5%

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

      1. *-commutative 6.5%

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

      2. associate--l+ 38.9%

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

      3. sub-neg 38.9%

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

      4. metadata-eval 38.9%

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

      5. +-commutative 38.9%

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

      6. sub-neg 38.9%

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

      7. metadata-eval 38.9%

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

      8. +-commutative 38.9%

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

      9. associate-/l* 38.9%

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

   7. Simplified 38.9%

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

   8. Taylor expanded in x around inf 72.4%

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

      1. associate-*l/ 76.9%

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

      2. sqrt-unprod 77.6%

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

      3. metadata-eval 77.6%

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

      4. metadata-eval 77.6%

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

      5. *-commutative 77.6%

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

      6. *-un-lft-identity 77.6%

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

   10. Applied egg-rr 77.6%

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

       1. associate-/l* 78.2%

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

   12. Simplified 78.2%

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

4. Final simplification 41.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 3.7 \cdot 10^{+136}:\\ \;\;\;\;1 + \frac{-1 - \frac{-0.5}{x}}{x}\\ \mathbf{elif}\;\ell \leq 1.9 \cdot 10^{+167}:\\ \;\;\;\;\frac{t \cdot \sqrt{x}}{\ell}\\ \mathbf{elif}\;\ell \leq 1.25 \cdot 10^{+222}:\\ \;\;\;\;-1 + \left(2 + \frac{-1}{x}\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{\sqrt{x}}{\ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 75.9% accurate, 25.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 32.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}} \]

3. Simplified 32.4%

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

5. Taylor expanded in l around 0 36.7%

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

6. Taylor expanded in x around -inf 0.0%

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

8. Simplified 36.8%

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

9. Final simplification 36.8%

   \[\leadsto 1 + \frac{-1 - \frac{-0.5}{x}}{x} \]
10. Add Preprocessing

Alternative 6: 75.7% accurate, 45.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 32.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}} \]

3. Simplified 32.4%

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

5. Taylor expanded in l around 0 36.7%

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

6. Taylor expanded in x around inf 36.5%

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

7. Final simplification 36.5%

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

Alternative 7: 75.1% accurate, 225.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 32.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}} \]

3. Simplified 32.4%

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

5. Taylor expanded in l around 0 36.7%

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

6. Taylor expanded in x around inf 36.0%

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

Reproduce

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