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

Percentage Accurate: 97.6% → 100.0%

Time: 5.5s

Alternatives: 6

Speedup: 1.7×

• 20.8% 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.6% 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 96.9%

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

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. sub-neg N/A

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

   4. mul-1-neg N/A

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

   5. +-commutative N/A

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

   6. distribute-lft1-in N/A

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

   7. associate-*r* N/A

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

   8. +-commutative N/A

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

   9. mul-1-neg N/A

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

   10. unsub-neg N/A

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

   11. associate-+l- N/A

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

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

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

   13. unsub-neg N/A

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

   14. mul-1-neg N/A

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

   15. sub-neg N/A

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

   16. mul-1-neg N/A

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

   17. +-commutative N/A

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

   18. mul-1-neg N/A

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

   19. *-commutative N/A

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

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

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

   21. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(\left(z + -1 \cdot y\right)\right), 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.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-z\right) \cdot x\\ \mathbf{if}\;x \leq -2.7 \cdot 10^{+288}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -1.6 \cdot 10^{-19}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-22}:\\ \;\;\;\;1 \cdot z\\ \mathbf{elif}\;x \leq 4.1 \cdot 10^{+63}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- z) x)))
   (if (<= x -2.7e+288)
     t_0
     (if (<= x -1.6e-19)
       (* x y)
       (if (<= x 2.4e-22) (* 1.0 z) (if (<= x 4.1e+63) (* x y) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = -z * x;
	double tmp;
	if (x <= -2.7e+288) {
		tmp = t_0;
	} else if (x <= -1.6e-19) {
		tmp = x * y;
	} else if (x <= 2.4e-22) {
		tmp = 1.0 * z;
	} else if (x <= 4.1e+63) {
		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 = -z * x
    if (x <= (-2.7d+288)) then
        tmp = t_0
    else if (x <= (-1.6d-19)) then
        tmp = x * y
    else if (x <= 2.4d-22) then
        tmp = 1.0d0 * z
    else if (x <= 4.1d+63) 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 = -z * x;
	double tmp;
	if (x <= -2.7e+288) {
		tmp = t_0;
	} else if (x <= -1.6e-19) {
		tmp = x * y;
	} else if (x <= 2.4e-22) {
		tmp = 1.0 * z;
	} else if (x <= 4.1e+63) {
		tmp = x * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -z * x
	tmp = 0
	if x <= -2.7e+288:
		tmp = t_0
	elif x <= -1.6e-19:
		tmp = x * y
	elif x <= 2.4e-22:
		tmp = 1.0 * z
	elif x <= 4.1e+63:
		tmp = x * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-z) * x)
	tmp = 0.0
	if (x <= -2.7e+288)
		tmp = t_0;
	elseif (x <= -1.6e-19)
		tmp = Float64(x * y);
	elseif (x <= 2.4e-22)
		tmp = Float64(1.0 * z);
	elseif (x <= 4.1e+63)
		tmp = Float64(x * y);
	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 <= -2.7e+288)
		tmp = t_0;
	elseif (x <= -1.6e-19)
		tmp = x * y;
	elseif (x <= 2.4e-22)
		tmp = 1.0 * z;
	elseif (x <= 4.1e+63)
		tmp = x * y;
	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, -2.7e+288], t$95$0, If[LessEqual[x, -1.6e-19], N[(x * y), $MachinePrecision], If[LessEqual[x, 2.4e-22], N[(1.0 * z), $MachinePrecision], If[LessEqual[x, 4.1e+63], N[(x * y), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.7000000000000001e288 or 4.09999999999999993e63 < x

   1. Initial program 89.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. *-commutative N/A

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

      2. +-commutative N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\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 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 67.2%

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

   if -2.7000000000000001e288 < x < -1.59999999999999991e-19 or 2.40000000000000002e-22 < x < 4.09999999999999993e63

   1. Initial program 97.4%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 61.5

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

   5. Applied rewrites 61.5%

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

   if -1.59999999999999991e-19 < x < 2.40000000000000002e-22

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\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 82.0

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

   5. Applied rewrites 82.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 82.0%

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

4. Final simplification 72.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.7 \cdot 10^{+288}:\\ \;\;\;\;\left(-z\right) \cdot x\\ \mathbf{elif}\;x \leq -1.6 \cdot 10^{-19}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-22}:\\ \;\;\;\;1 \cdot z\\ \mathbf{elif}\;x \leq 4.1 \cdot 10^{+63}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(-z\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(y - z\right)\\ \mathbf{if}\;x \leq -1.02 \cdot 10^{-19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 0.000215:\\ \;\;\;\;\left(1 - x\right) \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 -1.02e-19) t_0 (if (<= x 0.000215) (* (- 1.0 x) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * (y - z);
	double tmp;
	if (x <= -1.02e-19) {
		tmp = t_0;
	} else if (x <= 0.000215) {
		tmp = (1.0 - 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 <= (-1.02d-19)) then
        tmp = t_0
    else if (x <= 0.000215d0) then
        tmp = (1.0d0 - 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 <= -1.02e-19) {
		tmp = t_0;
	} else if (x <= 0.000215) {
		tmp = (1.0 - x) * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (y - z)
	tmp = 0
	if x <= -1.02e-19:
		tmp = t_0
	elif x <= 0.000215:
		tmp = (1.0 - 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 <= -1.02e-19)
		tmp = t_0;
	elseif (x <= 0.000215)
		tmp = Float64(Float64(1.0 - 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 <= -1.02e-19)
		tmp = t_0;
	elseif (x <= 0.000215)
		tmp = (1.0 - 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, -1.02e-19], t$95$0, If[LessEqual[x, 0.000215], N[(N[(1.0 - x), $MachinePrecision] * z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.02000000000000004e-19 or 2.14999999999999995e-4 < x

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

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

      2. +-commutative N/A

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. mul-1-neg N/A

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

      6. distribute-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\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 98.1

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

   5. Applied rewrites 98.1%

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

   if -1.02000000000000004e-19 < x < 2.14999999999999995e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\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 81.5

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

   5. Applied rewrites 81.5%

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

4. Final simplification 90.1%

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

Alternative 4: 74.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -8.8e+74) (* x y) (if (<= y 4.5e+124) (* (- 1.0 x) z) (* x y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -8.8e+74) {
		tmp = x * y;
	} else if (y <= 4.5e+124) {
		tmp = (1.0 - x) * z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -8.8e+74:
		tmp = x * y
	elif y <= 4.5e+124:
		tmp = (1.0 - x) * z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -8.8e+74)
		tmp = Float64(x * y);
	elseif (y <= 4.5e+124)
		tmp = Float64(Float64(1.0 - x) * z);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -8.8e+74)
		tmp = x * y;
	elseif (y <= 4.5e+124)
		tmp = (1.0 - x) * z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -8.8000000000000005e74 or 4.5000000000000004e124 < y

   1. Initial program 92.8%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 75.7

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

   5. Applied rewrites 75.7%

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

   if -8.8000000000000005e74 < y < 4.5000000000000004e124

   1. Initial program 98.8%

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

   3. Taylor expanded in z around inf

      \[\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 83.2

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

   5. Applied rewrites 83.2%

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

4. Final simplification 80.8%

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

Alternative 5: 61.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-19}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-22}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.6e-19) (* x y) (if (<= x 2.4e-22) (* 1.0 z) (* x y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.6e-19) {
		tmp = x * y;
	} else if (x <= 2.4e-22) {
		tmp = 1.0 * z;
	} else {
		tmp = x * y;
	}
	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 <= (-1.6d-19)) then
        tmp = x * y
    else if (x <= 2.4d-22) then
        tmp = 1.0d0 * z
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.6e-19) {
		tmp = x * y;
	} else if (x <= 2.4e-22) {
		tmp = 1.0 * z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.6e-19:
		tmp = x * y
	elif x <= 2.4e-22:
		tmp = 1.0 * z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.6e-19)
		tmp = Float64(x * y);
	elseif (x <= 2.4e-22)
		tmp = Float64(1.0 * z);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.6e-19)
		tmp = x * y;
	elseif (x <= 2.4e-22)
		tmp = 1.0 * z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.6e-19], N[(x * y), $MachinePrecision], If[LessEqual[x, 2.4e-22], N[(1.0 * z), $MachinePrecision], N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.59999999999999991e-19 or 2.40000000000000002e-22 < x

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 53.6

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

   5. Applied rewrites 53.6%

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

   if -1.59999999999999991e-19 < x < 2.40000000000000002e-22

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\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 82.0

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

   5. Applied rewrites 82.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 82.0%

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

4. Final simplification 67.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-19}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-22}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 42.2% 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.9%

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

3. Taylor expanded in z around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 38.1

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

5. Applied rewrites 38.1%

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

6. Final simplification 38.1%

   \[\leadsto x \cdot y \]
7. Add Preprocessing

Reproduce

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