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

Percentage Accurate: 96.2% → 98.2%

Time: 9.3s

Alternatives: 12

Speedup: 0.7×

• 21.1% 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.2% 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: 98.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \left(y \cdot x - x\right)\\ \mathbf{if}\;z \leq -1.32 \cdot 10^{+19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;\mathsf{fma}\left(y \cdot z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (- (* y x) x))))
   (if (<= z -1.32e+19) t_0 (if (<= z 1.0) (fma (* y z) x x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * ((y * x) - x);
	double tmp;
	if (z <= -1.32e+19) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = fma((y * z), x, x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * Float64(Float64(y * x) - x))
	tmp = 0.0
	if (z <= -1.32e+19)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = fma(Float64(y * z), x, x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[(N[(y * x), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.32e+19], t$95$0, If[LessEqual[z, 1.0], N[(N[(y * z), $MachinePrecision] * x + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.32e19 or 1 < z

   1. Initial program 92.6%

      \[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. associate-*r* N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. *-commutative N/A

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

      7. cancel-sign-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-rgt-identity N/A

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

      10. distribute-lft-out-- N/A

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

      11. mul-1-neg N/A

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

      12. *-commutative N/A

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

      13. distribute-lft-neg-in N/A

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

      14. associate-*r* N/A

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

      15. distribute-lft-neg-in N/A

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

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

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

      17. lower-*.f64 N/A

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

      18. distribute-rgt-out-- N/A

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

      19. *-lft-identity N/A

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

      20. unsub-neg N/A

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

      21. +-commutative N/A

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

      22. distribute-neg-in N/A

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

      23. remove-double-neg N/A

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

      24. unsub-neg N/A

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

      25. lower--.f64 N/A

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

      26. lower-*.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -1.32e19 < z < 1

   1. Initial program 99.9%

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

   4. Applied rewrites 94.7%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-+.f64 N/A

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

      8. distribute-rgt-in N/A

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

      9. neg-mul-1 N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 99.9

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

   6. Applied rewrites 99.9%

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

   7. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 98.6

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

   9. Applied rewrites 98.6%

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

4. Final simplification 99.1%

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

Alternative 2: 96.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(z \cdot x, y, x\right)\\ \mathbf{if}\;1 - y \leq -4 \cdot 10^{+15}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;1 - y \leq 2:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (* z x) y x)))
   (if (<= (- 1.0 y) -4e+15) t_0 (if (<= (- 1.0 y) 2.0) (* x (- 1.0 z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma((z * x), y, x);
	double tmp;
	if ((1.0 - y) <= -4e+15) {
		tmp = t_0;
	} else if ((1.0 - y) <= 2.0) {
		tmp = x * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(Float64(z * x), y, x)
	tmp = 0.0
	if (Float64(1.0 - y) <= -4e+15)
		tmp = t_0;
	elseif (Float64(1.0 - y) <= 2.0)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z * x), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[N[(1.0 - y), $MachinePrecision], -4e+15], t$95$0, If[LessEqual[N[(1.0 - y), $MachinePrecision], 2.0], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -4e15 or 2 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 92.4%

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

   4. Applied rewrites 94.6%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-+.f64 N/A

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

      8. distribute-rgt-in N/A

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

      9. neg-mul-1 N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 92.4

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

   6. Applied rewrites 92.4%

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

   7. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 92.2

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

   9. Applied rewrites 92.2%

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

       1. associate-*l* N/A

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

       2. *-commutative N/A

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

       3. associate-*r* N/A

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

       4. lift-*.f64 N/A

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

       5. lower-fma.f64 94.4

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

   11. Applied rewrites 94.4%

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

   if -4e15 < (-.f64 #s(literal 1 binary64) y) < 2

   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 x \cdot \color{blue}{\left(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 99.6

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

   5. Applied rewrites 99.6%

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

Alternative 3: 85.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - y \leq -5 \cdot 10^{+45}:\\ \;\;\;\;y \cdot \left(z \cdot x\right)\\ \mathbf{elif}\;1 - y \leq 10^{+86}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(y \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (- 1.0 y) -5e+45)
   (* y (* z x))
   (if (<= (- 1.0 y) 1e+86) (* x (- 1.0 z)) (* z (* y x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -5e+45) {
		tmp = y * (z * x);
	} else if ((1.0 - y) <= 1e+86) {
		tmp = x * (1.0 - z);
	} else {
		tmp = z * (y * x);
	}
	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 ((1.0d0 - y) <= (-5d+45)) then
        tmp = y * (z * x)
    else if ((1.0d0 - y) <= 1d+86) then
        tmp = x * (1.0d0 - z)
    else
        tmp = z * (y * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -5e+45) {
		tmp = y * (z * x);
	} else if ((1.0 - y) <= 1e+86) {
		tmp = x * (1.0 - z);
	} else {
		tmp = z * (y * x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (1.0 - y) <= -5e+45:
		tmp = y * (z * x)
	elif (1.0 - y) <= 1e+86:
		tmp = x * (1.0 - z)
	else:
		tmp = z * (y * x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -5e+45)
		tmp = Float64(y * Float64(z * x));
	elseif (Float64(1.0 - y) <= 1e+86)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = Float64(z * Float64(y * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 - y) <= -5e+45)
		tmp = y * (z * x);
	elseif ((1.0 - y) <= 1e+86)
		tmp = x * (1.0 - z);
	else
		tmp = z * (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(1.0 - y), $MachinePrecision], -5e+45], N[(y * N[(z * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(1.0 - y), $MachinePrecision], 1e+86], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(z * N[(y * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -5e45

   1. Initial program 90.3%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 73.8

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

   5. Applied rewrites 73.8%

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-*.f64 78.4

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

   7. Applied rewrites 78.4%

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

   if -5e45 < (-.f64 #s(literal 1 binary64) y) < 1e86

   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 x \cdot \color{blue}{\left(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 94.9

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

   5. Applied rewrites 94.9%

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

   if 1e86 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 91.2%

      \[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. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 76.6

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

   5. Applied rewrites 76.6%

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

4. Final simplification 87.9%

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

Alternative 4: 85.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \left(y \cdot x\right)\\ \mathbf{if}\;1 - y \leq -5 \cdot 10^{+45}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;1 - y \leq 10^{+86}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (* y x))))
   (if (<= (- 1.0 y) -5e+45)
     t_0
     (if (<= (- 1.0 y) 1e+86) (* x (- 1.0 z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * (y * x);
	double tmp;
	if ((1.0 - y) <= -5e+45) {
		tmp = t_0;
	} else if ((1.0 - y) <= 1e+86) {
		tmp = x * (1.0 - z);
	} else {
		tmp = t_0;
	}
	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) :: tmp
    t_0 = z * (y * x)
    if ((1.0d0 - y) <= (-5d+45)) then
        tmp = t_0
    else if ((1.0d0 - y) <= 1d+86) then
        tmp = x * (1.0d0 - z)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = z * (y * x);
	double tmp;
	if ((1.0 - y) <= -5e+45) {
		tmp = t_0;
	} else if ((1.0 - y) <= 1e+86) {
		tmp = x * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * (y * x)
	tmp = 0
	if (1.0 - y) <= -5e+45:
		tmp = t_0
	elif (1.0 - y) <= 1e+86:
		tmp = x * (1.0 - z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * Float64(y * x))
	tmp = 0.0
	if (Float64(1.0 - y) <= -5e+45)
		tmp = t_0;
	elseif (Float64(1.0 - y) <= 1e+86)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * (y * x);
	tmp = 0.0;
	if ((1.0 - y) <= -5e+45)
		tmp = t_0;
	elseif ((1.0 - y) <= 1e+86)
		tmp = x * (1.0 - z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[(y * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(1.0 - y), $MachinePrecision], -5e+45], t$95$0, If[LessEqual[N[(1.0 - y), $MachinePrecision], 1e+86], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -5e45 or 1e86 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 90.7%

      \[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. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 76.1

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

   5. Applied rewrites 76.1%

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

   if -5e45 < (-.f64 #s(literal 1 binary64) y) < 1e86

   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 x \cdot \color{blue}{\left(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 94.9

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

   5. Applied rewrites 94.9%

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

Alternative 5: 82.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(y \cdot z\right)\\ \mathbf{if}\;1 - y \leq -5 \cdot 10^{+45}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;1 - y \leq 10^{+133}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (* y z))))
   (if (<= (- 1.0 y) -5e+45)
     t_0
     (if (<= (- 1.0 y) 1e+133) (* x (- 1.0 z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * (y * z);
	double tmp;
	if ((1.0 - y) <= -5e+45) {
		tmp = t_0;
	} else if ((1.0 - y) <= 1e+133) {
		tmp = x * (1.0 - z);
	} else {
		tmp = t_0;
	}
	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) :: tmp
    t_0 = x * (y * z)
    if ((1.0d0 - y) <= (-5d+45)) then
        tmp = t_0
    else if ((1.0d0 - y) <= 1d+133) then
        tmp = x * (1.0d0 - z)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * (y * z);
	double tmp;
	if ((1.0 - y) <= -5e+45) {
		tmp = t_0;
	} else if ((1.0 - y) <= 1e+133) {
		tmp = x * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (y * z)
	tmp = 0
	if (1.0 - y) <= -5e+45:
		tmp = t_0
	elif (1.0 - y) <= 1e+133:
		tmp = x * (1.0 - z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(y * z))
	tmp = 0.0
	if (Float64(1.0 - y) <= -5e+45)
		tmp = t_0;
	elseif (Float64(1.0 - y) <= 1e+133)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (y * z);
	tmp = 0.0;
	if ((1.0 - y) <= -5e+45)
		tmp = t_0;
	elseif ((1.0 - y) <= 1e+133)
		tmp = x * (1.0 - z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(1.0 - y), $MachinePrecision], -5e+45], t$95$0, If[LessEqual[N[(1.0 - y), $MachinePrecision], 1e+133], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -5e45 or 1e133 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 90.8%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 73.7

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

   5. Applied rewrites 73.7%

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

   if -5e45 < (-.f64 #s(literal 1 binary64) y) < 1e133

   1. Initial program 99.4%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 92.8

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

   5. Applied rewrites 92.8%

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

4. Final simplification 85.8%

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

Alternative 6: 97.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(1 - y\right) \cdot z \leq 700000000:\\ \;\;\;\;\mathsf{fma}\left(y + -1, z \cdot x, x\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(y \cdot x - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* (- 1.0 y) z) 700000000.0)
   (fma (+ y -1.0) (* z x) x)
   (* z (- (* y x) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (((1.0 - y) * z) <= 700000000.0) {
		tmp = fma((y + -1.0), (z * x), x);
	} else {
		tmp = z * ((y * x) - x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(1.0 - y) * z) <= 700000000.0)
		tmp = fma(Float64(y + -1.0), Float64(z * x), x);
	else
		tmp = Float64(z * Float64(Float64(y * x) - x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 #s(literal 1 binary64) y) z) < 7e8

   1. Initial program 96.7%

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

   4. Applied rewrites 98.8%

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

   if 7e8 < (*.f64 (-.f64 #s(literal 1 binary64) y) z)

   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 inf

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

      1. associate-*r* N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. *-commutative N/A

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

      7. cancel-sign-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-rgt-identity N/A

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

      10. distribute-lft-out-- N/A

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

      11. mul-1-neg N/A

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

      12. *-commutative N/A

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

      13. distribute-lft-neg-in N/A

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

      14. associate-*r* N/A

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

      15. distribute-lft-neg-in N/A

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

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

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

      17. lower-*.f64 N/A

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

      18. distribute-rgt-out-- N/A

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

      19. *-lft-identity N/A

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

      20. unsub-neg N/A

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

      21. +-commutative N/A

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

      22. distribute-neg-in N/A

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

      23. remove-double-neg N/A

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

      24. unsub-neg N/A

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

      25. lower--.f64 N/A

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

      26. lower-*.f64 99.2

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

   5. Applied rewrites 99.2%

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

Alternative 7: 98.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(1 - y\right) \cdot z \leq -2 \cdot 10^{+273}:\\ \;\;\;\;z \cdot \left(y \cdot x - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot \left(y + -1\right), x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* (- 1.0 y) z) -2e+273)
   (* z (- (* y x) x))
   (fma (* z (+ y -1.0)) x x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (((1.0 - y) * z) <= -2e+273) {
		tmp = z * ((y * x) - x);
	} else {
		tmp = fma((z * (y + -1.0)), x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(1.0 - y) * z) <= -2e+273)
		tmp = Float64(z * Float64(Float64(y * x) - x));
	else
		tmp = fma(Float64(z * Float64(y + -1.0)), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision], -2e+273], N[(z * N[(N[(y * x), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], N[(N[(z * N[(y + -1.0), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 #s(literal 1 binary64) y) z) < -1.99999999999999989e273

   1. Initial program 78.9%

      \[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. associate-*r* N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. *-commutative N/A

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

      7. cancel-sign-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-rgt-identity N/A

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

      10. distribute-lft-out-- N/A

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

      11. mul-1-neg N/A

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

      12. *-commutative N/A

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

      13. distribute-lft-neg-in N/A

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

      14. associate-*r* N/A

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

      15. distribute-lft-neg-in N/A

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

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

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

      17. lower-*.f64 N/A

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

      18. distribute-rgt-out-- N/A

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

      19. *-lft-identity N/A

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

      20. unsub-neg N/A

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

      21. +-commutative N/A

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

      22. distribute-neg-in N/A

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

      23. remove-double-neg N/A

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

      24. unsub-neg N/A

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

      25. lower--.f64 N/A

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

      26. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   if -1.99999999999999989e273 < (*.f64 (-.f64 #s(literal 1 binary64) y) z)

   1. Initial program 98.3%

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

   4. Applied rewrites 98.3%

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

Alternative 8: 40.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 + z \cdot \left(y + -1\right) \leq -500000000:\\ \;\;\;\;z \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ 1.0 (* z (+ y -1.0))) -500000000.0) (* z x) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 + (z * (y + -1.0))) <= -500000000.0) {
		tmp = z * x;
	} else {
		tmp = x;
	}
	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 ((1.0d0 + (z * (y + (-1.0d0)))) <= (-500000000.0d0)) then
        tmp = z * x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((1.0 + (z * (y + -1.0))) <= -500000000.0) {
		tmp = z * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (1.0 + (z * (y + -1.0))) <= -500000000.0:
		tmp = z * x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 + Float64(z * Float64(y + -1.0))) <= -500000000.0)
		tmp = Float64(z * x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 + (z * (y + -1.0))) <= -500000000.0)
		tmp = z * x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < -5e8

   1. Initial program 95.3%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 51.6

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

   5. Applied rewrites 51.6%

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

   6. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 51.8

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

   8. Applied rewrites 51.8%

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

      1. distribute-rgt-neg-out N/A

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

      2. distribute-lft-neg-in N/A

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

      3. neg-sub0 N/A

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

      4. flip3-- N/A

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

      5. metadata-eval N/A

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

      6. neg-sub0 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left({z}^{3}\right)}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)} \cdot x \]

      7. distribute-neg-frac N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{{z}^{3}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right)} \cdot x \]

      8. sqr-pow N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{{z}^{\left(\frac{3}{2}\right)} \cdot {z}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      9. pow-prod-down N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{{\left(z \cdot z\right)}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      10. sqr-neg N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{{\color{blue}{\left(\left(\mathsf{neg}\left(z\right)\right) \cdot \left(\mathsf{neg}\left(z\right)\right)\right)}}^{\left(\frac{3}{2}\right)}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      11. lift-neg.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{{\left(\color{blue}{\left(\mathsf{neg}\left(z\right)\right)} \cdot \left(\mathsf{neg}\left(z\right)\right)\right)}^{\left(\frac{3}{2}\right)}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      12. lift-neg.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{{\left(\left(\mathsf{neg}\left(z\right)\right) \cdot \color{blue}{\left(\mathsf{neg}\left(z\right)\right)}\right)}^{\left(\frac{3}{2}\right)}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      13. pow-prod-down N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{{\left(\mathsf{neg}\left(z\right)\right)}^{\left(\frac{3}{2}\right)} \cdot {\left(\mathsf{neg}\left(z\right)\right)}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      14. sqr-pow N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{{\left(\mathsf{neg}\left(z\right)\right)}^{3}}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      15. lift-neg.f64 N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{{\color{blue}{\left(\mathsf{neg}\left(z\right)\right)}}^{3}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      16. cube-neg N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\mathsf{neg}\left({z}^{3}\right)}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      17. neg-sub0 N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{0 - {z}^{3}}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      18. metadata-eval N/A

          \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{{0}^{3}} - {z}^{3}}{0 \cdot 0 + \left(z \cdot z + 0 \cdot z\right)}\right)\right) \cdot x \]

      19. flip3-- N/A

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

      20. neg-sub0 N/A

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

      21. remove-double-neg N/A

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

   10. Applied rewrites 9.1%

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

   if -5e8 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z))

   1. Initial program 96.7%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 53.0%

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

      1. *-rgt-identity 53.0

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

   7. Applied rewrites 53.0%

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

4. Final simplification 38.9%

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

Alternative 9: 65.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -z \cdot x\\ \mathbf{if}\;z \leq -0.0023:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (* z x)))) (if (<= z -0.0023) t_0 (if (<= z 1.0) x t_0))))

C

double code(double x, double y, double z) {
	double t_0 = -(z * x);
	double tmp;
	if (z <= -0.0023) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	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) :: tmp
    t_0 = -(z * x)
    if (z <= (-0.0023d0)) then
        tmp = t_0
    else if (z <= 1.0d0) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = -(z * x);
	double tmp;
	if (z <= -0.0023) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -(z * x)
	tmp = 0
	if z <= -0.0023:
		tmp = t_0
	elif z <= 1.0:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(-Float64(z * x))
	tmp = 0.0
	if (z <= -0.0023)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -(z * x);
	tmp = 0.0;
	if (z <= -0.0023)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = (-N[(z * x), $MachinePrecision])}, If[LessEqual[z, -0.0023], t$95$0, If[LessEqual[z, 1.0], x, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -0.0023 or 1 < z

   1. Initial program 92.7%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 60.0

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

   5. Applied rewrites 60.0%

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

   6. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 59.6

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

   8. Applied rewrites 59.6%

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

   if -0.0023 < z < 1

   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 x \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 71.6%

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

      1. *-rgt-identity 71.6

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

   7. Applied rewrites 71.6%

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

4. Final simplification 65.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.0023:\\ \;\;\;\;-z \cdot x\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;-z \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 69.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - y \leq -3400:\\ \;\;\;\;x \cdot \left(1 + z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (- 1.0 y) -3400.0) (* x (+ 1.0 z)) (* x (- 1.0 z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -3400.0) {
		tmp = x * (1.0 + z);
	} else {
		tmp = x * (1.0 - z);
	}
	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 ((1.0d0 - y) <= (-3400.0d0)) then
        tmp = x * (1.0d0 + z)
    else
        tmp = x * (1.0d0 - z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -3400.0) {
		tmp = x * (1.0 + z);
	} else {
		tmp = x * (1.0 - z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (1.0 - y) <= -3400.0:
		tmp = x * (1.0 + z)
	else:
		tmp = x * (1.0 - z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -3400.0)
		tmp = Float64(x * Float64(1.0 + z));
	else
		tmp = Float64(x * Float64(1.0 - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 - y) <= -3400.0)
		tmp = x * (1.0 + z);
	else
		tmp = x * (1.0 - z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -3400

   1. Initial program 91.5%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 25.5

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

   5. Applied rewrites 25.5%

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

   7. Applied rewrites 41.6%

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

   if -3400 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 97.9%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 80.9

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

   5. Applied rewrites 80.9%

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

4. Final simplification 70.4%

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

Alternative 11: 66.0% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x * (1.0 - 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 - z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.2%

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

3. Taylor expanded in y around 0

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

   1. lower--.f64 66.2

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

5. Applied rewrites 66.2%

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

Alternative 12: 38.5% accurate, 17.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 x)

C

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

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
end function

Java

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

Python

def code(x, y, z):
	return x

Julia

function code(x, y, z)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 96.2%

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

3. Taylor expanded in z around 0

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

5. Applied rewrites 36.5%

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

   1. *-rgt-identity 36.5

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

7. Applied rewrites 36.5%

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

Developer Target 1: 99.7% accurate, 0.3× 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 2024219 
(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))))