Linear.Projection:infinitePerspective from linear-1.19.1.3, A

Percentage Accurate: 90.0% → 96.6%

Time: 8.6s

Alternatives: 9

Speedup: 0.8×

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: 90.0% 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.8× speedup

Math

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

FPCore

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

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (z_m <= 1.5e+79) {
		tmp = (x * 2.0) / (z_m * (y - t));
	} else {
		tmp = (x / z_m) * (2.0 / (y - t));
	}
	return z_s * tmp;
}

Fortran

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

Java

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

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if z_m <= 1.5e+79:
		tmp = (x * 2.0) / (z_m * (y - t))
	else:
		tmp = (x / z_m) * (2.0 / (y - t))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (z_m <= 1.5e+79)
		tmp = Float64(Float64(x * 2.0) / Float64(z_m * Float64(y - t)));
	else
		tmp = Float64(Float64(x / z_m) * Float64(2.0 / Float64(y - t)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (z_m <= 1.5e+79)
		tmp = (x * 2.0) / (z_m * (y - t));
	else
		tmp = (x / z_m) * (2.0 / (y - t));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.49999999999999987e79

   1. Initial program 91.3%

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

      1. distribute-rgt-out-- 93.2%

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

   3. Simplified 93.2%

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

   if 1.49999999999999987e79 < z

   1. Initial program 76.0%

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

      1. distribute-rgt-out-- 83.2%

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

   3. Simplified 83.2%

      \[\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}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 73.7% accurate, 0.6× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (or (<= t -5.4e+59) (not (<= t 12000000000.0)))
    (* (/ x z_m) (/ -2.0 t))
    (* 2.0 (/ (/ x z_m) y)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if ((t <= -5.4e+59) || !(t <= 12000000000.0)) {
		tmp = (x / z_m) * (-2.0 / t);
	} else {
		tmp = 2.0 * ((x / z_m) / y);
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-5.4d+59)) .or. (.not. (t <= 12000000000.0d0))) then
        tmp = (x / z_m) * ((-2.0d0) / t)
    else
        tmp = 2.0d0 * ((x / z_m) / y)
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if ((t <= -5.4e+59) || !(t <= 12000000000.0)) {
		tmp = (x / z_m) * (-2.0 / t);
	} else {
		tmp = 2.0 * ((x / z_m) / y);
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if (t <= -5.4e+59) or not (t <= 12000000000.0):
		tmp = (x / z_m) * (-2.0 / t)
	else:
		tmp = 2.0 * ((x / z_m) / y)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if ((t <= -5.4e+59) || !(t <= 12000000000.0))
		tmp = Float64(Float64(x / z_m) * Float64(-2.0 / t));
	else
		tmp = Float64(2.0 * Float64(Float64(x / z_m) / y));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if ((t <= -5.4e+59) || ~((t <= 12000000000.0)))
		tmp = (x / z_m) * (-2.0 / t);
	else
		tmp = 2.0 * ((x / z_m) / y);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -5.4000000000000002e59 or 1.2e10 < t

   1. Initial program 82.6%

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

      1. distribute-rgt-out-- 86.1%

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

   3. Simplified 86.1%

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

      1. times-frac 94.6%

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

   6. Applied egg-rr 94.6%

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

   7. Taylor expanded in y around 0 88.5%

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

   if -5.4000000000000002e59 < t < 1.2e10

   1. Initial program 92.1%

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

      1. distribute-rgt-out-- 94.9%

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

   3. Simplified 94.9%

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

   5. Taylor expanded in y around inf 76.6%

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

      1. *-commutative 76.6%

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

      2. associate-/r* 77.2%

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

   7. Simplified 77.2%

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

4. Final simplification 82.1%

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

Alternative 3: 73.7% accurate, 0.6× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (or (<= t -5.4e+59) (not (<= t 15500000000.0)))
    (* -2.0 (/ (/ x z_m) t))
    (* 2.0 (/ (/ x z_m) y)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if ((t <= -5.4e+59) || !(t <= 15500000000.0)) {
		tmp = -2.0 * ((x / z_m) / t);
	} else {
		tmp = 2.0 * ((x / z_m) / y);
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-5.4d+59)) .or. (.not. (t <= 15500000000.0d0))) then
        tmp = (-2.0d0) * ((x / z_m) / t)
    else
        tmp = 2.0d0 * ((x / z_m) / y)
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if ((t <= -5.4e+59) || !(t <= 15500000000.0)) {
		tmp = -2.0 * ((x / z_m) / t);
	} else {
		tmp = 2.0 * ((x / z_m) / y);
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if (t <= -5.4e+59) or not (t <= 15500000000.0):
		tmp = -2.0 * ((x / z_m) / t)
	else:
		tmp = 2.0 * ((x / z_m) / y)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if ((t <= -5.4e+59) || !(t <= 15500000000.0))
		tmp = Float64(-2.0 * Float64(Float64(x / z_m) / t));
	else
		tmp = Float64(2.0 * Float64(Float64(x / z_m) / y));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if ((t <= -5.4e+59) || ~((t <= 15500000000.0)))
		tmp = -2.0 * ((x / z_m) / t);
	else
		tmp = 2.0 * ((x / z_m) / y);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -5.4000000000000002e59 or 1.55e10 < t

   1. Initial program 82.6%

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

      1. distribute-rgt-out-- 86.1%

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

   3. Simplified 86.1%

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

   5. Taylor expanded in y around 0 80.0%

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

      1. *-commutative 80.0%

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

      2. associate-/r* 88.5%

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

   7. Simplified 88.5%

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

   if -5.4000000000000002e59 < t < 1.55e10

   1. Initial program 92.1%

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

      1. distribute-rgt-out-- 94.9%

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

   3. Simplified 94.9%

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

   5. Taylor expanded in y around inf 76.6%

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

      1. *-commutative 76.6%

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

      2. associate-/r* 77.2%

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

   7. Simplified 77.2%

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

4. Final simplification 82.1%

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

Alternative 4: 73.8% accurate, 0.6× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (<= t -1.2e+57)
    (* (/ x z_m) (/ -2.0 t))
    (if (<= t 900000000.0) (* 2.0 (/ (/ x z_m) y)) (/ -2.0 (* t (/ z_m x)))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= -1.2e+57) {
		tmp = (x / z_m) * (-2.0 / t);
	} else if (t <= 900000000.0) {
		tmp = 2.0 * ((x / z_m) / y);
	} else {
		tmp = -2.0 / (t * (z_m / x));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-1.2d+57)) then
        tmp = (x / z_m) * ((-2.0d0) / t)
    else if (t <= 900000000.0d0) then
        tmp = 2.0d0 * ((x / z_m) / y)
    else
        tmp = (-2.0d0) / (t * (z_m / x))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= -1.2e+57) {
		tmp = (x / z_m) * (-2.0 / t);
	} else if (t <= 900000000.0) {
		tmp = 2.0 * ((x / z_m) / y);
	} else {
		tmp = -2.0 / (t * (z_m / x));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if t <= -1.2e+57:
		tmp = (x / z_m) * (-2.0 / t)
	elif t <= 900000000.0:
		tmp = 2.0 * ((x / z_m) / y)
	else:
		tmp = -2.0 / (t * (z_m / x))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (t <= -1.2e+57)
		tmp = Float64(Float64(x / z_m) * Float64(-2.0 / t));
	elseif (t <= 900000000.0)
		tmp = Float64(2.0 * Float64(Float64(x / z_m) / y));
	else
		tmp = Float64(-2.0 / Float64(t * Float64(z_m / x)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (t <= -1.2e+57)
		tmp = (x / z_m) * (-2.0 / t);
	elseif (t <= 900000000.0)
		tmp = 2.0 * ((x / z_m) / y);
	else
		tmp = -2.0 / (t * (z_m / x));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -1.20000000000000002e57

   1. Initial program 85.8%

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

      1. distribute-rgt-out-- 89.2%

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

   3. Simplified 89.2%

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

      1. times-frac 93.0%

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

   6. Applied egg-rr 93.0%

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

   7. Taylor expanded in y around 0 86.0%

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

   if -1.20000000000000002e57 < t < 9e8

   1. Initial program 92.1%

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

      1. distribute-rgt-out-- 94.9%

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

   3. Simplified 94.9%

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

   5. Taylor expanded in y around inf 76.6%

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

      1. *-commutative 76.6%

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

      2. associate-/r* 77.2%

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

   7. Simplified 77.2%

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

   if 9e8 < t

   1. Initial program 79.4%

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

      1. distribute-rgt-out-- 83.1%

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

   3. Simplified 83.1%

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

   5. Taylor expanded in y around 0 79.3%

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

      1. clear-num 80.3%

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

      2. un-div-inv 80.3%

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

      3. *-commutative 80.3%

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

      4. associate-/l* 83.6%

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

   7. Applied egg-rr 83.6%

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

   8. Taylor expanded in z around 0 80.3%

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

      1. associate-/l* 91.9%

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

   10. Simplified 91.9%

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

Alternative 5: 96.4% accurate, 0.8× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (let* ((t_1 (/ 2.0 (- y t))))
   (* z_s (if (<= z_m 5.8e+87) (* x (/ t_1 z_m)) (* (/ x z_m) t_1)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double t_1 = 2.0 / (y - t);
	double tmp;
	if (z_m <= 5.8e+87) {
		tmp = x * (t_1 / z_m);
	} else {
		tmp = (x / z_m) * t_1;
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 / (y - t)
    if (z_m <= 5.8d+87) then
        tmp = x * (t_1 / z_m)
    else
        tmp = (x / z_m) * t_1
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double t_1 = 2.0 / (y - t);
	double tmp;
	if (z_m <= 5.8e+87) {
		tmp = x * (t_1 / z_m);
	} else {
		tmp = (x / z_m) * t_1;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	t_1 = 2.0 / (y - t)
	tmp = 0
	if z_m <= 5.8e+87:
		tmp = x * (t_1 / z_m)
	else:
		tmp = (x / z_m) * t_1
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	t_1 = Float64(2.0 / Float64(y - t))
	tmp = 0.0
	if (z_m <= 5.8e+87)
		tmp = Float64(x * Float64(t_1 / z_m));
	else
		tmp = Float64(Float64(x / z_m) * t_1);
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	t_1 = 2.0 / (y - t);
	tmp = 0.0;
	if (z_m <= 5.8e+87)
		tmp = x * (t_1 / z_m);
	else
		tmp = (x / z_m) * t_1;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 5.7999999999999996e87

   1. Initial program 91.1%

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

      1. distribute-rgt-out-- 92.9%

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

   3. Simplified 92.9%

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

   5. Taylor expanded in x around 0 92.9%

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

      1. associate-*r/ 92.9%

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

      2. associate-*l/ 92.3%

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

      3. *-commutative 92.3%

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

      4. *-commutative 92.3%

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

      5. associate-/r* 92.8%

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

   7. Simplified 92.8%

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

   if 5.7999999999999996e87 < z

   1. Initial program 75.5%

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

      1. distribute-rgt-out-- 83.5%

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

   3. Simplified 83.5%

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

      1. times-frac 98.0%

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

   6. Applied egg-rr 98.0%

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

Alternative 6: 90.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= 1.25e+116) {
		tmp = x * ((2.0 / (y - t)) / z_m);
	} else {
		tmp = -2.0 * ((x / z_m) / t);
	}
	return z_s * tmp;
}

Fortran

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

Java

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

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if t <= 1.25e+116:
		tmp = x * ((2.0 / (y - t)) / z_m)
	else:
		tmp = -2.0 * ((x / z_m) / t)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (t <= 1.25e+116)
		tmp = Float64(x * Float64(Float64(2.0 / Float64(y - t)) / z_m));
	else
		tmp = Float64(-2.0 * Float64(Float64(x / z_m) / t));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (t <= 1.25e+116)
		tmp = x * ((2.0 / (y - t)) / z_m);
	else
		tmp = -2.0 * ((x / z_m) / t);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.25000000000000006e116

   1. Initial program 90.6%

      \[\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 x around 0 93.3%

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

      1. associate-*r/ 93.3%

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

      2. associate-*l/ 92.7%

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

      3. *-commutative 92.7%

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

      4. *-commutative 92.7%

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

      5. associate-/r* 93.2%

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

   7. Simplified 93.2%

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

   if 1.25000000000000006e116 < t

   1. Initial program 74.8%

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

      1. distribute-rgt-out-- 79.7%

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

   3. Simplified 79.7%

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

   5. Taylor expanded in y around 0 79.7%

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

      1. *-commutative 79.7%

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

      2. associate-/r* 95.1%

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

   7. Simplified 95.1%

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

Alternative 7: 54.2% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 4.60000000000000002e76

   1. Initial program 89.0%

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

      1. distribute-rgt-out-- 92.6%

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

   3. Simplified 92.6%

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

   5. Taylor expanded in y around 0 56.0%

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

   if 4.60000000000000002e76 < x

   1. Initial program 81.6%

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

      1. distribute-rgt-out-- 81.8%

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

   3. Simplified 81.8%

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

   5. Taylor expanded in y around 0 45.9%

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

      1. associate-/r* 59.0%

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

   7. Simplified 59.0%

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

4. Final simplification 56.4%

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

Alternative 8: 55.0% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

   1. distribute-rgt-out-- 91.1%

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

3. Simplified 91.1%

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

5. Taylor expanded in y around 0 54.5%

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

   1. *-commutative 54.5%

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

   2. associate-/r* 60.9%

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

7. Simplified 60.9%

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

Alternative 9: 53.2% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

   1. distribute-rgt-out-- 91.1%

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

3. Simplified 91.1%

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

5. Taylor expanded in y around 0 54.5%

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

6. Final simplification 54.5%

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

Developer Target 1: 97.1% 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 2024185 
(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))))