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

Percentage Accurate: 100.0% → 100.0%

Time: 4.6s

Alternatives: 6

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, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

   2. cancel-sign-sub-inv 100.0%

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

   3. +-commutative 100.0%

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

   4. associate-+r+ 100.0%

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

   5. cancel-sign-sub-inv 100.0%

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

   6. associate-+l- 100.0%

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

   7. sub-neg 100.0%

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

   8. distribute-rgt-in 100.0%

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

   9. metadata-eval 100.0%

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

   10. neg-mul-1 100.0%

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

   11. associate--r+ 100.0%

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

   12. distribute-lft-out-- 100.0%

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

   13. unsub-neg 100.0%

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

   14. fmm-def 100.0%

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

   15. unsub-neg 100.0%

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

   16. remove-double-neg 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

   \[\leadsto 0.918938533204673 - \mathsf{fma}\left(y, 0.5 - x, x\right) \]
6. Add Preprocessing

Alternative 2: 98.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.12 \cdot 10^{-8} \lor \neg \left(x \leq 5.6 \cdot 10^{-11}\right):\\ \;\;\;\;x \cdot \left(y + -1\right) - -0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - y \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.12e-8) (not (<= x 5.6e-11)))
   (- (* x (+ y -1.0)) -0.918938533204673)
   (- 0.918938533204673 (* y 0.5))))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.12e-8) || !(x <= 5.6e-11)) {
		tmp = (x * (y + -1.0)) - -0.918938533204673;
	} 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 <= (-1.12d-8)) .or. (.not. (x <= 5.6d-11))) then
        tmp = (x * (y + (-1.0d0))) - (-0.918938533204673d0)
    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 <= -1.12e-8) || !(x <= 5.6e-11)) {
		tmp = (x * (y + -1.0)) - -0.918938533204673;
	} else {
		tmp = 0.918938533204673 - (y * 0.5);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.12e-8) or not (x <= 5.6e-11):
		tmp = (x * (y + -1.0)) - -0.918938533204673
	else:
		tmp = 0.918938533204673 - (y * 0.5)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.12e-8) || !(x <= 5.6e-11))
		tmp = Float64(Float64(x * Float64(y + -1.0)) - -0.918938533204673);
	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 <= -1.12e-8) || ~((x <= 5.6e-11)))
		tmp = (x * (y + -1.0)) - -0.918938533204673;
	else
		tmp = 0.918938533204673 - (y * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.12e-8], N[Not[LessEqual[x, 5.6e-11]], $MachinePrecision]], N[(N[(x * N[(y + -1.0), $MachinePrecision]), $MachinePrecision] - -0.918938533204673), $MachinePrecision], N[(0.918938533204673 - N[(y * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.11999999999999994e-8 or 5.6e-11 < 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 y around 0 99.6%

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

   if -1.11999999999999994e-8 < x < 5.6e-11

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

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

4. Final simplification 99.7%

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

Alternative 3: 97.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \lor \neg \left(y \leq 1.65\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.35) (not (<= y 1.65)))
   (* y (- x 0.5))
   (- 0.918938533204673 x)))

C

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

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.35) || !(y <= 1.65))
		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.35) || ~((y <= 1.65)))
		tmp = y * (x - 0.5);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.35], N[Not[LessEqual[y, 1.65]], $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.3500000000000001 or 1.6499999999999999 < 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.1%

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

   if -1.3500000000000001 < y < 1.6499999999999999

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

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

      1. neg-mul-1 99.1%

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

      2. unsub-neg 99.1%

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

   7. Simplified 99.1%

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

4. Final simplification 98.1%

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

Alternative 4: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ 0.918938533204673 + \left(y \cdot \left(x + -0.5\right) - x\right) \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(0.918938533204673 + Float64(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[(0.918938533204673 + N[(N[(y * N[(x + -0.5), $MachinePrecision]), $MachinePrecision] - x), $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. 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 100.0%

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

   1. sub-neg 100.0%

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

   2. distribute-lft-out-- 100.0%

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

   3. unsub-neg 100.0%

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

   4. distribute-lft-neg-out 100.0%

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

   5. *-rgt-identity 100.0%

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

   6. +-commutative 100.0%

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

   7. associate-+r+ 100.0%

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

   8. neg-mul-1 100.0%

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

   9. associate-+r+ 100.0%

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

   10. neg-mul-1 100.0%

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

   11. *-commutative 100.0%

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

   12. sub-neg 100.0%

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

   13. *-commutative 100.0%

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

   14. distribute-lft-out-- 100.0%

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

   15. associate-+r+ 100.0%

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

   16. +-commutative 100.0%

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

   17. unsub-neg 100.0%

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

   18. sub-neg 100.0%

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

   19. metadata-eval 100.0%

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

7. Simplified 100.0%

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

8. Final simplification 100.0%

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

Alternative 5: 50.7% accurate, 3.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 0.918938533204673 - x

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(0.918938533204673 - 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. 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 52.9%

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

   1. neg-mul-1 52.9%

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

   2. unsub-neg 52.9%

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

7. Simplified 52.9%

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

8. Final simplification 52.9%

   \[\leadsto 0.918938533204673 - x \]
9. Add Preprocessing

Alternative 6: 26.1% 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 x around 0 47.9%

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

6. Taylor expanded in y around 0 23.7%

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

7. Final simplification 23.7%

   \[\leadsto 0.918938533204673 \]
8. Add Preprocessing

Reproduce

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