Data.Colour.SRGB:transferFunction from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 4.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.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1050000000000:\\ \;\;\;\;\mathsf{fma}\left(y, x, y\right)\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;1 \cdot y - x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1050000000000.0)
   (fma y x y)
   (if (<= y 1.0) (- (* 1.0 y) x) (fma y x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1050000000000.0) {
		tmp = fma(y, x, y);
	} else if (y <= 1.0) {
		tmp = (1.0 * y) - x;
	} else {
		tmp = fma(y, x, y);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.05e12 or 1 < 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. mul-1-neg N/A

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

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

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. remove-double-neg N/A

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

      8. +-commutative N/A

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

      9. distribute-lft-in N/A

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

      10. *-rgt-identity N/A

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

      11. lower-fma.f64 99.4

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

   7. Applied rewrites 99.4%

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

   if -1.05e12 < y < 1

   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.0%

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

Alternative 3: 87.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.007:\\ \;\;\;\;\mathsf{fma}\left(y, x, y\right)\\ \mathbf{elif}\;y \leq 9 \cdot 10^{-14}:\\ \;\;\;\;x \cdot y - x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -0.007) (fma y x y) (if (<= y 9e-14) (- (* x y) x) (fma y x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -0.007) {
		tmp = fma(y, x, y);
	} else if (y <= 9e-14) {
		tmp = (x * y) - x;
	} else {
		tmp = fma(y, x, y);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -0.007)
		tmp = fma(y, x, y);
	elseif (y <= 9e-14)
		tmp = Float64(Float64(x * y) - x);
	else
		tmp = fma(y, x, y);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[y, -0.007], N[(y * x + y), $MachinePrecision], If[LessEqual[y, 9e-14], N[(N[(x * y), $MachinePrecision] - x), $MachinePrecision], N[(y * x + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.00700000000000000015 or 8.9999999999999995e-14 < 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. mul-1-neg N/A

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

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

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. remove-double-neg N/A

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

      8. +-commutative N/A

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

      9. distribute-lft-in N/A

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

      10. *-rgt-identity N/A

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

      11. lower-fma.f64 98.6

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

   7. Applied rewrites 98.6%

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

   if -0.00700000000000000015 < y < 8.9999999999999995e-14

   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 y} - x \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 81.6

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

   5. Applied rewrites 81.6%

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

4. Final simplification 90.1%

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

Alternative 4: 87.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.5 \cdot 10^{-7}:\\ \;\;\;\;\mathsf{fma}\left(y, x, y\right)\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-14}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.5e-7) (fma y x y) (if (<= y 8.5e-14) (- x) (fma y x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.5e-7) {
		tmp = fma(y, x, y);
	} else if (y <= 8.5e-14) {
		tmp = -x;
	} else {
		tmp = fma(y, x, y);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.5e-7)
		tmp = fma(y, x, y);
	elseif (y <= 8.5e-14)
		tmp = Float64(-x);
	else
		tmp = fma(y, x, y);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.5e-7], N[(y * x + y), $MachinePrecision], If[LessEqual[y, 8.5e-14], (-x), N[(y * x + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.4999999999999999e-7 or 8.50000000000000038e-14 < 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. mul-1-neg N/A

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

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

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. remove-double-neg N/A

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

      8. +-commutative N/A

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

      9. distribute-lft-in N/A

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

      10. *-rgt-identity N/A

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

      11. lower-fma.f64 98.6

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

   7. Applied rewrites 98.6%

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

   if -1.4999999999999999e-7 < y < 8.50000000000000038e-14

   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.1

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

   5. Applied rewrites 81.1%

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

Alternative 5: 62.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < 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. mul-1-neg N/A

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

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

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. remove-double-neg N/A

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

      8. +-commutative N/A

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

      9. distribute-lft-in N/A

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

      10. *-rgt-identity N/A

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

      11. lower-fma.f64 99.4

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

   7. Applied rewrites 99.4%

      \[\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 44.0%

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

   if -1 < y < 1

   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 79.6

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

   5. Applied rewrites 79.6%

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

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

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

5. Applied rewrites 42.2%

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

Reproduce

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