Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, A

Percentage Accurate: 100.0% → 100.0%

Time: 5.4s

Alternatives: 11

Speedup: 1.2×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

   \[\leadsto \left(x \cdot \left(y + -1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
4. Add Preprocessing

Alternative 2: 98.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.024:\\ \;\;\;\;0.918938533204673 + \left(x \cdot y - x\right)\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{-30}:\\ \;\;\;\;x \cdot y + \left(0.918938533204673 - y \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.918938533204673 + x \cdot y\right) - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -0.024)
   (+ 0.918938533204673 (- (* x y) x))
   (if (<= x 8.6e-30)
     (+ (* x y) (- 0.918938533204673 (* y 0.5)))
     (- (+ 0.918938533204673 (* x y)) x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -0.024) {
		tmp = 0.918938533204673 + ((x * y) - x);
	} else if (x <= 8.6e-30) {
		tmp = (x * y) + (0.918938533204673 - (y * 0.5));
	} else {
		tmp = (0.918938533204673 + (x * 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 <= (-0.024d0)) then
        tmp = 0.918938533204673d0 + ((x * y) - x)
    else if (x <= 8.6d-30) then
        tmp = (x * y) + (0.918938533204673d0 - (y * 0.5d0))
    else
        tmp = (0.918938533204673d0 + (x * y)) - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -0.024) {
		tmp = 0.918938533204673 + ((x * y) - x);
	} else if (x <= 8.6e-30) {
		tmp = (x * y) + (0.918938533204673 - (y * 0.5));
	} else {
		tmp = (0.918938533204673 + (x * y)) - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -0.024:
		tmp = 0.918938533204673 + ((x * y) - x)
	elif x <= 8.6e-30:
		tmp = (x * y) + (0.918938533204673 - (y * 0.5))
	else:
		tmp = (0.918938533204673 + (x * y)) - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -0.024)
		tmp = Float64(0.918938533204673 + Float64(Float64(x * y) - x));
	elseif (x <= 8.6e-30)
		tmp = Float64(Float64(x * y) + Float64(0.918938533204673 - Float64(y * 0.5)));
	else
		tmp = Float64(Float64(0.918938533204673 + Float64(x * y)) - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -0.024)
		tmp = 0.918938533204673 + ((x * y) - x);
	elseif (x <= 8.6e-30)
		tmp = (x * y) + (0.918938533204673 - (y * 0.5));
	else
		tmp = (0.918938533204673 + (x * y)) - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -0.024], N[(0.918938533204673 + N[(N[(x * y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.6e-30], N[(N[(x * y), $MachinePrecision] + N[(0.918938533204673 - N[(y * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.918938533204673 + N[(x * y), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -0.024

   1. Initial program 100.0%

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

      1. cancel-sign-sub-inv 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. metadata-eval 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-+r+ 100.0%

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

      8. unsub-neg 100.0%

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

      9. associate-+l- 100.0%

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

      10. distribute-lft-neg-out 100.0%

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

      11. distribute-rgt-neg-in 100.0%

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

      12. distribute-lft-out 100.0%

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

      13. fma-neg 100.0%

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

      14. +-commutative 100.0%

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

      15. metadata-eval 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate-+l- 100.0%

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

      18. neg-sub0 100.0%

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

      19. +-commutative 100.0%

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

      20. unsub-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. associate-+r- 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 99.3%

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

      1. *-commutative 99.3%

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

   9. Simplified 99.3%

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

       1. +-commutative 99.3%

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

       2. associate--l+ 99.3%

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

   11. Applied egg-rr 99.3%

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

   if -0.024 < x < 8.59999999999999932e-30

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 100.0%

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

      1. *-commutative 100.0%

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

   7. Simplified 100.0%

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

   if 8.59999999999999932e-30 < x

   1. Initial program 100.0%

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

      1. cancel-sign-sub-inv 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. metadata-eval 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-+r+ 100.0%

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

      8. unsub-neg 100.0%

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

      9. associate-+l- 100.0%

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

      10. distribute-lft-neg-out 100.0%

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

      11. distribute-rgt-neg-in 100.0%

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

      12. distribute-lft-out 100.0%

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

      13. fma-neg 100.0%

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

      14. +-commutative 100.0%

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

      15. metadata-eval 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate-+l- 100.0%

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

      18. neg-sub0 100.0%

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

      19. +-commutative 100.0%

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

      20. unsub-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. associate-+r- 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 94.9%

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

      1. *-commutative 94.9%

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

   9. Simplified 94.9%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.024:\\ \;\;\;\;0.918938533204673 + \left(x \cdot y - x\right)\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{-30}:\\ \;\;\;\;x \cdot y + \left(0.918938533204673 - y \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.918938533204673 + x \cdot y\right) - x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 49.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.85:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq -3.7 \cdot 10^{-66}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{-25}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.85)
   (* x y)
   (if (<= y -3.7e-66) 0.918938533204673 (if (<= y 1.2e-25) (- x) (* x y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.85) {
		tmp = x * y;
	} else if (y <= -3.7e-66) {
		tmp = 0.918938533204673;
	} else if (y <= 1.2e-25) {
		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.85d0)) then
        tmp = x * y
    else if (y <= (-3.7d-66)) then
        tmp = 0.918938533204673d0
    else if (y <= 1.2d-25) 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.85) {
		tmp = x * y;
	} else if (y <= -3.7e-66) {
		tmp = 0.918938533204673;
	} else if (y <= 1.2e-25) {
		tmp = -x;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.85:
		tmp = x * y
	elif y <= -3.7e-66:
		tmp = 0.918938533204673
	elif y <= 1.2e-25:
		tmp = -x
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.85)
		tmp = Float64(x * y);
	elseif (y <= -3.7e-66)
		tmp = 0.918938533204673;
	elseif (y <= 1.2e-25)
		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.85)
		tmp = x * y;
	elseif (y <= -3.7e-66)
		tmp = 0.918938533204673;
	elseif (y <= 1.2e-25)
		tmp = -x;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.85], N[(x * y), $MachinePrecision], If[LessEqual[y, -3.7e-66], 0.918938533204673, If[LessEqual[y, 1.2e-25], (-x), N[(x * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.8500000000000001 or 1.20000000000000005e-25 < y

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 96.4%

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

      1. *-commutative 96.4%

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

   7. Simplified 96.4%

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

   8. Taylor expanded in x around inf 51.5%

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

      1. *-commutative 51.5%

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

   10. Simplified 51.5%

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

   if -1.8500000000000001 < y < -3.7000000000000002e-66

   1. Initial program 99.9%

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

      1. associate-+l- 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around inf 68.1%

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

      1. *-commutative 68.1%

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

   7. Simplified 68.1%

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

   8. Taylor expanded in y around 0 59.6%

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

   if -3.7000000000000002e-66 < y < 1.20000000000000005e-25

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 56.9%

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

   6. Taylor expanded in y around 0 56.9%

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

      1. neg-mul-1 56.9%

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

   8. Simplified 56.9%

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

4. Final simplification 54.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.85:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq -3.7 \cdot 10^{-66}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{-25}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.000245 \lor \neg \left(x \leq 1.32 \cdot 10^{-6}\right):\\ \;\;\;\;0.918938533204673 + \left(x \cdot y - x\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - y \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -0.000245) (not (<= x 1.32e-6)))
   (+ 0.918938533204673 (- (* x y) x))
   (- 0.918938533204673 (* y 0.5))))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -0.000245) || !(x <= 1.32e-6)) {
		tmp = 0.918938533204673 + ((x * y) - x);
	} else {
		tmp = 0.918938533204673 - (y * 0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-0.000245d0)) .or. (.not. (x <= 1.32d-6))) then
        tmp = 0.918938533204673d0 + ((x * y) - x)
    else
        tmp = 0.918938533204673d0 - (y * 0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -0.000245) || !(x <= 1.32e-6)) {
		tmp = 0.918938533204673 + ((x * y) - x);
	} else {
		tmp = 0.918938533204673 - (y * 0.5);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -0.000245) or not (x <= 1.32e-6):
		tmp = 0.918938533204673 + ((x * y) - x)
	else:
		tmp = 0.918938533204673 - (y * 0.5)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -0.000245) || !(x <= 1.32e-6))
		tmp = Float64(0.918938533204673 + Float64(Float64(x * y) - x));
	else
		tmp = Float64(0.918938533204673 - Float64(y * 0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -0.000245) || ~((x <= 1.32e-6)))
		tmp = 0.918938533204673 + ((x * y) - x);
	else
		tmp = 0.918938533204673 - (y * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -0.000245], N[Not[LessEqual[x, 1.32e-6]], $MachinePrecision]], N[(0.918938533204673 + N[(N[(x * y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], N[(0.918938533204673 - N[(y * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.4499999999999999e-4 or 1.3200000000000001e-6 < x

   1. Initial program 100.0%

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

      1. cancel-sign-sub-inv 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. metadata-eval 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-+r+ 100.0%

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

      8. unsub-neg 100.0%

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

      9. associate-+l- 100.0%

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

      10. distribute-lft-neg-out 100.0%

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

      11. distribute-rgt-neg-in 100.0%

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

      12. distribute-lft-out 100.0%

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

      13. fma-neg 100.0%

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

      14. +-commutative 100.0%

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

      15. metadata-eval 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate-+l- 100.0%

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

      18. neg-sub0 100.0%

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

      19. +-commutative 100.0%

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

      20. unsub-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. associate-+r- 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 98.4%

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

      1. *-commutative 98.4%

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

   9. Simplified 98.4%

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

       1. +-commutative 98.4%

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

       2. associate--l+ 98.4%

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

   11. Applied egg-rr 98.4%

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

   if -2.4499999999999999e-4 < x < 1.3200000000000001e-6

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 98.6%

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

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.000245 \lor \neg \left(x \leq 1.32 \cdot 10^{-6}\right):\\ \;\;\;\;0.918938533204673 + \left(x \cdot y - x\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - y \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.000245:\\ \;\;\;\;0.918938533204673 + \left(x \cdot y - x\right)\\ \mathbf{elif}\;x \leq 0.00049:\\ \;\;\;\;0.918938533204673 - y \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(0.918938533204673 + x \cdot y\right) - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -0.000245)
   (+ 0.918938533204673 (- (* x y) x))
   (if (<= x 0.00049)
     (- 0.918938533204673 (* y 0.5))
     (- (+ 0.918938533204673 (* x y)) x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -0.000245) {
		tmp = 0.918938533204673 + ((x * y) - x);
	} else if (x <= 0.00049) {
		tmp = 0.918938533204673 - (y * 0.5);
	} else {
		tmp = (0.918938533204673 + (x * 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 <= (-0.000245d0)) then
        tmp = 0.918938533204673d0 + ((x * y) - x)
    else if (x <= 0.00049d0) then
        tmp = 0.918938533204673d0 - (y * 0.5d0)
    else
        tmp = (0.918938533204673d0 + (x * y)) - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -0.000245) {
		tmp = 0.918938533204673 + ((x * y) - x);
	} else if (x <= 0.00049) {
		tmp = 0.918938533204673 - (y * 0.5);
	} else {
		tmp = (0.918938533204673 + (x * y)) - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -0.000245:
		tmp = 0.918938533204673 + ((x * y) - x)
	elif x <= 0.00049:
		tmp = 0.918938533204673 - (y * 0.5)
	else:
		tmp = (0.918938533204673 + (x * y)) - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -0.000245)
		tmp = Float64(0.918938533204673 + Float64(Float64(x * y) - x));
	elseif (x <= 0.00049)
		tmp = Float64(0.918938533204673 - Float64(y * 0.5));
	else
		tmp = Float64(Float64(0.918938533204673 + Float64(x * y)) - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -0.000245)
		tmp = 0.918938533204673 + ((x * y) - x);
	elseif (x <= 0.00049)
		tmp = 0.918938533204673 - (y * 0.5);
	else
		tmp = (0.918938533204673 + (x * y)) - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -0.000245], N[(0.918938533204673 + N[(N[(x * y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 0.00049], N[(0.918938533204673 - N[(y * 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(0.918938533204673 + N[(x * y), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.4499999999999999e-4

   1. Initial program 100.0%

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

      1. cancel-sign-sub-inv 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. metadata-eval 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-+r+ 100.0%

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

      8. unsub-neg 100.0%

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

      9. associate-+l- 100.0%

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

      10. distribute-lft-neg-out 100.0%

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

      11. distribute-rgt-neg-in 100.0%

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

      12. distribute-lft-out 100.0%

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

      13. fma-neg 100.0%

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

      14. +-commutative 100.0%

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

      15. metadata-eval 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate-+l- 100.0%

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

      18. neg-sub0 100.0%

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

      19. +-commutative 100.0%

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

      20. unsub-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. associate-+r- 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 99.3%

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

      1. *-commutative 99.3%

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

   9. Simplified 99.3%

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

       1. +-commutative 99.3%

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

       2. associate--l+ 99.3%

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

   11. Applied egg-rr 99.3%

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

   if -2.4499999999999999e-4 < x < 4.8999999999999998e-4

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 98.6%

      \[\leadsto \color{blue}{0.918938533204673 - 0.5 \cdot y} \]

   if 4.8999999999999998e-4 < x

   1. Initial program 100.0%

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

      1. cancel-sign-sub-inv 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. metadata-eval 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-+r+ 100.0%

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

      8. unsub-neg 100.0%

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

      9. associate-+l- 100.0%

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

      10. distribute-lft-neg-out 100.0%

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

      11. distribute-rgt-neg-in 100.0%

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

      12. distribute-lft-out 100.0%

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

      13. fma-neg 100.0%

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

      14. +-commutative 100.0%

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

      15. metadata-eval 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate-+l- 100.0%

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

      18. neg-sub0 100.0%

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

      19. +-commutative 100.0%

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

      20. unsub-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. associate-+r- 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 97.5%

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

      1. *-commutative 97.5%

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

   9. Simplified 97.5%

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

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.000245:\\ \;\;\;\;0.918938533204673 + \left(x \cdot y - x\right)\\ \mathbf{elif}\;x \leq 0.00049:\\ \;\;\;\;0.918938533204673 - y \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(0.918938533204673 + x \cdot y\right) - x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.4 \lor \neg \left(y \leq 0.056\right):\\ \;\;\;\;y \cdot \left(x - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.4) (not (<= y 0.056)))
   (* y (- x 0.5))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.4) || !(y <= 0.056)) {
		tmp = y * (x - 0.5);
	} else {
		tmp = 0.918938533204673 - 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 <= (-1.4d0)) .or. (.not. (y <= 0.056d0))) then
        tmp = y * (x - 0.5d0)
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.4) || !(y <= 0.056)) {
		tmp = y * (x - 0.5);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.4) or not (y <= 0.056):
		tmp = y * (x - 0.5)
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.4) || !(y <= 0.056))
		tmp = Float64(y * Float64(x - 0.5));
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.4) || ~((y <= 0.056)))
		tmp = y * (x - 0.5);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.4], N[Not[LessEqual[y, 0.056]], $MachinePrecision]], N[(y * N[(x - 0.5), $MachinePrecision]), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3999999999999999 or 0.0560000000000000012 < y

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 97.5%

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

   if -1.3999999999999999 < y < 0.0560000000000000012

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.3%

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

      1. neg-mul-1 98.3%

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

      2. sub-neg 98.3%

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

   7. Simplified 98.3%

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

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.4 \lor \neg \left(y \leq 0.056\right):\\ \;\;\;\;y \cdot \left(x - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 72.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -360000000000 \lor \neg \left(x \leq 2.5 \cdot 10^{-43}\right):\\ \;\;\;\;x \cdot \left(y + -1\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -360000000000.0) (not (<= x 2.5e-43)))
   (* x (+ y -1.0))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -360000000000.0) || !(x <= 2.5e-43)) {
		tmp = x * (y + -1.0);
	} else {
		tmp = 0.918938533204673 - 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 <= (-360000000000.0d0)) .or. (.not. (x <= 2.5d-43))) then
        tmp = x * (y + (-1.0d0))
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -360000000000.0) || !(x <= 2.5e-43)) {
		tmp = x * (y + -1.0);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -360000000000.0) or not (x <= 2.5e-43):
		tmp = x * (y + -1.0)
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -360000000000.0) || !(x <= 2.5e-43))
		tmp = Float64(x * Float64(y + -1.0));
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -360000000000.0) || ~((x <= 2.5e-43)))
		tmp = x * (y + -1.0);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3.6e11 or 2.50000000000000009e-43 < x

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 94.2%

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

   if -3.6e11 < x < 2.50000000000000009e-43

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 49.0%

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

      1. neg-mul-1 49.0%

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

      2. sub-neg 49.0%

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

   7. Simplified 49.0%

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

4. Final simplification 74.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -360000000000 \lor \neg \left(x \leq 2.5 \cdot 10^{-43}\right):\\ \;\;\;\;x \cdot \left(y + -1\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 72.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -10500000.0) (not (<= y 3e-23)))
   (* x y)
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -10500000.0) || !(y <= 3e-23)) {
		tmp = x * y;
	} else {
		tmp = 0.918938533204673 - 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 <= (-10500000.0d0)) .or. (.not. (y <= 3d-23))) then
        tmp = x * y
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.05e7 or 3.00000000000000003e-23 < y

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 97.4%

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

      1. *-commutative 97.4%

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

   7. Simplified 97.4%

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

   8. Taylor expanded in x around inf 52.1%

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

      1. *-commutative 52.1%

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

   10. Simplified 52.1%

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

   if -1.05e7 < y < 3.00000000000000003e-23

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 97.6%

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

      1. neg-mul-1 97.6%

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

      2. sub-neg 97.6%

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

   7. Simplified 97.6%

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

4. Final simplification 72.2%

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

Alternative 9: 44.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{+26} \lor \neg \left(x \leq 4.3 \cdot 10^{-128}\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -9.6e+26) (not (<= x 4.3e-128))) (- x) 0.918938533204673))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -9.6e+26) || !(x <= 4.3e-128)) {
		tmp = -x;
	} else {
		tmp = 0.918938533204673;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-9.6d+26)) .or. (.not. (x <= 4.3d-128))) then
        tmp = -x
    else
        tmp = 0.918938533204673d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -9.6e+26) || !(x <= 4.3e-128)) {
		tmp = -x;
	} else {
		tmp = 0.918938533204673;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -9.6e+26) or not (x <= 4.3e-128):
		tmp = -x
	else:
		tmp = 0.918938533204673
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -9.6e+26) || !(x <= 4.3e-128))
		tmp = Float64(-x);
	else
		tmp = 0.918938533204673;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -9.6e+26) || ~((x <= 4.3e-128)))
		tmp = -x;
	else
		tmp = 0.918938533204673;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -9.6e+26], N[Not[LessEqual[x, 4.3e-128]], $MachinePrecision]], (-x), 0.918938533204673]

Derivation

1. Split input into 2 regimes

2. if x < -9.60000000000000018e26 or 4.29999999999999994e-128 < x

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 88.8%

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

   6. Taylor expanded in y around 0 41.0%

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

      1. neg-mul-1 41.0%

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

   8. Simplified 41.0%

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

   if -9.60000000000000018e26 < x < 4.29999999999999994e-128

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. sub-neg 100.0%

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

      3. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 97.6%

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

      1. *-commutative 97.6%

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

   7. Simplified 97.6%

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

   8. Taylor expanded in y around 0 46.8%

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

4. Final simplification 43.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{+26} \lor \neg \left(x \leq 4.3 \cdot 10^{-128}\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. cancel-sign-sub-inv 100.0%

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

   2. +-commutative 100.0%

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

   3. sub-neg 100.0%

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

   4. distribute-rgt-in 100.0%

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

   5. metadata-eval 100.0%

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

   6. neg-mul-1 100.0%

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

   7. associate-+r+ 100.0%

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

   8. unsub-neg 100.0%

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

   9. associate-+l- 100.0%

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

   10. distribute-lft-neg-out 100.0%

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

   11. distribute-rgt-neg-in 100.0%

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

   12. distribute-lft-out 100.0%

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

   13. fma-neg 100.0%

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

   14. +-commutative 100.0%

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

   15. metadata-eval 100.0%

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

   16. neg-sub0 100.0%

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

   17. associate-+l- 100.0%

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

   18. neg-sub0 100.0%

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

   19. +-commutative 100.0%

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

   20. unsub-neg 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. fma-undefine 100.0%

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

   2. associate-+r- 100.0%

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

6. Applied egg-rr 100.0%

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

7. Final simplification 100.0%

   \[\leadsto \left(0.918938533204673 + y \cdot \left(x + -0.5\right)\right) - x \]
8. Add Preprocessing

Alternative 11: 26.0% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 0.918938533204673)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 0.918938533204673

Julia

function code(x, y)
	return 0.918938533204673
end

MATLAB

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

Wolfram

code[x_, y_] := 0.918938533204673

Derivation

1. Initial program 100.0%

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

   1. associate-+l- 100.0%

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

   2. sub-neg 100.0%

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

   3. metadata-eval 100.0%

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

3. Simplified 100.0%

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

5. Taylor expanded in y around inf 76.2%

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

   1. *-commutative 76.2%

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

7. Simplified 76.2%

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

8. Taylor expanded in y around 0 23.1%

   \[\leadsto \color{blue}{0.918938533204673} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024107 
(FPCore (x y)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))