Toniolo and Linder, Equation (7)

Percentage Accurate: 34.8% → 83.6%

Time: 11.7s

Alternatives: 11

Speedup: 85.0×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 34.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, l, t)
use fmin_fmax_functions
    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: 83.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < 1.6499999999999999e-179

   1. Initial program 25.2%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. times-frac N/A

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

      4. lower-fma.f64 N/A

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

   5. Applied rewrites 13.7%

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

   if 1.6499999999999999e-179 < t < 3.5e-72

   1. Initial program 17.5%

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

   3. Taylor expanded in x around inf

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

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. div-add N/A

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

      4. associate-*r/ N/A

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

      5. *-lft-identity N/A

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

      6. lower-+.f64 N/A

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

   5. Applied rewrites 89.4%

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

   if 3.5e-72 < t

   1. Initial program 37.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 93.5

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

   5. Applied rewrites 93.5%

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

   7. Applied rewrites 95.0%

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

Alternative 2: 72.5% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 8.6d-84) then
        tmp = (sqrt(2.0d0) * t_m) / (sqrt((x ** (-1.0d0))) * (l * sqrt(2.0d0)))
    else
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 8.6000000000000007e-84

   1. Initial program 23.6%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.9

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

   5. Applied rewrites 2.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 24.3%

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

   if 8.6000000000000007e-84 < t

   1. Initial program 37.9%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 91.7

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

   5. Applied rewrites 91.7%

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

   7. Applied rewrites 93.2%

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

4. Final simplification 50.1%

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

Alternative 3: 81.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 3.5e-72

   1. Initial program 24.3%

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

   3. Taylor expanded in x around inf

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

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. div-add N/A

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

      4. associate-*r/ N/A

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

      5. *-lft-identity N/A

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

      6. lower-+.f64 N/A

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

   5. Applied rewrites 54.1%

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

   if 3.5e-72 < t

   1. Initial program 37.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 93.5

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

   5. Applied rewrites 93.5%

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

   7. Applied rewrites 95.0%

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

Alternative 4: 82.0% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 8.49999999999999925e-28

   1. Initial program 25.2%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. div-add-rev N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower--.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 2.8

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

   5. Applied rewrites 2.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

   7. Applied rewrites 2.8%

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

   8. Taylor expanded in x around inf

      \[\leadsto t \cdot \sqrt{\frac{2}{\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}}}} \]
   9. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. associate-*r/ N/A

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

      15. lower-/.f64 N/A

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

   10. Applied rewrites 54.2%

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

   11. Taylor expanded in x around -inf

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

   13. Applied rewrites 54.2%

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

   if 8.49999999999999925e-28 < t

   1. Initial program 36.0%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 93.4

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

   5. Applied rewrites 93.4%

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

   7. Applied rewrites 94.8%

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

Alternative 5: 72.6% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 8.6d-84) then
        tmp = (sqrt(2.0d0) * t_m) / (sqrt((((2.0d0 / x) + 2.0d0) / x)) * l)
    else
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 8.6000000000000007e-84

   1. Initial program 23.6%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.9

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

   5. Applied rewrites 2.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 24.4%

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

   if 8.6000000000000007e-84 < t

   1. Initial program 37.9%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 91.7

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

   5. Applied rewrites 91.7%

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

   7. Applied rewrites 93.2%

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

Alternative 6: 72.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 8.6d-84) then
        tmp = (sqrt(2.0d0) * t_m) / (sqrt((2.0d0 / x)) * l)
    else
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 8.6000000000000007e-84

   1. Initial program 23.6%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower--.f64 2.9

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

   5. Applied rewrites 2.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 24.2%

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

   if 8.6000000000000007e-84 < t

   1. Initial program 37.9%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 91.7

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

   5. Applied rewrites 91.7%

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

   7. Applied rewrites 93.2%

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

Alternative 7: 74.6% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 1.2d-86) then
        tmp = t_m * sqrt((2.0d0 / (((l * l) / x) * 2.0d0)))
    else
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.20000000000000007e-86

   1. Initial program 23.6%

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

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. div-add-rev N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower--.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 2.8

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

   5. Applied rewrites 2.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

   7. Applied rewrites 2.8%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 26.9%

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

   if 1.20000000000000007e-86 < t

   1. Initial program 37.9%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 91.7

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

   5. Applied rewrites 91.7%

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

   7. Applied rewrites 93.2%

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

Alternative 8: 77.6% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (l <= 3.5d+286) then
        tmp = sqrt(((x - 1.0d0) / (1.0d0 + x)))
    else
        tmp = t_m * sqrt((2.0d0 / ((-2.0d0) * (l * l))))
    end if
    code = t_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < 3.50000000000000001e286

   1. Initial program 29.3%

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

   3. Taylor expanded in l around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-sqrt.f64 39.6

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

   5. Applied rewrites 39.6%

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

   7. Applied rewrites 40.2%

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

   if 3.50000000000000001e286 < 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}} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. div-add-rev N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower--.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 0.0

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

   5. Applied rewrites 0.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

   7. Applied rewrites 0.0%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 100.0%

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

Alternative 9: 77.5% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * sqrt(((x - 1.0d0) / (1.0d0 + x)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 29.0%

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

3. Taylor expanded in l around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. lower--.f64 N/A

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

   6. lower-+.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. lower-sqrt.f64 N/A

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

   9. lower-sqrt.f64 39.2

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

5. Applied rewrites 39.2%

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

7. Applied rewrites 39.8%

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

Alternative 10: 76.8% accurate, 5.7× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * ((x - 1.0d0) / x)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 29.0%

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

3. Taylor expanded in l around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. lower--.f64 N/A

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

   6. lower-+.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. lower-sqrt.f64 N/A

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

   9. lower-sqrt.f64 39.2

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

5. Applied rewrites 39.2%

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

7. Applied rewrites 39.8%

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

8. Taylor expanded in x around inf

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

10. Applied rewrites 39.4%

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

11. Taylor expanded in x around 0

    \[\leadsto \frac{x - 1}{x} \]
12. Step-by-step derivation

13. Applied rewrites 39.4%

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

Alternative 11: 76.1% accurate, 85.0× speedup

Math

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

FPCore

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

C

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

Fortran

t\_m =     private
t\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t_s, x, l, t_m)
use fmin_fmax_functions
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 29.0%

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

3. Taylor expanded in x around inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-sqrt.f64 38.3

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

5. Applied rewrites 38.3%

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

7. Applied rewrites 38.8%

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

Reproduce

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