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

Percentage Accurate: 97.8% → 100.0%

Time: 6.7s

Alternatives: 5

Speedup: 1.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 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(x, y - z, z\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 96.5%

   \[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. mul-1-neg N/A

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

   3. remove-double-neg N/A

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

   4. mul-1-neg N/A

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

   5. distribute-neg-in N/A

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

   6. +-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. +-commutative N/A

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

   9. distribute-neg-in N/A

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

   10. mul-1-neg N/A

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

   11. remove-double-neg N/A

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

   12. unsub-neg N/A

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

   13. lower--.f64 100.0

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

5. Applied rewrites 100.0%

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

Alternative 2: 83.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(y - z\right)\\ \mathbf{if}\;x \leq -6 \cdot 10^{-24}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 3.6 \cdot 10^{-81}:\\ \;\;\;\;z - x \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- y z))))
   (if (<= x -6e-24) t_0 (if (<= x 3.6e-81) (- z (* x z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * (y - z);
	double tmp;
	if (x <= -6e-24) {
		tmp = t_0;
	} else if (x <= 3.6e-81) {
		tmp = z - (x * 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 (x <= (-6d-24)) then
        tmp = t_0
    else if (x <= 3.6d-81) then
        tmp = z - (x * 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 (x <= -6e-24) {
		tmp = t_0;
	} else if (x <= 3.6e-81) {
		tmp = z - (x * z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (y - z)
	tmp = 0
	if x <= -6e-24:
		tmp = t_0
	elif x <= 3.6e-81:
		tmp = z - (x * z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(y - z))
	tmp = 0.0
	if (x <= -6e-24)
		tmp = t_0;
	elseif (x <= 3.6e-81)
		tmp = Float64(z - Float64(x * 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 (x <= -6e-24)
		tmp = t_0;
	elseif (x <= 3.6e-81)
		tmp = z - (x * 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[x, -6e-24], t$95$0, If[LessEqual[x, 3.6e-81], N[(z - N[(x * z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.99999999999999991e-24 or 3.5999999999999999e-81 < x

   1. Initial program 94.3%

      \[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. mul-1-neg N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. mul-1-neg N/A

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

      10. remove-double-neg N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 93.1

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

   5. Applied rewrites 93.1%

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

   if -5.99999999999999991e-24 < x < 3.5999999999999999e-81

   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. distribute-rgt-out-- N/A

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

      2. *-lft-identity N/A

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

      3. lower--.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 75.9

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

   5. Applied rewrites 75.9%

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

4. Final simplification 86.5%

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

Alternative 3: 51.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- z))))
   (if (<= z -1.5e+154) t_0 (if (<= z 3e+17) (* x y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * -z;
	double tmp;
	if (z <= -1.5e+154) {
		tmp = t_0;
	} else if (z <= 3e+17) {
		tmp = x * y;
	} 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 * -z
    if (z <= (-1.5d+154)) then
        tmp = t_0
    else if (z <= 3d+17) then
        tmp = x * y
    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 * -z;
	double tmp;
	if (z <= -1.5e+154) {
		tmp = t_0;
	} else if (z <= 3e+17) {
		tmp = x * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * -z
	tmp = 0
	if z <= -1.5e+154:
		tmp = t_0
	elif z <= 3e+17:
		tmp = x * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(-z))
	tmp = 0.0
	if (z <= -1.5e+154)
		tmp = t_0;
	elseif (z <= 3e+17)
		tmp = Float64(x * y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * -z;
	tmp = 0.0;
	if (z <= -1.5e+154)
		tmp = t_0;
	elseif (z <= 3e+17)
		tmp = x * y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.50000000000000013e154 or 3e17 < z

   1. Initial program 93.9%

      \[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. mul-1-neg N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. mul-1-neg N/A

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

      10. remove-double-neg N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 56.7

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

   5. Applied rewrites 56.7%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 48.0%

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

   if -1.50000000000000013e154 < z < 3e17

   1. Initial program 98.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 61.6

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

   5. Applied rewrites 61.6%

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

Alternative 4: 65.3% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.5%

   \[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. mul-1-neg N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-neg-in N/A

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

   5. +-commutative N/A

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

   6. lower-*.f64 N/A

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

   7. +-commutative N/A

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

   8. distribute-neg-in N/A

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

   9. mul-1-neg N/A

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

   10. remove-double-neg N/A

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

   11. unsub-neg N/A

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

   12. lower--.f64 67.6

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

5. Applied rewrites 67.6%

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

Alternative 5: 42.3% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.5%

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

3. Taylor expanded in y around inf

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

   1. lower-*.f64 44.5

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

5. Applied rewrites 44.5%

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

Reproduce

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