Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3

Percentage Accurate: 97.8% → 100.0%

Time: 5.6s

Alternatives: 7

Speedup: 1.7×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y - z, x, z\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. mul-1-neg N/A

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

   4. remove-double-neg N/A

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

   5. mul-1-neg N/A

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

   6. distribute-neg-in N/A

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

   7. +-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. +-commutative N/A

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

   10. distribute-neg-in N/A

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

   11. mul-1-neg N/A

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

   12. remove-double-neg N/A

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

   13. unsub-neg N/A

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

   14. lower--.f64 100.0

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

5. Applied rewrites 100.0%

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

Alternative 2: 61.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- z) x)))
   (if (<= x -4.2e+17)
     t_0
     (if (<= x -8.5e-26) (* y x) (if (<= x 1.0) (* 1.0 z) t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = -z * x;
	double tmp;
	if (x <= -4.2e+17) {
		tmp = t_0;
	} else if (x <= -8.5e-26) {
		tmp = y * x;
	} else if (x <= 1.0) {
		tmp = 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 * x
    if (x <= (-4.2d+17)) then
        tmp = t_0
    else if (x <= (-8.5d-26)) then
        tmp = y * x
    else if (x <= 1.0d0) then
        tmp = 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 * x;
	double tmp;
	if (x <= -4.2e+17) {
		tmp = t_0;
	} else if (x <= -8.5e-26) {
		tmp = y * x;
	} else if (x <= 1.0) {
		tmp = 1.0 * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -z * x
	tmp = 0
	if x <= -4.2e+17:
		tmp = t_0
	elif x <= -8.5e-26:
		tmp = y * x
	elif x <= 1.0:
		tmp = 1.0 * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-z) * x)
	tmp = 0.0
	if (x <= -4.2e+17)
		tmp = t_0;
	elseif (x <= -8.5e-26)
		tmp = Float64(y * x);
	elseif (x <= 1.0)
		tmp = Float64(1.0 * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -z * x;
	tmp = 0.0;
	if (x <= -4.2e+17)
		tmp = t_0;
	elseif (x <= -8.5e-26)
		tmp = y * x;
	elseif (x <= 1.0)
		tmp = 1.0 * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -4.2e17 or 1 < x

   1. Initial program 95.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 62.0%

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

   if -4.2e17 < x < -8.50000000000000004e-26

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 35.7

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

   5. Applied rewrites 35.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 12.6%

      \[\leadsto 1 \cdot z \]

   9. Taylor expanded in y around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 67.6

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

   11. Applied rewrites 67.6%

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

   if -8.50000000000000004e-26 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 76.6

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

   5. Applied rewrites 76.6%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 74.7%

      \[\leadsto 1 \cdot z \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 85.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-26} \lor \neg \left(x \leq 0.155\right):\\ \;\;\;\;\left(y - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, x, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -8.5e-26) (not (<= x 0.155))) (* (- y z) x) (fma (- z) x z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.5e-26) || !(x <= 0.155)) {
		tmp = (y - z) * x;
	} else {
		tmp = fma(-z, x, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -8.5e-26) || !(x <= 0.155))
		tmp = Float64(Float64(y - z) * x);
	else
		tmp = fma(Float64(-z), x, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -8.5e-26], N[Not[LessEqual[x, 0.155]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * x), $MachinePrecision], N[((-z) * x + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.50000000000000004e-26 or 0.154999999999999999 < x

   1. Initial program 95.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -8.50000000000000004e-26 < x < 0.154999999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 77.2

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

   5. Applied rewrites 77.2%

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

   7. Applied rewrites 77.2%

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

4. Final simplification 87.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-26} \lor \neg \left(x \leq 0.155\right):\\ \;\;\;\;\left(y - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, x, z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 85.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-26} \lor \neg \left(x \leq 0.155\right):\\ \;\;\;\;\left(y - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(1 - x\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -8.5e-26) (not (<= x 0.155))) (* (- y z) x) (* (- 1.0 x) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.5e-26) || !(x <= 0.155)) {
		tmp = (y - z) * x;
	} else {
		tmp = (1.0 - x) * 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 ((x <= (-8.5d-26)) .or. (.not. (x <= 0.155d0))) then
        tmp = (y - z) * x
    else
        tmp = (1.0d0 - x) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.5e-26) || !(x <= 0.155)) {
		tmp = (y - z) * x;
	} else {
		tmp = (1.0 - x) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -8.5e-26) or not (x <= 0.155):
		tmp = (y - z) * x
	else:
		tmp = (1.0 - x) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -8.5e-26) || !(x <= 0.155))
		tmp = Float64(Float64(y - z) * x);
	else
		tmp = Float64(Float64(1.0 - x) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -8.5e-26) || ~((x <= 0.155)))
		tmp = (y - z) * x;
	else
		tmp = (1.0 - x) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -8.5e-26], N[Not[LessEqual[x, 0.155]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * x), $MachinePrecision], N[(N[(1.0 - x), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.50000000000000004e-26 or 0.154999999999999999 < x

   1. Initial program 95.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -8.50000000000000004e-26 < x < 0.154999999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 77.2

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

   5. Applied rewrites 77.2%

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

4. Final simplification 87.8%

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

Alternative 5: 75.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.4 \cdot 10^{+40} \lor \neg \left(y \leq 5 \cdot 10^{+89}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(1 - x\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -3.4e+40) (not (<= y 5e+89))) (* y x) (* (- 1.0 x) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3.4e+40) || !(y <= 5e+89)) {
		tmp = y * x;
	} else {
		tmp = (1.0 - x) * 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 ((y <= (-3.4d+40)) .or. (.not. (y <= 5d+89))) then
        tmp = y * x
    else
        tmp = (1.0d0 - x) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3.4e+40) || !(y <= 5e+89)) {
		tmp = y * x;
	} else {
		tmp = (1.0 - x) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -3.4e+40) or not (y <= 5e+89):
		tmp = y * x
	else:
		tmp = (1.0 - x) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -3.4e+40) || !(y <= 5e+89))
		tmp = Float64(y * x);
	else
		tmp = Float64(Float64(1.0 - x) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -3.4e+40) || ~((y <= 5e+89)))
		tmp = y * x;
	else
		tmp = (1.0 - x) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -3.4e+40], N[Not[LessEqual[y, 5e+89]], $MachinePrecision]], N[(y * x), $MachinePrecision], N[(N[(1.0 - x), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.39999999999999989e40 or 4.99999999999999983e89 < y

   1. Initial program 93.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 35.2

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

   5. Applied rewrites 35.2%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 24.4%

      \[\leadsto 1 \cdot z \]

   9. Taylor expanded in y around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 73.4

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

   11. Applied rewrites 73.4%

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

   if -3.39999999999999989e40 < y < 4.99999999999999983e89

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 88.3

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

   5. Applied rewrites 88.3%

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

4. Final simplification 82.6%

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

Alternative 6: 61.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-26} \lor \neg \left(x \leq 0.054\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -8.5e-26) (not (<= x 0.054))) (* y x) (* 1.0 z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.5e-26) || !(x <= 0.054)) {
		tmp = y * x;
	} else {
		tmp = 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 ((x <= (-8.5d-26)) .or. (.not. (x <= 0.054d0))) then
        tmp = y * x
    else
        tmp = 1.0d0 * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.5e-26) || !(x <= 0.054)) {
		tmp = y * x;
	} else {
		tmp = 1.0 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -8.5e-26) or not (x <= 0.054):
		tmp = y * x
	else:
		tmp = 1.0 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -8.5e-26) || !(x <= 0.054))
		tmp = Float64(y * x);
	else
		tmp = Float64(1.0 * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -8.5e-26) || ~((x <= 0.054)))
		tmp = y * x;
	else
		tmp = 1.0 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -8.5e-26], N[Not[LessEqual[x, 0.054]], $MachinePrecision]], N[(y * x), $MachinePrecision], N[(1.0 * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.50000000000000004e-26 or 0.0539999999999999994 < x

   1. Initial program 95.4%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 59.3

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

   5. Applied rewrites 59.3%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 3.8%

      \[\leadsto 1 \cdot z \]

   9. Taylor expanded in y around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 47.4

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

   11. Applied rewrites 47.4%

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

   if -8.50000000000000004e-26 < x < 0.0539999999999999994

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 77.2

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

   5. Applied rewrites 77.2%

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

   6. Taylor expanded in x around 0

      \[\leadsto 1 \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 75.3%

      \[\leadsto 1 \cdot z \]
3. Recombined 2 regimes into one program.

4. Final simplification 60.9%

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

Alternative 7: 41.7% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 68.0

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

5. Applied rewrites 68.0%

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

6. Taylor expanded in x around 0

   \[\leadsto 1 \cdot z \]
7. Step-by-step derivation

8. Applied rewrites 38.5%

   \[\leadsto 1 \cdot z \]

9. Taylor expanded in y around inf

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

    1. *-commutative N/A

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

    2. lower-*.f64 36.3

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

11. Applied rewrites 36.3%

    \[\leadsto \color{blue}{y \cdot x} \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2024307 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  :precision binary64
  (+ (* x y) (* (- 1.0 x) z)))