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

Percentage Accurate: 100.0% → 100.0%

Time: 6.3s

Alternatives: 11

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{+158}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq -0.175:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq -7 \cdot 10^{-265}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;x \leq 0.92:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.3e+158)
   (- x)
   (if (<= x -0.175)
     (* x y)
     (if (<= x -7e-265) 0.918938533204673 (if (<= x 0.92) (* y -0.5) (- x))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.3e+158) {
		tmp = -x;
	} else if (x <= -0.175) {
		tmp = x * y;
	} else if (x <= -7e-265) {
		tmp = 0.918938533204673;
	} else if (x <= 0.92) {
		tmp = y * -0.5;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-3.3d+158)) then
        tmp = -x
    else if (x <= (-0.175d0)) then
        tmp = x * y
    else if (x <= (-7d-265)) then
        tmp = 0.918938533204673d0
    else if (x <= 0.92d0) then
        tmp = y * (-0.5d0)
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -3.3e+158) {
		tmp = -x;
	} else if (x <= -0.175) {
		tmp = x * y;
	} else if (x <= -7e-265) {
		tmp = 0.918938533204673;
	} else if (x <= 0.92) {
		tmp = y * -0.5;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.3e+158:
		tmp = -x
	elif x <= -0.175:
		tmp = x * y
	elif x <= -7e-265:
		tmp = 0.918938533204673
	elif x <= 0.92:
		tmp = y * -0.5
	else:
		tmp = -x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.3e+158)
		tmp = Float64(-x);
	elseif (x <= -0.175)
		tmp = Float64(x * y);
	elseif (x <= -7e-265)
		tmp = 0.918938533204673;
	elseif (x <= 0.92)
		tmp = Float64(y * -0.5);
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.3e+158)
		tmp = -x;
	elseif (x <= -0.175)
		tmp = x * y;
	elseif (x <= -7e-265)
		tmp = 0.918938533204673;
	elseif (x <= 0.92)
		tmp = y * -0.5;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.3e+158], (-x), If[LessEqual[x, -0.175], N[(x * y), $MachinePrecision], If[LessEqual[x, -7e-265], 0.918938533204673, If[LessEqual[x, 0.92], N[(y * -0.5), $MachinePrecision], (-x)]]]]

Derivation

1. Split input into 4 regimes

2. if x < -3.30000000000000017e158 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. Taylor expanded in x around -inf 98.8%

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

   6. Taylor expanded in y around 0 56.3%

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

      1. neg-mul-1 56.3%

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

   8. Simplified 56.3%

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

   if -3.30000000000000017e158 < x < -0.17499999999999999

   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}{y \cdot \left(x - 0.5\right)} \]

   6. Taylor expanded in x around inf 65.2%

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

   if -0.17499999999999999 < x < -7.00000000000000031e-265

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

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

      1. neg-mul-1 55.8%

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

      2. sub-neg 55.8%

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

   7. Simplified 55.8%

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

   8. Taylor expanded in x around 0 53.3%

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

   if -7.00000000000000031e-265 < 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 58.0%

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

   6. Taylor expanded in x around 0 57.5%

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

4. Final simplification 57.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{+158}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq -0.175:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq -7 \cdot 10^{-265}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;x \leq 0.92:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(y + -1\right)\\ \mathbf{if}\;x \leq -2800000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -1.32 \cdot 10^{-257}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;x \leq 0.5:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* x (+ y -1.0))))
   (if (<= x -2800000.0)
     t_0
     (if (<= x -1.32e-257)
       (- 0.918938533204673 x)
       (if (<= x 0.5) (* y -0.5) t_0)))))

C

double code(double x, double y) {
	double t_0 = x * (y + -1.0);
	double tmp;
	if (x <= -2800000.0) {
		tmp = t_0;
	} else if (x <= -1.32e-257) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 0.5) {
		tmp = y * -0.5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x * (y + (-1.0d0))
    if (x <= (-2800000.0d0)) then
        tmp = t_0
    else if (x <= (-1.32d-257)) then
        tmp = 0.918938533204673d0 - x
    else if (x <= 0.5d0) then
        tmp = y * (-0.5d0)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = x * (y + -1.0);
	double tmp;
	if (x <= -2800000.0) {
		tmp = t_0;
	} else if (x <= -1.32e-257) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 0.5) {
		tmp = y * -0.5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = x * (y + -1.0)
	tmp = 0
	if x <= -2800000.0:
		tmp = t_0
	elif x <= -1.32e-257:
		tmp = 0.918938533204673 - x
	elif x <= 0.5:
		tmp = y * -0.5
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(x * Float64(y + -1.0))
	tmp = 0.0
	if (x <= -2800000.0)
		tmp = t_0;
	elseif (x <= -1.32e-257)
		tmp = Float64(0.918938533204673 - x);
	elseif (x <= 0.5)
		tmp = Float64(y * -0.5);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = x * (y + -1.0);
	tmp = 0.0;
	if (x <= -2800000.0)
		tmp = t_0;
	elseif (x <= -1.32e-257)
		tmp = 0.918938533204673 - x;
	elseif (x <= 0.5)
		tmp = y * -0.5;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(x * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2800000.0], t$95$0, If[LessEqual[x, -1.32e-257], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[x, 0.5], N[(y * -0.5), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.8e6 or 0.5 < 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.3%

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

   if -2.8e6 < x < -1.32e-257

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

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

      1. neg-mul-1 55.6%

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

      2. sub-neg 55.6%

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

   7. Simplified 55.6%

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

   if -1.32e-257 < x < 0.5

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

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

   6. Taylor expanded in x around 0 57.5%

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

4. Final simplification 76.7%

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

Alternative 4: 98.3% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.8e-14) (not (<= y 3.35e-18)))
   (+ (* x y) (- 0.918938533204673 (* y 0.5)))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.8e-14) || !(y <= 3.35e-18)) {
		tmp = (x * y) + (0.918938533204673 - (y * 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 <= (-2.8d-14)) .or. (.not. (y <= 3.35d-18))) then
        tmp = (x * y) + (0.918938533204673d0 - (y * 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 <= -2.8e-14) || !(y <= 3.35e-18)) {
		tmp = (x * y) + (0.918938533204673 - (y * 0.5));
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.8e-14) or not (y <= 3.35e-18):
		tmp = (x * y) + (0.918938533204673 - (y * 0.5))
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.8e-14) || !(y <= 3.35e-18))
		tmp = Float64(Float64(x * y) + Float64(0.918938533204673 - Float64(y * 0.5)));
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.8e-14) || ~((y <= 3.35e-18)))
		tmp = (x * y) + (0.918938533204673 - (y * 0.5));
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.8e-14], N[Not[LessEqual[y, 3.35e-18]], $MachinePrecision]], N[(N[(x * y), $MachinePrecision] + N[(0.918938533204673 - N[(y * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.8000000000000001e-14 or 3.3499999999999999e-18 < 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.7%

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

   if -2.8000000000000001e-14 < y < 3.3499999999999999e-18

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

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

      1. neg-mul-1 99.9%

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

      2. sub-neg 99.9%

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

   7. Simplified 99.9%

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

4. Final simplification 99.3%

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

Alternative 5: 48.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-14}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{-172}:\\ \;\;\;\;-x\\ \mathbf{elif}\;y \leq 0.0034:\\ \;\;\;\;0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;y \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -2.8e-14)
   (* y -0.5)
   (if (<= y 1.25e-172)
     (- x)
     (if (<= y 0.0034) 0.918938533204673 (* y -0.5)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -2.8e-14) {
		tmp = y * -0.5;
	} else if (y <= 1.25e-172) {
		tmp = -x;
	} else if (y <= 0.0034) {
		tmp = 0.918938533204673;
	} else {
		tmp = 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 (y <= (-2.8d-14)) then
        tmp = y * (-0.5d0)
    else if (y <= 1.25d-172) then
        tmp = -x
    else if (y <= 0.0034d0) then
        tmp = 0.918938533204673d0
    else
        tmp = y * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -2.8e-14) {
		tmp = y * -0.5;
	} else if (y <= 1.25e-172) {
		tmp = -x;
	} else if (y <= 0.0034) {
		tmp = 0.918938533204673;
	} else {
		tmp = y * -0.5;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -2.8e-14:
		tmp = y * -0.5
	elif y <= 1.25e-172:
		tmp = -x
	elif y <= 0.0034:
		tmp = 0.918938533204673
	else:
		tmp = y * -0.5
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -2.8e-14)
		tmp = Float64(y * -0.5);
	elseif (y <= 1.25e-172)
		tmp = Float64(-x);
	elseif (y <= 0.0034)
		tmp = 0.918938533204673;
	else
		tmp = Float64(y * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -2.8e-14)
		tmp = y * -0.5;
	elseif (y <= 1.25e-172)
		tmp = -x;
	elseif (y <= 0.0034)
		tmp = 0.918938533204673;
	else
		tmp = y * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -2.8e-14], N[(y * -0.5), $MachinePrecision], If[LessEqual[y, 1.25e-172], (-x), If[LessEqual[y, 0.0034], 0.918938533204673, N[(y * -0.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.8000000000000001e-14 or 0.00339999999999999981 < 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.3%

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

   6. Taylor expanded in x around 0 50.8%

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

   if -2.8000000000000001e-14 < y < 1.25e-172

   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. Taylor expanded in x around -inf 56.9%

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

   6. Taylor expanded in y around 0 56.8%

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

      1. neg-mul-1 56.8%

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

   8. Simplified 56.8%

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

   if 1.25e-172 < y < 0.00339999999999999981

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

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

      1. neg-mul-1 98.6%

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

      2. sub-neg 98.6%

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

   7. Simplified 98.6%

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

   8. Taylor expanded in x around 0 61.7%

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

Alternative 6: 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.02\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.02)))
   (* y (- x 0.5))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.35) || !(y <= 1.02)) {
		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.02d0))) 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.02)) {
		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.02):
		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.02))
		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.02)))
		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.02]], $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.02 < 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 99.0%

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

   if -1.3500000000000001 < y < 1.02

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

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

Alternative 7: 97.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1.3500000000000001

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

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

   6. Taylor expanded in y around inf 99.1%

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

   if -1.3500000000000001 < y < 1

   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} \]

   if 1 < 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.9%

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

4. Final simplification 98.6%

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

Alternative 8: 73.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.15e6 or 1.8500000000000001 < 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 99.4%

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

   6. Taylor expanded in x around 0 52.4%

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

   if -1.15e6 < y < 1.8500000000000001

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

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

Alternative 9: 49.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -0.92000000000000004 or 82000 < 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. Taylor expanded in x around -inf 98.2%

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

   6. Taylor expanded in y around 0 50.7%

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

      1. neg-mul-1 50.7%

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

   8. Simplified 50.7%

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

   if -0.92000000000000004 < x < 82000

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

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

      1. neg-mul-1 48.6%

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

      2. sub-neg 48.6%

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

   7. Simplified 48.6%

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

   8. Taylor expanded in x around 0 47.1%

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

4. Final simplification 48.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.92 \lor \neg \left(x \leq 82000\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.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 0 49.8%

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

   1. neg-mul-1 49.8%

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

   2. sub-neg 49.8%

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

7. Simplified 49.8%

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

8. Taylor expanded in x around 0 25.7%

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

Reproduce

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