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

Percentage Accurate: 100.0% → 100.0%

Time: 3.2s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. *-commutative 100.0%

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

   3. associate--l+ 100.0%

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

   4. +-commutative 100.0%

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

   5. *-lft-identity 100.0%

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

   6. metadata-eval 100.0%

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

   7. distribute-rgt-out-- 100.0%

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

   8. fma-define 100.0%

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

   9. metadata-eval 100.0%

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

3. Simplified 100.0%

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

Alternative 2: 61.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(-x\right)\\ \mathbf{if}\;x \leq -2.4 \cdot 10^{+252}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -5.2 \cdot 10^{+228}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -9.5 \cdot 10^{+196}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -1.5 \cdot 10^{-93}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (- x))))
   (if (<= x -2.4e+252)
     t_0
     (if (<= x -5.2e+228)
       x
       (if (<= x -9.5e+196)
         t_0
         (if (<= x -1.5e-93) x (if (<= x 1.0) y t_0)))))))

C

double code(double x, double y) {
	double t_0 = y * -x;
	double tmp;
	if (x <= -2.4e+252) {
		tmp = t_0;
	} else if (x <= -5.2e+228) {
		tmp = x;
	} else if (x <= -9.5e+196) {
		tmp = t_0;
	} else if (x <= -1.5e-93) {
		tmp = x;
	} else if (x <= 1.0) {
		tmp = y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y * -x
    if (x <= (-2.4d+252)) then
        tmp = t_0
    else if (x <= (-5.2d+228)) then
        tmp = x
    else if (x <= (-9.5d+196)) then
        tmp = t_0
    else if (x <= (-1.5d-93)) then
        tmp = x
    else if (x <= 1.0d0) then
        tmp = y
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * -x;
	double tmp;
	if (x <= -2.4e+252) {
		tmp = t_0;
	} else if (x <= -5.2e+228) {
		tmp = x;
	} else if (x <= -9.5e+196) {
		tmp = t_0;
	} else if (x <= -1.5e-93) {
		tmp = x;
	} else if (x <= 1.0) {
		tmp = y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * -x
	tmp = 0
	if x <= -2.4e+252:
		tmp = t_0
	elif x <= -5.2e+228:
		tmp = x
	elif x <= -9.5e+196:
		tmp = t_0
	elif x <= -1.5e-93:
		tmp = x
	elif x <= 1.0:
		tmp = y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * Float64(-x))
	tmp = 0.0
	if (x <= -2.4e+252)
		tmp = t_0;
	elseif (x <= -5.2e+228)
		tmp = x;
	elseif (x <= -9.5e+196)
		tmp = t_0;
	elseif (x <= -1.5e-93)
		tmp = x;
	elseif (x <= 1.0)
		tmp = y;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * -x;
	tmp = 0.0;
	if (x <= -2.4e+252)
		tmp = t_0;
	elseif (x <= -5.2e+228)
		tmp = x;
	elseif (x <= -9.5e+196)
		tmp = t_0;
	elseif (x <= -1.5e-93)
		tmp = x;
	elseif (x <= 1.0)
		tmp = y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * (-x)), $MachinePrecision]}, If[LessEqual[x, -2.4e+252], t$95$0, If[LessEqual[x, -5.2e+228], x, If[LessEqual[x, -9.5e+196], t$95$0, If[LessEqual[x, -1.5e-93], x, If[LessEqual[x, 1.0], y, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.3999999999999999e252 or -5.20000000000000015e228 < x < -9.5000000000000004e196 or 1 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 98.8%

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

   4. Taylor expanded in y around inf 43.3%

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

      1. associate-*r* 43.3%

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

      2. neg-mul-1 43.3%

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

      3. *-commutative 43.3%

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

   6. Simplified 43.3%

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

   if -2.3999999999999999e252 < x < -5.20000000000000015e228 or -9.5000000000000004e196 < x < -1.5000000000000001e-93

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 50.6%

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

   if -1.5000000000000001e-93 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 74.9%

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

Alternative 3: 73.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{-96}:\\ \;\;\;\;x \cdot \left(1 - y\right)\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -6.8e-96) (* x (- 1.0 y)) (if (<= x 1.0) y (* y (- x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -6.8e-96) {
		tmp = x * (1.0 - y);
	} else if (x <= 1.0) {
		tmp = y;
	} else {
		tmp = y * -x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-6.8d-96)) then
        tmp = x * (1.0d0 - y)
    else if (x <= 1.0d0) then
        tmp = y
    else
        tmp = y * -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -6.8e-96) {
		tmp = x * (1.0 - y);
	} else if (x <= 1.0) {
		tmp = y;
	} else {
		tmp = y * -x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -6.8e-96:
		tmp = x * (1.0 - y)
	elif x <= 1.0:
		tmp = y
	else:
		tmp = y * -x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -6.8e-96)
		tmp = Float64(x * Float64(1.0 - y));
	elseif (x <= 1.0)
		tmp = y;
	else
		tmp = Float64(y * Float64(-x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -6.8e-96)
		tmp = x * (1.0 - y);
	elseif (x <= 1.0)
		tmp = y;
	else
		tmp = y * -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -6.8e-96], N[(x * N[(1.0 - y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.0], y, N[(y * (-x)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.8000000000000002e-96

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 92.0%

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

   if -6.8000000000000002e-96 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 74.9%

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

   if 1 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 98.4%

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

   4. Taylor expanded in y around inf 34.6%

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

      1. associate-*r* 34.6%

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

      2. neg-mul-1 34.6%

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

      3. *-commutative 34.6%

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

   6. Simplified 34.6%

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

Alternative 4: 74.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-93}:\\ \;\;\;\;x - x \cdot y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.6e-93) (- x (* x y)) (* y (- 1.0 x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.6e-93) {
		tmp = x - (x * y);
	} else {
		tmp = y * (1.0 - x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1.6d-93)) then
        tmp = x - (x * y)
    else
        tmp = y * (1.0d0 - x)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if x <= -1.6e-93:
		tmp = x - (x * y)
	else:
		tmp = y * (1.0 - x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.6e-93)
		tmp = Float64(x - Float64(x * y));
	else
		tmp = Float64(y * Float64(1.0 - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.6e-93)
		tmp = x - (x * y);
	else
		tmp = y * (1.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.6e-93], N[(x - N[(x * y), $MachinePrecision]), $MachinePrecision], N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.5999999999999999e-93

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 92.0%

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

      1. sub-neg 92.0%

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

      2. distribute-rgt-in 92.0%

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

      3. *-un-lft-identity 92.0%

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

   5. Applied egg-rr 92.0%

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

   if -1.5999999999999999e-93 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 60.4%

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

4. Final simplification 71.9%

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

Alternative 5: 74.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-93}:\\ \;\;\;\;x \cdot \left(1 - y\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.6e-93) (* x (- 1.0 y)) (* y (- 1.0 x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.6e-93) {
		tmp = x * (1.0 - y);
	} else {
		tmp = y * (1.0 - x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1.6d-93)) then
        tmp = x * (1.0d0 - y)
    else
        tmp = y * (1.0d0 - x)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if x <= -1.6e-93:
		tmp = x * (1.0 - y)
	else:
		tmp = y * (1.0 - x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.6e-93)
		tmp = Float64(x * Float64(1.0 - y));
	else
		tmp = Float64(y * Float64(1.0 - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.6e-93)
		tmp = x * (1.0 - y);
	else
		tmp = y * (1.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.6e-93], N[(x * N[(1.0 - y), $MachinePrecision]), $MachinePrecision], N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.5999999999999999e-93

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 92.0%

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

   if -1.5999999999999999e-93 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 60.4%

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

Alternative 6: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 7: 48.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.55 \cdot 10^{-93}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= x -1.55e-93) x y))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.55e-93) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1.55d-93)) then
        tmp = x
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.55e-93) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.55e-93:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.55e-93)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.55e-93)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.55e-93], x, y]

Derivation

1. Split input into 2 regimes

2. if x < -1.55e-93

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 46.7%

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

   if -1.55e-93 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 46.2%

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

Alternative 8: 37.8% accurate, 7.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around 0 43.2%

   \[\leadsto \color{blue}{x} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024106 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, A"
  :precision binary64
  (- (+ x y) (* x y)))