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

Percentage Accurate: 95.6% → 99.8%

Time: 3.1s

Alternatives: 9

Speedup: 1.3×

Specification

Math

\[\begin{array}{l} \\ x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+ x (/ y (- (* 1.1283791670955126 (exp z)) (* x y)))))

C

double code(double x, double y, double z) {
	return x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
end function

Java

public static double code(double x, double y, double z) {
	return x + (y / ((1.1283791670955126 * Math.exp(z)) - (x * y)));
}

Python

def code(x, y, z):
	return x + (y / ((1.1283791670955126 * math.exp(z)) - (x * y)))

Julia

function code(x, y, z)
	return Float64(x + Float64(y / Float64(Float64(1.1283791670955126 * exp(z)) - Float64(x * y))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y / N[(N[(1.1283791670955126 * N[Exp[z], $MachinePrecision]), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 95.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+ x (/ y (- (* 1.1283791670955126 (exp z)) (* x y)))))

C

double code(double x, double y, double z) {
	return x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
}

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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
end function

Java

public static double code(double x, double y, double z) {
	return x + (y / ((1.1283791670955126 * Math.exp(z)) - (x * y)));
}

Python

def code(x, y, z):
	return x + (y / ((1.1283791670955126 * math.exp(z)) - (x * y)))

Julia

function code(x, y, z)
	return Float64(x + Float64(y / Float64(Float64(1.1283791670955126 * exp(z)) - Float64(x * y))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y / N[(N[(1.1283791670955126 * N[Exp[z], $MachinePrecision]), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.35 \cdot 10^{+15}:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(-x, y, e^{z} \cdot 1.1283791670955126\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.35e+15)
   (- x (/ 1.0 x))
   (+ x (/ y (fma (- x) y (* (exp z) 1.1283791670955126))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.35e+15) {
		tmp = x - (1.0 / x);
	} else {
		tmp = x + (y / fma(-x, y, (exp(z) * 1.1283791670955126)));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.35e+15)
		tmp = Float64(x - Float64(1.0 / x));
	else
		tmp = Float64(x + Float64(y / fma(Float64(-x), y, Float64(exp(z) * 1.1283791670955126))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.35e+15], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], N[(x + N[(y / N[((-x) * y + N[(N[Exp[z], $MachinePrecision] * 1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.35e15

   1. Initial program 88.4%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -1.35e15 < z

   1. Initial program 97.7%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} - \color{blue}{x \cdot y}} \]

      2. lift--.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} - x \cdot y}} \]

      3. lift-*.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z}} - x \cdot y} \]

      4. lift-exp.f64 N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot \color{blue}{e^{z}} - x \cdot y} \]

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

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \left(\mathsf{neg}\left(x\right)\right) \cdot y}} \]

      6. mul-1-neg N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \color{blue}{\left(-1 \cdot x\right)} \cdot y} \]

      7. associate-*r* N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \color{blue}{-1 \cdot \left(x \cdot y\right)}} \]

      8. +-commutative N/A

         \[\leadsto x + \frac{y}{\color{blue}{-1 \cdot \left(x \cdot y\right) + \frac{5641895835477563}{5000000000000000} \cdot e^{z}}} \]

      9. associate-*r* N/A

         \[\leadsto x + \frac{y}{\color{blue}{\left(-1 \cdot x\right) \cdot y} + \frac{5641895835477563}{5000000000000000} \cdot e^{z}} \]

      10. mul-1-neg N/A

          \[\leadsto x + \frac{y}{\color{blue}{\left(\mathsf{neg}\left(x\right)\right)} \cdot y + \frac{5641895835477563}{5000000000000000} \cdot e^{z}} \]

      11. lower-fma.f64 N/A

          \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(x\right), y, \frac{5641895835477563}{5000000000000000} \cdot e^{z}\right)}} \]

      12. lower-neg.f64 N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(\color{blue}{-x}, y, \frac{5641895835477563}{5000000000000000} \cdot e^{z}\right)} \]

      13. *-commutative N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z} \cdot \frac{5641895835477563}{5000000000000000}}\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z} \cdot \frac{5641895835477563}{5000000000000000}}\right)} \]

      15. lift-exp.f64 99.8

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z}} \cdot 1.1283791670955126\right)} \]

   3. Applied rewrites 99.8%

      \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(-x, y, e^{z} \cdot 1.1283791670955126\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -250:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 2.25:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(-x, y, 1.1283791670955126\right)}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{e^{z} \cdot 1.1283791670955126}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -250.0)
   (- x (/ 1.0 x))
   (if (<= z 2.25)
     (+ x (/ y (fma (- x) y 1.1283791670955126)))
     (+ x (/ y (* (exp z) 1.1283791670955126))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -250.0) {
		tmp = x - (1.0 / x);
	} else if (z <= 2.25) {
		tmp = x + (y / fma(-x, y, 1.1283791670955126));
	} else {
		tmp = x + (y / (exp(z) * 1.1283791670955126));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -250.0)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 2.25)
		tmp = Float64(x + Float64(y / fma(Float64(-x), y, 1.1283791670955126)));
	else
		tmp = Float64(x + Float64(y / Float64(exp(z) * 1.1283791670955126)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -250.0], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.25], N[(x + N[(y / N[((-x) * y + 1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y / N[(N[Exp[z], $MachinePrecision] * 1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -250

   1. Initial program 88.5%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -250 < z < 2.25

   1. Initial program 99.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} - \color{blue}{x \cdot y}} \]

      2. lift--.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} - x \cdot y}} \]

      3. lift-*.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z}} - x \cdot y} \]

      4. lift-exp.f64 N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot \color{blue}{e^{z}} - x \cdot y} \]

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

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \left(\mathsf{neg}\left(x\right)\right) \cdot y}} \]

      6. mul-1-neg N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \color{blue}{\left(-1 \cdot x\right)} \cdot y} \]

      7. associate-*r* N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \color{blue}{-1 \cdot \left(x \cdot y\right)}} \]

      8. +-commutative N/A

         \[\leadsto x + \frac{y}{\color{blue}{-1 \cdot \left(x \cdot y\right) + \frac{5641895835477563}{5000000000000000} \cdot e^{z}}} \]

      9. associate-*r* N/A

         \[\leadsto x + \frac{y}{\color{blue}{\left(-1 \cdot x\right) \cdot y} + \frac{5641895835477563}{5000000000000000} \cdot e^{z}} \]

      10. mul-1-neg N/A

          \[\leadsto x + \frac{y}{\color{blue}{\left(\mathsf{neg}\left(x\right)\right)} \cdot y + \frac{5641895835477563}{5000000000000000} \cdot e^{z}} \]

      11. lower-fma.f64 N/A

          \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(x\right), y, \frac{5641895835477563}{5000000000000000} \cdot e^{z}\right)}} \]

      12. lower-neg.f64 N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(\color{blue}{-x}, y, \frac{5641895835477563}{5000000000000000} \cdot e^{z}\right)} \]

      13. *-commutative N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z} \cdot \frac{5641895835477563}{5000000000000000}}\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z} \cdot \frac{5641895835477563}{5000000000000000}}\right)} \]

      15. lift-exp.f64 99.8

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z}} \cdot 1.1283791670955126\right)} \]

   3. Applied rewrites 99.8%

      \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(-x, y, e^{z} \cdot 1.1283791670955126\right)}} \]

   4. Taylor expanded in z around 0

      \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{\frac{5641895835477563}{5000000000000000}}\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.2%

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

   if 2.25 < z

   1. Initial program 94.1%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around 0

      \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z}}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto x + \frac{y}{e^{z} \cdot \color{blue}{\frac{5641895835477563}{5000000000000000}}} \]

      2. lower-*.f64 N/A

         \[\leadsto x + \frac{y}{e^{z} \cdot \color{blue}{\frac{5641895835477563}{5000000000000000}}} \]

      3. lift-exp.f64 99.7

         \[\leadsto x + \frac{y}{e^{z} \cdot 1.1283791670955126} \]

   4. Applied rewrites 99.7%

      \[\leadsto x + \frac{y}{\color{blue}{e^{z} \cdot 1.1283791670955126}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 99.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -250:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 100:\\ \;\;\;\;x + \frac{y}{\mathsf{fma}\left(-x, y, 1.1283791670955126\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -250.0)
   (- x (/ 1.0 x))
   (if (<= z 100.0) (+ x (/ y (fma (- x) y 1.1283791670955126))) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -250.0) {
		tmp = x - (1.0 / x);
	} else if (z <= 100.0) {
		tmp = x + (y / fma(-x, y, 1.1283791670955126));
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -250.0)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 100.0)
		tmp = Float64(x + Float64(y / fma(Float64(-x), y, 1.1283791670955126)));
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -250.0], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 100.0], N[(x + N[(y / N[((-x) * y + 1.1283791670955126), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -250

   1. Initial program 88.5%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -250 < z < 100

   1. Initial program 99.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} - \color{blue}{x \cdot y}} \]

      2. lift--.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} - x \cdot y}} \]

      3. lift-*.f64 N/A

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z}} - x \cdot y} \]

      4. lift-exp.f64 N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot \color{blue}{e^{z}} - x \cdot y} \]

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

         \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \left(\mathsf{neg}\left(x\right)\right) \cdot y}} \]

      6. mul-1-neg N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \color{blue}{\left(-1 \cdot x\right)} \cdot y} \]

      7. associate-*r* N/A

         \[\leadsto x + \frac{y}{\frac{5641895835477563}{5000000000000000} \cdot e^{z} + \color{blue}{-1 \cdot \left(x \cdot y\right)}} \]

      8. +-commutative N/A

         \[\leadsto x + \frac{y}{\color{blue}{-1 \cdot \left(x \cdot y\right) + \frac{5641895835477563}{5000000000000000} \cdot e^{z}}} \]

      9. associate-*r* N/A

         \[\leadsto x + \frac{y}{\color{blue}{\left(-1 \cdot x\right) \cdot y} + \frac{5641895835477563}{5000000000000000} \cdot e^{z}} \]

      10. mul-1-neg N/A

          \[\leadsto x + \frac{y}{\color{blue}{\left(\mathsf{neg}\left(x\right)\right)} \cdot y + \frac{5641895835477563}{5000000000000000} \cdot e^{z}} \]

      11. lower-fma.f64 N/A

          \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(x\right), y, \frac{5641895835477563}{5000000000000000} \cdot e^{z}\right)}} \]

      12. lower-neg.f64 N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(\color{blue}{-x}, y, \frac{5641895835477563}{5000000000000000} \cdot e^{z}\right)} \]

      13. *-commutative N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z} \cdot \frac{5641895835477563}{5000000000000000}}\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z} \cdot \frac{5641895835477563}{5000000000000000}}\right)} \]

      15. lift-exp.f64 99.8

          \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{e^{z}} \cdot 1.1283791670955126\right)} \]

   3. Applied rewrites 99.8%

      \[\leadsto x + \frac{y}{\color{blue}{\mathsf{fma}\left(-x, y, e^{z} \cdot 1.1283791670955126\right)}} \]

   4. Taylor expanded in z around 0

      \[\leadsto x + \frac{y}{\mathsf{fma}\left(-x, y, \color{blue}{\frac{5641895835477563}{5000000000000000}}\right)} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.2%

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

   if 100 < z

   1. Initial program 94.0%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 99.9%

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

Alternative 4: 99.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -250:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 100:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -250.0)
   (- x (/ 1.0 x))
   (if (<= z 100.0) (+ x (/ y (- 1.1283791670955126 (* x y)))) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -250.0) {
		tmp = x - (1.0 / x);
	} else if (z <= 100.0) {
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	} else {
		tmp = 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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-250.0d0)) then
        tmp = x - (1.0d0 / x)
    else if (z <= 100.0d0) then
        tmp = x + (y / (1.1283791670955126d0 - (x * y)))
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -250.0) {
		tmp = x - (1.0 / x);
	} else if (z <= 100.0) {
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -250.0:
		tmp = x - (1.0 / x)
	elif z <= 100.0:
		tmp = x + (y / (1.1283791670955126 - (x * y)))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -250.0)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 100.0)
		tmp = Float64(x + Float64(y / Float64(1.1283791670955126 - Float64(x * y))));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -250.0)
		tmp = x - (1.0 / x);
	elseif (z <= 100.0)
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -250.0], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 100.0], N[(x + N[(y / N[(1.1283791670955126 - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -250

   1. Initial program 88.5%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -250 < z < 100

   1. Initial program 99.8%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in z around 0

      \[\leadsto x + \frac{y}{\color{blue}{\frac{5641895835477563}{5000000000000000}} - x \cdot y} \]
   3. Step-by-step derivation

   4. Applied rewrites 99.2%

      \[\leadsto x + \frac{y}{\color{blue}{1.1283791670955126} - x \cdot y} \]

   if 100 < z

   1. Initial program 94.0%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 99.9%

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

Alternative 5: 98.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y}\\ \mathbf{if}\;t\_0 \leq 10^{+245}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;x - \frac{1}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (/ y (- (* 1.1283791670955126 (exp z)) (* x y))))))
   (if (<= t_0 1e+245) t_0 (- x (/ 1.0 x)))))

C

double code(double x, double y, double z) {
	double t_0 = x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
	double tmp;
	if (t_0 <= 1e+245) {
		tmp = t_0;
	} else {
		tmp = x - (1.0 / 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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
    if (t_0 <= 1d+245) then
        tmp = t_0
    else
        tmp = x - (1.0d0 / x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x + (y / ((1.1283791670955126 * Math.exp(z)) - (x * y)));
	double tmp;
	if (t_0 <= 1e+245) {
		tmp = t_0;
	} else {
		tmp = x - (1.0 / x);
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x + (y / ((1.1283791670955126 * math.exp(z)) - (x * y)))
	tmp = 0
	if t_0 <= 1e+245:
		tmp = t_0
	else:
		tmp = x - (1.0 / x)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(y / Float64(Float64(1.1283791670955126 * exp(z)) - Float64(x * y))))
	tmp = 0.0
	if (t_0 <= 1e+245)
		tmp = t_0;
	else
		tmp = Float64(x - Float64(1.0 / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
	tmp = 0.0;
	if (t_0 <= 1e+245)
		tmp = t_0;
	else
		tmp = x - (1.0 / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[(y / N[(N[(1.1283791670955126 * N[Exp[z], $MachinePrecision]), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 1e+245], t$95$0, N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y)))) < 1.00000000000000004e245

   1. Initial program 98.3%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   if 1.00000000000000004e245 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y))))

   1. Initial program 65.4%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 98.7

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

   4. Applied rewrites 98.7%

      \[\leadsto \color{blue}{x - \frac{1}{x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 86.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x - \frac{1}{x}\\ t_1 := x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y}\\ \mathbf{if}\;t\_1 \leq -10000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- x (/ 1.0 x)))
        (t_1 (+ x (/ y (- (* 1.1283791670955126 (exp z)) (* x y))))))
   (if (<= t_1 -10000000000.0) t_0 (if (<= t_1 2e-6) x t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x - (1.0 / x);
	double t_1 = x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
	double tmp;
	if (t_1 <= -10000000000.0) {
		tmp = t_0;
	} else if (t_1 <= 2e-6) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = x - (1.0d0 / x)
    t_1 = x + (y / ((1.1283791670955126d0 * exp(z)) - (x * y)))
    if (t_1 <= (-10000000000.0d0)) then
        tmp = t_0
    else if (t_1 <= 2d-6) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x - (1.0 / x);
	double t_1 = x + (y / ((1.1283791670955126 * Math.exp(z)) - (x * y)));
	double tmp;
	if (t_1 <= -10000000000.0) {
		tmp = t_0;
	} else if (t_1 <= 2e-6) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x - (1.0 / x)
	t_1 = x + (y / ((1.1283791670955126 * math.exp(z)) - (x * y)))
	tmp = 0
	if t_1 <= -10000000000.0:
		tmp = t_0
	elif t_1 <= 2e-6:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x - Float64(1.0 / x))
	t_1 = Float64(x + Float64(y / Float64(Float64(1.1283791670955126 * exp(z)) - Float64(x * y))))
	tmp = 0.0
	if (t_1 <= -10000000000.0)
		tmp = t_0;
	elseif (t_1 <= 2e-6)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x - (1.0 / x);
	t_1 = x + (y / ((1.1283791670955126 * exp(z)) - (x * y)));
	tmp = 0.0;
	if (t_1 <= -10000000000.0)
		tmp = t_0;
	elseif (t_1 <= 2e-6)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x + N[(y / N[(N[(1.1283791670955126 * N[Exp[z], $MachinePrecision]), $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -10000000000.0], t$95$0, If[LessEqual[t$95$1, 2e-6], x, t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y)))) < -1e10 or 1.99999999999999991e-6 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y))))

   1. Initial program 94.0%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 91.5

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

   4. Applied rewrites 91.5%

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

   if -1e10 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y)))) < 1.99999999999999991e-6

   1. Initial program 99.9%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 74.2%

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

Alternative 7: 71.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{-39}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -1.56 \cdot 10^{-117}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{elif}\;x \leq -9.5 \cdot 10^{-246}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.85 \cdot 10^{-184}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{elif}\;x \leq 4.8 \cdot 10^{-133}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 10^{-19}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.2e-39)
   x
   (if (<= x -1.56e-117)
     (/ -1.0 x)
     (if (<= x -9.5e-246)
       x
       (if (<= x 2.85e-184)
         (* y 0.8862269254527579)
         (if (<= x 4.8e-133) x (if (<= x 1e-19) (/ -1.0 x) x)))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.2e-39) {
		tmp = x;
	} else if (x <= -1.56e-117) {
		tmp = -1.0 / x;
	} else if (x <= -9.5e-246) {
		tmp = x;
	} else if (x <= 2.85e-184) {
		tmp = y * 0.8862269254527579;
	} else if (x <= 4.8e-133) {
		tmp = x;
	} else if (x <= 1e-19) {
		tmp = -1.0 / x;
	} else {
		tmp = 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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-2.2d-39)) then
        tmp = x
    else if (x <= (-1.56d-117)) then
        tmp = (-1.0d0) / x
    else if (x <= (-9.5d-246)) then
        tmp = x
    else if (x <= 2.85d-184) then
        tmp = y * 0.8862269254527579d0
    else if (x <= 4.8d-133) then
        tmp = x
    else if (x <= 1d-19) then
        tmp = (-1.0d0) / x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.2e-39) {
		tmp = x;
	} else if (x <= -1.56e-117) {
		tmp = -1.0 / x;
	} else if (x <= -9.5e-246) {
		tmp = x;
	} else if (x <= 2.85e-184) {
		tmp = y * 0.8862269254527579;
	} else if (x <= 4.8e-133) {
		tmp = x;
	} else if (x <= 1e-19) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -2.2e-39:
		tmp = x
	elif x <= -1.56e-117:
		tmp = -1.0 / x
	elif x <= -9.5e-246:
		tmp = x
	elif x <= 2.85e-184:
		tmp = y * 0.8862269254527579
	elif x <= 4.8e-133:
		tmp = x
	elif x <= 1e-19:
		tmp = -1.0 / x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.2e-39)
		tmp = x;
	elseif (x <= -1.56e-117)
		tmp = Float64(-1.0 / x);
	elseif (x <= -9.5e-246)
		tmp = x;
	elseif (x <= 2.85e-184)
		tmp = Float64(y * 0.8862269254527579);
	elseif (x <= 4.8e-133)
		tmp = x;
	elseif (x <= 1e-19)
		tmp = Float64(-1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -2.2e-39)
		tmp = x;
	elseif (x <= -1.56e-117)
		tmp = -1.0 / x;
	elseif (x <= -9.5e-246)
		tmp = x;
	elseif (x <= 2.85e-184)
		tmp = y * 0.8862269254527579;
	elseif (x <= 4.8e-133)
		tmp = x;
	elseif (x <= 1e-19)
		tmp = -1.0 / x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.2e-39], x, If[LessEqual[x, -1.56e-117], N[(-1.0 / x), $MachinePrecision], If[LessEqual[x, -9.5e-246], x, If[LessEqual[x, 2.85e-184], N[(y * 0.8862269254527579), $MachinePrecision], If[LessEqual[x, 4.8e-133], x, If[LessEqual[x, 1e-19], N[(-1.0 / x), $MachinePrecision], x]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.20000000000000001e-39 or -1.56e-117 < x < -9.5000000000000002e-246 or 2.85000000000000026e-184 < x < 4.8e-133 or 9.9999999999999998e-20 < x

   1. Initial program 96.1%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 83.4%

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

   if -2.20000000000000001e-39 < x < -1.56e-117 or 4.8e-133 < x < 9.9999999999999998e-20

   1. Initial program 97.9%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in y around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 42.8

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

   4. Applied rewrites 42.8%

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

   5. Taylor expanded in x around 0

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

      1. lower-/.f64 42.8

         \[\leadsto \frac{-1}{x} \]

   7. Applied rewrites 42.8%

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

   if -9.5000000000000002e-246 < x < 2.85000000000000026e-184

   1. Initial program 96.1%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{5000000000000000}{5641895835477563} \cdot \frac{y}{e^{z}}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{y}{e^{z}} \cdot \color{blue}{\frac{5000000000000000}{5641895835477563}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{y}{e^{z}} \cdot \color{blue}{\frac{5000000000000000}{5641895835477563}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{e^{z}} \cdot \frac{5000000000000000}{5641895835477563} \]

      4. lift-exp.f64 8.1

         \[\leadsto \frac{y}{e^{z}} \cdot 0.8862269254527579 \]

   4. Applied rewrites 8.1%

      \[\leadsto \color{blue}{\frac{y}{e^{z}} \cdot 0.8862269254527579} \]

   5. Taylor expanded in z around 0

      \[\leadsto y \cdot \frac{5000000000000000}{5641895835477563} \]
   6. Step-by-step derivation

   7. Applied rewrites 8.1%

      \[\leadsto y \cdot 0.8862269254527579 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 70.7% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{-246}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.85 \cdot 10^{-184}:\\ \;\;\;\;y \cdot 0.8862269254527579\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -9.5e-246) x (if (<= x 2.85e-184) (* y 0.8862269254527579) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.5e-246) {
		tmp = x;
	} else if (x <= 2.85e-184) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = 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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-9.5d-246)) then
        tmp = x
    else if (x <= 2.85d-184) then
        tmp = y * 0.8862269254527579d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.5e-246) {
		tmp = x;
	} else if (x <= 2.85e-184) {
		tmp = y * 0.8862269254527579;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -9.5e-246:
		tmp = x
	elif x <= 2.85e-184:
		tmp = y * 0.8862269254527579
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -9.5e-246)
		tmp = x;
	elseif (x <= 2.85e-184)
		tmp = Float64(y * 0.8862269254527579);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -9.5e-246)
		tmp = x;
	elseif (x <= 2.85e-184)
		tmp = y * 0.8862269254527579;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -9.5e-246], x, If[LessEqual[x, 2.85e-184], N[(y * 0.8862269254527579), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -9.5000000000000002e-246 or 2.85000000000000026e-184 < x

   1. Initial program 96.5%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 76.0%

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

   if -9.5000000000000002e-246 < x < 2.85000000000000026e-184

   1. Initial program 90.4%

      \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{5000000000000000}{5641895835477563} \cdot \frac{y}{e^{z}}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{y}{e^{z}} \cdot \color{blue}{\frac{5000000000000000}{5641895835477563}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{y}{e^{z}} \cdot \color{blue}{\frac{5000000000000000}{5641895835477563}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{e^{z}} \cdot \frac{5000000000000000}{5641895835477563} \]

      4. lift-exp.f64 45.0

         \[\leadsto \frac{y}{e^{z}} \cdot 0.8862269254527579 \]

   4. Applied rewrites 45.0%

      \[\leadsto \color{blue}{\frac{y}{e^{z}} \cdot 0.8862269254527579} \]

   5. Taylor expanded in z around 0

      \[\leadsto y \cdot \frac{5000000000000000}{5641895835477563} \]
   6. Step-by-step derivation

   7. Applied rewrites 42.7%

      \[\leadsto y \cdot 0.8862269254527579 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 69.4% accurate, 25.8× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 x)

C

double code(double x, double y, double z) {
	return 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, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x
end function

Java

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

Python

def code(x, y, z):
	return x

Julia

function code(x, y, z)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 95.6%

   \[x + \frac{y}{1.1283791670955126 \cdot e^{z} - x \cdot y} \]

2. Taylor expanded in x around inf

   \[\leadsto \color{blue}{x} \]
3. Step-by-step derivation

4. Applied rewrites 69.4%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025119 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:invErfc from math-functions-0.1.5.2, A"
  :precision binary64
  (+ x (/ y (- (* 1.1283791670955126 (exp z)) (* x y)))))