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

Percentage Accurate: 100.0% → 100.0%

Time: 3.7s

Alternatives: 13

Speedup: 1.5×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    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.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_] := N[(N[(y - 1.0), $MachinePrecision] * x + N[(-0.5 * y + 0.918938533204673), $MachinePrecision]), $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. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-+l- N/A

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. associate-+l- N/A

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

   9. fp-cancel-sub-sign-inv N/A

      \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y\right)} + \frac{918938533204673}{1000000000000000} \]

   10. metadata-eval N/A

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

   11. associate-+l+ N/A

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

   12. *-commutative N/A

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

   13. +-commutative N/A

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

   14. metadata-eval N/A

       \[\leadsto \left(y - 1\right) \cdot x + \left(\frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot y\right) \]

   15. fp-cancel-sub-sign-inv N/A

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

   16. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right)} \]

   17. lift--.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{y - 1}, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right) \]

   18. fp-cancel-sub-sign-inv N/A

       \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{918938533204673}{1000000000000000} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y}\right) \]

   19. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} + \color{blue}{\frac{-1}{2}} \cdot y\right) \]

   20. +-commutative N/A

       \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}}\right) \]

   21. lower-fma.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 74.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+80}:\\ \;\;\;\;\mathsf{fma}\left(y, x, 0.918938533204673\right)\\ \mathbf{elif}\;x \leq -1.4 \cdot 10^{-6}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{+20}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+241}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.5e+80)
   (fma y x 0.918938533204673)
   (if (<= x -1.4e-6)
     (- 0.918938533204673 x)
     (if (<= x 3.8e-9)
       (fma -0.5 y 0.918938533204673)
       (if (<= x 1.45e+20)
         (- 0.918938533204673 x)
         (if (<= x 9e+241) (* x y) (- x)))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.5e+80) {
		tmp = fma(y, x, 0.918938533204673);
	} else if (x <= -1.4e-6) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 3.8e-9) {
		tmp = fma(-0.5, y, 0.918938533204673);
	} else if (x <= 1.45e+20) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 9e+241) {
		tmp = x * y;
	} else {
		tmp = -x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.5e+80)
		tmp = fma(y, x, 0.918938533204673);
	elseif (x <= -1.4e-6)
		tmp = Float64(0.918938533204673 - x);
	elseif (x <= 3.8e-9)
		tmp = fma(-0.5, y, 0.918938533204673);
	elseif (x <= 1.45e+20)
		tmp = Float64(0.918938533204673 - x);
	elseif (x <= 9e+241)
		tmp = Float64(x * y);
	else
		tmp = Float64(-x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.5e+80], N[(y * x + 0.918938533204673), $MachinePrecision], If[LessEqual[x, -1.4e-6], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[x, 3.8e-9], N[(-0.5 * y + 0.918938533204673), $MachinePrecision], If[LessEqual[x, 1.45e+20], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[x, 9e+241], N[(x * y), $MachinePrecision], (-x)]]]]]

Derivation

1. Split input into 5 regimes

2. if x < -1.49999999999999993e80

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-+l- N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-+l- N/A

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

      9. fp-cancel-sub-sign-inv N/A

         \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y\right)} + \frac{918938533204673}{1000000000000000} \]

      10. metadata-eval N/A

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

      11. associate-+l+ N/A

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

      12. *-commutative N/A

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

      13. +-commutative N/A

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

      14. metadata-eval N/A

          \[\leadsto \left(y - 1\right) \cdot x + \left(\frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot y\right) \]

      15. fp-cancel-sub-sign-inv N/A

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

      16. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right)} \]

      17. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{y - 1}, x, \frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y\right) \]

      18. fp-cancel-sub-sign-inv N/A

          \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{918938533204673}{1000000000000000} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y}\right) \]

      19. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(y - 1, x, \frac{918938533204673}{1000000000000000} + \color{blue}{\frac{-1}{2}} \cdot y\right) \]

      20. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(y - 1, x, \color{blue}{\frac{-1}{2} \cdot y + \frac{918938533204673}{1000000000000000}}\right) \]

      21. lower-fma.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around inf

      \[\leadsto \mathsf{fma}\left(\color{blue}{y}, x, \mathsf{fma}\left(\frac{-1}{2}, y, \frac{918938533204673}{1000000000000000}\right)\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 65.2%

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

   8. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{\frac{918938533204673}{1000000000000000}}\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 65.2%

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

   if -1.49999999999999993e80 < x < -1.39999999999999994e-6 or 3.80000000000000011e-9 < x < 1.45e20

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 66.9

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

   5. Applied rewrites 66.9%

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

   if -1.39999999999999994e-6 < x < 3.80000000000000011e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} + \frac{-1}{2} \cdot y \]

      3. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot y + \color{blue}{\frac{918938533204673}{1000000000000000}} \]

      4. lower-fma.f64 98.9

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

   5. Applied rewrites 98.9%

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

   if 1.45e20 < x < 8.99999999999999987e241

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 64.4

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

   5. Applied rewrites 64.4%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 64.4%

      \[\leadsto x \cdot y \]

   if 8.99999999999999987e241 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 83.3

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

   5. Applied rewrites 83.3%

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

   6. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(x\right) \]

      2. lower-neg.f64 83.3

         \[\leadsto -x \]

   8. Applied rewrites 83.3%

      \[\leadsto -x \]
3. Recombined 5 regimes into one program.
4. Add Preprocessing

Alternative 3: 74.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+80}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq -1.4 \cdot 10^{-6}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, y, 0.918938533204673\right)\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{+20}:\\ \;\;\;\;0.918938533204673 - x\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+241}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.5e+80)
   (* x y)
   (if (<= x -1.4e-6)
     (- 0.918938533204673 x)
     (if (<= x 3.8e-9)
       (fma -0.5 y 0.918938533204673)
       (if (<= x 1.45e+20)
         (- 0.918938533204673 x)
         (if (<= x 9e+241) (* x y) (- x)))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.5e+80) {
		tmp = x * y;
	} else if (x <= -1.4e-6) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 3.8e-9) {
		tmp = fma(-0.5, y, 0.918938533204673);
	} else if (x <= 1.45e+20) {
		tmp = 0.918938533204673 - x;
	} else if (x <= 9e+241) {
		tmp = x * y;
	} else {
		tmp = -x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.5e+80)
		tmp = Float64(x * y);
	elseif (x <= -1.4e-6)
		tmp = Float64(0.918938533204673 - x);
	elseif (x <= 3.8e-9)
		tmp = fma(-0.5, y, 0.918938533204673);
	elseif (x <= 1.45e+20)
		tmp = Float64(0.918938533204673 - x);
	elseif (x <= 9e+241)
		tmp = Float64(x * y);
	else
		tmp = Float64(-x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.5e+80], N[(x * y), $MachinePrecision], If[LessEqual[x, -1.4e-6], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[x, 3.8e-9], N[(-0.5 * y + 0.918938533204673), $MachinePrecision], If[LessEqual[x, 1.45e+20], N[(0.918938533204673 - x), $MachinePrecision], If[LessEqual[x, 9e+241], N[(x * y), $MachinePrecision], (-x)]]]]]

Derivation

1. Split input into 4 regimes

2. if x < -1.49999999999999993e80 or 1.45e20 < x < 8.99999999999999987e241

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 64.7

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

   5. Applied rewrites 64.7%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 64.7%

      \[\leadsto x \cdot y \]

   if -1.49999999999999993e80 < x < -1.39999999999999994e-6 or 3.80000000000000011e-9 < x < 1.45e20

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 66.9

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

   5. Applied rewrites 66.9%

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

   if -1.39999999999999994e-6 < x < 3.80000000000000011e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} - \frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot y} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} + \frac{-1}{2} \cdot y \]

      3. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot y + \color{blue}{\frac{918938533204673}{1000000000000000}} \]

      4. lower-fma.f64 98.9

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

   5. Applied rewrites 98.9%

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

   if 8.99999999999999987e241 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 83.3

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

   5. Applied rewrites 83.3%

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

   6. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(x\right) \]

      2. lower-neg.f64 83.3

         \[\leadsto -x \]

   8. Applied rewrites 83.3%

      \[\leadsto -x \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 4: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1800000 \lor \neg \left(y \leq 6.2 \cdot 10^{-6}\right):\\ \;\;\;\;\mathsf{fma}\left(x - 0.5, y, 0.918938533204673\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, 0.918938533204673 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1800000.0) (not (<= y 6.2e-6)))
   (fma (- x 0.5) y 0.918938533204673)
   (fma x y (- 0.918938533204673 x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1800000.0) || !(y <= 6.2e-6)) {
		tmp = fma((x - 0.5), y, 0.918938533204673);
	} else {
		tmp = fma(x, y, (0.918938533204673 - x));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1800000.0) || !(y <= 6.2e-6))
		tmp = fma(Float64(x - 0.5), y, 0.918938533204673);
	else
		tmp = fma(x, y, Float64(0.918938533204673 - x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.8e6 or 6.1999999999999999e-6 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

      8. *-lft-identity N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, -1 \cdot x\right) \]
   7. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \mathsf{neg}\left(x\right)\right) \]

      2. lower-neg.f64 98.4

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

   8. Applied rewrites 98.4%

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

   9. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 99.6%

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

   if -1.8e6 < y < 6.1999999999999999e-6

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

      8. *-lft-identity N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(x, y, \frac{918938533204673}{1000000000000000} - x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 99.6%

      \[\leadsto \mathsf{fma}\left(x, y, 0.918938533204673 - x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.6%

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

Alternative 5: 98.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5000000 \lor \neg \left(y \leq 4.8\right):\\ \;\;\;\;\left(x - 0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, 0.918938533204673 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -5000000.0) (not (<= y 4.8)))
   (* (- x 0.5) y)
   (fma x y (- 0.918938533204673 x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -5000000.0) || !(y <= 4.8)) {
		tmp = (x - 0.5) * y;
	} else {
		tmp = fma(x, y, (0.918938533204673 - x));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -5e6 or 4.79999999999999982 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 98.9

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

   5. Applied rewrites 98.9%

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

   if -5e6 < y < 4.79999999999999982

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

      8. *-lft-identity N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(x, y, \frac{918938533204673}{1000000000000000} - x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 99.1%

      \[\leadsto \mathsf{fma}\left(x, y, 0.918938533204673 - x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

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

Alternative 6: 98.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -48000:\\ \;\;\;\;\mathsf{fma}\left(x - 0.5, y, -x\right)\\ \mathbf{elif}\;y \leq 6.2 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(x, y, 0.918938533204673 - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 0.5, y, 0.918938533204673\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -48000.0)
   (fma (- x 0.5) y (- x))
   (if (<= y 6.2e-6)
     (fma x y (- 0.918938533204673 x))
     (fma (- x 0.5) y 0.918938533204673))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -48000.0) {
		tmp = fma((x - 0.5), y, -x);
	} else if (y <= 6.2e-6) {
		tmp = fma(x, y, (0.918938533204673 - x));
	} else {
		tmp = fma((x - 0.5), y, 0.918938533204673);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -48000.0)
		tmp = fma(Float64(x - 0.5), y, Float64(-x));
	elseif (y <= 6.2e-6)
		tmp = fma(x, y, Float64(0.918938533204673 - x));
	else
		tmp = fma(Float64(x - 0.5), y, 0.918938533204673);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -48000

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

      8. *-lft-identity N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, -1 \cdot x\right) \]
   7. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \mathsf{neg}\left(x\right)\right) \]

      2. lower-neg.f64 99.3

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

   8. Applied rewrites 99.3%

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

   if -48000 < y < 6.1999999999999999e-6

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

      8. *-lft-identity N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(x, y, \frac{918938533204673}{1000000000000000} - x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 99.6%

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

   if 6.1999999999999999e-6 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

      8. *-lft-identity N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

      9. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, -1 \cdot x\right) \]
   7. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \mathsf{neg}\left(x\right)\right) \]

      2. lower-neg.f64 97.4

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

   8. Applied rewrites 97.4%

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

   9. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \mathsf{fma}\left(x - 0.5, y, 0.918938533204673\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 97.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.35) || !(y <= 1.02)) {
		tmp = (x - 0.5) * y;
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.35d0)) .or. (.not. (y <= 1.02d0))) then
        tmp = (x - 0.5d0) * y
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.35) || !(y <= 1.02))
		tmp = Float64(Float64(x - 0.5) * y);
	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 = (x - 0.5) * y;
	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[(N[(x - 0.5), $MachinePrecision] * y), $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. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   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. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 98.0

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

   5. Applied rewrites 98.0%

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

4. Final simplification 98.3%

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

Alternative 8: 74.6% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -28.0) (not (<= y 1.02))) (* x y) (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -28.0) || !(y <= 1.02)) {
		tmp = x * y;
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-28.0d0)) .or. (.not. (y <= 1.02d0))) then
        tmp = x * y
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -28 or 1.02 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 56.2%

      \[\leadsto x \cdot y \]

   if -28 < y < 1.02

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 98.0

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

   5. Applied rewrites 98.0%

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

4. Final simplification 75.0%

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

Alternative 9: 74.1% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1800000.0) || !(y <= 1.82)) {
		tmp = -0.5 * y;
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1800000.0d0)) .or. (.not. (y <= 1.82d0))) then
        tmp = (-0.5d0) * y
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.8e6 or 1.82000000000000006 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(x - \frac{1}{2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 98.9

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

   5. Applied rewrites 98.9%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{2} \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 43.5%

      \[\leadsto -0.5 \cdot y \]

   if -1.8e6 < y < 1.82000000000000006

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 97.3

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

   5. Applied rewrites 97.3%

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

4. Final simplification 67.9%

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

Alternative 10: 50.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((x <= -21.0) || !(x <= 0.92)) {
		tmp = -x;
	} else {
		tmp = 0.918938533204673;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-21.0d0)) .or. (.not. (x <= 0.92d0))) then
        tmp = -x
    else
        tmp = 0.918938533204673d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -21 or 0.92000000000000004 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 46.8

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

   5. Applied rewrites 46.8%

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

   6. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(x\right) \]

      2. lower-neg.f64 45.6

         \[\leadsto -x \]

   8. Applied rewrites 45.6%

      \[\leadsto -x \]

   if -21 < x < 0.92000000000000004

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
   4. Step-by-step derivation

      1. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

      2. metadata-eval N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

      3. *-lft-identity N/A

         \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

      4. lower--.f64 44.8

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

   5. Applied rewrites 44.8%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{918938533204673}{1000000000000000} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.9%

      \[\leadsto 0.918938533204673 \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.9%

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

Alternative 11: 100.0% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_] := N[(N[(x - 0.5), $MachinePrecision] * y + N[(0.918938533204673 - x), $MachinePrecision]), $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. Taylor expanded in y around 0

   \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + \left(-1 \cdot x + y \cdot \left(x - \frac{1}{2}\right)\right)} \]
4. Step-by-step derivation

   1. associate-+r+ N/A

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

   2. +-commutative N/A

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

   3. *-commutative N/A

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

   4. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, \color{blue}{y}, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

   5. lower--.f64 N/A

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} + -1 \cdot x\right) \]

   6. fp-cancel-sign-sub-inv N/A

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - \left(\mathsf{neg}\left(-1\right)\right) \cdot x\right) \]

   7. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - 1 \cdot x\right) \]

   8. *-lft-identity N/A

      \[\leadsto \mathsf{fma}\left(x - \frac{1}{2}, y, \frac{918938533204673}{1000000000000000} - x\right) \]

   9. lower--.f64 100.0

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

5. Applied rewrites 100.0%

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

Alternative 12: 52.0% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
4. Step-by-step derivation

   1. fp-cancel-sign-sub-inv N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

   2. metadata-eval N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

   3. *-lft-identity N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

   4. lower--.f64 45.9

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

5. Applied rewrites 45.9%

   \[\leadsto \color{blue}{0.918938533204673 - x} \]
6. Add Preprocessing

Alternative 13: 26.7% accurate, 20.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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    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. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{\frac{918938533204673}{1000000000000000} + -1 \cdot x} \]
4. Step-by-step derivation

   1. fp-cancel-sign-sub-inv N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} \]

   2. metadata-eval N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - 1 \cdot x \]

   3. *-lft-identity N/A

      \[\leadsto \frac{918938533204673}{1000000000000000} - x \]

   4. lower--.f64 45.9

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

5. Applied rewrites 45.9%

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

6. Taylor expanded in x around 0

   \[\leadsto \frac{918938533204673}{1000000000000000} \]
7. Step-by-step derivation

8. Applied rewrites 20.5%

   \[\leadsto 0.918938533204673 \]
9. Add Preprocessing

Reproduce

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