Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J

Percentage Accurate: 96.0% → 99.9%

Time: 8.6s

Alternatives: 9

Speedup: 1.0×

• 20.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

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 * (1.0d0 - ((1.0d0 - y) * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 * (1.0d0 - ((1.0d0 - y) * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 2 \cdot 10^{-7}:\\ \;\;\;\;x\_m + z \cdot \left(x\_m \cdot \left(y + -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 + z \cdot \left(y + -1\right)\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 2e-7)
    (+ x_m (* z (* x_m (+ y -1.0))))
    (* x_m (+ 1.0 (* z (+ y -1.0)))))))

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 <= 2e-7) {
		tmp = x_m + (z * (x_m * (y + -1.0)));
	} else {
		tmp = x_m * (1.0 + (z * (y + -1.0)));
	}
	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 <= 2d-7) then
        tmp = x_m + (z * (x_m * (y + (-1.0d0))))
    else
        tmp = x_m * (1.0d0 + (z * (y + (-1.0d0))))
    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 <= 2e-7) {
		tmp = x_m + (z * (x_m * (y + -1.0)));
	} else {
		tmp = x_m * (1.0 + (z * (y + -1.0)));
	}
	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 <= 2e-7:
		tmp = x_m + (z * (x_m * (y + -1.0)))
	else:
		tmp = x_m * (1.0 + (z * (y + -1.0)))
	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 <= 2e-7)
		tmp = Float64(x_m + Float64(z * Float64(x_m * Float64(y + -1.0))));
	else
		tmp = Float64(x_m * Float64(1.0 + Float64(z * Float64(y + -1.0))));
	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 <= 2e-7)
		tmp = x_m + (z * (x_m * (y + -1.0)));
	else
		tmp = x_m * (1.0 + (z * (y + -1.0)));
	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, 2e-7], N[(x$95$m + N[(z * N[(x$95$m * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(1.0 + N[(z * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.9999999999999999e-7

   1. Initial program 93.5%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. sub-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. fma-define N/A

         \[\leadsto \mathsf{fma}\left(1, \color{blue}{x}, \left(\mathsf{neg}\left(\left(1 - y\right) \cdot z\right)\right) \cdot x\right) \]

      4. distribute-lft-neg-out N/A

         \[\leadsto \mathsf{fma}\left(1, x, \mathsf{neg}\left(\left(\left(1 - y\right) \cdot z\right) \cdot x\right)\right) \]

      5. fmm-undef N/A

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

      6. *-lft-identity N/A

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

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \color{blue}{\left(\left(\left(1 - y\right) \cdot z\right) \cdot x\right)}\right) \]

      8. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\left(\left(1 - y\right) \cdot z\right), \color{blue}{x}\right)\right) \]

      9. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{*.f64}\left(\left(1 - y\right), z\right), x\right)\right) \]

      10. --lowering--.f64 93.5%

          \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(1, y\right), z\right), x\right)\right) \]

   4. Applied egg-rr 93.5%

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

      1. *-commutative N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \left(x \cdot \color{blue}{\left(\left(1 - y\right) \cdot z\right)}\right)\right) \]

      2. associate-*r* N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \left(\left(x \cdot \left(1 - y\right)\right) \cdot \color{blue}{z}\right)\right) \]

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\left(x \cdot \left(1 - y\right)\right), \color{blue}{z}\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(1 - y\right)\right), z\right)\right) \]

      5. --lowering--.f64 96.9%

         \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, y\right)\right), z\right)\right) \]

   6. Applied egg-rr 96.9%

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

   if 1.9999999999999999e-7 < x

   1. Initial program 99.9%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 97.7%

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

Alternative 2: 86.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := z \cdot \left(x\_m \cdot \left(y + -1\right)\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{-26}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 5.1 \cdot 10^{-14}:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \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
 (let* ((t_0 (* z (* x_m (+ y -1.0)))))
   (* x_s (if (<= z -3.6e-26) t_0 (if (<= z 5.1e-14) (* x_m (- 1.0 z)) t_0)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = z * (x_m * (y + -1.0));
	double tmp;
	if (z <= -3.6e-26) {
		tmp = t_0;
	} else if (z <= 5.1e-14) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = z * (x_m * (y + (-1.0d0)))
    if (z <= (-3.6d-26)) then
        tmp = t_0
    else if (z <= 5.1d-14) then
        tmp = x_m * (1.0d0 - z)
    else
        tmp = t_0
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = z * (x_m * (y + -1.0));
	double tmp;
	if (z <= -3.6e-26) {
		tmp = t_0;
	} else if (z <= 5.1e-14) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = z * (x_m * (y + -1.0))
	tmp = 0
	if z <= -3.6e-26:
		tmp = t_0
	elif z <= 5.1e-14:
		tmp = x_m * (1.0 - z)
	else:
		tmp = t_0
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(z * Float64(x_m * Float64(y + -1.0)))
	tmp = 0.0
	if (z <= -3.6e-26)
		tmp = t_0;
	elseif (z <= 5.1e-14)
		tmp = Float64(x_m * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = z * (x_m * (y + -1.0));
	tmp = 0.0;
	if (z <= -3.6e-26)
		tmp = t_0;
	elseif (z <= 5.1e-14)
		tmp = x_m * (1.0 - z);
	else
		tmp = t_0;
	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_] := Block[{t$95$0 = N[(z * N[(x$95$m * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[z, -3.6e-26], t$95$0, If[LessEqual[z, 5.1e-14], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6000000000000001e-26 or 5.0999999999999997e-14 < z

   1. Initial program 91.4%

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

   3. Taylor expanded in z around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(z \cdot \left(y - 1\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{\left(y - 1\right)}\right)\right) \]

      3. sub-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \left(y + \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right)\right)\right) \]

      4. metadata-eval N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \left(y + -1\right)\right)\right) \]

      5. +-lowering-+.f64 87.5%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \mathsf{+.f64}\left(y, \color{blue}{-1}\right)\right)\right) \]

   5. Simplified 87.5%

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. +-commutative N/A

         \[\leadsto \left(x \cdot \left(-1 + y\right)\right) \cdot z \]

      4. metadata-eval N/A

         \[\leadsto \left(x \cdot \left(\left(0 - 1\right) + y\right)\right) \cdot z \]

      5. associate--r- N/A

         \[\leadsto \left(x \cdot \left(0 - \left(1 - y\right)\right)\right) \cdot z \]

      6. neg-sub0 N/A

         \[\leadsto \left(x \cdot \left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)\right) \cdot z \]

      7. distribute-rgt-neg-in N/A

         \[\leadsto \left(\mathsf{neg}\left(x \cdot \left(1 - y\right)\right)\right) \cdot z \]

      8. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\mathsf{neg}\left(x \cdot \left(1 - y\right)\right)\right), \color{blue}{z}\right) \]

      9. distribute-rgt-neg-in N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x \cdot \left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)\right), z\right) \]

      10. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)\right), z\right) \]

      11. neg-sub0 N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(0 - \left(1 - y\right)\right)\right), z\right) \]

      12. associate--r- N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(\left(0 - 1\right) + y\right)\right), z\right) \]

      13. metadata-eval N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(-1 + y\right)\right), z\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(y + -1\right)\right), z\right) \]

      15. +-lowering-+.f64 96.0%

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(y, -1\right)\right), z\right) \]

   7. Applied egg-rr 96.0%

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

   if -3.6000000000000001e-26 < z < 5.0999999999999997e-14

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 - z\right)}\right) \]

      2. --lowering--.f64 79.2%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{z}\right)\right) \]

   5. Simplified 79.2%

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

4. Final simplification 88.6%

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

Alternative 3: 84.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -8.4 \cdot 10^{+20}:\\ \;\;\;\;z \cdot \left(x\_m \cdot y\right)\\ \mathbf{elif}\;y \leq 7.5 \cdot 10^{+74}:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x\_m \cdot z\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 (<= y -8.4e+20)
    (* z (* x_m y))
    (if (<= y 7.5e+74) (* x_m (- 1.0 z)) (* y (* x_m 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 (y <= -8.4e+20) {
		tmp = z * (x_m * y);
	} else if (y <= 7.5e+74) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = y * (x_m * 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 (y <= (-8.4d+20)) then
        tmp = z * (x_m * y)
    else if (y <= 7.5d+74) then
        tmp = x_m * (1.0d0 - z)
    else
        tmp = y * (x_m * 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 (y <= -8.4e+20) {
		tmp = z * (x_m * y);
	} else if (y <= 7.5e+74) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = y * (x_m * 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 y <= -8.4e+20:
		tmp = z * (x_m * y)
	elif y <= 7.5e+74:
		tmp = x_m * (1.0 - z)
	else:
		tmp = y * (x_m * 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 (y <= -8.4e+20)
		tmp = Float64(z * Float64(x_m * y));
	elseif (y <= 7.5e+74)
		tmp = Float64(x_m * Float64(1.0 - z));
	else
		tmp = Float64(y * Float64(x_m * 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 (y <= -8.4e+20)
		tmp = z * (x_m * y);
	elseif (y <= 7.5e+74)
		tmp = x_m * (1.0 - z);
	else
		tmp = y * (x_m * 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[y, -8.4e+20], N[(z * N[(x$95$m * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7.5e+74], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(y * N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -8.4e20

   1. Initial program 89.0%

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

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(y \cdot z\right)}\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(z \cdot \color{blue}{y}\right)\right) \]

      3. *-lowering-*.f64 62.2%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{y}\right)\right) \]

   5. Simplified 62.2%

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(y \cdot x\right), \color{blue}{z}\right) \]

      5. *-lowering-*.f64 72.9%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(y, x\right), z\right) \]

   7. Applied egg-rr 72.9%

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

   if -8.4e20 < y < 7.5e74

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 - z\right)}\right) \]

      2. --lowering--.f64 92.7%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{z}\right)\right) \]

   5. Simplified 92.7%

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

   if 7.5e74 < y

   1. Initial program 88.5%

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

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(y \cdot z\right)}\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(z \cdot \color{blue}{y}\right)\right) \]

      3. *-lowering-*.f64 75.6%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{y}\right)\right) \]

   5. Simplified 75.6%

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

      1. associate-*r* N/A

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

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x \cdot z\right), \color{blue}{y}\right) \]

      3. *-lowering-*.f64 85.1%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, z\right), y\right) \]

   7. Applied egg-rr 85.1%

      \[\leadsto \color{blue}{\left(x \cdot z\right) \cdot y} \]
3. Recombined 3 regimes into one program.

4. Final simplification 86.9%

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

Alternative 4: 84.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := y \cdot \left(x\_m \cdot z\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{+20}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3 \cdot 10^{+75}:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \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
 (let* ((t_0 (* y (* x_m z))))
   (* x_s (if (<= y -3.5e+20) t_0 (if (<= y 3e+75) (* x_m (- 1.0 z)) t_0)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = y * (x_m * z);
	double tmp;
	if (y <= -3.5e+20) {
		tmp = t_0;
	} else if (y <= 3e+75) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = y * (x_m * z)
    if (y <= (-3.5d+20)) then
        tmp = t_0
    else if (y <= 3d+75) then
        tmp = x_m * (1.0d0 - z)
    else
        tmp = t_0
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = y * (x_m * z);
	double tmp;
	if (y <= -3.5e+20) {
		tmp = t_0;
	} else if (y <= 3e+75) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = y * (x_m * z)
	tmp = 0
	if y <= -3.5e+20:
		tmp = t_0
	elif y <= 3e+75:
		tmp = x_m * (1.0 - z)
	else:
		tmp = t_0
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(y * Float64(x_m * z))
	tmp = 0.0
	if (y <= -3.5e+20)
		tmp = t_0;
	elseif (y <= 3e+75)
		tmp = Float64(x_m * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = y * (x_m * z);
	tmp = 0.0;
	if (y <= -3.5e+20)
		tmp = t_0;
	elseif (y <= 3e+75)
		tmp = x_m * (1.0 - z);
	else
		tmp = t_0;
	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_] := Block[{t$95$0 = N[(y * N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[y, -3.5e+20], t$95$0, If[LessEqual[y, 3e+75], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.5e20 or 3e75 < y

   1. Initial program 88.8%

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

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(y \cdot z\right)}\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(z \cdot \color{blue}{y}\right)\right) \]

      3. *-lowering-*.f64 69.2%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{y}\right)\right) \]

   5. Simplified 69.2%

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

      1. associate-*r* N/A

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

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x \cdot z\right), \color{blue}{y}\right) \]

      3. *-lowering-*.f64 78.3%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, z\right), y\right) \]

   7. Applied egg-rr 78.3%

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

   if -3.5e20 < y < 3e75

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 - z\right)}\right) \]

      2. --lowering--.f64 92.7%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{z}\right)\right) \]

   5. Simplified 92.7%

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

4. Final simplification 86.5%

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

Alternative 5: 82.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := x\_m \cdot \left(y \cdot z\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -2.2 \cdot 10^{+20}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3 \cdot 10^{+75}:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \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
 (let* ((t_0 (* x_m (* y z))))
   (* x_s (if (<= y -2.2e+20) t_0 (if (<= y 3e+75) (* x_m (- 1.0 z)) t_0)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = x_m * (y * z);
	double tmp;
	if (y <= -2.2e+20) {
		tmp = t_0;
	} else if (y <= 3e+75) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = x_m * (y * z)
    if (y <= (-2.2d+20)) then
        tmp = t_0
    else if (y <= 3d+75) then
        tmp = x_m * (1.0d0 - z)
    else
        tmp = t_0
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = x_m * (y * z);
	double tmp;
	if (y <= -2.2e+20) {
		tmp = t_0;
	} else if (y <= 3e+75) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = x_m * (y * z)
	tmp = 0
	if y <= -2.2e+20:
		tmp = t_0
	elif y <= 3e+75:
		tmp = x_m * (1.0 - z)
	else:
		tmp = t_0
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(x_m * Float64(y * z))
	tmp = 0.0
	if (y <= -2.2e+20)
		tmp = t_0;
	elseif (y <= 3e+75)
		tmp = Float64(x_m * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = x_m * (y * z);
	tmp = 0.0;
	if (y <= -2.2e+20)
		tmp = t_0;
	elseif (y <= 3e+75)
		tmp = x_m * (1.0 - z);
	else
		tmp = t_0;
	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_] := Block[{t$95$0 = N[(x$95$m * N[(y * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[y, -2.2e+20], t$95$0, If[LessEqual[y, 3e+75], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.2e20 or 3e75 < y

   1. Initial program 88.8%

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

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(y \cdot z\right)}\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(z \cdot \color{blue}{y}\right)\right) \]

      3. *-lowering-*.f64 69.2%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{y}\right)\right) \]

   5. Simplified 69.2%

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

   if -2.2e20 < y < 3e75

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 - z\right)}\right) \]

      2. --lowering--.f64 92.7%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{z}\right)\right) \]

   5. Simplified 92.7%

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

4. Final simplification 82.6%

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

Alternative 6: 59.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := x\_m \cdot \left(y \cdot z\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -4.1 \cdot 10^{-28}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.6 \cdot 10^{-15}:\\ \;\;\;\;x\_m\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \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
 (let* ((t_0 (* x_m (* y z))))
   (* x_s (if (<= z -4.1e-28) t_0 (if (<= z 1.6e-15) x_m t_0)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = x_m * (y * z);
	double tmp;
	if (z <= -4.1e-28) {
		tmp = t_0;
	} else if (z <= 1.6e-15) {
		tmp = x_m;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = x_m * (y * z)
    if (z <= (-4.1d-28)) then
        tmp = t_0
    else if (z <= 1.6d-15) then
        tmp = x_m
    else
        tmp = t_0
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = x_m * (y * z);
	double tmp;
	if (z <= -4.1e-28) {
		tmp = t_0;
	} else if (z <= 1.6e-15) {
		tmp = x_m;
	} else {
		tmp = t_0;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = x_m * (y * z)
	tmp = 0
	if z <= -4.1e-28:
		tmp = t_0
	elif z <= 1.6e-15:
		tmp = x_m
	else:
		tmp = t_0
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(x_m * Float64(y * z))
	tmp = 0.0
	if (z <= -4.1e-28)
		tmp = t_0;
	elseif (z <= 1.6e-15)
		tmp = x_m;
	else
		tmp = t_0;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = x_m * (y * z);
	tmp = 0.0;
	if (z <= -4.1e-28)
		tmp = t_0;
	elseif (z <= 1.6e-15)
		tmp = x_m;
	else
		tmp = t_0;
	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_] := Block[{t$95$0 = N[(x$95$m * N[(y * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[z, -4.1e-28], t$95$0, If[LessEqual[z, 1.6e-15], x$95$m, t$95$0]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.1000000000000002e-28 or 1.6e-15 < z

   1. Initial program 91.4%

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

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(y \cdot z\right)}\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(z \cdot \color{blue}{y}\right)\right) \]

      3. *-lowering-*.f64 45.0%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{y}\right)\right) \]

   5. Simplified 45.0%

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

   if -4.1000000000000002e-28 < z < 1.6e-15

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

   5. Simplified 79.1%

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

4. Final simplification 60.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.1 \cdot 10^{-28}:\\ \;\;\;\;x \cdot \left(y \cdot z\right)\\ \mathbf{elif}\;z \leq 1.6 \cdot 10^{-15}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 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}\;z \leq 255000000:\\ \;\;\;\;x\_m \cdot \left(1 + z \cdot \left(y + -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(x\_m \cdot \left(y + -1\right)\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 255000000.0)
    (* x_m (+ 1.0 (* z (+ y -1.0))))
    (* z (* x_m (+ y -1.0))))))

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 <= 255000000.0) {
		tmp = x_m * (1.0 + (z * (y + -1.0)));
	} else {
		tmp = z * (x_m * (y + -1.0));
	}
	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 <= 255000000.0d0) then
        tmp = x_m * (1.0d0 + (z * (y + (-1.0d0))))
    else
        tmp = z * (x_m * (y + (-1.0d0)))
    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 <= 255000000.0) {
		tmp = x_m * (1.0 + (z * (y + -1.0)));
	} else {
		tmp = z * (x_m * (y + -1.0));
	}
	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 <= 255000000.0:
		tmp = x_m * (1.0 + (z * (y + -1.0)))
	else:
		tmp = z * (x_m * (y + -1.0))
	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 <= 255000000.0)
		tmp = Float64(x_m * Float64(1.0 + Float64(z * Float64(y + -1.0))));
	else
		tmp = Float64(z * Float64(x_m * Float64(y + -1.0)));
	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 <= 255000000.0)
		tmp = x_m * (1.0 + (z * (y + -1.0)));
	else
		tmp = z * (x_m * (y + -1.0));
	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, 255000000.0], N[(x$95$m * N[(1.0 + N[(z * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(x$95$m * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 2.55e8

   1. Initial program 98.1%

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

   if 2.55e8 < z

   1. Initial program 85.4%

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

   3. Taylor expanded in z around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(z \cdot \left(y - 1\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \color{blue}{\left(y - 1\right)}\right)\right) \]

      3. sub-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \left(y + \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right)\right)\right) \]

      4. metadata-eval N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \left(y + -1\right)\right)\right) \]

      5. +-lowering-+.f64 85.4%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(z, \mathsf{+.f64}\left(y, \color{blue}{-1}\right)\right)\right) \]

   5. Simplified 85.4%

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. +-commutative N/A

         \[\leadsto \left(x \cdot \left(-1 + y\right)\right) \cdot z \]

      4. metadata-eval N/A

         \[\leadsto \left(x \cdot \left(\left(0 - 1\right) + y\right)\right) \cdot z \]

      5. associate--r- N/A

         \[\leadsto \left(x \cdot \left(0 - \left(1 - y\right)\right)\right) \cdot z \]

      6. neg-sub0 N/A

         \[\leadsto \left(x \cdot \left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)\right) \cdot z \]

      7. distribute-rgt-neg-in N/A

         \[\leadsto \left(\mathsf{neg}\left(x \cdot \left(1 - y\right)\right)\right) \cdot z \]

      8. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\mathsf{neg}\left(x \cdot \left(1 - y\right)\right)\right), \color{blue}{z}\right) \]

      9. distribute-rgt-neg-in N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x \cdot \left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)\right), z\right) \]

      10. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)\right), z\right) \]

      11. neg-sub0 N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(0 - \left(1 - y\right)\right)\right), z\right) \]

      12. associate--r- N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(\left(0 - 1\right) + y\right)\right), z\right) \]

      13. metadata-eval N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(-1 + y\right)\right), z\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \left(y + -1\right)\right), z\right) \]

      15. +-lowering-+.f64 99.9%

          \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(y, -1\right)\right), z\right) \]

   7. Applied egg-rr 99.9%

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

4. Final simplification 98.5%

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

Alternative 8: 97.9% 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 + \left(x\_m \cdot z\right) \cdot \left(y + -1\right)\right) \end{array} \]

FPCore

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

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 * z) * (y + -1.0)));
}

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 * z) * (y + (-1.0d0))))
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 * z) * (y + -1.0)));
}

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 * z) * (y + -1.0)))

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(Float64(x_m * z) * Float64(y + -1.0))))
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 * z) * (y + -1.0)));
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[(N[(x$95$m * z), $MachinePrecision] * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 95.2%

   \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. sub-neg N/A

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

   2. distribute-rgt-in N/A

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

   3. fma-define N/A

      \[\leadsto \mathsf{fma}\left(1, \color{blue}{x}, \left(\mathsf{neg}\left(\left(1 - y\right) \cdot z\right)\right) \cdot x\right) \]

   4. distribute-lft-neg-out N/A

      \[\leadsto \mathsf{fma}\left(1, x, \mathsf{neg}\left(\left(\left(1 - y\right) \cdot z\right) \cdot x\right)\right) \]

   5. fmm-undef N/A

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

   6. *-lft-identity N/A

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

   7. --lowering--.f64 N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \color{blue}{\left(\left(\left(1 - y\right) \cdot z\right) \cdot x\right)}\right) \]

   8. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\left(\left(1 - y\right) \cdot z\right), \color{blue}{x}\right)\right) \]

   9. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{*.f64}\left(\left(1 - y\right), z\right), x\right)\right) \]

   10. --lowering--.f64 95.2%

       \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(1, y\right), z\right), x\right)\right) \]

4. Applied egg-rr 95.2%

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

   1. --lowering--.f64 N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \color{blue}{\left(\left(\left(1 - y\right) \cdot z\right) \cdot x\right)}\right) \]

   2. associate-*l* N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \left(\left(1 - y\right) \cdot \color{blue}{\left(z \cdot x\right)}\right)\right) \]

   3. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\left(1 - y\right), \color{blue}{\left(z \cdot x\right)}\right)\right) \]

   4. --lowering--.f64 N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(1, y\right), \left(\color{blue}{z} \cdot x\right)\right)\right) \]

   5. *-commutative N/A

      \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(1, y\right), \left(x \cdot \color{blue}{z}\right)\right)\right) \]

   6. *-lowering-*.f64 98.7%

      \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(1, y\right), \mathsf{*.f64}\left(x, \color{blue}{z}\right)\right)\right) \]

6. Applied egg-rr 98.7%

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

7. Final simplification 98.7%

   \[\leadsto x + \left(x \cdot z\right) \cdot \left(y + -1\right) \]
8. Add Preprocessing

Alternative 9: 39.0% accurate, 9.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 95.2%

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

3. Taylor expanded in z around 0

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

5. Simplified 37.2%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Developer Target 1: 99.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(1 - \left(1 - y\right) \cdot z\right)\\ t_1 := x + \left(1 - y\right) \cdot \left(\left(-z\right) \cdot x\right)\\ \mathbf{if}\;t\_0 < -1.618195973607049 \cdot 10^{+50}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 < 3.892237649663903 \cdot 10^{+134}:\\ \;\;\;\;\left(x \cdot y\right) \cdot z - \left(x \cdot z - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- 1.0 (* (- 1.0 y) z))))
        (t_1 (+ x (* (- 1.0 y) (* (- z) x)))))
   (if (< t_0 -1.618195973607049e+50)
     t_1
     (if (< t_0 3.892237649663903e+134) (- (* (* x y) z) (- (* x z) x)) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = x * (1.0 - ((1.0 - y) * z));
	double t_1 = x + ((1.0 - y) * (-z * x));
	double tmp;
	if (t_0 < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (t_0 < 3.892237649663903e+134) {
		tmp = ((x * y) * z) - ((x * z) - x);
	} else {
		tmp = t_1;
	}
	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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = x * (1.0d0 - ((1.0d0 - y) * z))
    t_1 = x + ((1.0d0 - y) * (-z * x))
    if (t_0 < (-1.618195973607049d+50)) then
        tmp = t_1
    else if (t_0 < 3.892237649663903d+134) then
        tmp = ((x * y) * z) - ((x * z) - x)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * (1.0 - ((1.0 - y) * z));
	double t_1 = x + ((1.0 - y) * (-z * x));
	double tmp;
	if (t_0 < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (t_0 < 3.892237649663903e+134) {
		tmp = ((x * y) * z) - ((x * z) - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (1.0 - ((1.0 - y) * z))
	t_1 = x + ((1.0 - y) * (-z * x))
	tmp = 0
	if t_0 < -1.618195973607049e+50:
		tmp = t_1
	elif t_0 < 3.892237649663903e+134:
		tmp = ((x * y) * z) - ((x * z) - x)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(1.0 - Float64(Float64(1.0 - y) * z)))
	t_1 = Float64(x + Float64(Float64(1.0 - y) * Float64(Float64(-z) * x)))
	tmp = 0.0
	if (t_0 < -1.618195973607049e+50)
		tmp = t_1;
	elseif (t_0 < 3.892237649663903e+134)
		tmp = Float64(Float64(Float64(x * y) * z) - Float64(Float64(x * z) - x));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (1.0 - ((1.0 - y) * z));
	t_1 = x + ((1.0 - y) * (-z * x));
	tmp = 0.0;
	if (t_0 < -1.618195973607049e+50)
		tmp = t_1;
	elseif (t_0 < 3.892237649663903e+134)
		tmp = ((x * y) * z) - ((x * z) - x);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[(1.0 - N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x + N[(N[(1.0 - y), $MachinePrecision] * N[((-z) * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$0, -1.618195973607049e+50], t$95$1, If[Less[t$95$0, 3.892237649663903e+134], N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] - N[(N[(x * z), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2024149 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (* x (- 1 (* (- 1 y) z))) -161819597360704900000000000000000000000000000000000) (+ x (* (- 1 y) (* (- z) x))) (if (< (* x (- 1 (* (- 1 y) z))) 389223764966390300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* x y) z) (- (* x z) x)) (+ x (* (- 1 y) (* (- z) x))))))

  (* x (- 1.0 (* (- 1.0 y) z))))