Toniolo and Linder, Equation (7)

Percentage Accurate: 33.5% → 82.7%

Time: 21.8s

Alternatives: 13

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: 33.5% 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.7% accurate, 0.1× 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_4 := \sqrt{2} \cdot t\_m\\ t_5 := \frac{t\_4}{\sqrt{\frac{x + 1}{x + -1} \cdot \left(l\_m \cdot l\_m + 2 \cdot \left(t\_m \cdot t\_m\right)\right) - l\_m \cdot l\_m}}\\ t_6 := t\_3 + t\_3\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_5 \leq 0:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{elif}\;t\_5 \leq \infty:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{t\_2 + \frac{t\_6 + \frac{\left(t\_6 + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \frac{{l\_m}^{2}}{x}\right)\right) + \frac{t\_3}{x}}{x}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_4}{\sqrt{2} \cdot \left(l\_m \cdot {x}^{-0.5}\right)}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 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_4 (* (sqrt 2.0) t_m))
        (t_5
         (/
          t_4
          (sqrt
           (-
            (* (/ (+ x 1.0) (+ x -1.0)) (+ (* l_m l_m) (* 2.0 (* t_m t_m))))
            (* l_m l_m)))))
        (t_6 (+ t_3 t_3)))
   (*
    t_s
    (if (<= t_5 0.0)
      (sqrt (/ (+ x -1.0) (+ x 1.0)))
      (if (<= t_5 INFINITY)
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (+
            t_2
            (/
             (+
              t_6
              (/
               (+
                (+ t_6 (+ (* 2.0 (/ (pow t_m 2.0) x)) (/ (pow l_m 2.0) x)))
                (/ t_3 x))
               x))
             x)))))
        (/ t_4 (* (sqrt 2.0) (* l_m (pow x -0.5)))))))))

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 t_4 = sqrt(2.0) * t_m;
	double t_5 = t_4 / sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	double t_6 = t_3 + t_3;
	double tmp;
	if (t_5 <= 0.0) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_5 <= ((double) INFINITY)) {
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((t_6 + (((t_6 + ((2.0 * (pow(t_m, 2.0) / x)) + (pow(l_m, 2.0) / x))) + (t_3 / x)) / x)) / x))));
	} else {
		tmp = t_4 / (sqrt(2.0) * (l_m * pow(x, -0.5)));
	}
	return t_s * tmp;
}

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 t_4 = Math.sqrt(2.0) * t_m;
	double t_5 = t_4 / Math.sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	double t_6 = t_3 + t_3;
	double tmp;
	if (t_5 <= 0.0) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_5 <= Double.POSITIVE_INFINITY) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((t_2 + ((t_6 + (((t_6 + ((2.0 * (Math.pow(t_m, 2.0) / x)) + (Math.pow(l_m, 2.0) / x))) + (t_3 / x)) / x)) / x))));
	} else {
		tmp = t_4 / (Math.sqrt(2.0) * (l_m * Math.pow(x, -0.5)));
	}
	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)
	t_4 = math.sqrt(2.0) * t_m
	t_5 = t_4 / math.sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))
	t_6 = t_3 + t_3
	tmp = 0
	if t_5 <= 0.0:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	elif t_5 <= math.inf:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((t_2 + ((t_6 + (((t_6 + ((2.0 * (math.pow(t_m, 2.0) / x)) + (math.pow(l_m, 2.0) / x))) + (t_3 / x)) / x)) / x))))
	else:
		tmp = t_4 / (math.sqrt(2.0) * (l_m * math.pow(x, -0.5)))
	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))
	t_4 = Float64(sqrt(2.0) * t_m)
	t_5 = Float64(t_4 / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x + -1.0)) * Float64(Float64(l_m * l_m) + Float64(2.0 * Float64(t_m * t_m)))) - Float64(l_m * l_m))))
	t_6 = Float64(t_3 + t_3)
	tmp = 0.0
	if (t_5 <= 0.0)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	elseif (t_5 <= Inf)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_2 + Float64(Float64(t_6 + Float64(Float64(Float64(t_6 + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l_m ^ 2.0) / x))) + Float64(t_3 / x)) / x)) / x)))));
	else
		tmp = Float64(t_4 / Float64(sqrt(2.0) * Float64(l_m * (x ^ -0.5))));
	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);
	t_4 = sqrt(2.0) * t_m;
	t_5 = t_4 / sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	t_6 = t_3 + t_3;
	tmp = 0.0;
	if (t_5 <= 0.0)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	elseif (t_5 <= Inf)
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((t_6 + (((t_6 + ((2.0 * ((t_m ^ 2.0) / x)) + ((l_m ^ 2.0) / x))) + (t_3 / x)) / x)) / x))));
	else
		tmp = t_4 / (sqrt(2.0) * (l_m * (x ^ -0.5)));
	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]}, Block[{t$95$4 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l$95$m * l$95$m), $MachinePrecision] + N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(t$95$3 + t$95$3), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$5, 0.0], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(t$95$2 + N[(N[(t$95$6 + N[(N[(N[(t$95$6 + 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]), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$4 / N[(N[Sqrt[2.0], $MachinePrecision] * N[(l$95$m * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l l)))) < 0.0

   1. Initial program 37.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 32.2%

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

   5. Taylor expanded in t around inf 23.8%

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

      1. associate-*l* 23.8%

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

      2. +-commutative 23.8%

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

      3. sub-neg 23.8%

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

      4. metadata-eval 23.8%

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

      5. +-commutative 23.8%

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

   7. Simplified 23.8%

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

   8. Taylor expanded in t around 0 23.9%

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

   if 0.0 < (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l l)))) < +inf.0

   1. Initial program 49.3%

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

   3. Simplified 40.4%

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

   5. Taylor expanded in x around -inf 80.5%

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

   if +inf.0 < (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 24.6%

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

   6. Taylor expanded in l around inf 53.4%

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

      1. associate-*l* 53.4%

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

   8. Simplified 53.4%

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

      1. *-un-lft-identity 53.4%

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

      2. inv-pow 53.4%

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

      3. sqrt-pow1 53.4%

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

      4. metadata-eval 53.4%

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

   10. Applied egg-rr 53.4%

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

       1. *-lft-identity 53.4%

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

       2. associate-*r* 53.4%

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

       3. *-commutative 53.4%

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

   12. Simplified 53.4%

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

       1. associate-*r/ 53.4%

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

       2. associate-*l* 53.5%

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

   14. Applied egg-rr 53.5%

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

4. Final simplification 43.8%

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

Alternative 2: 82.6% accurate, 0.1× 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_4 := \sqrt{2} \cdot t\_m\\ t_5 := \frac{t\_4}{\sqrt{\frac{x + 1}{x + -1} \cdot \left(l\_m \cdot l\_m + 2 \cdot \left(t\_m \cdot t\_m\right)\right) - l\_m \cdot l\_m}}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_5 \leq 0:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{elif}\;t\_5 \leq \infty:\\ \;\;\;\;\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}:\\ \;\;\;\;\frac{t\_4}{\sqrt{2} \cdot \left(l\_m \cdot {x}^{-0.5}\right)}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 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_4 (* (sqrt 2.0) t_m))
        (t_5
         (/
          t_4
          (sqrt
           (-
            (* (/ (+ x 1.0) (+ x -1.0)) (+ (* l_m l_m) (* 2.0 (* t_m t_m))))
            (* l_m l_m))))))
   (*
    t_s
    (if (<= t_5 0.0)
      (sqrt (/ (+ x -1.0) (+ x 1.0)))
      (if (<= t_5 INFINITY)
        (*
         (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)))))
        (/ t_4 (* (sqrt 2.0) (* l_m (pow x -0.5)))))))))

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 t_4 = sqrt(2.0) * t_m;
	double t_5 = t_4 / sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	double tmp;
	if (t_5 <= 0.0) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_5 <= ((double) INFINITY)) {
		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 = t_4 / (sqrt(2.0) * (l_m * pow(x, -0.5)));
	}
	return t_s * tmp;
}

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 t_4 = Math.sqrt(2.0) * t_m;
	double t_5 = t_4 / Math.sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	double tmp;
	if (t_5 <= 0.0) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_5 <= Double.POSITIVE_INFINITY) {
		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 = t_4 / (Math.sqrt(2.0) * (l_m * Math.pow(x, -0.5)));
	}
	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)
	t_4 = math.sqrt(2.0) * t_m
	t_5 = t_4 / math.sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))
	tmp = 0
	if t_5 <= 0.0:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	elif t_5 <= math.inf:
		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 = t_4 / (math.sqrt(2.0) * (l_m * math.pow(x, -0.5)))
	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))
	t_4 = Float64(sqrt(2.0) * t_m)
	t_5 = Float64(t_4 / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x + -1.0)) * Float64(Float64(l_m * l_m) + Float64(2.0 * Float64(t_m * t_m)))) - Float64(l_m * l_m))))
	tmp = 0.0
	if (t_5 <= 0.0)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	elseif (t_5 <= Inf)
		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(t_4 / Float64(sqrt(2.0) * Float64(l_m * (x ^ -0.5))));
	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);
	t_4 = sqrt(2.0) * t_m;
	t_5 = t_4 / sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	tmp = 0.0;
	if (t_5 <= 0.0)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	elseif (t_5 <= Inf)
		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 = t_4 / (sqrt(2.0) * (l_m * (x ^ -0.5)));
	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]}, Block[{t$95$4 = N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l$95$m * l$95$m), $MachinePrecision] + N[(2.0 * N[(t$95$m * t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$5, 0.0], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$5, Infinity], 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[(t$95$4 / N[(N[Sqrt[2.0], $MachinePrecision] * N[(l$95$m * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l l)))) < 0.0

   1. Initial program 37.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 32.2%

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

   5. Taylor expanded in t around inf 23.8%

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

      1. associate-*l* 23.8%

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

      2. +-commutative 23.8%

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

      3. sub-neg 23.8%

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

      4. metadata-eval 23.8%

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

      5. +-commutative 23.8%

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

   7. Simplified 23.8%

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

   8. Taylor expanded in t around 0 23.9%

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

   if 0.0 < (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l l)))) < +inf.0

   1. Initial program 49.3%

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

   3. Simplified 40.4%

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

   5. Taylor expanded in x around -inf 80.3%

      \[\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 +inf.0 < (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 24.6%

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

   6. Taylor expanded in l around inf 53.4%

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

      1. associate-*l* 53.4%

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

   8. Simplified 53.4%

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

      1. *-un-lft-identity 53.4%

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

      2. inv-pow 53.4%

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

      3. sqrt-pow1 53.4%

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

      4. metadata-eval 53.4%

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

   10. Applied egg-rr 53.4%

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

       1. *-lft-identity 53.4%

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

       2. associate-*r* 53.4%

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

       3. *-commutative 53.4%

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

   12. Simplified 53.4%

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

       1. associate-*r/ 53.4%

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

       2. associate-*l* 53.5%

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

   14. Applied egg-rr 53.5%

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

4. Final simplification 43.7%

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

Alternative 3: 82.8% 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 := \frac{{l\_m}^{2}}{x}\\ t_3 := \sqrt{2} \cdot t\_m\\ t_4 := \frac{t\_3}{\sqrt{\frac{x + 1}{x + -1} \cdot \left(l\_m \cdot l\_m + 2 \cdot \left(t\_m \cdot t\_m\right)\right) - l\_m \cdot l\_m}}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_4 \leq 2:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{t\_2 + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(2 \cdot {t\_m}^{2} + t\_2\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_3}{\sqrt{2} \cdot \left(l\_m \cdot {x}^{-0.5}\right)}\\ \end{array} \end{array} \end{array} \]

FPCore

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

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 = pow(l_m, 2.0) / x;
	double t_3 = sqrt(2.0) * t_m;
	double t_4 = t_3 / sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	double tmp;
	if (t_4 <= 2.0) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((2.0 * (pow(t_m, 2.0) / x)) + ((2.0 * pow(t_m, 2.0)) + t_2)))));
	} else {
		tmp = t_3 / (sqrt(2.0) * (l_m * pow(x, -0.5)));
	}
	return t_s * tmp;
}

Java

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

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = math.pow(l_m, 2.0) / x
	t_3 = math.sqrt(2.0) * t_m
	t_4 = t_3 / math.sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)))
	tmp = 0
	if t_4 <= 2.0:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	elif t_4 <= math.inf:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((t_2 + ((2.0 * (math.pow(t_m, 2.0) / x)) + ((2.0 * math.pow(t_m, 2.0)) + t_2)))))
	else:
		tmp = t_3 / (math.sqrt(2.0) * (l_m * math.pow(x, -0.5)))
	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((l_m ^ 2.0) / x)
	t_3 = Float64(sqrt(2.0) * t_m)
	t_4 = Float64(t_3 / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x + -1.0)) * Float64(Float64(l_m * l_m) + Float64(2.0 * Float64(t_m * t_m)))) - Float64(l_m * l_m))))
	tmp = 0.0
	if (t_4 <= 2.0)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	elseif (t_4 <= Inf)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_2 + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(Float64(2.0 * (t_m ^ 2.0)) + t_2))))));
	else
		tmp = Float64(t_3 / Float64(sqrt(2.0) * Float64(l_m * (x ^ -0.5))));
	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 = (l_m ^ 2.0) / x;
	t_3 = sqrt(2.0) * t_m;
	t_4 = t_3 / sqrt(((((x + 1.0) / (x + -1.0)) * ((l_m * l_m) + (2.0 * (t_m * t_m)))) - (l_m * l_m)));
	tmp = 0.0;
	if (t_4 <= 2.0)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	elseif (t_4 <= Inf)
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((2.0 * ((t_m ^ 2.0) / x)) + ((2.0 * (t_m ^ 2.0)) + t_2)))));
	else
		tmp = t_3 / (sqrt(2.0) * (l_m * (x ^ -0.5)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 48.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 41.1%

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

   5. Taylor expanded in t around inf 37.3%

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

      1. associate-*l* 37.3%

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

      2. +-commutative 37.3%

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

      3. sub-neg 37.3%

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

      4. metadata-eval 37.3%

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

      5. +-commutative 37.3%

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

   7. Simplified 37.3%

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

   8. Taylor expanded in t around 0 37.4%

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

   if 2 < (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l l)))) < +inf.0

   1. Initial program 2.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 2.5%

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

   5. Taylor expanded in x around inf 63.0%

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

   6. Taylor expanded in t around 0 63.0%

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

   if +inf.0 < (/.f64 (*.f64 (sqrt.f64 2) t) (sqrt.f64 (-.f64 (*.f64 (/.f64 (+.f64 x 1) (-.f64 x 1)) (+.f64 (*.f64 l l) (*.f64 2 (*.f64 t t)))) (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 24.6%

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

   6. Taylor expanded in l around inf 53.4%

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

      1. associate-*l* 53.4%

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

   8. Simplified 53.4%

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

      1. *-un-lft-identity 53.4%

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

      2. inv-pow 53.4%

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

      3. sqrt-pow1 53.4%

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

      4. metadata-eval 53.4%

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

   10. Applied egg-rr 53.4%

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

       1. *-lft-identity 53.4%

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

       2. associate-*r* 53.4%

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

       3. *-commutative 53.4%

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

   12. Simplified 53.4%

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

       1. associate-*r/ 53.4%

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

       2. associate-*l* 53.5%

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

   14. Applied egg-rr 53.5%

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

4. Final simplification 43.5%

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

Alternative 4: 80.7% accurate, 0.7× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 4e+302)
    (sqrt (/ (+ x -1.0) (+ x 1.0)))
    (* (sqrt 2.0) (/ t_m (* (pow x -0.5) (* (sqrt 2.0) 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 * l_m) <= 4e+302) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = sqrt(2.0) * (t_m / (pow(x, -0.5) * (sqrt(2.0) * 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 * l_m) <= 4d+302) then
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    else
        tmp = sqrt(2.0d0) * (t_m / ((x ** (-0.5d0)) * (sqrt(2.0d0) * 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 * l_m) <= 4e+302) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = Math.sqrt(2.0) * (t_m / (Math.pow(x, -0.5) * (Math.sqrt(2.0) * 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 * l_m) <= 4e+302:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	else:
		tmp = math.sqrt(2.0) * (t_m / (math.pow(x, -0.5) * (math.sqrt(2.0) * 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 (Float64(l_m * l_m) <= 4e+302)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	else
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64((x ^ -0.5) * Float64(sqrt(2.0) * 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 * l_m) <= 4e+302)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	else
		tmp = sqrt(2.0) * (t_m / ((x ^ -0.5) * (sqrt(2.0) * 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[N[(l$95$m * l$95$m), $MachinePrecision], 4e+302], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[Power[x, -0.5], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.0000000000000003e302

   1. Initial program 41.1%

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

   3. Simplified 35.0%

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

   5. Taylor expanded in t around inf 38.7%

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

      1. associate-*l* 38.7%

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

      2. +-commutative 38.7%

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

      3. sub-neg 38.7%

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

      4. metadata-eval 38.7%

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

      5. +-commutative 38.7%

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

   7. Simplified 38.7%

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

   8. Taylor expanded in t around 0 38.7%

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

   if 4.0000000000000003e302 < (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 26.4%

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

   6. Taylor expanded in l around inf 54.4%

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

      1. associate-*l* 54.5%

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

   8. Simplified 54.5%

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

      1. *-un-lft-identity 54.5%

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

      2. inv-pow 54.5%

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

      3. sqrt-pow1 54.5%

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

      4. metadata-eval 54.5%

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

   10. Applied egg-rr 54.5%

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

       1. *-lft-identity 54.5%

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

       2. associate-*r* 54.4%

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

       3. *-commutative 54.4%

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

   12. Simplified 54.4%

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

4. Final simplification 41.4%

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

Alternative 5: 80.7% accurate, 0.7× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 4e+302)
    (sqrt (/ (+ x -1.0) (+ x 1.0)))
    (/ (* (sqrt 2.0) t_m) (* l_m (* (sqrt 2.0) (pow x -0.5)))))))

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 * l_m) <= 4e+302) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (sqrt(2.0) * t_m) / (l_m * (sqrt(2.0) * pow(x, -0.5)));
	}
	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 * l_m) <= 4d+302) then
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    else
        tmp = (sqrt(2.0d0) * t_m) / (l_m * (sqrt(2.0d0) * (x ** (-0.5d0))))
    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 * l_m) <= 4e+302) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (Math.sqrt(2.0) * t_m) / (l_m * (Math.sqrt(2.0) * Math.pow(x, -0.5)));
	}
	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 * l_m) <= 4e+302:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	else:
		tmp = (math.sqrt(2.0) * t_m) / (l_m * (math.sqrt(2.0) * math.pow(x, -0.5)))
	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 (Float64(l_m * l_m) <= 4e+302)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	else
		tmp = Float64(Float64(sqrt(2.0) * t_m) / Float64(l_m * Float64(sqrt(2.0) * (x ^ -0.5))));
	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 * l_m) <= 4e+302)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	else
		tmp = (sqrt(2.0) * t_m) / (l_m * (sqrt(2.0) * (x ^ -0.5)));
	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[N[(l$95$m * l$95$m), $MachinePrecision], 4e+302], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision] / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.0000000000000003e302

   1. Initial program 41.1%

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

   3. Simplified 35.0%

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

   5. Taylor expanded in t around inf 38.7%

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

      1. associate-*l* 38.7%

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

      2. +-commutative 38.7%

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

      3. sub-neg 38.7%

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

      4. metadata-eval 38.7%

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

      5. +-commutative 38.7%

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

   7. Simplified 38.7%

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

   8. Taylor expanded in t around 0 38.7%

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

   if 4.0000000000000003e302 < (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 26.4%

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

   6. Taylor expanded in l around inf 54.4%

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

      1. associate-*l* 54.5%

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

   8. Simplified 54.5%

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

      1. associate-*r/ 54.5%

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

      2. inv-pow 54.5%

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

      3. sqrt-pow1 54.6%

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

      4. metadata-eval 54.6%

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

   10. Applied egg-rr 54.6%

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

4. Final simplification 41.4%

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

Alternative 6: 80.7% accurate, 0.7× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 4e+302)
    (sqrt (/ (+ x -1.0) (+ x 1.0)))
    (/ (* (sqrt 2.0) t_m) (* (sqrt 2.0) (* l_m (pow x -0.5)))))))

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 * l_m) <= 4e+302) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (sqrt(2.0) * t_m) / (sqrt(2.0) * (l_m * pow(x, -0.5)));
	}
	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 * l_m) <= 4d+302) then
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    else
        tmp = (sqrt(2.0d0) * t_m) / (sqrt(2.0d0) * (l_m * (x ** (-0.5d0))))
    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 * l_m) <= 4e+302) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (Math.sqrt(2.0) * t_m) / (Math.sqrt(2.0) * (l_m * Math.pow(x, -0.5)));
	}
	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 * l_m) <= 4e+302:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	else:
		tmp = (math.sqrt(2.0) * t_m) / (math.sqrt(2.0) * (l_m * math.pow(x, -0.5)))
	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 (Float64(l_m * l_m) <= 4e+302)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	else
		tmp = Float64(Float64(sqrt(2.0) * t_m) / Float64(sqrt(2.0) * Float64(l_m * (x ^ -0.5))));
	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 * l_m) <= 4e+302)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	else
		tmp = (sqrt(2.0) * t_m) / (sqrt(2.0) * (l_m * (x ^ -0.5)));
	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[N[(l$95$m * l$95$m), $MachinePrecision], 4e+302], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] * t$95$m), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * N[(l$95$m * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.0000000000000003e302

   1. Initial program 41.1%

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

   3. Simplified 35.0%

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

   5. Taylor expanded in t around inf 38.7%

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

      1. associate-*l* 38.7%

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

      2. +-commutative 38.7%

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

      3. sub-neg 38.7%

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

      4. metadata-eval 38.7%

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

      5. +-commutative 38.7%

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

   7. Simplified 38.7%

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

   8. Taylor expanded in t around 0 38.7%

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

   if 4.0000000000000003e302 < (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 26.4%

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

   6. Taylor expanded in l around inf 54.4%

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

      1. associate-*l* 54.5%

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

   8. Simplified 54.5%

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

      1. *-un-lft-identity 54.5%

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

      2. inv-pow 54.5%

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

      3. sqrt-pow1 54.5%

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

      4. metadata-eval 54.5%

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

   10. Applied egg-rr 54.5%

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

       1. *-lft-identity 54.5%

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

       2. associate-*r* 54.4%

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

       3. *-commutative 54.4%

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

   12. Simplified 54.4%

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

       1. associate-*r/ 54.5%

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

       2. associate-*l* 54.6%

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

   14. Applied egg-rr 54.6%

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

4. Final simplification 41.4%

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

Alternative 7: 80.7% accurate, 1.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 \begin{array}{l} \mathbf{if}\;l\_m \cdot l\_m \leq 4 \cdot 10^{+302}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \sqrt{\frac{2}{x}}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= (* l_m l_m) 4e+302)
    (sqrt (/ (+ x -1.0) (+ x 1.0)))
    (* (sqrt 2.0) (/ t_m (* l_m (sqrt (/ 2.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 * l_m) <= 4e+302) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = sqrt(2.0) * (t_m / (l_m * sqrt((2.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 * l_m) <= 4d+302) then
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    else
        tmp = sqrt(2.0d0) * (t_m / (l_m * sqrt((2.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 * l_m) <= 4e+302) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = Math.sqrt(2.0) * (t_m / (l_m * Math.sqrt((2.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 * l_m) <= 4e+302:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	else:
		tmp = math.sqrt(2.0) * (t_m / (l_m * math.sqrt((2.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 (Float64(l_m * l_m) <= 4e+302)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	else
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * sqrt(Float64(2.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 * l_m) <= 4e+302)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	else
		tmp = sqrt(2.0) * (t_m / (l_m * sqrt((2.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[N[(l$95$m * l$95$m), $MachinePrecision], 4e+302], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[Sqrt[N[(2.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 l l) < 4.0000000000000003e302

   1. Initial program 41.1%

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

   3. Simplified 35.0%

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

   5. Taylor expanded in t around inf 38.7%

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

      1. associate-*l* 38.7%

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

      2. +-commutative 38.7%

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

      3. sub-neg 38.7%

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

      4. metadata-eval 38.7%

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

      5. +-commutative 38.7%

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

   7. Simplified 38.7%

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

   8. Taylor expanded in t around 0 38.7%

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

   if 4.0000000000000003e302 < (*.f64 l 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{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, -\ell \cdot \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 26.4%

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

   6. Taylor expanded in l around inf 54.4%

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

      1. associate-*l* 54.5%

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

   8. Simplified 54.5%

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

      1. sqrt-unprod 54.4%

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

      2. pow1/2 54.4%

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

   10. Applied egg-rr 54.4%

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

       1. unpow1/2 54.4%

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

       2. associate-*r/ 54.4%

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

       3. metadata-eval 54.4%

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

   12. Simplified 54.4%

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

4. Final simplification 41.4%

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

Alternative 8: 78.7% accurate, 2.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 \begin{array}{l} \mathbf{if}\;l\_m \leq 5.6 \cdot 10^{+151}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{t\_m}{l\_m}}{{x}^{-0.5}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 5.6e+151)
    (sqrt (/ (+ x -1.0) (+ x 1.0)))
    (/ (/ t_m l_m) (pow x -0.5)))))

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 <= 5.6e+151) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (t_m / l_m) / pow(x, -0.5);
	}
	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 <= 5.6d+151) then
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    else
        tmp = (t_m / l_m) / (x ** (-0.5d0))
    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 <= 5.6e+151) {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (t_m / l_m) / Math.pow(x, -0.5);
	}
	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 <= 5.6e+151:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	else:
		tmp = (t_m / l_m) / math.pow(x, -0.5)
	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 <= 5.6e+151)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	else
		tmp = Float64(Float64(t_m / l_m) / (x ^ -0.5));
	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 <= 5.6e+151)
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	else
		tmp = (t_m / l_m) / (x ^ -0.5);
	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, 5.6e+151], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(t$95$m / l$95$m), $MachinePrecision] / N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 5.59999999999999975e151

   1. Initial program 37.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 32.1%

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

   5. Taylor expanded in t around inf 37.0%

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

      1. associate-*l* 37.0%

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

      2. +-commutative 37.0%

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

      3. sub-neg 37.0%

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

      4. metadata-eval 37.0%

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

      5. +-commutative 37.0%

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

   7. Simplified 37.0%

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

   8. Taylor expanded in t around 0 37.1%

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

   if 5.59999999999999975e151 < l

   1. Initial program 0.1%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in x around inf 28.0%

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

   6. Taylor expanded in l around inf 79.2%

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

      1. associate-*l* 79.3%

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

   8. Simplified 79.3%

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

      1. *-un-lft-identity 79.3%

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

      2. inv-pow 79.3%

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

      3. sqrt-pow1 79.3%

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

      4. metadata-eval 79.3%

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

   10. Applied egg-rr 79.3%

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

       1. *-lft-identity 79.3%

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

       2. associate-*r* 79.2%

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

       3. *-commutative 79.2%

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

   12. Simplified 79.2%

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

       1. associate-*r/ 79.2%

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

       2. associate-*l* 79.4%

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

   14. Applied egg-rr 79.4%

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

       1. times-frac 79.4%

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

       2. *-inverses 79.4%

          \[\leadsto \color{blue}{1} \cdot \frac{t}{\ell \cdot {x}^{-0.5}} \]

       3. *-lft-identity 79.4%

          \[\leadsto \color{blue}{\frac{t}{\ell \cdot {x}^{-0.5}}} \]

       4. associate-/r* 66.4%

          \[\leadsto \color{blue}{\frac{\frac{t}{\ell}}{{x}^{-0.5}}} \]

   16. Simplified 66.4%

       \[\leadsto \color{blue}{\frac{\frac{t}{\ell}}{{x}^{-0.5}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 39.8%

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

Alternative 9: 78.3% accurate, 2.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 \begin{array}{l} \mathbf{if}\;l\_m \leq 2.05 \cdot 10^{+152}:\\ \;\;\;\;1 + \frac{-1 + \frac{0.5}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{t\_m}{l\_m}}{{x}^{-0.5}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 2.05e+152)
    (+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))
    (/ (/ t_m l_m) (pow x -0.5)))))

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.05e+152) {
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
	} else {
		tmp = (t_m / l_m) / pow(x, -0.5);
	}
	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.05d+152) then
        tmp = 1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x)
    else
        tmp = (t_m / l_m) / (x ** (-0.5d0))
    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.05e+152) {
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
	} else {
		tmp = (t_m / l_m) / Math.pow(x, -0.5);
	}
	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.05e+152:
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x)
	else:
		tmp = (t_m / l_m) / math.pow(x, -0.5)
	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.05e+152)
		tmp = Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x));
	else
		tmp = Float64(Float64(t_m / l_m) / (x ^ -0.5));
	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.05e+152)
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
	else
		tmp = (t_m / l_m) / (x ^ -0.5);
	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.05e+152], N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$m / l$95$m), $MachinePrecision] / N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 2.0499999999999999e152

   1. Initial program 37.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 32.1%

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

   5. Taylor expanded in t around inf 37.0%

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

      1. associate-*l* 37.0%

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

      2. +-commutative 37.0%

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

      3. sub-neg 37.0%

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

      4. metadata-eval 37.0%

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

      5. +-commutative 37.0%

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

   7. Simplified 37.0%

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

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

      1. mul-1-neg 0.0%

         \[\leadsto 1 + \color{blue}{\left(-\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}\right)} \]

      2. unsub-neg 0.0%

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

   10. Simplified 36.8%

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

   if 2.0499999999999999e152 < l

   1. Initial program 0.1%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in x around inf 28.0%

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

   6. Taylor expanded in l around inf 79.2%

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

      1. associate-*l* 79.3%

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

   8. Simplified 79.3%

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

      1. *-un-lft-identity 79.3%

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

      2. inv-pow 79.3%

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

      3. sqrt-pow1 79.3%

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

      4. metadata-eval 79.3%

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

   10. Applied egg-rr 79.3%

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

       1. *-lft-identity 79.3%

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

       2. associate-*r* 79.2%

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

       3. *-commutative 79.2%

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

   12. Simplified 79.2%

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

       1. associate-*r/ 79.2%

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

       2. associate-*l* 79.4%

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

   14. Applied egg-rr 79.4%

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

       1. times-frac 79.4%

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

       2. *-inverses 79.4%

          \[\leadsto \color{blue}{1} \cdot \frac{t}{\ell \cdot {x}^{-0.5}} \]

       3. *-lft-identity 79.4%

          \[\leadsto \color{blue}{\frac{t}{\ell \cdot {x}^{-0.5}}} \]

       4. associate-/r* 66.4%

          \[\leadsto \color{blue}{\frac{\frac{t}{\ell}}{{x}^{-0.5}}} \]

   16. Simplified 66.4%

       \[\leadsto \color{blue}{\frac{\frac{t}{\ell}}{{x}^{-0.5}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 39.6%

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

Alternative 10: 78.3% accurate, 2.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 \begin{array}{l} \mathbf{if}\;l\_m \leq 8.2 \cdot 10^{+151}:\\ \;\;\;\;1 + \frac{-1 + \frac{0.5}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_m}{l\_m} \cdot \sqrt{x}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 8.2e+151)
    (+ 1.0 (/ (+ -1.0 (/ 0.5 x)) x))
    (* (/ t_m l_m) (sqrt 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 <= 8.2e+151) {
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
	} else {
		tmp = (t_m / l_m) * sqrt(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 <= 8.2d+151) then
        tmp = 1.0d0 + (((-1.0d0) + (0.5d0 / x)) / x)
    else
        tmp = (t_m / l_m) * sqrt(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 <= 8.2e+151) {
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
	} else {
		tmp = (t_m / l_m) * Math.sqrt(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 <= 8.2e+151:
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x)
	else:
		tmp = (t_m / l_m) * math.sqrt(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 <= 8.2e+151)
		tmp = Float64(1.0 + Float64(Float64(-1.0 + Float64(0.5 / x)) / x));
	else
		tmp = Float64(Float64(t_m / l_m) * sqrt(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 <= 8.2e+151)
		tmp = 1.0 + ((-1.0 + (0.5 / x)) / x);
	else
		tmp = (t_m / l_m) * sqrt(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, 8.2e+151], N[(1.0 + N[(N[(-1.0 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$m / l$95$m), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 8.1999999999999996e151

   1. Initial program 37.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 32.1%

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

   5. Taylor expanded in t around inf 37.0%

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

      1. associate-*l* 37.0%

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

      2. +-commutative 37.0%

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

      3. sub-neg 37.0%

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

      4. metadata-eval 37.0%

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

      5. +-commutative 37.0%

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

   7. Simplified 37.0%

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

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

      1. mul-1-neg 0.0%

         \[\leadsto 1 + \color{blue}{\left(-\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}\right)} \]

      2. unsub-neg 0.0%

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

   10. Simplified 36.8%

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

   if 8.1999999999999996e151 < l

   1. Initial program 0.1%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in x around inf 28.0%

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

   6. Taylor expanded in l around inf 79.2%

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

      1. associate-*l* 79.3%

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

   8. Simplified 79.3%

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

   9. Taylor expanded in t around 0 66.2%

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

4. Final simplification 39.6%

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

Alternative 11: 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 1 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 34.2%

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

3. Simplified 29.1%

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

5. Taylor expanded in t around inf 35.4%

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

   1. associate-*l* 35.4%

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

   2. +-commutative 35.4%

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

   3. sub-neg 35.4%

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

   4. metadata-eval 35.4%

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

   5. +-commutative 35.4%

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

7. Simplified 35.4%

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

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

   1. mul-1-neg 0.0%

      \[\leadsto 1 + \color{blue}{\left(-\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}\right)} \]

   2. unsub-neg 0.0%

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

10. Simplified 35.2%

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

11. Final simplification 35.2%

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

Alternative 12: 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 1 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 34.2%

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

3. Simplified 29.1%

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

5. Taylor expanded in t around inf 35.4%

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

   1. associate-*l* 35.4%

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

   2. +-commutative 35.4%

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

   3. sub-neg 35.4%

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

   4. metadata-eval 35.4%

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

   5. +-commutative 35.4%

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

7. Simplified 35.4%

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

8. Taylor expanded in x around inf 35.1%

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

9. Final simplification 35.1%

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

Alternative 13: 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 1 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 34.2%

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

3. Simplified 29.1%

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

5. Taylor expanded in t around inf 35.4%

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

   1. associate-*l* 35.4%

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

   2. +-commutative 35.4%

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

   3. sub-neg 35.4%

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

   4. metadata-eval 35.4%

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

   5. +-commutative 35.4%

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

7. Simplified 35.4%

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

8. Taylor expanded in x around inf 34.9%

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

9. Final simplification 34.9%

   \[\leadsto 1 \]
10. Add Preprocessing

Reproduce

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