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

Percentage Accurate: 99.7% → 99.8%

Time: 10.3s

Alternatives: 11

Speedup: 1.0×

• 21.0% 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 z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
2. Step-by-step derivation

   1. associate-*l* 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 52.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* 6.0 (* y z))))
   (if (<= y -1.5e-39)
     t_0
     (if (<= y 1.3e-152) (* -6.0 (* x z)) (if (<= y 9500.0) x t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = 6.0 * (y * z);
	double tmp;
	if (y <= -1.5e-39) {
		tmp = t_0;
	} else if (y <= 1.3e-152) {
		tmp = -6.0 * (x * z);
	} else if (y <= 9500.0) {
		tmp = x;
	} 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 = 6.0d0 * (y * z)
    if (y <= (-1.5d-39)) then
        tmp = t_0
    else if (y <= 1.3d-152) then
        tmp = (-6.0d0) * (x * z)
    else if (y <= 9500.0d0) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = 6.0 * (y * z);
	double tmp;
	if (y <= -1.5e-39) {
		tmp = t_0;
	} else if (y <= 1.3e-152) {
		tmp = -6.0 * (x * z);
	} else if (y <= 9500.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 6.0 * (y * z)
	tmp = 0
	if y <= -1.5e-39:
		tmp = t_0
	elif y <= 1.3e-152:
		tmp = -6.0 * (x * z)
	elif y <= 9500.0:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(6.0 * Float64(y * z))
	tmp = 0.0
	if (y <= -1.5e-39)
		tmp = t_0;
	elseif (y <= 1.3e-152)
		tmp = Float64(-6.0 * Float64(x * z));
	elseif (y <= 9500.0)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 6.0 * (y * z);
	tmp = 0.0;
	if (y <= -1.5e-39)
		tmp = t_0;
	elseif (y <= 1.3e-152)
		tmp = -6.0 * (x * z);
	elseif (y <= 9500.0)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(6.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.5e-39], t$95$0, If[LessEqual[y, 1.3e-152], N[(-6.0 * N[(x * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9500.0], x, t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.50000000000000014e-39 or 9500 < y

   1. Initial program 99.0%

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

      1. associate-*r* 99.7%

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

      2. +-commutative 99.7%

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

      3. *-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in y around inf 68.9%

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

      1. *-commutative 68.9%

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

   7. Simplified 68.9%

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

   if -1.50000000000000014e-39 < y < 1.30000000000000006e-152

   1. Initial program 99.8%

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

      1. associate-*r* 99.9%

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

      2. +-commutative 99.9%

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

      3. *-commutative 99.9%

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

      4. associate-*r* 99.8%

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

      5. fma-define 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in z around inf 65.0%

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

      1. *-commutative 65.0%

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

      2. *-commutative 65.0%

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

      3. associate-*r* 65.1%

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

   7. Simplified 65.1%

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

   8. Taylor expanded in y around 0 58.9%

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

   if 1.30000000000000006e-152 < y < 9500

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 54.6%

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

4. Final simplification 64.0%

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

Alternative 3: 52.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* 6.0 (* y z))))
   (if (<= y -1.7e-37)
     t_0
     (if (<= y 1.45e-153) (* x (* z -6.0)) (if (<= y 13200.0) x t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = 6.0 * (y * z);
	double tmp;
	if (y <= -1.7e-37) {
		tmp = t_0;
	} else if (y <= 1.45e-153) {
		tmp = x * (z * -6.0);
	} else if (y <= 13200.0) {
		tmp = x;
	} 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 = 6.0d0 * (y * z)
    if (y <= (-1.7d-37)) then
        tmp = t_0
    else if (y <= 1.45d-153) then
        tmp = x * (z * (-6.0d0))
    else if (y <= 13200.0d0) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = 6.0 * (y * z);
	double tmp;
	if (y <= -1.7e-37) {
		tmp = t_0;
	} else if (y <= 1.45e-153) {
		tmp = x * (z * -6.0);
	} else if (y <= 13200.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 6.0 * (y * z)
	tmp = 0
	if y <= -1.7e-37:
		tmp = t_0
	elif y <= 1.45e-153:
		tmp = x * (z * -6.0)
	elif y <= 13200.0:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(6.0 * Float64(y * z))
	tmp = 0.0
	if (y <= -1.7e-37)
		tmp = t_0;
	elseif (y <= 1.45e-153)
		tmp = Float64(x * Float64(z * -6.0));
	elseif (y <= 13200.0)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 6.0 * (y * z);
	tmp = 0.0;
	if (y <= -1.7e-37)
		tmp = t_0;
	elseif (y <= 1.45e-153)
		tmp = x * (z * -6.0);
	elseif (y <= 13200.0)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(6.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.7e-37], t$95$0, If[LessEqual[y, 1.45e-153], N[(x * N[(z * -6.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 13200.0], x, t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.70000000000000009e-37 or 13200 < y

   1. Initial program 99.0%

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

      1. associate-*r* 99.7%

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

      2. +-commutative 99.7%

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

      3. *-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in y around inf 68.9%

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

      1. *-commutative 68.9%

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

   7. Simplified 68.9%

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

   if -1.70000000000000009e-37 < y < 1.45000000000000001e-153

   1. Initial program 99.8%

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

      1. associate-*r* 99.9%

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

      2. +-commutative 99.9%

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

      3. *-commutative 99.9%

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

      4. associate-*r* 99.8%

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

      5. fma-define 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in z around inf 65.0%

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

      1. *-commutative 65.0%

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

      2. *-commutative 65.0%

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

      3. associate-*r* 65.1%

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

   7. Simplified 65.1%

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

   8. Taylor expanded in y around 0 58.9%

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

      1. *-commutative 58.9%

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

      2. associate-*r* 58.9%

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

   10. Simplified 58.9%

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

   if 1.45000000000000001e-153 < y < 13200

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 54.6%

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

4. Final simplification 64.0%

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

Alternative 4: 53.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (* 6.0 z))))
   (if (<= y -1.05e-32)
     t_0
     (if (<= y 3.6e-151) (* x (* z -6.0)) (if (<= y 6200.0) x t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = y * (6.0 * z);
	double tmp;
	if (y <= -1.05e-32) {
		tmp = t_0;
	} else if (y <= 3.6e-151) {
		tmp = x * (z * -6.0);
	} else if (y <= 6200.0) {
		tmp = x;
	} 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 = y * (6.0d0 * z)
    if (y <= (-1.05d-32)) then
        tmp = t_0
    else if (y <= 3.6d-151) then
        tmp = x * (z * (-6.0d0))
    else if (y <= 6200.0d0) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y * (6.0 * z);
	double tmp;
	if (y <= -1.05e-32) {
		tmp = t_0;
	} else if (y <= 3.6e-151) {
		tmp = x * (z * -6.0);
	} else if (y <= 6200.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * (6.0 * z)
	tmp = 0
	if y <= -1.05e-32:
		tmp = t_0
	elif y <= 3.6e-151:
		tmp = x * (z * -6.0)
	elif y <= 6200.0:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(6.0 * z))
	tmp = 0.0
	if (y <= -1.05e-32)
		tmp = t_0;
	elseif (y <= 3.6e-151)
		tmp = Float64(x * Float64(z * -6.0));
	elseif (y <= 6200.0)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (6.0 * z);
	tmp = 0.0;
	if (y <= -1.05e-32)
		tmp = t_0;
	elseif (y <= 3.6e-151)
		tmp = x * (z * -6.0);
	elseif (y <= 6200.0)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(6.0 * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.05e-32], t$95$0, If[LessEqual[y, 3.6e-151], N[(x * N[(z * -6.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6200.0], x, t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.05e-32 or 6200 < y

   1. Initial program 99.0%

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

      1. associate-*r* 99.7%

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

      2. +-commutative 99.7%

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

      3. *-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in y around inf 90.9%

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

      1. *-commutative 90.9%

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

   7. Simplified 90.9%

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

   8. Taylor expanded in z around inf 68.9%

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

      1. *-commutative 68.9%

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

      2. associate-*r* 68.9%

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

      3. *-commutative 68.9%

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

   10. Simplified 68.9%

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

   if -1.05e-32 < y < 3.60000000000000032e-151

   1. Initial program 99.8%

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

      1. associate-*r* 99.9%

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

      2. +-commutative 99.9%

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

      3. *-commutative 99.9%

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

      4. associate-*r* 99.8%

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

      5. fma-define 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in z around inf 65.0%

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

      1. *-commutative 65.0%

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

      2. *-commutative 65.0%

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

      3. associate-*r* 65.1%

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

   7. Simplified 65.1%

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

   8. Taylor expanded in y around 0 58.9%

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

      1. *-commutative 58.9%

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

      2. associate-*r* 58.9%

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

   10. Simplified 58.9%

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

   if 3.60000000000000032e-151 < y < 6200

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 54.6%

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

4. Final simplification 64.0%

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

Alternative 5: 82.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.7e-115) (not (<= z 2.06e-81))) (* -6.0 (* z (- x y))) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.7e-115) || !(z <= 2.06e-81)) {
		tmp = -6.0 * (z * (x - y));
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-1.7d-115)) .or. (.not. (z <= 2.06d-81))) then
        tmp = (-6.0d0) * (z * (x - y))
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.7e-115) || !(z <= 2.06e-81)) {
		tmp = -6.0 * (z * (x - y));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.7e-115) or not (z <= 2.06e-81):
		tmp = -6.0 * (z * (x - y))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.7e-115) || !(z <= 2.06e-81))
		tmp = Float64(-6.0 * Float64(z * Float64(x - y)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.7e-115) || ~((z <= 2.06e-81)))
		tmp = -6.0 * (z * (x - y));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.7e-115], N[Not[LessEqual[z, 2.06e-81]], $MachinePrecision]], N[(-6.0 * N[(z * N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -1.6999999999999999e-115 or 2.0600000000000001e-81 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. *-commutative 99.7%

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

      3. fma-define 99.7%

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

      4. remove-double-neg 99.7%

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

      5. distribute-lft-neg-in 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. sub-neg 99.7%

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

      8. distribute-neg-in 99.7%

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

      9. remove-double-neg 99.7%

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

      10. +-commutative 99.7%

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

      11. sub-neg 99.7%

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

      12. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around inf 91.8%

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

   if -1.6999999999999999e-115 < z < 2.0600000000000001e-81

   1. Initial program 98.7%

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

   3. Taylor expanded in z around 0 76.7%

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

4. Final simplification 87.0%

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

Alternative 6: 82.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.9 \cdot 10^{-117}:\\ \;\;\;\;-6 \cdot \left(z \cdot \left(x - y\right)\right)\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{-81}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\left(y - x\right) \cdot \left(6 \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -4.9e-117)
   (* -6.0 (* z (- x y)))
   (if (<= z 1.06e-81) x (* (- y x) (* 6.0 z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.9e-117) {
		tmp = -6.0 * (z * (x - y));
	} else if (z <= 1.06e-81) {
		tmp = x;
	} else {
		tmp = (y - x) * (6.0 * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-4.9d-117)) then
        tmp = (-6.0d0) * (z * (x - y))
    else if (z <= 1.06d-81) then
        tmp = x
    else
        tmp = (y - x) * (6.0d0 * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.9e-117) {
		tmp = -6.0 * (z * (x - y));
	} else if (z <= 1.06e-81) {
		tmp = x;
	} else {
		tmp = (y - x) * (6.0 * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -4.9e-117:
		tmp = -6.0 * (z * (x - y))
	elif z <= 1.06e-81:
		tmp = x
	else:
		tmp = (y - x) * (6.0 * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -4.9e-117)
		tmp = Float64(-6.0 * Float64(z * Float64(x - y)));
	elseif (z <= 1.06e-81)
		tmp = x;
	else
		tmp = Float64(Float64(y - x) * Float64(6.0 * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -4.9e-117)
		tmp = -6.0 * (z * (x - y));
	elseif (z <= 1.06e-81)
		tmp = x;
	else
		tmp = (y - x) * (6.0 * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -4.9e-117], N[(-6.0 * N[(z * N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.06e-81], x, N[(N[(y - x), $MachinePrecision] * N[(6.0 * z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -4.8999999999999998e-117

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. *-commutative 99.7%

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

      3. fma-define 99.7%

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

      4. remove-double-neg 99.7%

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

      5. distribute-lft-neg-in 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. sub-neg 99.7%

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

      8. distribute-neg-in 99.7%

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

      9. remove-double-neg 99.7%

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

      10. +-commutative 99.7%

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

      11. sub-neg 99.7%

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

      12. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around inf 91.3%

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

   if -4.8999999999999998e-117 < z < 1.05999999999999991e-81

   1. Initial program 98.7%

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

   3. Taylor expanded in z around 0 76.7%

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

   if 1.05999999999999991e-81 < z

   1. Initial program 99.7%

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

      1. associate-*r* 99.8%

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

      2. +-commutative 99.8%

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

      3. *-commutative 99.8%

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

      4. associate-*r* 99.6%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 92.3%

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

      1. *-commutative 92.3%

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

      2. *-commutative 92.3%

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

      3. associate-*r* 92.4%

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

   7. Simplified 92.4%

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

4. Final simplification 87.0%

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

Alternative 7: 83.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.5 \cdot 10^{-115}:\\ \;\;\;\;-6 \cdot \left(z \cdot \left(x - y\right)\right)\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-8}:\\ \;\;\;\;x + -6 \cdot \left(x \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y - x\right) \cdot \left(6 \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -5.5e-115)
   (* -6.0 (* z (- x y)))
   (if (<= z 9e-8) (+ x (* -6.0 (* x z))) (* (- y x) (* 6.0 z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.5e-115) {
		tmp = -6.0 * (z * (x - y));
	} else if (z <= 9e-8) {
		tmp = x + (-6.0 * (x * z));
	} else {
		tmp = (y - x) * (6.0 * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-5.5d-115)) then
        tmp = (-6.0d0) * (z * (x - y))
    else if (z <= 9d-8) then
        tmp = x + ((-6.0d0) * (x * z))
    else
        tmp = (y - x) * (6.0d0 * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.5e-115) {
		tmp = -6.0 * (z * (x - y));
	} else if (z <= 9e-8) {
		tmp = x + (-6.0 * (x * z));
	} else {
		tmp = (y - x) * (6.0 * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -5.5e-115:
		tmp = -6.0 * (z * (x - y))
	elif z <= 9e-8:
		tmp = x + (-6.0 * (x * z))
	else:
		tmp = (y - x) * (6.0 * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -5.5e-115)
		tmp = Float64(-6.0 * Float64(z * Float64(x - y)));
	elseif (z <= 9e-8)
		tmp = Float64(x + Float64(-6.0 * Float64(x * z)));
	else
		tmp = Float64(Float64(y - x) * Float64(6.0 * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -5.5e-115)
		tmp = -6.0 * (z * (x - y));
	elseif (z <= 9e-8)
		tmp = x + (-6.0 * (x * z));
	else
		tmp = (y - x) * (6.0 * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -5.5e-115], N[(-6.0 * N[(z * N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9e-8], N[(x + N[(-6.0 * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y - x), $MachinePrecision] * N[(6.0 * z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.50000000000000028e-115

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. *-commutative 99.7%

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

      3. fma-define 99.7%

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

      4. remove-double-neg 99.7%

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

      5. distribute-lft-neg-in 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. sub-neg 99.7%

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

      8. distribute-neg-in 99.7%

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

      9. remove-double-neg 99.7%

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

      10. +-commutative 99.7%

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

      11. sub-neg 99.7%

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

      12. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around inf 91.3%

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

   if -5.50000000000000028e-115 < z < 8.99999999999999986e-8

   1. Initial program 98.9%

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

      1. associate-*r* 99.9%

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

      2. +-commutative 99.9%

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

      3. *-commutative 99.9%

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

      4. associate-*r* 99.9%

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

      5. fma-define 99.9%

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

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in y around 0 73.0%

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

   if 8.99999999999999986e-8 < z

   1. Initial program 99.7%

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

      1. associate-*r* 99.7%

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

      2. +-commutative 99.7%

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

      3. *-commutative 99.7%

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

      4. associate-*r* 99.6%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 99.6%

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

      1. *-commutative 99.6%

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

      2. *-commutative 99.6%

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

      3. associate-*r* 99.7%

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

   7. Simplified 99.7%

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

4. Final simplification 87.1%

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

Alternative 8: 98.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -430000:\\ \;\;\;\;-6 \cdot \left(z \cdot \left(x - y\right)\right)\\ \mathbf{elif}\;z \leq 0.0135:\\ \;\;\;\;x + 6 \cdot \left(y \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y - x\right) \cdot \left(6 \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -430000.0)
   (* -6.0 (* z (- x y)))
   (if (<= z 0.0135) (+ x (* 6.0 (* y z))) (* (- y x) (* 6.0 z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -430000.0) {
		tmp = -6.0 * (z * (x - y));
	} else if (z <= 0.0135) {
		tmp = x + (6.0 * (y * z));
	} else {
		tmp = (y - x) * (6.0 * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-430000.0d0)) then
        tmp = (-6.0d0) * (z * (x - y))
    else if (z <= 0.0135d0) then
        tmp = x + (6.0d0 * (y * z))
    else
        tmp = (y - x) * (6.0d0 * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -430000.0) {
		tmp = -6.0 * (z * (x - y));
	} else if (z <= 0.0135) {
		tmp = x + (6.0 * (y * z));
	} else {
		tmp = (y - x) * (6.0 * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -430000.0:
		tmp = -6.0 * (z * (x - y))
	elif z <= 0.0135:
		tmp = x + (6.0 * (y * z))
	else:
		tmp = (y - x) * (6.0 * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -430000.0)
		tmp = Float64(-6.0 * Float64(z * Float64(x - y)));
	elseif (z <= 0.0135)
		tmp = Float64(x + Float64(6.0 * Float64(y * z)));
	else
		tmp = Float64(Float64(y - x) * Float64(6.0 * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -430000.0)
		tmp = -6.0 * (z * (x - y));
	elseif (z <= 0.0135)
		tmp = x + (6.0 * (y * z));
	else
		tmp = (y - x) * (6.0 * z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -4.3e5

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. *-commutative 99.7%

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

      3. fma-define 99.7%

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

      4. remove-double-neg 99.7%

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

      5. distribute-lft-neg-in 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. sub-neg 99.7%

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

      8. distribute-neg-in 99.7%

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

      9. remove-double-neg 99.7%

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

      10. +-commutative 99.7%

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

      11. sub-neg 99.7%

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

      12. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in z around inf 99.2%

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

   if -4.3e5 < z < 0.0134999999999999998

   1. Initial program 99.0%

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

   3. Taylor expanded in y around inf 99.5%

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

      1. *-commutative 99.5%

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

   5. Simplified 99.5%

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

   if 0.0134999999999999998 < z

   1. Initial program 99.7%

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

      1. associate-*r* 99.7%

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

      2. +-commutative 99.7%

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

      3. *-commutative 99.7%

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

      4. associate-*r* 99.6%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 99.6%

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

      1. *-commutative 99.6%

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

      2. *-commutative 99.6%

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

      3. associate-*r* 99.7%

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

   7. Simplified 99.7%

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

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -430000:\\ \;\;\;\;-6 \cdot \left(z \cdot \left(x - y\right)\right)\\ \mathbf{elif}\;z \leq 0.0135:\\ \;\;\;\;x + 6 \cdot \left(y \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y - x\right) \cdot \left(6 \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 60.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.165 \lor \neg \left(z \leq 0.0135\right):\\ \;\;\;\;-6 \cdot \left(x \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -0.165) (not (<= z 0.0135))) (* -6.0 (* x z)) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.165) || !(z <= 0.0135)) {
		tmp = -6.0 * (x * z);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-0.165d0)) .or. (.not. (z <= 0.0135d0))) then
        tmp = (-6.0d0) * (x * z)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.165) || !(z <= 0.0135)) {
		tmp = -6.0 * (x * z);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -0.165) or not (z <= 0.0135):
		tmp = -6.0 * (x * z)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -0.165) || !(z <= 0.0135))
		tmp = Float64(-6.0 * Float64(x * z));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -0.165) || ~((z <= 0.0135)))
		tmp = -6.0 * (x * z);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -0.165], N[Not[LessEqual[z, 0.0135]], $MachinePrecision]], N[(-6.0 * N[(x * z), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -0.165000000000000008 or 0.0134999999999999998 < z

   1. Initial program 99.7%

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

      1. associate-*r* 99.7%

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

      2. +-commutative 99.7%

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

      3. *-commutative 99.7%

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

      4. associate-*r* 99.7%

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

      5. fma-define 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around inf 99.4%

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

      1. *-commutative 99.4%

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

      2. *-commutative 99.4%

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

      3. associate-*r* 99.5%

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

   7. Simplified 99.5%

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

   8. Taylor expanded in y around 0 50.8%

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

   if -0.165000000000000008 < z < 0.0134999999999999998

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0 67.5%

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

4. Final simplification 58.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.165 \lor \neg \left(z \leq 0.0135\right):\\ \;\;\;\;-6 \cdot \left(x \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 + (z * ((y - x) * 6.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Final simplification 99.4%

   \[\leadsto x + z \cdot \left(\left(y - x\right) \cdot 6\right) \]
4. Add Preprocessing

Alternative 11: 37.0% accurate, 9.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in z around 0 31.6%

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

4. Final simplification 31.6%

   \[\leadsto x \]
5. Add Preprocessing

Developer target: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024075 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, E"
  :precision binary64

  :alt
  (- x (* (* 6.0 z) (- x y)))

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