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

Percentage Accurate: 95.3% → 99.6%

Time: 3.2s

Alternatives: 7

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.3% 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.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -510.0)
   (- x (/ 1.0 x))
   (if (<= z 1.3e-28)
     (+ x (/ y (- 1.1283791670955126 (* x y))))
     (fma (/ y (exp z)) 0.8862269254527579 x))))

C

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -510.0)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 1.3e-28)
		tmp = Float64(x + Float64(y / Float64(1.1283791670955126 - Float64(x * y))));
	else
		tmp = fma(Float64(y / exp(z)), 0.8862269254527579, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -510

   1. Initial program 87.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 -510 < z < 1.3e-28

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

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

   if 1.3e-28 < z

   1. Initial program 94.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-exp.f64 97.6

         \[\leadsto \mathsf{fma}\left(\frac{y}{e^{z}}, 0.8862269254527579, x\right) \]

   4. Applied rewrites 97.6%

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

Alternative 2: 99.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -510.0)
   (- x (/ 1.0 x))
   (if (<= z 3.05e-6)
     (+ x (/ y (- (fma z 1.1283791670955126 1.1283791670955126) (* x y))))
     x)))

C

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -510.0)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 3.05e-6)
		tmp = Float64(x + Float64(y / Float64(fma(z, 1.1283791670955126, 1.1283791670955126) - Float64(x * y))));
	else
		tmp = x;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -510

   1. Initial program 87.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 -510 < z < 3.05000000000000002e-6

   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}{\left(\frac{5641895835477563}{5000000000000000} + \frac{5641895835477563}{5000000000000000} \cdot z\right)} - x \cdot y} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto x + \frac{y}{\left(z \cdot \frac{5641895835477563}{5000000000000000} + \frac{5641895835477563}{5000000000000000}\right) - x \cdot y} \]

      3. lower-fma.f64 99.5

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

   4. Applied rewrites 99.5%

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

   if 3.05000000000000002e-6 < z

   1. Initial program 93.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 99.4%

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

Alternative 3: 99.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -510:\\ \;\;\;\;x - \frac{1}{x}\\ \mathbf{elif}\;z \leq 3.05 \cdot 10^{-6}:\\ \;\;\;\;x + \frac{y}{1.1283791670955126 - x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -510.0)
   (- x (/ 1.0 x))
   (if (<= z 3.05e-6) (+ x (/ y (- 1.1283791670955126 (* x y)))) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -510.0) {
		tmp = x - (1.0 / x);
	} else if (z <= 3.05e-6) {
		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 <= (-510.0d0)) then
        tmp = x - (1.0d0 / x)
    else if (z <= 3.05d-6) 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 <= -510.0) {
		tmp = x - (1.0 / x);
	} else if (z <= 3.05e-6) {
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -510.0:
		tmp = x - (1.0 / x)
	elif z <= 3.05e-6:
		tmp = x + (y / (1.1283791670955126 - (x * y)))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -510.0)
		tmp = Float64(x - Float64(1.0 / x));
	elseif (z <= 3.05e-6)
		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 <= -510.0)
		tmp = x - (1.0 / x);
	elseif (z <= 3.05e-6)
		tmp = x + (y / (1.1283791670955126 - (x * y)));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -510.0], N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.05e-6], 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 < -510

   1. Initial program 87.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 -510 < z < 3.05000000000000002e-6

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

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

   if 3.05000000000000002e-6 < z

   1. Initial program 93.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 99.4%

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

Alternative 4: 86.2% 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 -1000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 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 -1000000.0) t_0 (if (<= t_1 1e-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 <= -1000000.0) {
		tmp = t_0;
	} else if (t_1 <= 1e-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 <= (-1000000.0d0)) then
        tmp = t_0
    else if (t_1 <= 1d-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 <= -1000000.0) {
		tmp = t_0;
	} else if (t_1 <= 1e-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 <= -1000000.0:
		tmp = t_0
	elif t_1 <= 1e-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 <= -1000000.0)
		tmp = t_0;
	elseif (t_1 <= 1e-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 <= -1000000.0)
		tmp = t_0;
	elseif (t_1 <= 1e-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, -1000000.0], t$95$0, If[LessEqual[t$95$1, 1e-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)))) < -1e6 or 9.99999999999999955e-7 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y))))

   1. Initial program 93.7%

      \[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 90.4

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

   4. Applied rewrites 90.4%

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

   if -1e6 < (+.f64 x (/.f64 y (-.f64 (*.f64 #s(literal 5641895835477563/5000000000000000 binary64) (exp.f64 z)) (*.f64 x y)))) < 9.99999999999999955e-7

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

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

Alternative 5: 73.0% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -6.8e+15)
   (/ -1.0 x)
   (if (<= z 8.2e-207) (fma 0.8862269254527579 y x) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -6.8e+15) {
		tmp = -1.0 / x;
	} else if (z <= 8.2e-207) {
		tmp = fma(0.8862269254527579, y, x);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -6.8e+15)
		tmp = Float64(-1.0 / x);
	elseif (z <= 8.2e-207)
		tmp = fma(0.8862269254527579, y, x);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -6.8e+15], N[(-1.0 / x), $MachinePrecision], If[LessEqual[z, 8.2e-207], N[(0.8862269254527579 * y + x), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if z < -6.8e15

   1. Initial program 87.6%

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

   5. Taylor expanded in x around 0

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

      1. lower-/.f64 50.9

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

   7. Applied rewrites 50.9%

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

   if -6.8e15 < z < 8.1999999999999998e-207

   1. Initial program 99.4%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-exp.f64 72.4

         \[\leadsto \mathsf{fma}\left(\frac{y}{e^{z}}, 0.8862269254527579, x\right) \]

   4. Applied rewrites 72.4%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{5000000000000000}{5641895835477563} \cdot y + x \]

      2. lower-fma.f64 72.8

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

   7. Applied rewrites 72.8%

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

   if 8.1999999999999998e-207 < z

   1. Initial program 96.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 84.8%

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

Alternative 6: 69.0% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+25}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= z -3.4e+25) (/ -1.0 x) x))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.4e+25) {
		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 (z <= (-3.4d+25)) 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 (z <= -3.4e+25) {
		tmp = -1.0 / x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.4e+25:
		tmp = -1.0 / x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.4e+25)
		tmp = Float64(-1.0 / x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.4e+25)
		tmp = -1.0 / x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.4e+25], N[(-1.0 / x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -3.39999999999999984e25

   1. Initial program 87.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}} \]

   5. Taylor expanded in x around 0

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

      1. lower-/.f64 50.9

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

   7. Applied rewrites 50.9%

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

   if -3.39999999999999984e25 < z

   1. Initial program 97.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 74.0%

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

Alternative 7: 68.7% 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.3%

   \[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 68.7%

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

Reproduce

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