Diagrams.Color.HSV:lerp from diagrams-contrib-1.3.0.5

Percentage Accurate: 98.1% → 100.0%

Time: 8.3s

Alternatives: 5

Speedup: 1.7×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. +-commutative N/A

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

   4. remove-double-neg N/A

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

   5. mul-1-neg N/A

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

   6. mul-1-neg N/A

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

   7. distribute-neg-in N/A

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

   8. lower-fma.f64 N/A

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

   9. +-commutative N/A

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

   10. distribute-neg-in N/A

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

   11. mul-1-neg N/A

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

   12. remove-double-neg N/A

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

   13. unsub-neg N/A

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

   14. lower--.f64 100.0

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

5. Applied rewrites 100.0%

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

Alternative 2: 85.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -9e-7) (not (<= x 680000000000.0)))
   (* (- z y) x)
   (fma (- y) x y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -9e-7) || !(x <= 680000000000.0)) {
		tmp = (z - y) * x;
	} else {
		tmp = fma(-y, x, y);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -8.99999999999999959e-7 or 6.8e11 < x

   1. Initial program 98.5%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if -8.99999999999999959e-7 < x < 6.8e11

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. remove-double-neg N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. distribute-neg-in N/A

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

      8. lower-fma.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. mul-1-neg N/A

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

      12. remove-double-neg N/A

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

      13. unsub-neg N/A

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

      14. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around inf

      \[\leadsto \mathsf{fma}\left(-1 \cdot y, x, y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 73.3%

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

4. Final simplification 86.5%

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

Alternative 3: 51.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1e-7) (not (<= z 4.5e-6))) (* z x) (* (- y) x)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1e-7) || !(z <= 4.5e-6)) {
		tmp = z * x;
	} else {
		tmp = -y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1e-7) or not (z <= 4.5e-6):
		tmp = z * x
	else:
		tmp = -y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1e-7) || !(z <= 4.5e-6))
		tmp = Float64(z * x);
	else
		tmp = Float64(Float64(-y) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1e-7) || ~((z <= 4.5e-6)))
		tmp = z * x;
	else
		tmp = -y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1e-7], N[Not[LessEqual[z, 4.5e-6]], $MachinePrecision]], N[(z * x), $MachinePrecision], N[((-y) * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.9999999999999995e-8 or 4.50000000000000011e-6 < z

   1. Initial program 98.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 72.2

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

   5. Applied rewrites 72.2%

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

   6. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 62.3

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

   8. Applied rewrites 62.3%

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

   if -9.9999999999999995e-8 < z < 4.50000000000000011e-6

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 59.7

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

   5. Applied rewrites 59.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 48.1%

      \[\leadsto \left(-y\right) \cdot x \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.2%

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

Alternative 4: 64.1% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. +-commutative N/A

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

   3. remove-double-neg N/A

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

   4. mul-1-neg N/A

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

   5. mul-1-neg N/A

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

   6. distribute-neg-in N/A

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

   7. lower-*.f64 N/A

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

   8. +-commutative N/A

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

   9. distribute-neg-in N/A

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

   10. mul-1-neg N/A

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

   11. remove-double-neg N/A

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

   12. unsub-neg N/A

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

   13. lower--.f64 65.9

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

5. Applied rewrites 65.9%

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

Alternative 5: 41.1% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. +-commutative N/A

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

   3. remove-double-neg N/A

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

   4. mul-1-neg N/A

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

   5. mul-1-neg N/A

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

   6. distribute-neg-in N/A

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

   7. lower-*.f64 N/A

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

   8. +-commutative N/A

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

   9. distribute-neg-in N/A

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

   10. mul-1-neg N/A

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

   11. remove-double-neg N/A

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

   12. unsub-neg N/A

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

   13. lower--.f64 65.9

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

5. Applied rewrites 65.9%

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

6. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 37.7

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

8. Applied rewrites 37.7%

   \[\leadsto \color{blue}{z \cdot x} \]
9. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024321 
(FPCore (x y z)
  :name "Diagrams.Color.HSV:lerp  from diagrams-contrib-1.3.0.5"
  :precision binary64

  :alt
  (! :herbie-platform default (- y (* x (- y z))))

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