Data.Colour.SRGB:transferFunction from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 5.9s

Alternatives: 6

Speedup: 1.2×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. lift--.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lift-+.f64 N/A

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

   5. +-commutative N/A

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

   6. distribute-rgt-in N/A

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

   7. *-lft-identity N/A

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

   8. *-commutative N/A

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

   9. +-commutative N/A

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

   10. associate--l+ N/A

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

   11. lower-fma.f64 N/A

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

   12. lower--.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 98.3% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 3.2e-23))) (fma y x y) (- (* 1.0 y) x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 3.2e-23)) {
		tmp = fma(y, x, y);
	} else {
		tmp = (1.0 * y) - x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 3.2e-23))
		tmp = fma(y, x, y);
	else
		tmp = Float64(Float64(1.0 * y) - x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 3.2e-23]], $MachinePrecision]], N[(y * x + y), $MachinePrecision], N[(N[(1.0 * y), $MachinePrecision] - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 3.19999999999999976e-23 < y

   1. Initial program 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. distribute-rgt-in N/A

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

      7. *-lft-identity N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. associate--l+ N/A

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

      11. lower-fma.f64 N/A

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

      12. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around -inf

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

      1. associate-*r* N/A

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

      2. distribute-rgt-out-- N/A

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

      3. mul-1-neg N/A

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

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

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

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

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. fp-cancel-sign-sub-inv N/A

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

      11. *-commutative N/A

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

      12. *-rgt-identity N/A

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

      13. lower-fma.f64 98.9

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

   7. Applied rewrites 98.9%

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

   if -1 < y < 3.19999999999999976e-23

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.3%

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

4. Final simplification 99.1%

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

Alternative 3: 86.7% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -9e-44) (not (<= y 1.05e-31))) (fma y x y) (* (- y 1.0) x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -9e-44) || !(y <= 1.05e-31)) {
		tmp = fma(y, x, y);
	} else {
		tmp = (y - 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -9e-44) || !(y <= 1.05e-31))
		tmp = fma(y, x, y);
	else
		tmp = Float64(Float64(y - 1.0) * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -9e-44], N[Not[LessEqual[y, 1.05e-31]], $MachinePrecision]], N[(y * x + y), $MachinePrecision], N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -8.9999999999999997e-44 or 1.04999999999999996e-31 < y

   1. Initial program 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. distribute-rgt-in N/A

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

      7. *-lft-identity N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. associate--l+ N/A

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

      11. lower-fma.f64 N/A

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

      12. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around -inf

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

      1. associate-*r* N/A

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

      2. distribute-rgt-out-- N/A

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

      3. mul-1-neg N/A

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

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

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

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

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. fp-cancel-sign-sub-inv N/A

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

      11. *-commutative N/A

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

      12. *-rgt-identity N/A

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

      13. lower-fma.f64 97.2

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

   7. Applied rewrites 97.2%

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

   if -8.9999999999999997e-44 < y < 1.04999999999999996e-31

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 81.2

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

   5. Applied rewrites 81.2%

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

4. Final simplification 90.2%

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

Alternative 4: 86.7% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -9e-44) (not (<= y 1.05e-31))) (fma y x y) (- x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -9e-44) || !(y <= 1.05e-31)) {
		tmp = fma(y, x, y);
	} else {
		tmp = -x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -9e-44) || !(y <= 1.05e-31))
		tmp = fma(y, x, y);
	else
		tmp = Float64(-x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -9e-44], N[Not[LessEqual[y, 1.05e-31]], $MachinePrecision]], N[(y * x + y), $MachinePrecision], (-x)]

Derivation

1. Split input into 2 regimes

2. if y < -8.9999999999999997e-44 or 1.04999999999999996e-31 < y

   1. Initial program 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. distribute-rgt-in N/A

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

      7. *-lft-identity N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. associate--l+ N/A

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

      11. lower-fma.f64 N/A

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

      12. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around -inf

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

      1. associate-*r* N/A

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

      2. distribute-rgt-out-- N/A

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

      3. mul-1-neg N/A

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

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

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

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

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. fp-cancel-sign-sub-inv N/A

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

      11. *-commutative N/A

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

      12. *-rgt-identity N/A

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

      13. lower-fma.f64 97.2

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

   7. Applied rewrites 97.2%

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

   if -8.9999999999999997e-44 < y < 1.04999999999999996e-31

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. lower-neg.f64 81.2

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

   5. Applied rewrites 81.2%

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

4. Final simplification 90.2%

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

Alternative 5: 60.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.006 \lor \neg \left(y \leq 5.2 \cdot 10^{-23}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -0.006) (not (<= y 5.2e-23))) (* x y) (- x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -0.006) || !(y <= 5.2e-23)) {
		tmp = x * y;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-0.006d0)) .or. (.not. (y <= 5.2d-23))) then
        tmp = x * y
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -0.006) || !(y <= 5.2e-23)) {
		tmp = x * y;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -0.006) or not (y <= 5.2e-23):
		tmp = x * y
	else:
		tmp = -x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -0.006) || !(y <= 5.2e-23))
		tmp = Float64(x * y);
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -0.006) || ~((y <= 5.2e-23)))
		tmp = x * y;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -0.006], N[Not[LessEqual[y, 5.2e-23]], $MachinePrecision]], N[(x * y), $MachinePrecision], (-x)]

Derivation

1. Split input into 2 regimes

2. if y < -0.0060000000000000001 or 5.2e-23 < y

   1. Initial program 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. distribute-rgt-in N/A

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

      7. *-lft-identity N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. associate--l+ N/A

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

      11. lower-fma.f64 N/A

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

      12. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around -inf

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

      1. associate-*r* N/A

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

      2. distribute-rgt-out-- N/A

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

      3. mul-1-neg N/A

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

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

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

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

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. fp-cancel-sign-sub-inv N/A

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

      11. *-commutative N/A

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

      12. *-rgt-identity N/A

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

      13. lower-fma.f64 98.9

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

   7. Applied rewrites 98.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 45.3%

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

   if -0.0060000000000000001 < y < 5.2e-23

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. lower-neg.f64 74.3

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

   5. Applied rewrites 74.3%

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

4. Final simplification 59.5%

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

Alternative 6: 36.6% accurate, 4.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 Float64(-x)
end

MATLAB

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

Wolfram

code[x_, y_] := (-x)

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around 0

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

   2. lower-neg.f64 38.0

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

5. Applied rewrites 38.0%

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

Reproduce

herbie shell --seed 2024326 
(FPCore (x y)
  :name "Data.Colour.SRGB:transferFunction from colour-2.3.3"
  :precision binary64
  (- (* (+ x 1.0) y) x))