Linear.Projection:infinitePerspective from linear-1.19.1.3, A

Percentage Accurate: 89.9% → 96.6%

Time: 11.0s

Alternatives: 13

Speedup: 1.2×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot 2}{y \cdot z - t \cdot z} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (/ (* x 2.0) (- (* y z) (* t z))))

C

double code(double x, double y, double z, double t) {
	return (x * 2.0) / ((y * z) - (t * z));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * 2.0d0) / ((y * z) - (t * z))
end function

Java

public static double code(double x, double y, double z, double t) {
	return (x * 2.0) / ((y * z) - (t * z));
}

Python

def code(x, y, z, t):
	return (x * 2.0) / ((y * z) - (t * z))

Julia

function code(x, y, z, t)
	return Float64(Float64(x * 2.0) / Float64(Float64(y * z) - Float64(t * z)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (x * 2.0) / ((y * z) - (t * z));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * 2.0), $MachinePrecision] / N[(N[(y * z), $MachinePrecision] - N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 89.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot 2}{y \cdot z - t \cdot z} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (/ (* x 2.0) (- (* y z) (* t z))))

C

double code(double x, double y, double z, double t) {
	return (x * 2.0) / ((y * z) - (t * z));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * 2.0d0) / ((y * z) - (t * z))
end function

Java

public static double code(double x, double y, double z, double t) {
	return (x * 2.0) / ((y * z) - (t * z));
}

Python

def code(x, y, z, t):
	return (x * 2.0) / ((y * z) - (t * z))

Julia

function code(x, y, z, t)
	return Float64(Float64(x * 2.0) / Float64(Float64(y * z) - Float64(t * z)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (x * 2.0) / ((y * z) - (t * z));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * 2.0), $MachinePrecision] / N[(N[(y * z), $MachinePrecision] - N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.6% accurate, 0.7× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= (* x_m 2.0) 2e-30)
    (/ (* -2.0 (/ x_m z)) (- t y))
    (* (/ x_m (- y t)) (/ 2.0 z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((x_m * 2.0) <= 2e-30) {
		tmp = (-2.0 * (x_m / z)) / (t - y);
	} else {
		tmp = (x_m / (y - t)) * (2.0 / z);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x_m * 2.0d0) <= 2d-30) then
        tmp = ((-2.0d0) * (x_m / z)) / (t - y)
    else
        tmp = (x_m / (y - t)) * (2.0d0 / z)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((x_m * 2.0) <= 2e-30) {
		tmp = (-2.0 * (x_m / z)) / (t - y);
	} else {
		tmp = (x_m / (y - t)) * (2.0 / z);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if (x_m * 2.0) <= 2e-30:
		tmp = (-2.0 * (x_m / z)) / (t - y)
	else:
		tmp = (x_m / (y - t)) * (2.0 / z)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (Float64(x_m * 2.0) <= 2e-30)
		tmp = Float64(Float64(-2.0 * Float64(x_m / z)) / Float64(t - y));
	else
		tmp = Float64(Float64(x_m / Float64(y - t)) * Float64(2.0 / z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if ((x_m * 2.0) <= 2e-30)
		tmp = (-2.0 * (x_m / z)) / (t - y);
	else
		tmp = (x_m / (y - t)) * (2.0 / z);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[N[(x$95$m * 2.0), $MachinePrecision], 2e-30], N[(N[(-2.0 * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / N[(t - y), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / N[(y - t), $MachinePrecision]), $MachinePrecision] * N[(2.0 / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x #s(literal 2 binary64)) < 2e-30

   1. Initial program 91.2%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.8%

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

   3. Simplified 92.8%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 92.7%

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

      1. associate-*r/ 92.8%

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

      2. metadata-eval 92.8%

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

      3. distribute-lft-neg-in 92.8%

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

      4. *-commutative 92.8%

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

      5. distribute-neg-frac 92.8%

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

      6. associate-/r* 95.8%

         \[\leadsto -\color{blue}{\frac{\frac{x \cdot -2}{z}}{y - t}} \]

      7. *-commutative 95.8%

         \[\leadsto -\frac{\frac{\color{blue}{-2 \cdot x}}{z}}{y - t} \]

      8. associate-*r/ 95.8%

         \[\leadsto -\frac{\color{blue}{-2 \cdot \frac{x}{z}}}{y - t} \]

      9. distribute-neg-frac2 95.8%

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

      10. neg-sub0 95.8%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{0 - \left(y - t\right)}} \]

      11. sub-neg 95.8%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{0 - \color{blue}{\left(y + \left(-t\right)\right)}} \]

      12. +-commutative 95.8%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{0 - \color{blue}{\left(\left(-t\right) + y\right)}} \]

      13. associate--r+ 95.8%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{\left(0 - \left(-t\right)\right) - y}} \]

      14. neg-sub0 95.8%

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

      15. remove-double-neg 95.8%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{t} - y} \]

   7. Simplified 95.8%

      \[\leadsto \color{blue}{\frac{-2 \cdot \frac{x}{z}}{t - y}} \]

   if 2e-30 < (*.f64 x #s(literal 2 binary64))

   1. Initial program 84.3%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 88.8%

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

   3. Simplified 88.8%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-commutative 88.8%

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

      2. times-frac 96.8%

         \[\leadsto \color{blue}{\frac{x}{y - t} \cdot \frac{2}{z}} \]

   6. Applied egg-rr 96.8%

      \[\leadsto \color{blue}{\frac{x}{y - t} \cdot \frac{2}{z}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 74.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{-53}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x\_m}{y}\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{-27}:\\ \;\;\;\;\frac{\frac{-2}{t}}{\frac{z}{x\_m}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot \frac{x\_m}{z}}{-y}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -1.15e-53)
    (* (/ 2.0 z) (/ x_m y))
    (if (<= y 2.4e-27)
      (/ (/ -2.0 t) (/ z x_m))
      (/ (* -2.0 (/ x_m z)) (- y))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -1.15e-53) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 2.4e-27) {
		tmp = (-2.0 / t) / (z / x_m);
	} else {
		tmp = (-2.0 * (x_m / z)) / -y;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-1.15d-53)) then
        tmp = (2.0d0 / z) * (x_m / y)
    else if (y <= 2.4d-27) then
        tmp = ((-2.0d0) / t) / (z / x_m)
    else
        tmp = ((-2.0d0) * (x_m / z)) / -y
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -1.15e-53) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 2.4e-27) {
		tmp = (-2.0 / t) / (z / x_m);
	} else {
		tmp = (-2.0 * (x_m / z)) / -y;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -1.15e-53:
		tmp = (2.0 / z) * (x_m / y)
	elif y <= 2.4e-27:
		tmp = (-2.0 / t) / (z / x_m)
	else:
		tmp = (-2.0 * (x_m / z)) / -y
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -1.15e-53)
		tmp = Float64(Float64(2.0 / z) * Float64(x_m / y));
	elseif (y <= 2.4e-27)
		tmp = Float64(Float64(-2.0 / t) / Float64(z / x_m));
	else
		tmp = Float64(Float64(-2.0 * Float64(x_m / z)) / Float64(-y));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -1.15e-53)
		tmp = (2.0 / z) * (x_m / y);
	elseif (y <= 2.4e-27)
		tmp = (-2.0 / t) / (z / x_m);
	else
		tmp = (-2.0 * (x_m / z)) / -y;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -1.15e-53], N[(N[(2.0 / z), $MachinePrecision] * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.4e-27], N[(N[(-2.0 / t), $MachinePrecision] / N[(z / x$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / (-y)), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -1.1500000000000001e-53

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.1%

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

   3. Simplified 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 79.9%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   6. Step-by-step derivation

      1. associate-/r* 81.9%

         \[\leadsto 2 \cdot \color{blue}{\frac{\frac{x}{y}}{z}} \]

      2. associate-*r/ 81.9%

         \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]

   7. Simplified 81.9%

      \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]
   8. Step-by-step derivation

      1. *-commutative 81.9%

         \[\leadsto \frac{\color{blue}{\frac{x}{y} \cdot 2}}{z} \]

      2. associate-/l* 81.9%

         \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   9. Applied egg-rr 81.9%

      \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   if -1.1500000000000001e-53 < y < 2.40000000000000002e-27

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

   7. Simplified 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-*l/ 78.3%

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

      3. metadata-eval 78.3%

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

      4. distribute-rgt-neg-in 78.3%

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

      5. distribute-frac-neg 78.3%

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

      6. distribute-frac-neg2 78.3%

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

      7. distribute-rgt-neg-out 78.3%

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

      8. times-frac 81.4%

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

      9. clear-num 81.4%

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

      10. associate-*l/ 82.0%

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

      11. *-un-lft-identity 82.0%

          \[\leadsto \frac{\color{blue}{\frac{2}{-t}}}{\frac{z}{x}} \]

      12. neg-mul-1 82.0%

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

      13. associate-/r* 82.0%

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

      14. metadata-eval 82.0%

          \[\leadsto \frac{\frac{\color{blue}{-2}}{t}}{\frac{z}{x}} \]

   9. Applied egg-rr 82.0%

      \[\leadsto \color{blue}{\frac{\frac{-2}{t}}{\frac{z}{x}}} \]

   if 2.40000000000000002e-27 < y

   1. Initial program 89.7%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.3%

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

   3. Simplified 91.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 91.3%

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

      1. associate-*r/ 91.3%

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

      2. metadata-eval 91.3%

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

      3. distribute-lft-neg-in 91.3%

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

      4. *-commutative 91.3%

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

      5. distribute-neg-frac 91.3%

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

      6. associate-/r* 96.5%

         \[\leadsto -\color{blue}{\frac{\frac{x \cdot -2}{z}}{y - t}} \]

      7. *-commutative 96.5%

         \[\leadsto -\frac{\frac{\color{blue}{-2 \cdot x}}{z}}{y - t} \]

      8. associate-*r/ 96.5%

         \[\leadsto -\frac{\color{blue}{-2 \cdot \frac{x}{z}}}{y - t} \]

      9. distribute-neg-frac2 96.5%

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

      10. neg-sub0 96.5%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{0 - \left(y - t\right)}} \]

      11. sub-neg 96.5%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{0 - \color{blue}{\left(y + \left(-t\right)\right)}} \]

      12. +-commutative 96.5%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{0 - \color{blue}{\left(\left(-t\right) + y\right)}} \]

      13. associate--r+ 96.5%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{\left(0 - \left(-t\right)\right) - y}} \]

      14. neg-sub0 96.5%

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

      15. remove-double-neg 96.5%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{t} - y} \]

   7. Simplified 96.5%

      \[\leadsto \color{blue}{\frac{-2 \cdot \frac{x}{z}}{t - y}} \]

   8. Taylor expanded in t around 0 82.8%

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

      1. neg-mul-1 82.8%

         \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{-y}} \]

   10. Simplified 82.8%

       \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{-y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 82.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{-53}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x}{y}\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{-27}:\\ \;\;\;\;\frac{\frac{-2}{t}}{\frac{z}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot \frac{x}{z}}{-y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 73.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -6.2 \cdot 10^{-54} \lor \neg \left(y \leq 2.2 \cdot 10^{-31}\right):\\ \;\;\;\;2 \cdot \frac{\frac{x\_m}{z}}{y}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{\frac{x\_m}{z}}{t}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (or (<= y -6.2e-54) (not (<= y 2.2e-31)))
    (* 2.0 (/ (/ x_m z) y))
    (* -2.0 (/ (/ x_m z) t)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((y <= -6.2e-54) || !(y <= 2.2e-31)) {
		tmp = 2.0 * ((x_m / z) / y);
	} else {
		tmp = -2.0 * ((x_m / z) / t);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y <= (-6.2d-54)) .or. (.not. (y <= 2.2d-31))) then
        tmp = 2.0d0 * ((x_m / z) / y)
    else
        tmp = (-2.0d0) * ((x_m / z) / t)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((y <= -6.2e-54) || !(y <= 2.2e-31)) {
		tmp = 2.0 * ((x_m / z) / y);
	} else {
		tmp = -2.0 * ((x_m / z) / t);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if (y <= -6.2e-54) or not (y <= 2.2e-31):
		tmp = 2.0 * ((x_m / z) / y)
	else:
		tmp = -2.0 * ((x_m / z) / t)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if ((y <= -6.2e-54) || !(y <= 2.2e-31))
		tmp = Float64(2.0 * Float64(Float64(x_m / z) / y));
	else
		tmp = Float64(-2.0 * Float64(Float64(x_m / z) / t));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if ((y <= -6.2e-54) || ~((y <= 2.2e-31)))
		tmp = 2.0 * ((x_m / z) / y);
	else
		tmp = -2.0 * ((x_m / z) / t);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[Or[LessEqual[y, -6.2e-54], N[Not[LessEqual[y, 2.2e-31]], $MachinePrecision]], N[(2.0 * N[(N[(x$95$m / z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[(x$95$m / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -6.20000000000000008e-54 or 2.2000000000000001e-31 < y

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.8%

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

   3. Simplified 91.8%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. distribute-rgt-out-- 89.8%

         \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

      2. associate-/l* 89.1%

         \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

      3. *-commutative 89.1%

         \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

      4. distribute-rgt-out-- 91.2%

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

   6. Applied egg-rr 91.2%

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

   7. Taylor expanded in y around inf 79.6%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   8. Step-by-step derivation

      1. *-commutative 79.6%

         \[\leadsto 2 \cdot \frac{x}{\color{blue}{z \cdot y}} \]

      2. associate-/l* 79.6%

         \[\leadsto \color{blue}{\frac{2 \cdot x}{z \cdot y}} \]

      3. times-frac 80.4%

         \[\leadsto \color{blue}{\frac{2}{z} \cdot \frac{x}{y}} \]

      4. metadata-eval 80.4%

         \[\leadsto \frac{\color{blue}{--2}}{z} \cdot \frac{x}{y} \]

      5. distribute-neg-frac 80.4%

         \[\leadsto \color{blue}{\left(-\frac{-2}{z}\right)} \cdot \frac{x}{y} \]

      6. /-rgt-identity 80.4%

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

      7. distribute-neg-frac2 80.4%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z}}{-1}} \cdot \frac{x}{y} \]

      8. metadata-eval 80.4%

         \[\leadsto \frac{\frac{-2}{z}}{\color{blue}{-1}} \cdot \frac{x}{y} \]

      9. times-frac 81.0%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z} \cdot x}{-1 \cdot y}} \]

      10. associate-*l/ 81.1%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot x}{z}}}{-1 \cdot y} \]

      11. associate-*r/ 81.1%

          \[\leadsto \frac{\color{blue}{-2 \cdot \frac{x}{z}}}{-1 \cdot y} \]

      12. times-frac 81.1%

          \[\leadsto \color{blue}{\frac{-2}{-1} \cdot \frac{\frac{x}{z}}{y}} \]

      13. metadata-eval 81.1%

          \[\leadsto \color{blue}{2} \cdot \frac{\frac{x}{z}}{y} \]

   9. Simplified 81.1%

      \[\leadsto \color{blue}{2 \cdot \frac{\frac{x}{z}}{y}} \]

   if -6.20000000000000008e-54 < y < 2.2000000000000001e-31

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-/r* 81.5%

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

   7. Simplified 81.5%

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

4. Final simplification 81.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.2 \cdot 10^{-54} \lor \neg \left(y \leq 2.2 \cdot 10^{-31}\right):\\ \;\;\;\;2 \cdot \frac{\frac{x}{z}}{y}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{\frac{x}{z}}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -5.5 \cdot 10^{-54}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x\_m}{y}\\ \mathbf{elif}\;y \leq 8.2 \cdot 10^{-27}:\\ \;\;\;\;\frac{\frac{-2}{t}}{\frac{z}{x\_m}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z} \cdot \frac{2}{y}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -5.5e-54)
    (* (/ 2.0 z) (/ x_m y))
    (if (<= y 8.2e-27) (/ (/ -2.0 t) (/ z x_m)) (* (/ x_m z) (/ 2.0 y))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -5.5e-54) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 8.2e-27) {
		tmp = (-2.0 / t) / (z / x_m);
	} else {
		tmp = (x_m / z) * (2.0 / y);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-5.5d-54)) then
        tmp = (2.0d0 / z) * (x_m / y)
    else if (y <= 8.2d-27) then
        tmp = ((-2.0d0) / t) / (z / x_m)
    else
        tmp = (x_m / z) * (2.0d0 / y)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -5.5e-54) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 8.2e-27) {
		tmp = (-2.0 / t) / (z / x_m);
	} else {
		tmp = (x_m / z) * (2.0 / y);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -5.5e-54:
		tmp = (2.0 / z) * (x_m / y)
	elif y <= 8.2e-27:
		tmp = (-2.0 / t) / (z / x_m)
	else:
		tmp = (x_m / z) * (2.0 / y)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -5.5e-54)
		tmp = Float64(Float64(2.0 / z) * Float64(x_m / y));
	elseif (y <= 8.2e-27)
		tmp = Float64(Float64(-2.0 / t) / Float64(z / x_m));
	else
		tmp = Float64(Float64(x_m / z) * Float64(2.0 / y));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -5.5e-54)
		tmp = (2.0 / z) * (x_m / y);
	elseif (y <= 8.2e-27)
		tmp = (-2.0 / t) / (z / x_m);
	else
		tmp = (x_m / z) * (2.0 / y);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -5.5e-54], N[(N[(2.0 / z), $MachinePrecision] * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.2e-27], N[(N[(-2.0 / t), $MachinePrecision] / N[(z / x$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / z), $MachinePrecision] * N[(2.0 / y), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -5.50000000000000046e-54

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.1%

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

   3. Simplified 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 79.9%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   6. Step-by-step derivation

      1. associate-/r* 81.9%

         \[\leadsto 2 \cdot \color{blue}{\frac{\frac{x}{y}}{z}} \]

      2. associate-*r/ 81.9%

         \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]

   7. Simplified 81.9%

      \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]
   8. Step-by-step derivation

      1. *-commutative 81.9%

         \[\leadsto \frac{\color{blue}{\frac{x}{y} \cdot 2}}{z} \]

      2. associate-/l* 81.9%

         \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   9. Applied egg-rr 81.9%

      \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   if -5.50000000000000046e-54 < y < 8.1999999999999997e-27

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

   7. Simplified 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-*l/ 78.3%

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

      3. metadata-eval 78.3%

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

      4. distribute-rgt-neg-in 78.3%

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

      5. distribute-frac-neg 78.3%

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

      6. distribute-frac-neg2 78.3%

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

      7. distribute-rgt-neg-out 78.3%

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

      8. times-frac 81.4%

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

      9. clear-num 81.4%

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

      10. associate-*l/ 82.0%

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

      11. *-un-lft-identity 82.0%

          \[\leadsto \frac{\color{blue}{\frac{2}{-t}}}{\frac{z}{x}} \]

      12. neg-mul-1 82.0%

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

      13. associate-/r* 82.0%

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

      14. metadata-eval 82.0%

          \[\leadsto \frac{\frac{\color{blue}{-2}}{t}}{\frac{z}{x}} \]

   9. Applied egg-rr 82.0%

      \[\leadsto \color{blue}{\frac{\frac{-2}{t}}{\frac{z}{x}}} \]

   if 8.1999999999999997e-27 < y

   1. Initial program 89.7%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.3%

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

   3. Simplified 91.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. times-frac 96.5%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   6. Applied egg-rr 96.5%

      \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   7. Taylor expanded in y around inf 82.8%

      \[\leadsto \frac{x}{z} \cdot \color{blue}{\frac{2}{y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 82.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.5 \cdot 10^{-54}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x}{y}\\ \mathbf{elif}\;y \leq 8.2 \cdot 10^{-27}:\\ \;\;\;\;\frac{\frac{-2}{t}}{\frac{z}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \cdot \frac{2}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 73.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{-53}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x\_m}{y}\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-31}:\\ \;\;\;\;-2 \cdot \frac{\frac{x\_m}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z} \cdot \frac{2}{y}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -1.25e-53)
    (* (/ 2.0 z) (/ x_m y))
    (if (<= y 3e-31) (* -2.0 (/ (/ x_m z) t)) (* (/ x_m z) (/ 2.0 y))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -1.25e-53) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 3e-31) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = (x_m / z) * (2.0 / y);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-1.25d-53)) then
        tmp = (2.0d0 / z) * (x_m / y)
    else if (y <= 3d-31) then
        tmp = (-2.0d0) * ((x_m / z) / t)
    else
        tmp = (x_m / z) * (2.0d0 / y)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -1.25e-53) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 3e-31) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = (x_m / z) * (2.0 / y);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -1.25e-53:
		tmp = (2.0 / z) * (x_m / y)
	elif y <= 3e-31:
		tmp = -2.0 * ((x_m / z) / t)
	else:
		tmp = (x_m / z) * (2.0 / y)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -1.25e-53)
		tmp = Float64(Float64(2.0 / z) * Float64(x_m / y));
	elseif (y <= 3e-31)
		tmp = Float64(-2.0 * Float64(Float64(x_m / z) / t));
	else
		tmp = Float64(Float64(x_m / z) * Float64(2.0 / y));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -1.25e-53)
		tmp = (2.0 / z) * (x_m / y);
	elseif (y <= 3e-31)
		tmp = -2.0 * ((x_m / z) / t);
	else
		tmp = (x_m / z) * (2.0 / y);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -1.25e-53], N[(N[(2.0 / z), $MachinePrecision] * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3e-31], N[(-2.0 * N[(N[(x$95$m / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / z), $MachinePrecision] * N[(2.0 / y), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -1.25e-53

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.1%

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

   3. Simplified 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 79.9%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   6. Step-by-step derivation

      1. associate-/r* 81.9%

         \[\leadsto 2 \cdot \color{blue}{\frac{\frac{x}{y}}{z}} \]

      2. associate-*r/ 81.9%

         \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]

   7. Simplified 81.9%

      \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]
   8. Step-by-step derivation

      1. *-commutative 81.9%

         \[\leadsto \frac{\color{blue}{\frac{x}{y} \cdot 2}}{z} \]

      2. associate-/l* 81.9%

         \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   9. Applied egg-rr 81.9%

      \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   if -1.25e-53 < y < 2.99999999999999981e-31

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-/r* 81.5%

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

   7. Simplified 81.5%

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

   if 2.99999999999999981e-31 < y

   1. Initial program 89.7%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.3%

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

   3. Simplified 91.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. times-frac 96.5%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   6. Applied egg-rr 96.5%

      \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   7. Taylor expanded in y around inf 82.8%

      \[\leadsto \frac{x}{z} \cdot \color{blue}{\frac{2}{y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 82.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{-53}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x}{y}\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-31}:\\ \;\;\;\;-2 \cdot \frac{\frac{x}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \cdot \frac{2}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 73.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{-54}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x\_m}{y}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{-32}:\\ \;\;\;\;-2 \cdot \frac{\frac{x\_m}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{\frac{x\_m}{z}}{y}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -9.2e-54)
    (* (/ 2.0 z) (/ x_m y))
    (if (<= y 5.5e-32) (* -2.0 (/ (/ x_m z) t)) (* 2.0 (/ (/ x_m z) y))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -9.2e-54) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 5.5e-32) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = 2.0 * ((x_m / z) / y);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-9.2d-54)) then
        tmp = (2.0d0 / z) * (x_m / y)
    else if (y <= 5.5d-32) then
        tmp = (-2.0d0) * ((x_m / z) / t)
    else
        tmp = 2.0d0 * ((x_m / z) / y)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -9.2e-54) {
		tmp = (2.0 / z) * (x_m / y);
	} else if (y <= 5.5e-32) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = 2.0 * ((x_m / z) / y);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -9.2e-54:
		tmp = (2.0 / z) * (x_m / y)
	elif y <= 5.5e-32:
		tmp = -2.0 * ((x_m / z) / t)
	else:
		tmp = 2.0 * ((x_m / z) / y)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -9.2e-54)
		tmp = Float64(Float64(2.0 / z) * Float64(x_m / y));
	elseif (y <= 5.5e-32)
		tmp = Float64(-2.0 * Float64(Float64(x_m / z) / t));
	else
		tmp = Float64(2.0 * Float64(Float64(x_m / z) / y));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -9.2e-54)
		tmp = (2.0 / z) * (x_m / y);
	elseif (y <= 5.5e-32)
		tmp = -2.0 * ((x_m / z) / t);
	else
		tmp = 2.0 * ((x_m / z) / y);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -9.2e-54], N[(N[(2.0 / z), $MachinePrecision] * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.5e-32], N[(-2.0 * N[(N[(x$95$m / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[(x$95$m / z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -9.1999999999999996e-54

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.1%

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

   3. Simplified 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 79.9%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   6. Step-by-step derivation

      1. associate-/r* 81.9%

         \[\leadsto 2 \cdot \color{blue}{\frac{\frac{x}{y}}{z}} \]

      2. associate-*r/ 81.9%

         \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]

   7. Simplified 81.9%

      \[\leadsto \color{blue}{\frac{2 \cdot \frac{x}{y}}{z}} \]
   8. Step-by-step derivation

      1. *-commutative 81.9%

         \[\leadsto \frac{\color{blue}{\frac{x}{y} \cdot 2}}{z} \]

      2. associate-/l* 81.9%

         \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   9. Applied egg-rr 81.9%

      \[\leadsto \color{blue}{\frac{x}{y} \cdot \frac{2}{z}} \]

   if -9.1999999999999996e-54 < y < 5.50000000000000024e-32

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-/r* 81.5%

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

   7. Simplified 81.5%

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

   if 5.50000000000000024e-32 < y

   1. Initial program 89.7%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.3%

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

   3. Simplified 91.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. distribute-rgt-out-- 89.7%

         \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

      2. associate-/l* 88.0%

         \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

      3. *-commutative 88.0%

         \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

      4. distribute-rgt-out-- 89.7%

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

   6. Applied egg-rr 89.7%

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

   7. Taylor expanded in y around inf 79.3%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   8. Step-by-step derivation

      1. *-commutative 79.3%

         \[\leadsto 2 \cdot \frac{x}{\color{blue}{z \cdot y}} \]

      2. associate-/l* 79.3%

         \[\leadsto \color{blue}{\frac{2 \cdot x}{z \cdot y}} \]

      3. times-frac 78.1%

         \[\leadsto \color{blue}{\frac{2}{z} \cdot \frac{x}{y}} \]

      4. metadata-eval 78.1%

         \[\leadsto \frac{\color{blue}{--2}}{z} \cdot \frac{x}{y} \]

      5. distribute-neg-frac 78.1%

         \[\leadsto \color{blue}{\left(-\frac{-2}{z}\right)} \cdot \frac{x}{y} \]

      6. /-rgt-identity 78.1%

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

      7. distribute-neg-frac2 78.1%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z}}{-1}} \cdot \frac{x}{y} \]

      8. metadata-eval 78.1%

         \[\leadsto \frac{\frac{-2}{z}}{\color{blue}{-1}} \cdot \frac{x}{y} \]

      9. times-frac 82.7%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z} \cdot x}{-1 \cdot y}} \]

      10. associate-*l/ 82.8%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot x}{z}}}{-1 \cdot y} \]

      11. associate-*r/ 82.8%

          \[\leadsto \frac{\color{blue}{-2 \cdot \frac{x}{z}}}{-1 \cdot y} \]

      12. times-frac 82.8%

          \[\leadsto \color{blue}{\frac{-2}{-1} \cdot \frac{\frac{x}{z}}{y}} \]

      13. metadata-eval 82.8%

          \[\leadsto \color{blue}{2} \cdot \frac{\frac{x}{z}}{y} \]

   9. Simplified 82.8%

      \[\leadsto \color{blue}{2 \cdot \frac{\frac{x}{z}}{y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 81.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{-54}:\\ \;\;\;\;\frac{2}{z} \cdot \frac{x}{y}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{-32}:\\ \;\;\;\;-2 \cdot \frac{\frac{x}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{\frac{x}{z}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 73.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -3.1 \cdot 10^{-54}:\\ \;\;\;\;x\_m \cdot \frac{2}{z \cdot y}\\ \mathbf{elif}\;y \leq 4.6 \cdot 10^{-34}:\\ \;\;\;\;-2 \cdot \frac{\frac{x\_m}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{\frac{x\_m}{z}}{y}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -3.1e-54)
    (* x_m (/ 2.0 (* z y)))
    (if (<= y 4.6e-34) (* -2.0 (/ (/ x_m z) t)) (* 2.0 (/ (/ x_m z) y))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -3.1e-54) {
		tmp = x_m * (2.0 / (z * y));
	} else if (y <= 4.6e-34) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = 2.0 * ((x_m / z) / y);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-3.1d-54)) then
        tmp = x_m * (2.0d0 / (z * y))
    else if (y <= 4.6d-34) then
        tmp = (-2.0d0) * ((x_m / z) / t)
    else
        tmp = 2.0d0 * ((x_m / z) / y)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -3.1e-54) {
		tmp = x_m * (2.0 / (z * y));
	} else if (y <= 4.6e-34) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = 2.0 * ((x_m / z) / y);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -3.1e-54:
		tmp = x_m * (2.0 / (z * y))
	elif y <= 4.6e-34:
		tmp = -2.0 * ((x_m / z) / t)
	else:
		tmp = 2.0 * ((x_m / z) / y)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -3.1e-54)
		tmp = Float64(x_m * Float64(2.0 / Float64(z * y)));
	elseif (y <= 4.6e-34)
		tmp = Float64(-2.0 * Float64(Float64(x_m / z) / t));
	else
		tmp = Float64(2.0 * Float64(Float64(x_m / z) / y));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -3.1e-54)
		tmp = x_m * (2.0 / (z * y));
	elseif (y <= 4.6e-34)
		tmp = -2.0 * ((x_m / z) / t);
	else
		tmp = 2.0 * ((x_m / z) / y);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -3.1e-54], N[(x$95$m * N[(2.0 / N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.6e-34], N[(-2.0 * N[(N[(x$95$m / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[(x$95$m / z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -3.10000000000000004e-54

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.1%

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

   3. Simplified 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. distribute-rgt-out-- 89.8%

         \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

      2. associate-/l* 89.9%

         \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

      3. *-commutative 89.9%

         \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

      4. distribute-rgt-out-- 92.2%

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

   6. Applied egg-rr 92.2%

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

   7. Taylor expanded in y around inf 79.9%

      \[\leadsto \color{blue}{\frac{2}{y \cdot z}} \cdot x \]
   8. Step-by-step derivation

      1. *-commutative 79.9%

         \[\leadsto \frac{2}{\color{blue}{z \cdot y}} \cdot x \]

   9. Simplified 79.9%

      \[\leadsto \color{blue}{\frac{2}{z \cdot y}} \cdot x \]

   if -3.10000000000000004e-54 < y < 4.60000000000000022e-34

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-/r* 81.5%

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

   7. Simplified 81.5%

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

   if 4.60000000000000022e-34 < y

   1. Initial program 89.7%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.3%

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

   3. Simplified 91.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. distribute-rgt-out-- 89.7%

         \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

      2. associate-/l* 88.0%

         \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

      3. *-commutative 88.0%

         \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

      4. distribute-rgt-out-- 89.7%

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

   6. Applied egg-rr 89.7%

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

   7. Taylor expanded in y around inf 79.3%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   8. Step-by-step derivation

      1. *-commutative 79.3%

         \[\leadsto 2 \cdot \frac{x}{\color{blue}{z \cdot y}} \]

      2. associate-/l* 79.3%

         \[\leadsto \color{blue}{\frac{2 \cdot x}{z \cdot y}} \]

      3. times-frac 78.1%

         \[\leadsto \color{blue}{\frac{2}{z} \cdot \frac{x}{y}} \]

      4. metadata-eval 78.1%

         \[\leadsto \frac{\color{blue}{--2}}{z} \cdot \frac{x}{y} \]

      5. distribute-neg-frac 78.1%

         \[\leadsto \color{blue}{\left(-\frac{-2}{z}\right)} \cdot \frac{x}{y} \]

      6. /-rgt-identity 78.1%

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

      7. distribute-neg-frac2 78.1%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z}}{-1}} \cdot \frac{x}{y} \]

      8. metadata-eval 78.1%

         \[\leadsto \frac{\frac{-2}{z}}{\color{blue}{-1}} \cdot \frac{x}{y} \]

      9. times-frac 82.7%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z} \cdot x}{-1 \cdot y}} \]

      10. associate-*l/ 82.8%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot x}{z}}}{-1 \cdot y} \]

      11. associate-*r/ 82.8%

          \[\leadsto \frac{\color{blue}{-2 \cdot \frac{x}{z}}}{-1 \cdot y} \]

      12. times-frac 82.8%

          \[\leadsto \color{blue}{\frac{-2}{-1} \cdot \frac{\frac{x}{z}}{y}} \]

      13. metadata-eval 82.8%

          \[\leadsto \color{blue}{2} \cdot \frac{\frac{x}{z}}{y} \]

   9. Simplified 82.8%

      \[\leadsto \color{blue}{2 \cdot \frac{\frac{x}{z}}{y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 81.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.1 \cdot 10^{-54}:\\ \;\;\;\;x \cdot \frac{2}{z \cdot y}\\ \mathbf{elif}\;y \leq 4.6 \cdot 10^{-34}:\\ \;\;\;\;-2 \cdot \frac{\frac{x}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{\frac{x}{z}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 74.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{-53}:\\ \;\;\;\;x\_m \cdot \frac{\frac{2}{z}}{y}\\ \mathbf{elif}\;y \leq 7.8 \cdot 10^{-28}:\\ \;\;\;\;-2 \cdot \frac{\frac{x\_m}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{\frac{x\_m}{z}}{y}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -1.25e-53)
    (* x_m (/ (/ 2.0 z) y))
    (if (<= y 7.8e-28) (* -2.0 (/ (/ x_m z) t)) (* 2.0 (/ (/ x_m z) y))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -1.25e-53) {
		tmp = x_m * ((2.0 / z) / y);
	} else if (y <= 7.8e-28) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = 2.0 * ((x_m / z) / y);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-1.25d-53)) then
        tmp = x_m * ((2.0d0 / z) / y)
    else if (y <= 7.8d-28) then
        tmp = (-2.0d0) * ((x_m / z) / t)
    else
        tmp = 2.0d0 * ((x_m / z) / y)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -1.25e-53) {
		tmp = x_m * ((2.0 / z) / y);
	} else if (y <= 7.8e-28) {
		tmp = -2.0 * ((x_m / z) / t);
	} else {
		tmp = 2.0 * ((x_m / z) / y);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -1.25e-53:
		tmp = x_m * ((2.0 / z) / y)
	elif y <= 7.8e-28:
		tmp = -2.0 * ((x_m / z) / t)
	else:
		tmp = 2.0 * ((x_m / z) / y)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -1.25e-53)
		tmp = Float64(x_m * Float64(Float64(2.0 / z) / y));
	elseif (y <= 7.8e-28)
		tmp = Float64(-2.0 * Float64(Float64(x_m / z) / t));
	else
		tmp = Float64(2.0 * Float64(Float64(x_m / z) / y));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -1.25e-53)
		tmp = x_m * ((2.0 / z) / y);
	elseif (y <= 7.8e-28)
		tmp = -2.0 * ((x_m / z) / t);
	else
		tmp = 2.0 * ((x_m / z) / y);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -1.25e-53], N[(x$95$m * N[(N[(2.0 / z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7.8e-28], N[(-2.0 * N[(N[(x$95$m / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[(x$95$m / z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -1.25e-53

   1. Initial program 89.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.1%

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

   3. Simplified 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 92.1%

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

      1. associate-*r/ 92.1%

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

      2. metadata-eval 92.1%

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

      3. distribute-lft-neg-in 92.1%

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

      4. *-commutative 92.1%

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

      5. distribute-neg-frac 92.1%

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

      6. associate-/r* 93.3%

         \[\leadsto -\color{blue}{\frac{\frac{x \cdot -2}{z}}{y - t}} \]

      7. *-commutative 93.3%

         \[\leadsto -\frac{\frac{\color{blue}{-2 \cdot x}}{z}}{y - t} \]

      8. associate-*r/ 93.3%

         \[\leadsto -\frac{\color{blue}{-2 \cdot \frac{x}{z}}}{y - t} \]

      9. distribute-neg-frac2 93.3%

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

      10. neg-sub0 93.3%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{0 - \left(y - t\right)}} \]

      11. sub-neg 93.3%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{0 - \color{blue}{\left(y + \left(-t\right)\right)}} \]

      12. +-commutative 93.3%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{0 - \color{blue}{\left(\left(-t\right) + y\right)}} \]

      13. associate--r+ 93.3%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{\left(0 - \left(-t\right)\right) - y}} \]

      14. neg-sub0 93.3%

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

      15. remove-double-neg 93.3%

          \[\leadsto \frac{-2 \cdot \frac{x}{z}}{\color{blue}{t} - y} \]

   7. Simplified 93.3%

      \[\leadsto \color{blue}{\frac{-2 \cdot \frac{x}{z}}{t - y}} \]

   8. Taylor expanded in t around 0 79.9%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   9. Step-by-step derivation

      1. *-commutative 79.9%

         \[\leadsto \color{blue}{\frac{x}{y \cdot z} \cdot 2} \]

      2. associate-/r* 81.9%

         \[\leadsto \color{blue}{\frac{\frac{x}{y}}{z}} \cdot 2 \]

      3. associate-*l/ 81.9%

         \[\leadsto \color{blue}{\frac{\frac{x}{y} \cdot 2}{z}} \]

      4. associate-*l/ 81.9%

         \[\leadsto \frac{\color{blue}{\frac{x \cdot 2}{y}}}{z} \]

      5. associate-*r/ 81.9%

         \[\leadsto \frac{\color{blue}{x \cdot \frac{2}{y}}}{z} \]

      6. *-rgt-identity 81.9%

         \[\leadsto \frac{\color{blue}{\left(x \cdot \frac{2}{y}\right) \cdot 1}}{z} \]

      7. associate-*r/ 81.8%

         \[\leadsto \color{blue}{\left(x \cdot \frac{2}{y}\right) \cdot \frac{1}{z}} \]

      8. associate-*l* 79.9%

         \[\leadsto \color{blue}{x \cdot \left(\frac{2}{y} \cdot \frac{1}{z}\right)} \]

      9. associate-*l/ 79.9%

         \[\leadsto x \cdot \color{blue}{\frac{2 \cdot \frac{1}{z}}{y}} \]

      10. associate-*r/ 79.9%

          \[\leadsto x \cdot \frac{\color{blue}{\frac{2 \cdot 1}{z}}}{y} \]

      11. metadata-eval 79.9%

          \[\leadsto x \cdot \frac{\frac{\color{blue}{2}}{z}}{y} \]

   10. Simplified 79.9%

       \[\leadsto \color{blue}{x \cdot \frac{\frac{2}{z}}{y}} \]

   if -1.25e-53 < y < 7.79999999999999998e-28

   1. Initial program 88.8%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.6%

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

   3. Simplified 91.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-/r* 81.5%

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

   7. Simplified 81.5%

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

   if 7.79999999999999998e-28 < y

   1. Initial program 89.7%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 91.3%

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

   3. Simplified 91.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. distribute-rgt-out-- 89.7%

         \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

      2. associate-/l* 88.0%

         \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

      3. *-commutative 88.0%

         \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

      4. distribute-rgt-out-- 89.7%

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

   6. Applied egg-rr 89.7%

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

   7. Taylor expanded in y around inf 79.3%

      \[\leadsto \color{blue}{2 \cdot \frac{x}{y \cdot z}} \]
   8. Step-by-step derivation

      1. *-commutative 79.3%

         \[\leadsto 2 \cdot \frac{x}{\color{blue}{z \cdot y}} \]

      2. associate-/l* 79.3%

         \[\leadsto \color{blue}{\frac{2 \cdot x}{z \cdot y}} \]

      3. times-frac 78.1%

         \[\leadsto \color{blue}{\frac{2}{z} \cdot \frac{x}{y}} \]

      4. metadata-eval 78.1%

         \[\leadsto \frac{\color{blue}{--2}}{z} \cdot \frac{x}{y} \]

      5. distribute-neg-frac 78.1%

         \[\leadsto \color{blue}{\left(-\frac{-2}{z}\right)} \cdot \frac{x}{y} \]

      6. /-rgt-identity 78.1%

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

      7. distribute-neg-frac2 78.1%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z}}{-1}} \cdot \frac{x}{y} \]

      8. metadata-eval 78.1%

         \[\leadsto \frac{\frac{-2}{z}}{\color{blue}{-1}} \cdot \frac{x}{y} \]

      9. times-frac 82.7%

         \[\leadsto \color{blue}{\frac{\frac{-2}{z} \cdot x}{-1 \cdot y}} \]

      10. associate-*l/ 82.8%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot x}{z}}}{-1 \cdot y} \]

      11. associate-*r/ 82.8%

          \[\leadsto \frac{\color{blue}{-2 \cdot \frac{x}{z}}}{-1 \cdot y} \]

      12. times-frac 82.8%

          \[\leadsto \color{blue}{\frac{-2}{-1} \cdot \frac{\frac{x}{z}}{y}} \]

      13. metadata-eval 82.8%

          \[\leadsto \color{blue}{2} \cdot \frac{\frac{x}{z}}{y} \]

   9. Simplified 82.8%

      \[\leadsto \color{blue}{2 \cdot \frac{\frac{x}{z}}{y}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 96.6% accurate, 0.7× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= (* x_m 2.0) 2e-30)
    (* (/ x_m z) (/ 2.0 (- y t)))
    (* (/ x_m (- y t)) (/ 2.0 z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((x_m * 2.0) <= 2e-30) {
		tmp = (x_m / z) * (2.0 / (y - t));
	} else {
		tmp = (x_m / (y - t)) * (2.0 / z);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x_m * 2.0d0) <= 2d-30) then
        tmp = (x_m / z) * (2.0d0 / (y - t))
    else
        tmp = (x_m / (y - t)) * (2.0d0 / z)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((x_m * 2.0) <= 2e-30) {
		tmp = (x_m / z) * (2.0 / (y - t));
	} else {
		tmp = (x_m / (y - t)) * (2.0 / z);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if (x_m * 2.0) <= 2e-30:
		tmp = (x_m / z) * (2.0 / (y - t))
	else:
		tmp = (x_m / (y - t)) * (2.0 / z)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (Float64(x_m * 2.0) <= 2e-30)
		tmp = Float64(Float64(x_m / z) * Float64(2.0 / Float64(y - t)));
	else
		tmp = Float64(Float64(x_m / Float64(y - t)) * Float64(2.0 / z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if ((x_m * 2.0) <= 2e-30)
		tmp = (x_m / z) * (2.0 / (y - t));
	else
		tmp = (x_m / (y - t)) * (2.0 / z);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[N[(x$95$m * 2.0), $MachinePrecision], 2e-30], N[(N[(x$95$m / z), $MachinePrecision] * N[(2.0 / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / N[(y - t), $MachinePrecision]), $MachinePrecision] * N[(2.0 / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x #s(literal 2 binary64)) < 2e-30

   1. Initial program 91.2%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.8%

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

   3. Simplified 92.8%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. times-frac 95.7%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   6. Applied egg-rr 95.7%

      \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   if 2e-30 < (*.f64 x #s(literal 2 binary64))

   1. Initial program 84.3%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 88.8%

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

   3. Simplified 88.8%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-commutative 88.8%

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

      2. times-frac 96.8%

         \[\leadsto \color{blue}{\frac{x}{y - t} \cdot \frac{2}{z}} \]

   6. Applied egg-rr 96.8%

      \[\leadsto \color{blue}{\frac{x}{y - t} \cdot \frac{2}{z}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 94.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 5.2 \cdot 10^{-37}:\\ \;\;\;\;x\_m \cdot \frac{2}{z \cdot \left(y - t\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z} \cdot \frac{2}{y - t}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= z 5.2e-37)
    (* x_m (/ 2.0 (* z (- y t))))
    (* (/ x_m z) (/ 2.0 (- y t))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (z <= 5.2e-37) {
		tmp = x_m * (2.0 / (z * (y - t)));
	} else {
		tmp = (x_m / z) * (2.0 / (y - t));
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= 5.2d-37) then
        tmp = x_m * (2.0d0 / (z * (y - t)))
    else
        tmp = (x_m / z) * (2.0d0 / (y - t))
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (z <= 5.2e-37) {
		tmp = x_m * (2.0 / (z * (y - t)));
	} else {
		tmp = (x_m / z) * (2.0 / (y - t));
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if z <= 5.2e-37:
		tmp = x_m * (2.0 / (z * (y - t)))
	else:
		tmp = (x_m / z) * (2.0 / (y - t))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (z <= 5.2e-37)
		tmp = Float64(x_m * Float64(2.0 / Float64(z * Float64(y - t))));
	else
		tmp = Float64(Float64(x_m / z) * Float64(2.0 / Float64(y - t)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (z <= 5.2e-37)
		tmp = x_m * (2.0 / (z * (y - t)));
	else
		tmp = (x_m / z) * (2.0 / (y - t));
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[z, 5.2e-37], N[(x$95$m * N[(2.0 / N[(z * N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / z), $MachinePrecision] * N[(2.0 / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 5.19999999999999959e-37

   1. Initial program 89.1%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 92.5%

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

   3. Simplified 92.5%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. distribute-rgt-out-- 89.1%

         \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

      2. associate-/l* 88.6%

         \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

      3. *-commutative 88.6%

         \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

      4. distribute-rgt-out-- 91.9%

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

   6. Applied egg-rr 91.9%

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

   if 5.19999999999999959e-37 < z

   1. Initial program 89.9%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 89.9%

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

   3. Simplified 89.9%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. times-frac 96.7%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{2}{y - t}} \]

   6. Applied egg-rr 96.7%

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

4. Final simplification 93.3%

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

Alternative 11: 55.2% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (* x_s (if (<= z 1e+76) (* -2.0 (/ x_m (* z t))) (* -2.0 (/ (/ x_m z) t)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (z <= 1e+76) {
		tmp = -2.0 * (x_m / (z * t));
	} else {
		tmp = -2.0 * ((x_m / z) / t);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= 1d+76) then
        tmp = (-2.0d0) * (x_m / (z * t))
    else
        tmp = (-2.0d0) * ((x_m / z) / t)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (z <= 1e+76) {
		tmp = -2.0 * (x_m / (z * t));
	} else {
		tmp = -2.0 * ((x_m / z) / t);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if z <= 1e+76:
		tmp = -2.0 * (x_m / (z * t))
	else:
		tmp = -2.0 * ((x_m / z) / t)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (z <= 1e+76)
		tmp = Float64(-2.0 * Float64(x_m / Float64(z * t)));
	else
		tmp = Float64(-2.0 * Float64(Float64(x_m / z) / t));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (z <= 1e+76)
		tmp = -2.0 * (x_m / (z * t));
	else
		tmp = -2.0 * ((x_m / z) / t);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[z, 1e+76], N[(-2.0 * N[(x$95$m / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[(x$95$m / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1e76

   1. Initial program 90.3%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 93.3%

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

   3. Simplified 93.3%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 53.7%

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

      1. *-commutative 53.7%

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

   7. Simplified 53.7%

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

   if 1e76 < z

   1. Initial program 85.6%

      \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
   2. Step-by-step derivation

      1. distribute-rgt-out-- 85.6%

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

   3. Simplified 85.6%

      \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 45.6%

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

      1. *-commutative 45.6%

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

      2. associate-/r* 55.6%

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

   7. Simplified 55.6%

      \[\leadsto \color{blue}{-2 \cdot \frac{\frac{x}{z}}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 91.8% accurate, 1.2× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (* x_s (* x_m (/ 2.0 (* z (- y t))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (x_m * (2.0 / (z * (y - t))));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x_s * (x_m * (2.0d0 / (z * (y - t))))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (x_m * (2.0 / (z * (y - t))));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	return x_s * (x_m * (2.0 / (z * (y - t))))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	return Float64(x_s * Float64(x_m * Float64(2.0 / Float64(z * Float64(y - t)))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z, t)
	tmp = x_s * (x_m * (2.0 / (z * (y - t))));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * N[(x$95$m * N[(2.0 / N[(z * N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.4%

   \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
2. Step-by-step derivation

   1. distribute-rgt-out-- 91.7%

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

3. Simplified 91.7%

   \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. distribute-rgt-out-- 89.4%

      \[\leadsto \frac{x \cdot 2}{\color{blue}{y \cdot z - t \cdot z}} \]

   2. associate-/l* 89.0%

      \[\leadsto \color{blue}{x \cdot \frac{2}{y \cdot z - t \cdot z}} \]

   3. *-commutative 89.0%

      \[\leadsto \color{blue}{\frac{2}{y \cdot z - t \cdot z} \cdot x} \]

   4. distribute-rgt-out-- 91.3%

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

6. Applied egg-rr 91.3%

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

7. Final simplification 91.3%

   \[\leadsto x \cdot \frac{2}{z \cdot \left(y - t\right)} \]
8. Add Preprocessing

Alternative 13: 53.1% accurate, 1.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t) :precision binary64 (* x_s (* -2.0 (/ x_m (* z t)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (-2.0 * (x_m / (z * t)));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x_s * ((-2.0d0) * (x_m / (z * t)))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (-2.0 * (x_m / (z * t)));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	return x_s * (-2.0 * (x_m / (z * t)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	return Float64(x_s * Float64(-2.0 * Float64(x_m / Float64(z * t))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z, t)
	tmp = x_s * (-2.0 * (x_m / (z * t)));
end

Wolfram

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

Derivation

1. Initial program 89.4%

   \[\frac{x \cdot 2}{y \cdot z - t \cdot z} \]
2. Step-by-step derivation

   1. distribute-rgt-out-- 91.7%

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

3. Simplified 91.7%

   \[\leadsto \color{blue}{\frac{x \cdot 2}{z \cdot \left(y - t\right)}} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 52.1%

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

   1. *-commutative 52.1%

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

7. Simplified 52.1%

   \[\leadsto \color{blue}{-2 \cdot \frac{x}{z \cdot t}} \]
8. Add Preprocessing

Developer Target 1: 97.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{\left(y - t\right) \cdot z} \cdot 2\\ t_2 := \frac{x \cdot 2}{y \cdot z - t \cdot z}\\ \mathbf{if}\;t\_2 < -2.559141628295061 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 < 1.045027827330126 \cdot 10^{-269}:\\ \;\;\;\;\frac{\frac{x}{z} \cdot 2}{y - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ x (* (- y t) z)) 2.0))
        (t_2 (/ (* x 2.0) (- (* y z) (* t z)))))
   (if (< t_2 -2.559141628295061e-13)
     t_1
     (if (< t_2 1.045027827330126e-269) (/ (* (/ x z) 2.0) (- y t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / ((y - t) * z)) * 2.0;
	double t_2 = (x * 2.0) / ((y * z) - (t * z));
	double tmp;
	if (t_2 < -2.559141628295061e-13) {
		tmp = t_1;
	} else if (t_2 < 1.045027827330126e-269) {
		tmp = ((x / z) * 2.0) / (y - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x / ((y - t) * z)) * 2.0d0
    t_2 = (x * 2.0d0) / ((y * z) - (t * z))
    if (t_2 < (-2.559141628295061d-13)) then
        tmp = t_1
    else if (t_2 < 1.045027827330126d-269) then
        tmp = ((x / z) * 2.0d0) / (y - t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / ((y - t) * z)) * 2.0;
	double t_2 = (x * 2.0) / ((y * z) - (t * z));
	double tmp;
	if (t_2 < -2.559141628295061e-13) {
		tmp = t_1;
	} else if (t_2 < 1.045027827330126e-269) {
		tmp = ((x / z) * 2.0) / (y - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / ((y - t) * z)) * 2.0
	t_2 = (x * 2.0) / ((y * z) - (t * z))
	tmp = 0
	if t_2 < -2.559141628295061e-13:
		tmp = t_1
	elif t_2 < 1.045027827330126e-269:
		tmp = ((x / z) * 2.0) / (y - t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / Float64(Float64(y - t) * z)) * 2.0)
	t_2 = Float64(Float64(x * 2.0) / Float64(Float64(y * z) - Float64(t * z)))
	tmp = 0.0
	if (t_2 < -2.559141628295061e-13)
		tmp = t_1;
	elseif (t_2 < 1.045027827330126e-269)
		tmp = Float64(Float64(Float64(x / z) * 2.0) / Float64(y - t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / ((y - t) * z)) * 2.0;
	t_2 = (x * 2.0) / ((y * z) - (t * z));
	tmp = 0.0;
	if (t_2 < -2.559141628295061e-13)
		tmp = t_1;
	elseif (t_2 < 1.045027827330126e-269)
		tmp = ((x / z) * 2.0) / (y - t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / N[(N[(y - t), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 2.0), $MachinePrecision] / N[(N[(y * z), $MachinePrecision] - N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$2, -2.559141628295061e-13], t$95$1, If[Less[t$95$2, 1.045027827330126e-269], N[(N[(N[(x / z), $MachinePrecision] * 2.0), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2024186 
(FPCore (x y z t)
  :name "Linear.Projection:infinitePerspective from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (/ (* x 2) (- (* y z) (* t z))) -2559141628295061/10000000000000000000000000000) (* (/ x (* (- y t) z)) 2) (if (< (/ (* x 2) (- (* y z) (* t z))) 522513913665063/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (* (/ x z) 2) (- y t)) (* (/ x (* (- y t) z)) 2))))

  (/ (* x 2.0) (- (* y z) (* t z))))