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

Percentage Accurate: 100.0% → 100.0%

Time: 5.5s

Alternatives: 8

Speedup: 1.0×

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: 47.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.65 \cdot 10^{+21}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq -1.85 \cdot 10^{-140}:\\ \;\;\;\;-x\\ \mathbf{elif}\;y \leq -3.5 \cdot 10^{-161}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq 2.02 \cdot 10^{-41}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.65e+21)
   (* x y)
   (if (<= y -1.85e-140)
     (- x)
     (if (<= y -3.5e-161)
       0.918938533204673
       (if (<= y 2.02e-41) (- x) (* x y))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.65e+21) {
		tmp = x * y;
	} else if (y <= -1.85e-140) {
		tmp = -x;
	} else if (y <= -3.5e-161) {
		tmp = 0.918938533204673;
	} else if (y <= 2.02e-41) {
		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.65d+21)) then
        tmp = x * y
    else if (y <= (-1.85d-140)) then
        tmp = -x
    else if (y <= (-3.5d-161)) then
        tmp = 0.918938533204673d0
    else if (y <= 2.02d-41) 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.65e+21) {
		tmp = x * y;
	} else if (y <= -1.85e-140) {
		tmp = -x;
	} else if (y <= -3.5e-161) {
		tmp = 0.918938533204673;
	} else if (y <= 2.02e-41) {
		tmp = -x;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.65e+21:
		tmp = x * y
	elif y <= -1.85e-140:
		tmp = -x
	elif y <= -3.5e-161:
		tmp = 0.918938533204673
	elif y <= 2.02e-41:
		tmp = -x
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.65e+21)
		tmp = Float64(x * y);
	elseif (y <= -1.85e-140)
		tmp = Float64(-x);
	elseif (y <= -3.5e-161)
		tmp = 0.918938533204673;
	elseif (y <= 2.02e-41)
		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.65e+21)
		tmp = x * y;
	elseif (y <= -1.85e-140)
		tmp = -x;
	elseif (y <= -3.5e-161)
		tmp = 0.918938533204673;
	elseif (y <= 2.02e-41)
		tmp = -x;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.65e+21], N[(x * y), $MachinePrecision], If[LessEqual[y, -1.85e-140], (-x), If[LessEqual[y, -3.5e-161], 0.918938533204673, If[LessEqual[y, 2.02e-41], (-x), N[(x * y), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.65e21 or 2.0199999999999999e-41 < 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. 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. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 47.7%

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

   8. Taylor expanded in y around inf 45.0%

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

   if -1.65e21 < y < -1.84999999999999989e-140 or -3.5000000000000002e-161 < y < 2.0199999999999999e-41

   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. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 62.2%

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

   8. Taylor expanded in y around 0 62.1%

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

      1. mul-1-neg 62.1%

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

   10. Simplified 62.1%

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

   if -1.84999999999999989e-140 < y < -3.5000000000000002e-161

   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 93.9%

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

   6. Taylor expanded in y around 0 93.9%

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

Alternative 3: 96.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{+28} \lor \neg \left(y \leq 2.35 \cdot 10^{-6}\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.15e+28) (not (<= y 2.35e-6)))
   (* y (- x 0.5))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.15e+28) || !(y <= 2.35e-6)) {
		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.15d+28)) .or. (.not. (y <= 2.35d-6))) 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.15e+28) || !(y <= 2.35e-6)) {
		tmp = y * (x - 0.5);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.15e+28) || !(y <= 2.35e-6))
		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.15e+28) || ~((y <= 2.35e-6)))
		tmp = y * (x - 0.5);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.15e+28], N[Not[LessEqual[y, 2.35e-6]], $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.14999999999999992e28 or 2.34999999999999995e-6 < 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 98.1%

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

   if -1.14999999999999992e28 < y < 2.34999999999999995e-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 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 98.2%

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

Alternative 4: 73.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+37} \lor \neg \left(x \leq 128000\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 -1.02e+37) (not (<= x 128000.0)))
   (* x (+ y -1.0))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.02e+37) || !(x <= 128000.0)) {
		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 <= (-1.02d+37)) .or. (.not. (x <= 128000.0d0))) 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 <= -1.02e+37) || !(x <= 128000.0)) {
		tmp = x * (y + -1.0);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.02e+37) or not (x <= 128000.0):
		tmp = x * (y + -1.0)
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.02e+37) || !(x <= 128000.0))
		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 <= -1.02e+37) || ~((x <= 128000.0)))
		tmp = x * (y + -1.0);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.01999999999999995e37 or 128000 < 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. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 98.4%

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

   if -1.01999999999999995e37 < x < 128000

   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 45.2%

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

      1. neg-mul-1 45.2%

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

      2. sub-neg 45.2%

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

   7. Simplified 45.2%

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

4. Final simplification 71.6%

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

Alternative 5: 70.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{+51} \lor \neg \left(y \leq 2.9 \cdot 10^{-19}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.45e+51) (not (<= y 2.9e-19)))
   (* x y)
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.45e+51) || !(y <= 2.9e-19)) {
		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 <= (-1.45d+51)) .or. (.not. (y <= 2.9d-19))) 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 <= -1.45e+51) || !(y <= 2.9e-19)) {
		tmp = x * y;
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.45e+51) or not (y <= 2.9e-19):
		tmp = x * y
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.45e+51) || !(y <= 2.9e-19))
		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 <= -1.45e+51) || ~((y <= 2.9e-19)))
		tmp = x * y;
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.45e+51], N[Not[LessEqual[y, 2.9e-19]], $MachinePrecision]], N[(x * y), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.4499999999999999e51 or 2.9e-19 < 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. 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. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 46.6%

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

   8. Taylor expanded in y around inf 45.2%

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

   if -1.4499999999999999e51 < y < 2.9e-19

   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 95.6%

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

      1. neg-mul-1 95.6%

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

      2. sub-neg 95.6%

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

   7. Simplified 95.6%

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

4. Final simplification 70.4%

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

Alternative 6: 49.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -86000000 \lor \neg \left(x \leq 0.92\right):\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -86000000.0) (not (<= x 0.92))) (- x) 0.918938533204673))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -86000000.0) || !(x <= 0.92)) {
		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 <= (-86000000.0d0)) .or. (.not. (x <= 0.92d0))) 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 <= -86000000.0) || !(x <= 0.92)) {
		tmp = -x;
	} else {
		tmp = 0.918938533204673;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -86000000.0) or not (x <= 0.92):
		tmp = -x
	else:
		tmp = 0.918938533204673
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -86000000.0) || !(x <= 0.92))
		tmp = Float64(-x);
	else
		tmp = 0.918938533204673;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -86000000.0) || ~((x <= 0.92)))
		tmp = -x;
	else
		tmp = 0.918938533204673;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -86000000.0], N[Not[LessEqual[x, 0.92]], $MachinePrecision]], (-x), 0.918938533204673]

Derivation

1. Split input into 2 regimes

2. if x < -8.6e7 or 0.92000000000000004 < 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. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 97.8%

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

   8. Taylor expanded in y around 0 54.0%

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

      1. mul-1-neg 54.0%

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

   10. Simplified 54.0%

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

   if -8.6e7 < x < 0.92000000000000004

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

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

   6. Taylor expanded in y around 0 40.8%

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

4. Final simplification 47.7%

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

Alternative 7: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(N[(0.918938533204673 - x), $MachinePrecision] + N[(y * N[(x + -0.5), $MachinePrecision]), $MachinePrecision]), $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. +-commutative 100.0%

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

6. Applied egg-rr 100.0%

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

Alternative 8: 26.2% 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 70.7%

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

6. Taylor expanded in y around 0 20.9%

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

Reproduce

herbie shell --seed 2024105 
(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))