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

Percentage Accurate: 100.0% → 100.0%

Time: 5.4s

Alternatives: 10

Speedup: N/A×

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.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. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. sub-neg 100.0%

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

   4. distribute-rgt-in 100.0%

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

   5. associate-+r+ 100.0%

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

   6. associate-+l+ 100.0%

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

   7. distribute-rgt-neg-in 100.0%

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

   8. distribute-lft-out 100.0%

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

   9. fma-def 100.0%

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

   10. +-commutative 100.0%

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

   11. metadata-eval 100.0%

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

   12. +-commutative 100.0%

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

   13. cancel-sign-sub-inv 100.0%

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

   14. *-lft-identity 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in y around 0 100.0%

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

5. Final simplification 100.0%

   \[\leadsto \left(0.918938533204673 + y \cdot \left(x - 0.5\right)\right) - x \]

Alternative 2: 49.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+271}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -7.5 \cdot 10^{+215}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -4.1 \cdot 10^{+183}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -3 \cdot 10^{+20}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -1.25 \cdot 10^{-139}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq -1.3 \cdot 10^{-190}:\\ \;\;\;\;-x\\ \mathbf{elif}\;y \leq 9 \cdot 10^{-298}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-7}:\\ \;\;\;\;-x\\ \mathbf{elif}\;y \leq 2 \cdot 10^{+67}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.9e+271)
   (* y -0.5)
   (if (<= y -7.5e+215)
     (* y x)
     (if (<= y -4.1e+183)
       (* y -0.5)
       (if (<= y -3e+20)
         (* y x)
         (if (<= y -1.25e-139)
           0.918938533204673
           (if (<= y -1.3e-190)
             (- x)
             (if (<= y 9e-298)
               0.918938533204673
               (if (<= y 8.5e-7)
                 (- x)
                 (if (<= y 2e+67) (* y x) (* y -0.5)))))))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.9e+271) {
		tmp = y * -0.5;
	} else if (y <= -7.5e+215) {
		tmp = y * x;
	} else if (y <= -4.1e+183) {
		tmp = y * -0.5;
	} else if (y <= -3e+20) {
		tmp = y * x;
	} else if (y <= -1.25e-139) {
		tmp = 0.918938533204673;
	} else if (y <= -1.3e-190) {
		tmp = -x;
	} else if (y <= 9e-298) {
		tmp = 0.918938533204673;
	} else if (y <= 8.5e-7) {
		tmp = -x;
	} else if (y <= 2e+67) {
		tmp = y * x;
	} 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 <= (-1.9d+271)) then
        tmp = y * (-0.5d0)
    else if (y <= (-7.5d+215)) then
        tmp = y * x
    else if (y <= (-4.1d+183)) then
        tmp = y * (-0.5d0)
    else if (y <= (-3d+20)) then
        tmp = y * x
    else if (y <= (-1.25d-139)) then
        tmp = 0.918938533204673d0
    else if (y <= (-1.3d-190)) then
        tmp = -x
    else if (y <= 9d-298) then
        tmp = 0.918938533204673d0
    else if (y <= 8.5d-7) then
        tmp = -x
    else if (y <= 2d+67) then
        tmp = y * x
    else
        tmp = y * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.9e+271) {
		tmp = y * -0.5;
	} else if (y <= -7.5e+215) {
		tmp = y * x;
	} else if (y <= -4.1e+183) {
		tmp = y * -0.5;
	} else if (y <= -3e+20) {
		tmp = y * x;
	} else if (y <= -1.25e-139) {
		tmp = 0.918938533204673;
	} else if (y <= -1.3e-190) {
		tmp = -x;
	} else if (y <= 9e-298) {
		tmp = 0.918938533204673;
	} else if (y <= 8.5e-7) {
		tmp = -x;
	} else if (y <= 2e+67) {
		tmp = y * x;
	} else {
		tmp = y * -0.5;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.9e+271:
		tmp = y * -0.5
	elif y <= -7.5e+215:
		tmp = y * x
	elif y <= -4.1e+183:
		tmp = y * -0.5
	elif y <= -3e+20:
		tmp = y * x
	elif y <= -1.25e-139:
		tmp = 0.918938533204673
	elif y <= -1.3e-190:
		tmp = -x
	elif y <= 9e-298:
		tmp = 0.918938533204673
	elif y <= 8.5e-7:
		tmp = -x
	elif y <= 2e+67:
		tmp = y * x
	else:
		tmp = y * -0.5
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.9e+271)
		tmp = Float64(y * -0.5);
	elseif (y <= -7.5e+215)
		tmp = Float64(y * x);
	elseif (y <= -4.1e+183)
		tmp = Float64(y * -0.5);
	elseif (y <= -3e+20)
		tmp = Float64(y * x);
	elseif (y <= -1.25e-139)
		tmp = 0.918938533204673;
	elseif (y <= -1.3e-190)
		tmp = Float64(-x);
	elseif (y <= 9e-298)
		tmp = 0.918938533204673;
	elseif (y <= 8.5e-7)
		tmp = Float64(-x);
	elseif (y <= 2e+67)
		tmp = Float64(y * x);
	else
		tmp = Float64(y * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.9e+271)
		tmp = y * -0.5;
	elseif (y <= -7.5e+215)
		tmp = y * x;
	elseif (y <= -4.1e+183)
		tmp = y * -0.5;
	elseif (y <= -3e+20)
		tmp = y * x;
	elseif (y <= -1.25e-139)
		tmp = 0.918938533204673;
	elseif (y <= -1.3e-190)
		tmp = -x;
	elseif (y <= 9e-298)
		tmp = 0.918938533204673;
	elseif (y <= 8.5e-7)
		tmp = -x;
	elseif (y <= 2e+67)
		tmp = y * x;
	else
		tmp = y * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.9e+271], N[(y * -0.5), $MachinePrecision], If[LessEqual[y, -7.5e+215], N[(y * x), $MachinePrecision], If[LessEqual[y, -4.1e+183], N[(y * -0.5), $MachinePrecision], If[LessEqual[y, -3e+20], N[(y * x), $MachinePrecision], If[LessEqual[y, -1.25e-139], 0.918938533204673, If[LessEqual[y, -1.3e-190], (-x), If[LessEqual[y, 9e-298], 0.918938533204673, If[LessEqual[y, 8.5e-7], (-x), If[LessEqual[y, 2e+67], N[(y * x), $MachinePrecision], N[(y * -0.5), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -1.8999999999999999e271 or -7.4999999999999994e215 < y < -4.10000000000000015e183 or 1.99999999999999997e67 < 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 100.0%

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

   5. Taylor expanded in x around 0 63.7%

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

      1. *-commutative 63.7%

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

   7. Simplified 63.7%

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

   if -1.8999999999999999e271 < y < -7.4999999999999994e215 or -4.10000000000000015e183 < y < -3e20 or 8.50000000000000014e-7 < y < 1.99999999999999997e67

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 94.5%

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

   5. Taylor expanded in x around inf 66.5%

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

   if -3e20 < y < -1.25000000000000008e-139 or -1.2999999999999999e-190 < y < 8.99999999999999985e-298

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 93.3%

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

      1. neg-mul-1 93.3%

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

      2. sub-neg 93.3%

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

   6. Simplified 93.3%

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

   7. Taylor expanded in x around 0 55.9%

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

   if -1.25000000000000008e-139 < y < -1.2999999999999999e-190 or 8.99999999999999985e-298 < y < 8.50000000000000014e-7

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 99.3%

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

      1. neg-mul-1 99.3%

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

   6. Simplified 99.3%

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

   7. Taylor expanded in x around inf 72.5%

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

      1. mul-1-neg 72.5%

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

   9. Simplified 72.5%

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

4. Final simplification 64.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+271}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -7.5 \cdot 10^{+215}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -4.1 \cdot 10^{+183}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -3 \cdot 10^{+20}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -1.25 \cdot 10^{-139}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq -1.3 \cdot 10^{-190}:\\ \;\;\;\;-x\\ \mathbf{elif}\;y \leq 9 \cdot 10^{-298}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-7}:\\ \;\;\;\;-x\\ \mathbf{elif}\;y \leq 2 \cdot 10^{+67}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot -0.5\\ \end{array} \]

Alternative 3: 74.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.1 \cdot 10^{+270}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -8.6 \cdot 10^{+213}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -9 \cdot 10^{+182}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -3 \cdot 10^{+20}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.25:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;y \leq 9 \cdot 10^{+68}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -4.1e+270)
   (* y -0.5)
   (if (<= y -8.6e+213)
     (* y x)
     (if (<= y -9e+182)
       (* y -0.5)
       (if (<= y -3e+20)
         (* y x)
         (if (<= y 1.25)
           (- 0.918938533204673 x)
           (if (<= y 9e+68) (* y x) (* y -0.5))))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -4.1e+270) {
		tmp = y * -0.5;
	} else if (y <= -8.6e+213) {
		tmp = y * x;
	} else if (y <= -9e+182) {
		tmp = y * -0.5;
	} else if (y <= -3e+20) {
		tmp = y * x;
	} else if (y <= 1.25) {
		tmp = 0.918938533204673 - x;
	} else if (y <= 9e+68) {
		tmp = y * x;
	} 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 <= (-4.1d+270)) then
        tmp = y * (-0.5d0)
    else if (y <= (-8.6d+213)) then
        tmp = y * x
    else if (y <= (-9d+182)) then
        tmp = y * (-0.5d0)
    else if (y <= (-3d+20)) then
        tmp = y * x
    else if (y <= 1.25d0) then
        tmp = 0.918938533204673d0 - x
    else if (y <= 9d+68) then
        tmp = y * x
    else
        tmp = y * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -4.1e+270) {
		tmp = y * -0.5;
	} else if (y <= -8.6e+213) {
		tmp = y * x;
	} else if (y <= -9e+182) {
		tmp = y * -0.5;
	} else if (y <= -3e+20) {
		tmp = y * x;
	} else if (y <= 1.25) {
		tmp = 0.918938533204673 - x;
	} else if (y <= 9e+68) {
		tmp = y * x;
	} else {
		tmp = y * -0.5;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -4.1e+270:
		tmp = y * -0.5
	elif y <= -8.6e+213:
		tmp = y * x
	elif y <= -9e+182:
		tmp = y * -0.5
	elif y <= -3e+20:
		tmp = y * x
	elif y <= 1.25:
		tmp = 0.918938533204673 - x
	elif y <= 9e+68:
		tmp = y * x
	else:
		tmp = y * -0.5
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -4.1e+270)
		tmp = Float64(y * -0.5);
	elseif (y <= -8.6e+213)
		tmp = Float64(y * x);
	elseif (y <= -9e+182)
		tmp = Float64(y * -0.5);
	elseif (y <= -3e+20)
		tmp = Float64(y * x);
	elseif (y <= 1.25)
		tmp = Float64(0.918938533204673 - x);
	elseif (y <= 9e+68)
		tmp = Float64(y * x);
	else
		tmp = Float64(y * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -4.1e+270)
		tmp = y * -0.5;
	elseif (y <= -8.6e+213)
		tmp = y * x;
	elseif (y <= -9e+182)
		tmp = y * -0.5;
	elseif (y <= -3e+20)
		tmp = y * x;
	elseif (y <= 1.25)
		tmp = 0.918938533204673 - x;
	elseif (y <= 9e+68)
		tmp = y * x;
	else
		tmp = y * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -4.1e+270], N[(y * -0.5), $MachinePrecision], If[LessEqual[y, -8.6e+213], N[(y * x), $MachinePrecision], If[LessEqual[y, -9e+182], N[(y * -0.5), $MachinePrecision], If[LessEqual[y, -3e+20], N[(y * x), $MachinePrecision], If[LessEqual[y, 1.25], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[y, 9e+68], N[(y * x), $MachinePrecision], N[(y * -0.5), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.09999999999999996e270 or -8.5999999999999999e213 < y < -9.00000000000000058e182 or 9.0000000000000007e68 < 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 100.0%

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

   5. Taylor expanded in x around 0 63.7%

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

      1. *-commutative 63.7%

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

   7. Simplified 63.7%

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

   if -4.09999999999999996e270 < y < -8.5999999999999999e213 or -9.00000000000000058e182 < y < -3e20 or 1.25 < y < 9.0000000000000007e68

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 97.7%

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

   5. Taylor expanded in x around inf 68.6%

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

   if -3e20 < y < 1.25

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 95.1%

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

      1. neg-mul-1 95.1%

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

      2. sub-neg 95.1%

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

   6. Simplified 95.1%

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

4. Final simplification 81.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.1 \cdot 10^{+270}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -8.6 \cdot 10^{+213}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -9 \cdot 10^{+182}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;y \leq -3 \cdot 10^{+20}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.25:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;y \leq 9 \cdot 10^{+68}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot -0.5\\ \end{array} \]

Alternative 4: 98.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -0.36) (not (<= y 1.7e-7)))
   (+ (* y x) (- 0.918938533204673 (* y 0.5)))
   (+ 0.918938533204673 (- (* y x) x))))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -0.36) or not (y <= 1.7e-7):
		tmp = (y * x) + (0.918938533204673 - (y * 0.5))
	else:
		tmp = 0.918938533204673 + ((y * x) - x)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.35999999999999999 or 1.69999999999999987e-7 < 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 99.5%

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

   if -0.35999999999999999 < y < 1.69999999999999987e-7

   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. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. associate-+r+ 100.0%

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

      6. associate-+l+ 100.0%

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

      7. distribute-rgt-neg-in 100.0%

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

      8. distribute-lft-out 100.0%

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

      9. fma-def 100.0%

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

      10. +-commutative 100.0%

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

      11. metadata-eval 100.0%

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

      12. +-commutative 100.0%

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

      13. cancel-sign-sub-inv 100.0%

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

      14. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 100.0%

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

   5. Taylor expanded in x around inf 99.3%

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

      1. associate--l+ 99.3%

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

      2. *-commutative 99.3%

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

      3. +-commutative 99.3%

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

      4. *-commutative 99.3%

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

   7. Applied egg-rr 99.3%

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

4. Final simplification 99.4%

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

Alternative 5: 48.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.75 \cdot 10^{-30}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 3.4 \cdot 10^{-240}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 3.9 \cdot 10^{-182}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-103}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 680000000000:\\ \;\;\;\;0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.75e-30)
   (- x)
   (if (<= x 3.4e-240)
     (* y -0.5)
     (if (<= x 3.9e-182)
       0.918938533204673
       (if (<= x 2.2e-103)
         (* y -0.5)
         (if (<= x 680000000000.0) 0.918938533204673 (- x)))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.75e-30) {
		tmp = -x;
	} else if (x <= 3.4e-240) {
		tmp = y * -0.5;
	} else if (x <= 3.9e-182) {
		tmp = 0.918938533204673;
	} else if (x <= 2.2e-103) {
		tmp = y * -0.5;
	} else if (x <= 680000000000.0) {
		tmp = 0.918938533204673;
	} 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 <= (-1.75d-30)) then
        tmp = -x
    else if (x <= 3.4d-240) then
        tmp = y * (-0.5d0)
    else if (x <= 3.9d-182) then
        tmp = 0.918938533204673d0
    else if (x <= 2.2d-103) then
        tmp = y * (-0.5d0)
    else if (x <= 680000000000.0d0) then
        tmp = 0.918938533204673d0
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.75e-30) {
		tmp = -x;
	} else if (x <= 3.4e-240) {
		tmp = y * -0.5;
	} else if (x <= 3.9e-182) {
		tmp = 0.918938533204673;
	} else if (x <= 2.2e-103) {
		tmp = y * -0.5;
	} else if (x <= 680000000000.0) {
		tmp = 0.918938533204673;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.75e-30:
		tmp = -x
	elif x <= 3.4e-240:
		tmp = y * -0.5
	elif x <= 3.9e-182:
		tmp = 0.918938533204673
	elif x <= 2.2e-103:
		tmp = y * -0.5
	elif x <= 680000000000.0:
		tmp = 0.918938533204673
	else:
		tmp = -x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.75e-30)
		tmp = Float64(-x);
	elseif (x <= 3.4e-240)
		tmp = Float64(y * -0.5);
	elseif (x <= 3.9e-182)
		tmp = 0.918938533204673;
	elseif (x <= 2.2e-103)
		tmp = Float64(y * -0.5);
	elseif (x <= 680000000000.0)
		tmp = 0.918938533204673;
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.75e-30)
		tmp = -x;
	elseif (x <= 3.4e-240)
		tmp = y * -0.5;
	elseif (x <= 3.9e-182)
		tmp = 0.918938533204673;
	elseif (x <= 2.2e-103)
		tmp = y * -0.5;
	elseif (x <= 680000000000.0)
		tmp = 0.918938533204673;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.75e-30], (-x), If[LessEqual[x, 3.4e-240], N[(y * -0.5), $MachinePrecision], If[LessEqual[x, 3.9e-182], 0.918938533204673, If[LessEqual[x, 2.2e-103], N[(y * -0.5), $MachinePrecision], If[LessEqual[x, 680000000000.0], 0.918938533204673, (-x)]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.7500000000000001e-30 or 6.8e11 < 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 56.8%

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

      1. neg-mul-1 56.8%

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

   6. Simplified 56.8%

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

   7. Taylor expanded in x around inf 53.4%

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

      1. mul-1-neg 53.4%

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

   9. Simplified 53.4%

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

   if -1.7500000000000001e-30 < x < 3.3999999999999999e-240 or 3.9e-182 < x < 2.1999999999999999e-103

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 62.5%

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

   5. Taylor expanded in x around 0 62.5%

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

      1. *-commutative 62.5%

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

   7. Simplified 62.5%

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

   if 3.3999999999999999e-240 < x < 3.9e-182 or 2.1999999999999999e-103 < x < 6.8e11

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 66.3%

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

      1. neg-mul-1 66.3%

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

      2. sub-neg 66.3%

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

   6. Simplified 66.3%

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

   7. Taylor expanded in x around 0 61.6%

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

4. Final simplification 57.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.75 \cdot 10^{-30}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 3.4 \cdot 10^{-240}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 3.9 \cdot 10^{-182}:\\ \;\;\;\;0.918938533204673\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-103}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 680000000000:\\ \;\;\;\;0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

Alternative 6: 98.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.05e-8) (not (<= x 5.2e-10)))
   (+ 0.918938533204673 (- (* y x) x))
   (- 0.918938533204673 (* y 0.5))))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.05e-8) || !(x <= 5.2e-10)) {
		tmp = 0.918938533204673 + ((y * x) - x);
	} else {
		tmp = 0.918938533204673 - (y * 0.5);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.05e-8) || !(x <= 5.2e-10)) {
		tmp = 0.918938533204673 + ((y * x) - x);
	} else {
		tmp = 0.918938533204673 - (y * 0.5);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.05e-8) or not (x <= 5.2e-10):
		tmp = 0.918938533204673 + ((y * x) - x)
	else:
		tmp = 0.918938533204673 - (y * 0.5)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.05e-8) || !(x <= 5.2e-10))
		tmp = Float64(0.918938533204673 + Float64(Float64(y * x) - x));
	else
		tmp = Float64(0.918938533204673 - Float64(y * 0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.05e-8) || ~((x <= 5.2e-10)))
		tmp = 0.918938533204673 + ((y * x) - x);
	else
		tmp = 0.918938533204673 - (y * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.05e-8], N[Not[LessEqual[x, 5.2e-10]], $MachinePrecision]], N[(0.918938533204673 + N[(N[(y * x), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], N[(0.918938533204673 - N[(y * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.04999999999999997e-8 or 5.19999999999999962e-10 < 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. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. associate-+r+ 100.0%

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

      6. associate-+l+ 100.0%

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

      7. distribute-rgt-neg-in 100.0%

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

      8. distribute-lft-out 100.0%

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

      9. fma-def 100.0%

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

      10. +-commutative 100.0%

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

      11. metadata-eval 100.0%

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

      12. +-commutative 100.0%

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

      13. cancel-sign-sub-inv 100.0%

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

      14. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 100.0%

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

   5. Taylor expanded in x around inf 98.6%

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

      1. associate--l+ 98.6%

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

      2. *-commutative 98.6%

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

      3. +-commutative 98.6%

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

      4. *-commutative 98.6%

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

   7. Applied egg-rr 98.6%

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

   if -1.04999999999999997e-8 < x < 5.19999999999999962e-10

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. 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.2%

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

Alternative 7: 98.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -32.0) (not (<= x 0.000285)))
   (+ 0.918938533204673 (- (* y x) x))
   (- (- 0.918938533204673 (* y 0.5)) x)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -32 or 2.8499999999999999e-4 < x

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. distribute-rgt-in 100.0%

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

      5. associate-+r+ 100.0%

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

      6. associate-+l+ 100.0%

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

      7. distribute-rgt-neg-in 100.0%

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

      8. distribute-lft-out 100.0%

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

      9. fma-def 100.0%

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

      10. +-commutative 100.0%

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

      11. metadata-eval 100.0%

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

      12. +-commutative 100.0%

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

      13. cancel-sign-sub-inv 100.0%

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

      14. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 100.0%

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

   5. Taylor expanded in x around inf 99.2%

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

      1. associate--l+ 99.2%

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

      2. *-commutative 99.2%

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

      3. +-commutative 99.2%

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

      4. *-commutative 99.2%

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

   7. Applied egg-rr 99.2%

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

   if -32 < x < 2.8499999999999999e-4

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 99.2%

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

      1. neg-mul-1 99.2%

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

   6. Simplified 99.2%

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

4. Final simplification 99.2%

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

Alternative 8: 98.0% accurate, 1.2× speedup

Math

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

C

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

Python

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

Julia

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

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.32], N[Not[LessEqual[y, 1.0]], $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.32000000000000006 or 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around inf 98.3%

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

   if -1.32000000000000006 < 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 97.1%

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

      1. neg-mul-1 97.1%

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

      2. sub-neg 97.1%

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

   6. Simplified 97.1%

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

4. Final simplification 97.7%

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

Alternative 9: 49.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.92:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 680000000000:\\ \;\;\;\;0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -0.92) (- x) (if (<= x 680000000000.0) 0.918938533204673 (- x))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -0.92) {
		tmp = -x;
	} else if (x <= 680000000000.0) {
		tmp = 0.918938533204673;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -0.92:
		tmp = -x
	elif x <= 680000000000.0:
		tmp = 0.918938533204673
	else:
		tmp = -x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -0.92)
		tmp = -x;
	elseif (x <= 680000000000.0)
		tmp = 0.918938533204673;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -0.92], (-x), If[LessEqual[x, 680000000000.0], 0.918938533204673, (-x)]]

Derivation

1. Split input into 2 regimes

2. if x < -0.92000000000000004 or 6.8e11 < 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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 56.1%

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

      1. neg-mul-1 56.1%

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

   6. Simplified 56.1%

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

   7. Taylor expanded in x around inf 54.7%

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

      1. mul-1-neg 54.7%

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

   9. Simplified 54.7%

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

   if -0.92000000000000004 < x < 6.8e11

   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. fma-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. remove-double-neg 100.0%

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

      6. sub-neg 100.0%

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

      7. fma-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. remove-double-neg 100.0%

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

      10. +-commutative 100.0%

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

      11. 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. Taylor expanded in y around 0 45.7%

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

      1. neg-mul-1 45.7%

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

      2. sub-neg 45.7%

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

   6. Simplified 45.7%

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

   7. Taylor expanded in x around 0 43.5%

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

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.92:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 680000000000:\\ \;\;\;\;0.918938533204673\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

Alternative 10: 26.0% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 0.918938533204673)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 0.918938533204673

Julia

function code(x, y)
	return 0.918938533204673
end

MATLAB

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

Wolfram

code[x_, y_] := 0.918938533204673

Derivation

1. Initial program 100.0%

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

   1. associate-+l- 100.0%

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

   2. fma-neg 100.0%

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

   3. sub-neg 100.0%

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

   4. +-commutative 100.0%

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

   5. remove-double-neg 100.0%

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

   6. sub-neg 100.0%

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

   7. fma-neg 100.0%

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

   8. sub-neg 100.0%

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

   9. remove-double-neg 100.0%

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

   10. +-commutative 100.0%

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

   11. 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. Taylor expanded in y around 0 51.0%

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

   1. neg-mul-1 51.0%

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

   2. sub-neg 51.0%

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

6. Simplified 51.0%

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

7. Taylor expanded in x around 0 21.7%

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

8. Final simplification 21.7%

   \[\leadsto 0.918938533204673 \]

Reproduce

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