Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3

Percentage Accurate: 84.4% → 97.8%

Time: 5.8s

Alternatives: 9

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot \left(y - z\right)}{y} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot \left(y - z\right)}{y} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.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}\;x\_m \leq 6.8 \cdot 10^{+41}:\\ \;\;\;\;x\_m - \frac{x\_m \cdot z}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - \frac{z}{y}\right)\\ \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)
 :precision binary64
 (* x_s (if (<= x_m 6.8e+41) (- x_m (/ (* x_m z) y)) (* x_m (- 1.0 (/ 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 tmp;
	if (x_m <= 6.8e+41) {
		tmp = x_m - ((x_m * z) / y);
	} else {
		tmp = x_m * (1.0 - (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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 6.8d+41) then
        tmp = x_m - ((x_m * z) / y)
    else
        tmp = x_m * (1.0d0 - (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 tmp;
	if (x_m <= 6.8e+41) {
		tmp = x_m - ((x_m * z) / y);
	} else {
		tmp = x_m * (1.0 - (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):
	tmp = 0
	if x_m <= 6.8e+41:
		tmp = x_m - ((x_m * z) / y)
	else:
		tmp = x_m * (1.0 - (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)
	tmp = 0.0
	if (x_m <= 6.8e+41)
		tmp = Float64(x_m - Float64(Float64(x_m * z) / y));
	else
		tmp = Float64(x_m * Float64(1.0 - Float64(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)
	tmp = 0.0;
	if (x_m <= 6.8e+41)
		tmp = x_m - ((x_m * z) / y);
	else
		tmp = x_m * (1.0 - (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_] := N[(x$95$s * If[LessEqual[x$95$m, 6.8e+41], N[(x$95$m - N[(N[(x$95$m * z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 6.79999999999999996e41

   1. Initial program 88.6%

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

      1. remove-double-neg 88.6%

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

      2. distribute-frac-neg2 88.6%

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

      3. distribute-frac-neg 88.6%

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

      4. distribute-rgt-neg-in 88.6%

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

      5. associate-/l* 93.7%

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

      6. distribute-frac-neg 93.7%

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

      7. distribute-frac-neg2 93.7%

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

      8. remove-double-neg 93.7%

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

      9. div-sub 93.7%

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

      10. *-inverses 93.7%

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

   3. Simplified 93.7%

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

   5. Taylor expanded in z around 0 94.8%

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

      1. associate-*r/ 94.8%

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

      2. mul-1-neg 94.8%

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

      3. distribute-rgt-neg-out 94.8%

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

   7. Simplified 94.8%

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

   if 6.79999999999999996e41 < x

   1. Initial program 76.7%

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

      1. remove-double-neg 76.7%

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

      2. distribute-frac-neg2 76.7%

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

      3. distribute-frac-neg 76.7%

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

      4. distribute-rgt-neg-in 76.7%

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

      5. associate-/l* 99.8%

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

      6. distribute-frac-neg 99.8%

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

      7. distribute-frac-neg2 99.8%

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

      8. remove-double-neg 99.8%

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

      9. div-sub 99.9%

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

      10. *-inverses 99.9%

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

   3. Simplified 99.9%

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

4. Final simplification 95.9%

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

Alternative 2: 70.4% accurate, 0.4× 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 -7.5 \cdot 10^{-32} \lor \neg \left(z \leq 2.3 \cdot 10^{+55}\right):\\ \;\;\;\;x\_m \cdot \frac{z}{-y}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \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)
 :precision binary64
 (*
  x_s
  (if (or (<= z -7.5e-32) (not (<= z 2.3e+55))) (* x_m (/ z (- y))) x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -7.5e-32) || !(z <= 2.3e+55)) {
		tmp = x_m * (z / -y);
	} else {
		tmp = x_m;
	}
	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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-7.5d-32)) .or. (.not. (z <= 2.3d+55))) then
        tmp = x_m * (z / -y)
    else
        tmp = x_m
    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 tmp;
	if ((z <= -7.5e-32) || !(z <= 2.3e+55)) {
		tmp = x_m * (z / -y);
	} else {
		tmp = x_m;
	}
	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):
	tmp = 0
	if (z <= -7.5e-32) or not (z <= 2.3e+55):
		tmp = x_m * (z / -y)
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -7.5e-32) || !(z <= 2.3e+55))
		tmp = Float64(x_m * Float64(z / Float64(-y)));
	else
		tmp = x_m;
	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)
	tmp = 0.0;
	if ((z <= -7.5e-32) || ~((z <= 2.3e+55)))
		tmp = x_m * (z / -y);
	else
		tmp = x_m;
	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_] := N[(x$95$s * If[Or[LessEqual[z, -7.5e-32], N[Not[LessEqual[z, 2.3e+55]], $MachinePrecision]], N[(x$95$m * N[(z / (-y)), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -7.49999999999999953e-32 or 2.29999999999999987e55 < z

   1. Initial program 88.0%

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

      1. remove-double-neg 88.0%

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

      2. distribute-frac-neg2 88.0%

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

      3. distribute-frac-neg 88.0%

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

      4. distribute-rgt-neg-in 88.0%

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

      5. associate-/l* 91.4%

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

      6. distribute-frac-neg 91.4%

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

      7. distribute-frac-neg2 91.4%

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

      8. remove-double-neg 91.4%

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

      9. div-sub 91.4%

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

      10. *-inverses 91.4%

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

   3. Simplified 91.4%

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

   5. Taylor expanded in z around 0 89.9%

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

      1. associate-*r/ 89.9%

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

      2. mul-1-neg 89.9%

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

      3. distribute-rgt-neg-out 89.9%

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

   7. Simplified 89.9%

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

   8. Taylor expanded in x around 0 91.4%

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \frac{z}{y}\right)} \]
   9. Step-by-step derivation

      1. mul-1-neg 91.4%

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

      2. unsub-neg 91.4%

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

      3. distribute-lft-out-- 91.4%

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

      4. *-rgt-identity 91.4%

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

   10. Simplified 91.4%

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

       1. clear-num 91.3%

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

       2. un-div-inv 92.0%

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

   12. Applied egg-rr 92.0%

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

   13. Taylor expanded in y around 0 75.7%

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

       1. mul-1-neg 75.7%

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

       2. distribute-neg-frac2 75.7%

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

       3. associate-*r/ 71.3%

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

   15. Simplified 71.3%

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

   if -7.49999999999999953e-32 < z < 2.29999999999999987e55

   1. Initial program 83.7%

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

      1. remove-double-neg 83.7%

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

      2. distribute-frac-neg2 83.7%

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

      3. distribute-frac-neg 83.7%

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

      4. distribute-rgt-neg-in 83.7%

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

      5. associate-/l* 99.1%

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

      6. distribute-frac-neg 99.1%

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

      7. distribute-frac-neg2 99.1%

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

      8. remove-double-neg 99.1%

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

      9. div-sub 99.1%

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

      10. *-inverses 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around 0 80.1%

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

4. Final simplification 75.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7.5 \cdot 10^{-32} \lor \neg \left(z \leq 2.3 \cdot 10^{+55}\right):\\ \;\;\;\;x \cdot \frac{z}{-y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 72.4% accurate, 0.4× 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 -2.1 \cdot 10^{-30} \lor \neg \left(z \leq 4.3 \cdot 10^{+27}\right):\\ \;\;\;\;z \cdot \frac{x\_m}{-y}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \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)
 :precision binary64
 (*
  x_s
  (if (or (<= z -2.1e-30) (not (<= z 4.3e+27))) (* z (/ x_m (- y))) x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -2.1e-30) || !(z <= 4.3e+27)) {
		tmp = z * (x_m / -y);
	} else {
		tmp = x_m;
	}
	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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-2.1d-30)) .or. (.not. (z <= 4.3d+27))) then
        tmp = z * (x_m / -y)
    else
        tmp = x_m
    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 tmp;
	if ((z <= -2.1e-30) || !(z <= 4.3e+27)) {
		tmp = z * (x_m / -y);
	} else {
		tmp = x_m;
	}
	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):
	tmp = 0
	if (z <= -2.1e-30) or not (z <= 4.3e+27):
		tmp = z * (x_m / -y)
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -2.1e-30) || !(z <= 4.3e+27))
		tmp = Float64(z * Float64(x_m / Float64(-y)));
	else
		tmp = x_m;
	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)
	tmp = 0.0;
	if ((z <= -2.1e-30) || ~((z <= 4.3e+27)))
		tmp = z * (x_m / -y);
	else
		tmp = x_m;
	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_] := N[(x$95$s * If[Or[LessEqual[z, -2.1e-30], N[Not[LessEqual[z, 4.3e+27]], $MachinePrecision]], N[(z * N[(x$95$m / (-y)), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -2.1000000000000002e-30 or 4.30000000000000008e27 < z

   1. Initial program 88.4%

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

      1. remove-double-neg 88.4%

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

      2. distribute-frac-neg2 88.4%

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

      3. distribute-frac-neg 88.4%

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

      4. distribute-rgt-neg-in 88.4%

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

      5. associate-/l* 91.0%

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

      6. distribute-frac-neg 91.0%

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

      7. distribute-frac-neg2 91.0%

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

      8. remove-double-neg 91.0%

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

      9. div-sub 91.0%

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

      10. *-inverses 91.0%

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

   3. Simplified 91.0%

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

   5. Taylor expanded in z around inf 75.1%

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

      1. associate-*l/ 78.3%

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

      2. associate-*l* 78.3%

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

      3. *-commutative 78.3%

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

      4. associate-*r/ 78.3%

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

      5. mul-1-neg 78.3%

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

   7. Simplified 78.3%

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

   if -2.1000000000000002e-30 < z < 4.30000000000000008e27

   1. Initial program 83.2%

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

      1. remove-double-neg 83.2%

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

      2. distribute-frac-neg2 83.2%

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

      3. distribute-frac-neg 83.2%

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

      4. distribute-rgt-neg-in 83.2%

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

      5. associate-/l* 99.9%

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

      6. distribute-frac-neg 99.9%

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

      7. distribute-frac-neg2 99.9%

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

      8. remove-double-neg 99.9%

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

      9. div-sub 99.9%

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

      10. *-inverses 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 81.1%

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

4. Final simplification 79.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.1 \cdot 10^{-30} \lor \neg \left(z \leq 4.3 \cdot 10^{+27}\right):\\ \;\;\;\;z \cdot \frac{x}{-y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 93.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}\;z \leq -3.5 \cdot 10^{+108}:\\ \;\;\;\;z \cdot \frac{x\_m}{-y}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - \frac{z}{y}\right)\\ \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)
 :precision binary64
 (* x_s (if (<= z -3.5e+108) (* z (/ x_m (- y))) (* x_m (- 1.0 (/ 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 tmp;
	if (z <= -3.5e+108) {
		tmp = z * (x_m / -y);
	} else {
		tmp = x_m * (1.0 - (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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.5d+108)) then
        tmp = z * (x_m / -y)
    else
        tmp = x_m * (1.0d0 - (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 tmp;
	if (z <= -3.5e+108) {
		tmp = z * (x_m / -y);
	} else {
		tmp = x_m * (1.0 - (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):
	tmp = 0
	if z <= -3.5e+108:
		tmp = z * (x_m / -y)
	else:
		tmp = x_m * (1.0 - (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)
	tmp = 0.0
	if (z <= -3.5e+108)
		tmp = Float64(z * Float64(x_m / Float64(-y)));
	else
		tmp = Float64(x_m * Float64(1.0 - Float64(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)
	tmp = 0.0;
	if (z <= -3.5e+108)
		tmp = z * (x_m / -y);
	else
		tmp = x_m * (1.0 - (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_] := N[(x$95$s * If[LessEqual[z, -3.5e+108], N[(z * N[(x$95$m / (-y)), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -3.5000000000000002e108

   1. Initial program 94.6%

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

      1. remove-double-neg 94.6%

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

      2. distribute-frac-neg2 94.6%

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

      3. distribute-frac-neg 94.6%

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

      4. distribute-rgt-neg-in 94.6%

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

      5. associate-/l* 76.5%

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

      6. distribute-frac-neg 76.5%

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

      7. distribute-frac-neg2 76.5%

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

      8. remove-double-neg 76.5%

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

      9. div-sub 76.5%

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

      10. *-inverses 76.5%

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

   3. Simplified 76.5%

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

   5. Taylor expanded in z around inf 86.5%

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

      1. associate-*l/ 89.2%

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

      2. associate-*l* 89.2%

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

      3. *-commutative 89.2%

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

      4. associate-*r/ 89.2%

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

      5. mul-1-neg 89.2%

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

   7. Simplified 89.2%

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

   if -3.5000000000000002e108 < z

   1. Initial program 84.6%

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

      1. remove-double-neg 84.6%

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

      2. distribute-frac-neg2 84.6%

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

      3. distribute-frac-neg 84.6%

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

      4. distribute-rgt-neg-in 84.6%

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

      5. associate-/l* 98.1%

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

      6. distribute-frac-neg 98.1%

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

      7. distribute-frac-neg2 98.1%

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

      8. remove-double-neg 98.1%

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

      9. div-sub 98.1%

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

      10. *-inverses 98.1%

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

   3. Simplified 98.1%

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

4. Final simplification 96.9%

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

Alternative 5: 95.7% 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}\;z \leq -2.55 \cdot 10^{+107}:\\ \;\;\;\;\frac{x\_m \cdot \left(y - z\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m - \frac{x\_m}{\frac{y}{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)
 :precision binary64
 (* x_s (if (<= z -2.55e+107) (/ (* x_m (- y z)) y) (- x_m (/ x_m (/ y 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 tmp;
	if (z <= -2.55e+107) {
		tmp = (x_m * (y - z)) / y;
	} else {
		tmp = x_m - (x_m / (y / 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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-2.55d+107)) then
        tmp = (x_m * (y - z)) / y
    else
        tmp = x_m - (x_m / (y / 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 tmp;
	if (z <= -2.55e+107) {
		tmp = (x_m * (y - z)) / y;
	} else {
		tmp = x_m - (x_m / (y / 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):
	tmp = 0
	if z <= -2.55e+107:
		tmp = (x_m * (y - z)) / y
	else:
		tmp = x_m - (x_m / (y / z))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (z <= -2.55e+107)
		tmp = Float64(Float64(x_m * Float64(y - z)) / y);
	else
		tmp = Float64(x_m - Float64(x_m / Float64(y / 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)
	tmp = 0.0;
	if (z <= -2.55e+107)
		tmp = (x_m * (y - z)) / y;
	else
		tmp = x_m - (x_m / (y / 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_] := N[(x$95$s * If[LessEqual[z, -2.55e+107], N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(x$95$m - N[(x$95$m / N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -2.5500000000000001e107

   1. Initial program 94.6%

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

   if -2.5500000000000001e107 < z

   1. Initial program 84.6%

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

      1. remove-double-neg 84.6%

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

      2. distribute-frac-neg2 84.6%

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

      3. distribute-frac-neg 84.6%

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

      4. distribute-rgt-neg-in 84.6%

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

      5. associate-/l* 98.1%

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

      6. distribute-frac-neg 98.1%

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

      7. distribute-frac-neg2 98.1%

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

      8. remove-double-neg 98.1%

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

      9. div-sub 98.1%

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

      10. *-inverses 98.1%

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

   3. Simplified 98.1%

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

   5. Taylor expanded in z around 0 93.5%

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

      1. associate-*r/ 93.5%

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

      2. mul-1-neg 93.5%

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

      3. distribute-rgt-neg-out 93.5%

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

   7. Simplified 93.5%

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

   8. Taylor expanded in x around 0 98.1%

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \frac{z}{y}\right)} \]
   9. Step-by-step derivation

      1. mul-1-neg 98.1%

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

      2. unsub-neg 98.1%

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

      3. distribute-lft-out-- 98.1%

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

      4. *-rgt-identity 98.1%

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

   10. Simplified 98.1%

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

       1. clear-num 98.1%

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

       2. un-div-inv 98.2%

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

   12. Applied egg-rr 98.2%

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

4. Final simplification 97.7%

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

Alternative 6: 52.5% 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 \leq 2.8 \cdot 10^{+100}:\\ \;\;\;\;x\_m\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x\_m}{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)
 :precision binary64
 (* x_s (if (<= x_m 2.8e+100) x_m (* y (/ x_m 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 tmp;
	if (x_m <= 2.8e+100) {
		tmp = x_m;
	} else {
		tmp = y * (x_m / 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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 2.8d+100) then
        tmp = x_m
    else
        tmp = y * (x_m / 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 tmp;
	if (x_m <= 2.8e+100) {
		tmp = x_m;
	} else {
		tmp = y * (x_m / 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):
	tmp = 0
	if x_m <= 2.8e+100:
		tmp = x_m
	else:
		tmp = y * (x_m / y)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 2.8e+100)
		tmp = x_m;
	else
		tmp = Float64(y * Float64(x_m / 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)
	tmp = 0.0;
	if (x_m <= 2.8e+100)
		tmp = x_m;
	else
		tmp = y * (x_m / 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_] := N[(x$95$s * If[LessEqual[x$95$m, 2.8e+100], x$95$m, N[(y * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 2.7999999999999998e100

   1. Initial program 87.6%

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

      1. remove-double-neg 87.6%

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

      2. distribute-frac-neg2 87.6%

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

      3. distribute-frac-neg 87.6%

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

      4. distribute-rgt-neg-in 87.6%

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

      5. associate-/l* 94.1%

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

      6. distribute-frac-neg 94.1%

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

      7. distribute-frac-neg2 94.1%

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

      8. remove-double-neg 94.1%

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

      9. div-sub 94.1%

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

      10. *-inverses 94.1%

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

   3. Simplified 94.1%

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

   5. Taylor expanded in z around 0 50.9%

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

   if 2.7999999999999998e100 < x

   1. Initial program 78.0%

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

   3. Taylor expanded in y around inf 28.4%

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

      1. *-commutative 28.4%

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

      2. associate-/l* 52.8%

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

   5. Applied egg-rr 52.8%

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

4. Final simplification 51.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2.8 \cdot 10^{+100}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.5% 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 \leq 9.4 \cdot 10^{+83}:\\ \;\;\;\;x\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x\_m}}\\ \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)
 :precision binary64
 (* x_s (if (<= x_m 9.4e+83) x_m (/ y (/ y x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 9.4e+83) {
		tmp = x_m;
	} else {
		tmp = y / (y / x_m);
	}
	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)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 9.4d+83) then
        tmp = x_m
    else
        tmp = y / (y / x_m)
    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 tmp;
	if (x_m <= 9.4e+83) {
		tmp = x_m;
	} else {
		tmp = y / (y / x_m);
	}
	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):
	tmp = 0
	if x_m <= 9.4e+83:
		tmp = x_m
	else:
		tmp = y / (y / x_m)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 9.4e+83)
		tmp = x_m;
	else
		tmp = Float64(y / Float64(y / x_m));
	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)
	tmp = 0.0;
	if (x_m <= 9.4e+83)
		tmp = x_m;
	else
		tmp = y / (y / x_m);
	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_] := N[(x$95$s * If[LessEqual[x$95$m, 9.4e+83], x$95$m, N[(y / N[(y / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 9.3999999999999997e83

   1. Initial program 87.9%

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

      1. remove-double-neg 87.9%

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

      2. distribute-frac-neg2 87.9%

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

      3. distribute-frac-neg 87.9%

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

      4. distribute-rgt-neg-in 87.9%

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

      5. associate-/l* 94.0%

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

      6. distribute-frac-neg 94.0%

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

      7. distribute-frac-neg2 94.0%

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

      8. remove-double-neg 94.0%

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

      9. div-sub 94.1%

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

      10. *-inverses 94.1%

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

   3. Simplified 94.1%

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

   5. Taylor expanded in z around 0 50.4%

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

   if 9.3999999999999997e83 < x

   1. Initial program 76.8%

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

   3. Taylor expanded in y around inf 29.5%

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

      1. *-commutative 29.5%

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

      2. associate-/l* 54.9%

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

   5. Applied egg-rr 54.9%

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

      1. clear-num 54.8%

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

      2. un-div-inv 56.3%

         \[\leadsto \color{blue}{\frac{y}{\frac{y}{x}}} \]

   7. Applied egg-rr 56.3%

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

4. Final simplification 51.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 9.4 \cdot 10^{+83}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 96.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(x\_m - \frac{x\_m}{\frac{y}{z}}\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) :precision binary64 (* x_s (- x_m (/ x_m (/ y z)))))

C

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

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * (x_m - (x_m / (y / z)))
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) {
	return x_s * (x_m - (x_m / (y / z)));
}

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (x_m - (x_m / (y / z)));
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_] := N[(x$95$s * N[(x$95$m - N[(x$95$m / N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 86.0%

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

   1. remove-double-neg 86.0%

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

   2. distribute-frac-neg2 86.0%

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

   3. distribute-frac-neg 86.0%

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

   4. distribute-rgt-neg-in 86.0%

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

   5. associate-/l* 95.1%

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

   6. distribute-frac-neg 95.1%

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

   7. distribute-frac-neg2 95.1%

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

   8. remove-double-neg 95.1%

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

   9. div-sub 95.1%

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

   10. *-inverses 95.1%

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

3. Simplified 95.1%

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

5. Taylor expanded in z around 0 93.7%

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

   1. associate-*r/ 93.7%

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

   2. mul-1-neg 93.7%

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

   3. distribute-rgt-neg-out 93.7%

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

7. Simplified 93.7%

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

8. Taylor expanded in x around 0 95.1%

   \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \frac{z}{y}\right)} \]
9. Step-by-step derivation

   1. mul-1-neg 95.1%

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

   2. unsub-neg 95.1%

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

   3. distribute-lft-out-- 95.1%

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

   4. *-rgt-identity 95.1%

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

10. Simplified 95.1%

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

    1. clear-num 95.0%

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

    2. un-div-inv 95.4%

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

12. Applied egg-rr 95.4%

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

13. Final simplification 95.4%

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

Alternative 9: 50.3% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * x_m
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) {
	return x_s * x_m;
}

Python

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

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * x_m;
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_] := N[(x$95$s * x$95$m), $MachinePrecision]

Derivation

1. Initial program 86.0%

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

   1. remove-double-neg 86.0%

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

   2. distribute-frac-neg2 86.0%

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

   3. distribute-frac-neg 86.0%

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

   4. distribute-rgt-neg-in 86.0%

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

   5. associate-/l* 95.1%

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

   6. distribute-frac-neg 95.1%

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

   7. distribute-frac-neg2 95.1%

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

   8. remove-double-neg 95.1%

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

   9. div-sub 95.1%

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

   10. *-inverses 95.1%

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

3. Simplified 95.1%

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

5. Taylor expanded in z around 0 50.1%

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

6. Final simplification 50.1%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 96.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z < -2.060202331921739 \cdot 10^{+104}:\\ \;\;\;\;x - \frac{z \cdot x}{y}\\ \mathbf{elif}\;z < 1.6939766013828526 \cdot 10^{+213}:\\ \;\;\;\;\frac{x}{\frac{y}{y - z}}\\ \mathbf{else}:\\ \;\;\;\;\left(y - z\right) \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (< z -2.060202331921739e+104)
   (- x (/ (* z x) y))
   (if (< z 1.6939766013828526e+213) (/ x (/ y (- y z))) (* (- y z) (/ x y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z < -2.060202331921739e+104) {
		tmp = x - ((z * x) / y);
	} else if (z < 1.6939766013828526e+213) {
		tmp = x / (y / (y - z));
	} else {
		tmp = (y - z) * (x / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z < (-2.060202331921739d+104)) then
        tmp = x - ((z * x) / y)
    else if (z < 1.6939766013828526d+213) then
        tmp = x / (y / (y - z))
    else
        tmp = (y - z) * (x / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z < -2.060202331921739e+104) {
		tmp = x - ((z * x) / y);
	} else if (z < 1.6939766013828526e+213) {
		tmp = x / (y / (y - z));
	} else {
		tmp = (y - z) * (x / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z < -2.060202331921739e+104:
		tmp = x - ((z * x) / y)
	elif z < 1.6939766013828526e+213:
		tmp = x / (y / (y - z))
	else:
		tmp = (y - z) * (x / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z < -2.060202331921739e+104)
		tmp = Float64(x - Float64(Float64(z * x) / y));
	elseif (z < 1.6939766013828526e+213)
		tmp = Float64(x / Float64(y / Float64(y - z)));
	else
		tmp = Float64(Float64(y - z) * Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z < -2.060202331921739e+104)
		tmp = x - ((z * x) / y);
	elseif (z < 1.6939766013828526e+213)
		tmp = x / (y / (y - z));
	else
		tmp = (y - z) * (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Less[z, -2.060202331921739e+104], N[(x - N[(N[(z * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[Less[z, 1.6939766013828526e+213], N[(x / N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024060 
(FPCore (x y z)
  :name "Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3"
  :precision binary64

  :alt
  (if (< z -2.060202331921739e+104) (- x (/ (* z x) y)) (if (< z 1.6939766013828526e+213) (/ x (/ y (- y z))) (* (- y z) (/ x y))))

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