Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, D

Percentage Accurate: 99.5% → 99.7%

Time: 11.5s

Alternatives: 12

Speedup: 1.9×

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

Specification

Math

\[\begin{array}{l} \\ x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+ x (* (* (- y x) 6.0) (- (/ 2.0 3.0) z))))

C

double code(double x, double y, double z) {
	return x + (((y - x) * 6.0) * ((2.0 / 3.0) - z));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (((y - x) * 6.0d0) * ((2.0d0 / 3.0d0) - z))
end function

Java

public static double code(double x, double y, double z) {
	return x + (((y - x) * 6.0) * ((2.0 / 3.0) - z));
}

Python

def code(x, y, z):
	return x + (((y - x) * 6.0) * ((2.0 / 3.0) - z))

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(Float64(y - x) * 6.0) * Float64(Float64(2.0 / 3.0) - z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (((y - x) * 6.0) * ((2.0 / 3.0) - z));
end

Wolfram

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

Initial Program: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+ x (* (* (- y x) 6.0) (- (/ 2.0 3.0) z))))

C

double code(double x, double y, double z) {
	return x + (((y - x) * 6.0) * ((2.0 / 3.0) - z));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (((y - x) * 6.0d0) * ((2.0d0 / 3.0d0) - z))
end function

Java

public static double code(double x, double y, double z) {
	return x + (((y - x) * 6.0) * ((2.0 / 3.0) - z));
}

Python

def code(x, y, z):
	return x + (((y - x) * 6.0) * ((2.0 / 3.0) - z))

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(Float64(y - x) * 6.0) * Float64(Float64(2.0 / 3.0) - z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (((y - x) * 6.0) * ((2.0 / 3.0) - z));
end

Wolfram

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

Alternative 1: 99.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.5%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-*l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(6 \cdot \left(\frac{2}{3} - z\right), y - x, x\right)} \]

   8. lift--.f64 N/A

      \[\leadsto \mathsf{fma}\left(6 \cdot \color{blue}{\left(\frac{2}{3} - z\right)}, y - x, x\right) \]

   9. sub-neg N/A

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

   10. +-commutative N/A

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

   11. distribute-lft-in N/A

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

   12. neg-mul-1 N/A

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

   13. associate-*r* N/A

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

   14. metadata-eval N/A

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

   15. metadata-eval N/A

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

   16. lower-fma.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(6\right), z, 6 \cdot \frac{2}{3}\right)}, y - x, x\right) \]

   17. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{-6}, z, 6 \cdot \frac{2}{3}\right), y - x, x\right) \]

   18. lift-/.f64 N/A

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-6, z, 6 \cdot \color{blue}{\frac{2}{3}}\right), y - x, x\right) \]

   19. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-6, z, 6 \cdot \color{blue}{\frac{2}{3}}\right), y - x, x\right) \]

   20. metadata-eval 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 75.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot z\right) \cdot -6\\ t_1 := \frac{2}{3} - z\\ t_2 := \mathsf{fma}\left(6, z, -3\right) \cdot x\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+81}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -10:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 0.6666666666667:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+129}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* y z) -6.0))
        (t_1 (- (/ 2.0 3.0) z))
        (t_2 (* (fma 6.0 z -3.0) x)))
   (if (<= t_1 -2e+81)
     t_2
     (if (<= t_1 -10.0)
       t_0
       (if (<= t_1 0.6666666666667)
         (fma (- y x) 4.0 x)
         (if (<= t_1 5e+129) t_2 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (y * z) * -6.0;
	double t_1 = (2.0 / 3.0) - z;
	double t_2 = fma(6.0, z, -3.0) * x;
	double tmp;
	if (t_1 <= -2e+81) {
		tmp = t_2;
	} else if (t_1 <= -10.0) {
		tmp = t_0;
	} else if (t_1 <= 0.6666666666667) {
		tmp = fma((y - x), 4.0, x);
	} else if (t_1 <= 5e+129) {
		tmp = t_2;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * z) * -6.0)
	t_1 = Float64(Float64(2.0 / 3.0) - z)
	t_2 = Float64(fma(6.0, z, -3.0) * x)
	tmp = 0.0
	if (t_1 <= -2e+81)
		tmp = t_2;
	elseif (t_1 <= -10.0)
		tmp = t_0;
	elseif (t_1 <= 0.6666666666667)
		tmp = fma(Float64(y - x), 4.0, x);
	elseif (t_1 <= 5e+129)
		tmp = t_2;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * z), $MachinePrecision] * -6.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(6.0 * z + -3.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+81], t$95$2, If[LessEqual[t$95$1, -10.0], t$95$0, If[LessEqual[t$95$1, 0.6666666666667], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+129], t$95$2, t$95$0]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -1.99999999999999984e81 or 0.66666666666670005 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 5.0000000000000003e129

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -6 \cdot \left(x \cdot \left(\frac{2}{3} - z\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. sub-neg N/A

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

      6. *-lft-identity N/A

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

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

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

      8. neg-mul-1 N/A

         \[\leadsto 1 \cdot x + \left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot \color{blue}{\left(-1 \cdot x\right)} \]

      9. associate-*r* N/A

         \[\leadsto 1 \cdot x + \color{blue}{\left(\left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot -1\right) \cdot x} \]

      10. distribute-rgt-in N/A

          \[\leadsto \color{blue}{x \cdot \left(1 + \left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot -1\right)} \]

      11. metadata-eval N/A

          \[\leadsto x \cdot \left(\color{blue}{-1 \cdot -1} + \left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot -1\right) \]

      12. distribute-rgt-in N/A

          \[\leadsto x \cdot \color{blue}{\left(-1 \cdot \left(-1 + 6 \cdot \left(\frac{2}{3} - z\right)\right)\right)} \]

      13. +-commutative N/A

          \[\leadsto x \cdot \left(-1 \cdot \color{blue}{\left(6 \cdot \left(\frac{2}{3} - z\right) + -1\right)}\right) \]

      14. metadata-eval N/A

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

      15. sub-neg N/A

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

      16. neg-mul-1 N/A

          \[\leadsto x \cdot \color{blue}{\left(\mathsf{neg}\left(\left(6 \cdot \left(\frac{2}{3} - z\right) - 1\right)\right)\right)} \]

      17. *-commutative N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(6 \cdot \left(\frac{2}{3} - z\right) - 1\right)\right)\right) \cdot x} \]

      18. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(6 \cdot \left(\frac{2}{3} - z\right) - 1\right)\right)\right) \cdot x} \]

   5. Applied rewrites 68.1%

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

   if -1.99999999999999984e81 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10 or 5.0000000000000003e129 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 96.7

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

   5. Applied rewrites 96.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 64.5%

      \[\leadsto \left(z \cdot y\right) \cdot -6 \]

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 0.66666666666670005

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 99.6

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

   5. Applied rewrites 99.6%

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

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -2 \cdot 10^{+81}:\\ \;\;\;\;\mathsf{fma}\left(6, z, -3\right) \cdot x\\ \mathbf{elif}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 0.6666666666667:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;\frac{2}{3} - z \leq 5 \cdot 10^{+129}:\\ \;\;\;\;\mathsf{fma}\left(6, z, -3\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot z\right) \cdot -6\\ t_1 := \frac{2}{3} - z\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+81}:\\ \;\;\;\;\left(6 \cdot x\right) \cdot z\\ \mathbf{elif}\;t\_1 \leq -10:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+129}:\\ \;\;\;\;\left(6 \cdot z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* y z) -6.0)) (t_1 (- (/ 2.0 3.0) z)))
   (if (<= t_1 -2e+81)
     (* (* 6.0 x) z)
     (if (<= t_1 -10.0)
       t_0
       (if (<= t_1 50.0)
         (fma (- y x) 4.0 x)
         (if (<= t_1 5e+129) (* (* 6.0 z) x) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (y * z) * -6.0;
	double t_1 = (2.0 / 3.0) - z;
	double tmp;
	if (t_1 <= -2e+81) {
		tmp = (6.0 * x) * z;
	} else if (t_1 <= -10.0) {
		tmp = t_0;
	} else if (t_1 <= 50.0) {
		tmp = fma((y - x), 4.0, x);
	} else if (t_1 <= 5e+129) {
		tmp = (6.0 * z) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * z) * -6.0)
	t_1 = Float64(Float64(2.0 / 3.0) - z)
	tmp = 0.0
	if (t_1 <= -2e+81)
		tmp = Float64(Float64(6.0 * x) * z);
	elseif (t_1 <= -10.0)
		tmp = t_0;
	elseif (t_1 <= 50.0)
		tmp = fma(Float64(y - x), 4.0, x);
	elseif (t_1 <= 5e+129)
		tmp = Float64(Float64(6.0 * z) * x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * z), $MachinePrecision] * -6.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+81], N[(N[(6.0 * x), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t$95$1, -10.0], t$95$0, If[LessEqual[t$95$1, 50.0], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+129], N[(N[(6.0 * z), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]]]]

Derivation

1. Split input into 4 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -1.99999999999999984e81

   1. Initial program 99.9%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in y around 0

      \[\leadsto \left(-4 \cdot \frac{x}{z} + \left(6 \cdot x + \frac{x}{z}\right)\right) \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 62.0%

      \[\leadsto \left(\left(6 - \frac{3}{z}\right) \cdot x\right) \cdot z \]

   9. Taylor expanded in z around inf

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

   11. Applied rewrites 62.0%

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

   if -1.99999999999999984e81 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10 or 5.0000000000000003e129 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 96.7

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

   5. Applied rewrites 96.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 64.5%

      \[\leadsto \left(z \cdot y\right) \cdot -6 \]

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 50

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if 50 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 5.0000000000000003e129

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(6 \cdot \left(\frac{2}{3} - z\right), y - x, x\right)} \]

      8. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(6 \cdot \color{blue}{\left(\frac{2}{3} - z\right)}, y - x, x\right) \]

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-lft-in N/A

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

      12. neg-mul-1 N/A

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

      13. associate-*r* N/A

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

      14. metadata-eval N/A

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

      15. metadata-eval N/A

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

      16. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(6\right), z, 6 \cdot \frac{2}{3}\right)}, y - x, x\right) \]

      17. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{-6}, z, 6 \cdot \frac{2}{3}\right), y - x, x\right) \]

      18. lift-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-6, z, 6 \cdot \color{blue}{\frac{2}{3}}\right), y - x, x\right) \]

      19. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-6, z, 6 \cdot \color{blue}{\frac{2}{3}}\right), y - x, x\right) \]

      20. metadata-eval 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto x + \left(\color{blue}{\frac{2}{3} \cdot -6} + -1 \cdot \left(-6 \cdot z\right)\right) \cdot x \]

      8. *-commutative N/A

         \[\leadsto x + \left(\frac{2}{3} \cdot -6 + -1 \cdot \color{blue}{\left(z \cdot -6\right)}\right) \cdot x \]

      9. associate-*r* N/A

         \[\leadsto x + \left(\frac{2}{3} \cdot -6 + \color{blue}{\left(-1 \cdot z\right) \cdot -6}\right) \cdot x \]

      10. distribute-rgt-in N/A

          \[\leadsto x + \color{blue}{\left(-6 \cdot \left(\frac{2}{3} + -1 \cdot z\right)\right)} \cdot x \]

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. distribute-rgt1-in N/A

          \[\leadsto \color{blue}{\left(-6 \cdot \left(\frac{2}{3} - z\right) + 1\right) \cdot x} \]

      14. +-commutative N/A

          \[\leadsto \color{blue}{\left(1 + -6 \cdot \left(\frac{2}{3} - z\right)\right)} \cdot x \]

      15. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(1 + -6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot x} \]

   7. Applied rewrites 81.1%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 75.2%

       \[\leadsto \left(6 \cdot z\right) \cdot x \]
3. Recombined 4 regimes into one program.

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -2 \cdot 10^{+81}:\\ \;\;\;\;\left(6 \cdot x\right) \cdot z\\ \mathbf{elif}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;\frac{2}{3} - z \leq 5 \cdot 10^{+129}:\\ \;\;\;\;\left(6 \cdot z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot z\right) \cdot -6\\ t_1 := \frac{2}{3} - z\\ t_2 := \left(6 \cdot x\right) \cdot z\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+81}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -10:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+129}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* y z) -6.0)) (t_1 (- (/ 2.0 3.0) z)) (t_2 (* (* 6.0 x) z)))
   (if (<= t_1 -2e+81)
     t_2
     (if (<= t_1 -10.0)
       t_0
       (if (<= t_1 50.0) (fma (- y x) 4.0 x) (if (<= t_1 5e+129) t_2 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (y * z) * -6.0;
	double t_1 = (2.0 / 3.0) - z;
	double t_2 = (6.0 * x) * z;
	double tmp;
	if (t_1 <= -2e+81) {
		tmp = t_2;
	} else if (t_1 <= -10.0) {
		tmp = t_0;
	} else if (t_1 <= 50.0) {
		tmp = fma((y - x), 4.0, x);
	} else if (t_1 <= 5e+129) {
		tmp = t_2;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * z) * -6.0)
	t_1 = Float64(Float64(2.0 / 3.0) - z)
	t_2 = Float64(Float64(6.0 * x) * z)
	tmp = 0.0
	if (t_1 <= -2e+81)
		tmp = t_2;
	elseif (t_1 <= -10.0)
		tmp = t_0;
	elseif (t_1 <= 50.0)
		tmp = fma(Float64(y - x), 4.0, x);
	elseif (t_1 <= 5e+129)
		tmp = t_2;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * z), $MachinePrecision] * -6.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(6.0 * x), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+81], t$95$2, If[LessEqual[t$95$1, -10.0], t$95$0, If[LessEqual[t$95$1, 50.0], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+129], t$95$2, t$95$0]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -1.99999999999999984e81 or 50 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 5.0000000000000003e129

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

   5. Applied rewrites 99.8%

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

   6. Taylor expanded in y around 0

      \[\leadsto \left(-4 \cdot \frac{x}{z} + \left(6 \cdot x + \frac{x}{z}\right)\right) \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 67.7%

      \[\leadsto \left(\left(6 - \frac{3}{z}\right) \cdot x\right) \cdot z \]

   9. Taylor expanded in z around inf

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

   11. Applied rewrites 65.9%

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

   if -1.99999999999999984e81 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10 or 5.0000000000000003e129 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 96.7

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

   5. Applied rewrites 96.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 64.5%

      \[\leadsto \left(z \cdot y\right) \cdot -6 \]

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 50

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 97.8

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

   5. Applied rewrites 97.8%

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

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -2 \cdot 10^{+81}:\\ \;\;\;\;\left(6 \cdot x\right) \cdot z\\ \mathbf{elif}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;\frac{2}{3} - z \leq 5 \cdot 10^{+129}:\\ \;\;\;\;\left(6 \cdot x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot z\right) \cdot -6\\ t_1 := \frac{2}{3} - z\\ t_2 := \left(x \cdot z\right) \cdot 6\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+81}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -10:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+129}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* y z) -6.0)) (t_1 (- (/ 2.0 3.0) z)) (t_2 (* (* x z) 6.0)))
   (if (<= t_1 -2e+81)
     t_2
     (if (<= t_1 -10.0)
       t_0
       (if (<= t_1 50.0) (fma (- y x) 4.0 x) (if (<= t_1 5e+129) t_2 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (y * z) * -6.0;
	double t_1 = (2.0 / 3.0) - z;
	double t_2 = (x * z) * 6.0;
	double tmp;
	if (t_1 <= -2e+81) {
		tmp = t_2;
	} else if (t_1 <= -10.0) {
		tmp = t_0;
	} else if (t_1 <= 50.0) {
		tmp = fma((y - x), 4.0, x);
	} else if (t_1 <= 5e+129) {
		tmp = t_2;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * z) * -6.0)
	t_1 = Float64(Float64(2.0 / 3.0) - z)
	t_2 = Float64(Float64(x * z) * 6.0)
	tmp = 0.0
	if (t_1 <= -2e+81)
		tmp = t_2;
	elseif (t_1 <= -10.0)
		tmp = t_0;
	elseif (t_1 <= 50.0)
		tmp = fma(Float64(y - x), 4.0, x);
	elseif (t_1 <= 5e+129)
		tmp = t_2;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * z), $MachinePrecision] * -6.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * z), $MachinePrecision] * 6.0), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+81], t$95$2, If[LessEqual[t$95$1, -10.0], t$95$0, If[LessEqual[t$95$1, 50.0], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+129], t$95$2, t$95$0]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -1.99999999999999984e81 or 50 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 5.0000000000000003e129

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 97.4

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

   5. Applied rewrites 97.4%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 65.9%

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

   if -1.99999999999999984e81 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10 or 5.0000000000000003e129 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 96.7

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

   5. Applied rewrites 96.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 64.5%

      \[\leadsto \left(z \cdot y\right) \cdot -6 \]

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 50

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 97.8

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

   5. Applied rewrites 97.8%

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

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -2 \cdot 10^{+81}:\\ \;\;\;\;\left(x \cdot z\right) \cdot 6\\ \mathbf{elif}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{elif}\;\frac{2}{3} - z \leq 5 \cdot 10^{+129}:\\ \;\;\;\;\left(x \cdot z\right) \cdot 6\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 97.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (/ 2.0 3.0) z)))
   (if (<= t_0 -10.0)
     (* (* (- y x) z) -6.0)
     (if (<= t_0 1.0) (fma (- y x) 4.0 x) (* (* (- y x) -6.0) z)))))

C

double code(double x, double y, double z) {
	double t_0 = (2.0 / 3.0) - z;
	double tmp;
	if (t_0 <= -10.0) {
		tmp = ((y - x) * z) * -6.0;
	} else if (t_0 <= 1.0) {
		tmp = fma((y - x), 4.0, x);
	} else {
		tmp = ((y - x) * -6.0) * z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(2.0 / 3.0) - z)
	tmp = 0.0
	if (t_0 <= -10.0)
		tmp = Float64(Float64(Float64(y - x) * z) * -6.0);
	elseif (t_0 <= 1.0)
		tmp = fma(Float64(y - x), 4.0, x);
	else
		tmp = Float64(Float64(Float64(y - x) * -6.0) * z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, If[LessEqual[t$95$0, -10.0], N[(N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision] * -6.0), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], N[(N[(N[(y - x), $MachinePrecision] * -6.0), $MachinePrecision] * z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 97.2

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

   5. Applied rewrites 97.2%

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

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 1

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   if 1 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 95.7

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

   5. Applied rewrites 95.7%

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

   7. Applied rewrites 95.7%

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

4. Final simplification 97.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(\left(y - x\right) \cdot z\right) \cdot -6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 1:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y - x\right) \cdot -6\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 97.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (/ 2.0 3.0) z)) (t_1 (* (* (- y x) z) -6.0)))
   (if (<= t_0 -10.0) t_1 (if (<= t_0 1.0) (fma (- y x) 4.0 x) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = (2.0 / 3.0) - z;
	double t_1 = ((y - x) * z) * -6.0;
	double tmp;
	if (t_0 <= -10.0) {
		tmp = t_1;
	} else if (t_0 <= 1.0) {
		tmp = fma((y - x), 4.0, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(2.0 / 3.0) - z)
	t_1 = Float64(Float64(Float64(y - x) * z) * -6.0)
	tmp = 0.0
	if (t_0 <= -10.0)
		tmp = t_1;
	elseif (t_0 <= 1.0)
		tmp = fma(Float64(y - x), 4.0, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision] * -6.0), $MachinePrecision]}, If[LessEqual[t$95$0, -10.0], t$95$1, If[LessEqual[t$95$0, 1.0], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10 or 1 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 96.5

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

   5. Applied rewrites 96.5%

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

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 1

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

4. Final simplification 97.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(\left(y - x\right) \cdot z\right) \cdot -6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 1:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(y - x\right) \cdot z\right) \cdot -6\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 74.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{2}{3} - z\\ t_1 := \left(x \cdot z\right) \cdot 6\\ \mathbf{if}\;t\_0 \leq -10:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (/ 2.0 3.0) z)) (t_1 (* (* x z) 6.0)))
   (if (<= t_0 -10.0) t_1 (if (<= t_0 50.0) (fma (- y x) 4.0 x) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = (2.0 / 3.0) - z;
	double t_1 = (x * z) * 6.0;
	double tmp;
	if (t_0 <= -10.0) {
		tmp = t_1;
	} else if (t_0 <= 50.0) {
		tmp = fma((y - x), 4.0, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(2.0 / 3.0) - z)
	t_1 = Float64(Float64(x * z) * 6.0)
	tmp = 0.0
	if (t_0 <= -10.0)
		tmp = t_1;
	elseif (t_0 <= 50.0)
		tmp = fma(Float64(y - x), 4.0, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * z), $MachinePrecision] * 6.0), $MachinePrecision]}, If[LessEqual[t$95$0, -10.0], t$95$1, If[LessEqual[t$95$0, 50.0], N[(N[(y - x), $MachinePrecision] * 4.0 + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -10 or 50 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 97.1

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

   5. Applied rewrites 97.1%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 52.3%

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

   if -10 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 50

   1. Initial program 99.3%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 97.8

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

   5. Applied rewrites 97.8%

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

4. Final simplification 74.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -10:\\ \;\;\;\;\left(x \cdot z\right) \cdot 6\\ \mathbf{elif}\;\frac{2}{3} - z \leq 50:\\ \;\;\;\;\mathsf{fma}\left(y - x, 4, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot z\right) \cdot 6\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 75.7% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (fma z -6.0 4.0) y)))
   (if (<= y -1.25e-11) t_0 (if (<= y 2e+23) (* (fma 6.0 z -3.0) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(z, -6.0, 4.0) * y;
	double tmp;
	if (y <= -1.25e-11) {
		tmp = t_0;
	} else if (y <= 2e+23) {
		tmp = fma(6.0, z, -3.0) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(fma(z, -6.0, 4.0) * y)
	tmp = 0.0
	if (y <= -1.25e-11)
		tmp = t_0;
	elseif (y <= 2e+23)
		tmp = Float64(fma(6.0, z, -3.0) * x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z * -6.0 + 4.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -1.25e-11], t$95$0, If[LessEqual[y, 2e+23], N[(N[(6.0 * z + -3.0), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.25000000000000005e-11 or 1.9999999999999998e23 < y

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(\left(\frac{2}{3} - z\right) \cdot y\right)} \]

      2. associate-*r* N/A

         \[\leadsto \color{blue}{\left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot y} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot y} \]

      4. sub-neg N/A

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

      5. mul-1-neg N/A

         \[\leadsto \left(6 \cdot \left(\frac{2}{3} + \color{blue}{-1 \cdot z}\right)\right) \cdot y \]

      6. +-commutative N/A

         \[\leadsto \left(6 \cdot \color{blue}{\left(-1 \cdot z + \frac{2}{3}\right)}\right) \cdot y \]

      7. distribute-lft-in N/A

         \[\leadsto \color{blue}{\left(6 \cdot \left(-1 \cdot z\right) + 6 \cdot \frac{2}{3}\right)} \cdot y \]

      8. metadata-eval N/A

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

      9. associate-*r* N/A

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

      10. metadata-eval N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 81.5

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

   5. Applied rewrites 81.5%

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

   if -1.25000000000000005e-11 < y < 1.9999999999999998e23

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -6 \cdot \left(x \cdot \left(\frac{2}{3} - z\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. sub-neg N/A

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

      6. *-lft-identity N/A

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

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

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

      8. neg-mul-1 N/A

         \[\leadsto 1 \cdot x + \left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot \color{blue}{\left(-1 \cdot x\right)} \]

      9. associate-*r* N/A

         \[\leadsto 1 \cdot x + \color{blue}{\left(\left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot -1\right) \cdot x} \]

      10. distribute-rgt-in N/A

          \[\leadsto \color{blue}{x \cdot \left(1 + \left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot -1\right)} \]

      11. metadata-eval N/A

          \[\leadsto x \cdot \left(\color{blue}{-1 \cdot -1} + \left(6 \cdot \left(\frac{2}{3} - z\right)\right) \cdot -1\right) \]

      12. distribute-rgt-in N/A

          \[\leadsto x \cdot \color{blue}{\left(-1 \cdot \left(-1 + 6 \cdot \left(\frac{2}{3} - z\right)\right)\right)} \]

      13. +-commutative N/A

          \[\leadsto x \cdot \left(-1 \cdot \color{blue}{\left(6 \cdot \left(\frac{2}{3} - z\right) + -1\right)}\right) \]

      14. metadata-eval N/A

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

      15. sub-neg N/A

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

      16. neg-mul-1 N/A

          \[\leadsto x \cdot \color{blue}{\left(\mathsf{neg}\left(\left(6 \cdot \left(\frac{2}{3} - z\right) - 1\right)\right)\right)} \]

      17. *-commutative N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(6 \cdot \left(\frac{2}{3} - z\right) - 1\right)\right)\right) \cdot x} \]

      18. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(6 \cdot \left(\frac{2}{3} - z\right) - 1\right)\right)\right) \cdot x} \]

   5. Applied rewrites 79.5%

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

Alternative 10: 38.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.013:\\ \;\;\;\;-3 \cdot x\\ \mathbf{elif}\;x \leq 4.1 \cdot 10^{-108}:\\ \;\;\;\;y \cdot 4\\ \mathbf{else}:\\ \;\;\;\;-3 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -0.013) (* -3.0 x) (if (<= x 4.1e-108) (* y 4.0) (* -3.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -0.013) {
		tmp = -3.0 * x;
	} else if (x <= 4.1e-108) {
		tmp = y * 4.0;
	} else {
		tmp = -3.0 * 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 (x <= (-0.013d0)) then
        tmp = (-3.0d0) * x
    else if (x <= 4.1d-108) then
        tmp = y * 4.0d0
    else
        tmp = (-3.0d0) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -0.013) {
		tmp = -3.0 * x;
	} else if (x <= 4.1e-108) {
		tmp = y * 4.0;
	} else {
		tmp = -3.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -0.013:
		tmp = -3.0 * x
	elif x <= 4.1e-108:
		tmp = y * 4.0
	else:
		tmp = -3.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -0.013)
		tmp = Float64(-3.0 * x);
	elseif (x <= 4.1e-108)
		tmp = Float64(y * 4.0);
	else
		tmp = Float64(-3.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -0.013)
		tmp = -3.0 * x;
	elseif (x <= 4.1e-108)
		tmp = y * 4.0;
	else
		tmp = -3.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -0.013], N[(-3.0 * x), $MachinePrecision], If[LessEqual[x, 4.1e-108], N[(y * 4.0), $MachinePrecision], N[(-3.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -0.0129999999999999994 or 4.10000000000000037e-108 < x

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 46.8

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

   5. Applied rewrites 46.8%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 36.3%

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

   if -0.0129999999999999994 < x < 4.10000000000000037e-108

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 47.8%

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

Alternative 11: 51.1% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.5%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
2. Add Preprocessing

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 50.2

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

5. Applied rewrites 50.2%

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

Alternative 12: 26.0% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ -3 \cdot x \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.5%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
2. Add Preprocessing

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 50.2

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

5. Applied rewrites 50.2%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 27.0%

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

Reproduce

herbie shell --seed 2024249 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, D"
  :precision binary64
  (+ x (* (* (- y x) 6.0) (- (/ 2.0 3.0) z))))