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

Percentage Accurate: 99.9% → 99.9%

Time: 4.4s

Alternatives: 10

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(\left(x \cdot \log y - y\right) - z\right) + \log t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ (- (- (* x (log y)) y) z) (log t)))

C

double code(double x, double y, double z, double t) {
	return (((x * log(y)) - y) - z) + log(t);
}

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

Java

public static double code(double x, double y, double z, double t) {
	return (((x * Math.log(y)) - y) - z) + Math.log(t);
}

Python

def code(x, y, z, t):
	return (((x * math.log(y)) - y) - z) + math.log(t)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(x * log(y)) - y) - z) + log(t))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((x * log(y)) - y) - z) + log(t);
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision] + N[Log[t], $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x \cdot \log y - y\right) - z\right) + \log t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ (- (- (* x (log y)) y) z) (log t)))

C

double code(double x, double y, double z, double t) {
	return (((x * log(y)) - y) - z) + log(t);
}

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

Java

public static double code(double x, double y, double z, double t) {
	return (((x * Math.log(y)) - y) - z) + Math.log(t);
}

Python

def code(x, y, z, t):
	return (((x * math.log(y)) - y) - z) + math.log(t)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(x * log(y)) - y) - z) + log(t))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((x * log(y)) - y) - z) + log(t);
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision] + N[Log[t], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ (- (fma (log y) x (- z)) y) (log t)))

C

double code(double x, double y, double z, double t) {
	return (fma(log(y), x, -z) - y) + log(t);
}

Julia

function code(x, y, z, t)
	return Float64(Float64(fma(log(y), x, Float64(-z)) - y) + log(t))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[Log[y], $MachinePrecision] * x + (-z)), $MachinePrecision] - y), $MachinePrecision] + N[Log[t], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

2. Taylor expanded in z around 0

   \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
3. Step-by-step derivation

   1. lower--.f64 N/A

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

   2. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

   3. *-commutative N/A

      \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

   4. lower-fma.f64 N/A

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

   5. lift-log.f64 N/A

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

   6. mul-1-neg N/A

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

   7. lower-neg.f64 99.9

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\log y, x, -z\right) - y\right)} + \log t \]
5. Add Preprocessing

Alternative 2: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\mathsf{fma}\left(\log y, x, \log t\right) - y\right) - z \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (- (fma (log y) x (log t)) y) z))

C

double code(double x, double y, double z, double t) {
	return (fma(log(y), x, log(t)) - y) - z;
}

Julia

function code(x, y, z, t)
	return Float64(Float64(fma(log(y), x, log(t)) - y) - z)
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[Log[y], $MachinePrecision] * x + N[Log[t], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]
2. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-log.f64 N/A

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

   6. lift-log.f64 N/A

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

   7. +-commutative N/A

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

   8. associate--l- N/A

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

   9. associate--l+ N/A

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

   10. associate--r+ N/A

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

   11. lower--.f64 N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. *-commutative N/A

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

   15. lower-fma.f64 N/A

       \[\leadsto \left(\color{blue}{\mathsf{fma}\left(\log y, x, \log t\right)} - y\right) - z \]

   16. lift-log.f64 N/A

       \[\leadsto \left(\mathsf{fma}\left(\color{blue}{\log y}, x, \log t\right) - y\right) - z \]

   17. lift-log.f64 99.9

       \[\leadsto \left(\mathsf{fma}\left(\log y, x, \color{blue}{\log t}\right) - y\right) - z \]

3. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\log y, x, \log t\right) - y\right) - z} \]
4. Add Preprocessing

Alternative 3: 89.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\log y, x, \log t\right)\\ \mathbf{if}\;z \leq -3.15 \cdot 10^{+91}:\\ \;\;\;\;\left(\log t - y\right) - z\\ \mathbf{elif}\;z \leq 2.6 \cdot 10^{+58}:\\ \;\;\;\;t\_1 - y\\ \mathbf{else}:\\ \;\;\;\;t\_1 - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma (log y) x (log t))))
   (if (<= z -3.15e+91)
     (- (- (log t) y) z)
     (if (<= z 2.6e+58) (- t_1 y) (- t_1 z)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(log(y), x, log(t));
	double tmp;
	if (z <= -3.15e+91) {
		tmp = (log(t) - y) - z;
	} else if (z <= 2.6e+58) {
		tmp = t_1 - y;
	} else {
		tmp = t_1 - z;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(log(y), x, log(t))
	tmp = 0.0
	if (z <= -3.15e+91)
		tmp = Float64(Float64(log(t) - y) - z);
	elseif (z <= 2.6e+58)
		tmp = Float64(t_1 - y);
	else
		tmp = Float64(t_1 - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Log[y], $MachinePrecision] * x + N[Log[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.15e+91], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], If[LessEqual[z, 2.6e+58], N[(t$95$1 - y), $MachinePrecision], N[(t$95$1 - z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.15e91

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log t - \left(y + z\right)} \]
   3. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(\log t - y\right) - \color{blue}{z} \]

      2. lower--.f64 N/A

         \[\leadsto \left(\log t - y\right) - \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\log t - y\right) - z \]

      4. lift-log.f64 70.3

         \[\leadsto \left(\log t - y\right) - z \]

   4. Applied rewrites 70.3%

      \[\leadsto \color{blue}{\left(\log t - y\right) - z} \]

   if -3.15e91 < z < 2.59999999999999988e58

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(x \cdot \log y + \log t\right) - y \]

      3. *-commutative N/A

         \[\leadsto \left(\log y \cdot x + \log t\right) - y \]

      4. lower-fma.f64 N/A

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

      5. lift-log.f64 N/A

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

      6. lift-log.f64 71.7

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

   4. Applied rewrites 71.7%

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

   if 2.59999999999999988e58 < z

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\left(\log t + x \cdot \log y\right) - z} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(x \cdot \log y + \log t\right) - z \]

      3. *-commutative N/A

         \[\leadsto \left(\log y \cdot x + \log t\right) - z \]

      4. lower-fma.f64 N/A

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

      5. lift-log.f64 N/A

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

      6. lift-log.f64 70.6

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

   4. Applied rewrites 70.6%

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

Alternative 4: 89.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\log y, x, \log t\right) - y\\ \mathbf{if}\;x \leq -6.5 \cdot 10^{+42}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 1.72 \cdot 10^{+78}:\\ \;\;\;\;\left(\log t - y\right) - z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (fma (log y) x (log t)) y)))
   (if (<= x -6.5e+42) t_1 (if (<= x 1.72e+78) (- (- (log t) y) z) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(log(y), x, log(t)) - y;
	double tmp;
	if (x <= -6.5e+42) {
		tmp = t_1;
	} else if (x <= 1.72e+78) {
		tmp = (log(t) - y) - z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(log(y), x, log(t)) - y)
	tmp = 0.0
	if (x <= -6.5e+42)
		tmp = t_1;
	elseif (x <= 1.72e+78)
		tmp = Float64(Float64(log(t) - y) - z);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[Log[y], $MachinePrecision] * x + N[Log[t], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision]}, If[LessEqual[x, -6.5e+42], t$95$1, If[LessEqual[x, 1.72e+78], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.50000000000000052e42 or 1.71999999999999997e78 < x

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(x \cdot \log y + \log t\right) - y \]

      3. *-commutative N/A

         \[\leadsto \left(\log y \cdot x + \log t\right) - y \]

      4. lower-fma.f64 N/A

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

      5. lift-log.f64 N/A

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

      6. lift-log.f64 71.7

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

   4. Applied rewrites 71.7%

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

   if -6.50000000000000052e42 < x < 1.71999999999999997e78

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log t - \left(y + z\right)} \]
   3. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(\log t - y\right) - \color{blue}{z} \]

      2. lower--.f64 N/A

         \[\leadsto \left(\log t - y\right) - \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\log t - y\right) - z \]

      4. lift-log.f64 70.3

         \[\leadsto \left(\log t - y\right) - z \]

   4. Applied rewrites 70.3%

      \[\leadsto \color{blue}{\left(\log t - y\right) - z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 83.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log y \cdot x\\ \mathbf{if}\;x \leq -7.2 \cdot 10^{+83}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{+145}:\\ \;\;\;\;\left(\log t - y\right) - z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (log y) x)))
   (if (<= x -7.2e+83) t_1 (if (<= x 8.6e+145) (- (- (log t) y) z) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = log(y) * x;
	double tmp;
	if (x <= -7.2e+83) {
		tmp = t_1;
	} else if (x <= 8.6e+145) {
		tmp = (log(t) - y) - z;
	} else {
		tmp = t_1;
	}
	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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = log(y) * x
    if (x <= (-7.2d+83)) then
        tmp = t_1
    else if (x <= 8.6d+145) then
        tmp = (log(t) - y) - z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = Math.log(y) * x;
	double tmp;
	if (x <= -7.2e+83) {
		tmp = t_1;
	} else if (x <= 8.6e+145) {
		tmp = (Math.log(t) - y) - z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = math.log(y) * x
	tmp = 0
	if x <= -7.2e+83:
		tmp = t_1
	elif x <= 8.6e+145:
		tmp = (math.log(t) - y) - z
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(log(y) * x)
	tmp = 0.0
	if (x <= -7.2e+83)
		tmp = t_1;
	elseif (x <= 8.6e+145)
		tmp = Float64(Float64(log(t) - y) - z);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = log(y) * x;
	tmp = 0.0;
	if (x <= -7.2e+83)
		tmp = t_1;
	elseif (x <= 8.6e+145)
		tmp = (log(t) - y) - z;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Log[y], $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -7.2e+83], t$95$1, If[LessEqual[x, 8.6e+145], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -7.1999999999999995e83 or 8.59999999999999996e145 < x

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

      3. *-commutative N/A

         \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

      4. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      5. lift-log.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

      7. lower-neg.f64 99.9

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-log.f64 30.5

         \[\leadsto \log y \cdot x \]

   7. Applied rewrites 30.5%

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

   if -7.1999999999999995e83 < x < 8.59999999999999996e145

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log t - \left(y + z\right)} \]
   3. Step-by-step derivation

      1. associate--r+ N/A

         \[\leadsto \left(\log t - y\right) - \color{blue}{z} \]

      2. lower--.f64 N/A

         \[\leadsto \left(\log t - y\right) - \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(\log t - y\right) - z \]

      4. lift-log.f64 70.3

         \[\leadsto \left(\log t - y\right) - z \]

   4. Applied rewrites 70.3%

      \[\leadsto \color{blue}{\left(\log t - y\right) - z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 62.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \log y - y\\ t_2 := \log y \cdot x\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+225}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+106}:\\ \;\;\;\;-y\\ \mathbf{elif}\;t\_1 \leq 10^{+45}:\\ \;\;\;\;\log t - z\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* x (log y)) y)) (t_2 (* (log y) x)))
   (if (<= t_1 -2e+225)
     t_2
     (if (<= t_1 -1e+106) (- y) (if (<= t_1 1e+45) (- (log t) z) t_2)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * log(y)) - y;
	double t_2 = log(y) * x;
	double tmp;
	if (t_1 <= -2e+225) {
		tmp = t_2;
	} else if (t_1 <= -1e+106) {
		tmp = -y;
	} else if (t_1 <= 1e+45) {
		tmp = log(t) - z;
	} else {
		tmp = t_2;
	}
	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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x * log(y)) - y
    t_2 = log(y) * x
    if (t_1 <= (-2d+225)) then
        tmp = t_2
    else if (t_1 <= (-1d+106)) then
        tmp = -y
    else if (t_1 <= 1d+45) then
        tmp = log(t) - z
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x * Math.log(y)) - y;
	double t_2 = Math.log(y) * x;
	double tmp;
	if (t_1 <= -2e+225) {
		tmp = t_2;
	} else if (t_1 <= -1e+106) {
		tmp = -y;
	} else if (t_1 <= 1e+45) {
		tmp = Math.log(t) - z;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x * math.log(y)) - y
	t_2 = math.log(y) * x
	tmp = 0
	if t_1 <= -2e+225:
		tmp = t_2
	elif t_1 <= -1e+106:
		tmp = -y
	elif t_1 <= 1e+45:
		tmp = math.log(t) - z
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * log(y)) - y)
	t_2 = Float64(log(y) * x)
	tmp = 0.0
	if (t_1 <= -2e+225)
		tmp = t_2;
	elseif (t_1 <= -1e+106)
		tmp = Float64(-y);
	elseif (t_1 <= 1e+45)
		tmp = Float64(log(t) - z);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * log(y)) - y;
	t_2 = log(y) * x;
	tmp = 0.0;
	if (t_1 <= -2e+225)
		tmp = t_2;
	elseif (t_1 <= -1e+106)
		tmp = -y;
	elseif (t_1 <= 1e+45)
		tmp = log(t) - z;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision]}, Block[{t$95$2 = N[(N[Log[y], $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+225], t$95$2, If[LessEqual[t$95$1, -1e+106], (-y), If[LessEqual[t$95$1, 1e+45], N[(N[Log[t], $MachinePrecision] - z), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x (log.f64 y)) y) < -1.99999999999999986e225 or 9.9999999999999993e44 < (-.f64 (*.f64 x (log.f64 y)) y)

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

      3. *-commutative N/A

         \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

      4. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      5. lift-log.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

      7. lower-neg.f64 99.9

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-log.f64 30.5

         \[\leadsto \log y \cdot x \]

   7. Applied rewrites 30.5%

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

   if -1.99999999999999986e225 < (-.f64 (*.f64 x (log.f64 y)) y) < -1.00000000000000009e106

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

      3. *-commutative N/A

         \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

      4. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      5. lift-log.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

      7. lower-neg.f64 99.9

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 30.2

         \[\leadsto -y \]

   7. Applied rewrites 30.2%

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

   if -1.00000000000000009e106 < (-.f64 (*.f64 x (log.f64 y)) y) < 9.9999999999999993e44

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\left(\log t + x \cdot \log y\right) - z} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(x \cdot \log y + \log t\right) - z \]

      3. *-commutative N/A

         \[\leadsto \left(\log y \cdot x + \log t\right) - z \]

      4. lower-fma.f64 N/A

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

      5. lift-log.f64 N/A

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

      6. lift-log.f64 70.6

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

   4. Applied rewrites 70.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\log y, x, \log t\right) - z} \]

   5. Taylor expanded in x around 0

      \[\leadsto \log t - z \]
   6. Step-by-step derivation

      1. lift-log.f64 41.7

         \[\leadsto \log t - z \]

   7. Applied rewrites 41.7%

      \[\leadsto \log t - z \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 60.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5 \cdot 10^{+94}:\\ \;\;\;\;-z\\ \mathbf{elif}\;z \leq 10^{+78}:\\ \;\;\;\;\log t - y\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -5e+94) (- z) (if (<= z 1e+78) (- (log t) y) (- z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -5e+94) {
		tmp = -z;
	} else if (z <= 1e+78) {
		tmp = log(t) - y;
	} else {
		tmp = -z;
	}
	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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-5d+94)) then
        tmp = -z
    else if (z <= 1d+78) then
        tmp = log(t) - y
    else
        tmp = -z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -5e+94) {
		tmp = -z;
	} else if (z <= 1e+78) {
		tmp = Math.log(t) - y;
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -5e+94:
		tmp = -z
	elif z <= 1e+78:
		tmp = math.log(t) - y
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -5e+94)
		tmp = Float64(-z);
	elseif (z <= 1e+78)
		tmp = Float64(log(t) - y);
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -5e+94)
		tmp = -z;
	elseif (z <= 1e+78)
		tmp = log(t) - y;
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -5e+94], (-z), If[LessEqual[z, 1e+78], N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision], (-z)]]

Derivation

1. Split input into 2 regimes

2. if z < -5.0000000000000001e94 or 1.00000000000000001e78 < z

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 29.3

         \[\leadsto -z \]

   4. Applied rewrites 29.3%

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

   if -5.0000000000000001e94 < z < 1.00000000000000001e78

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(x \cdot \log y + \log t\right) - y \]

      3. *-commutative N/A

         \[\leadsto \left(\log y \cdot x + \log t\right) - y \]

      4. lower-fma.f64 N/A

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

      5. lift-log.f64 N/A

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

      6. lift-log.f64 71.7

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

   4. Applied rewrites 71.7%

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

   5. Taylor expanded in x around 0

      \[\leadsto \log t - y \]
   6. Step-by-step derivation

      1. lift-log.f64 42.8

         \[\leadsto \log t - y \]

   7. Applied rewrites 42.8%

      \[\leadsto \log t - y \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 59.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+46}:\\ \;\;\;\;\log t - z\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= y 4e+46) (- (log t) z) (- y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 4e+46) {
		tmp = log(t) - z;
	} else {
		tmp = -y;
	}
	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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= 4d+46) then
        tmp = log(t) - z
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 4e+46) {
		tmp = Math.log(t) - z;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 4e+46:
		tmp = math.log(t) - z
	else:
		tmp = -y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 4e+46)
		tmp = Float64(log(t) - z);
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 4e+46)
		tmp = log(t) - z;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 4e+46], N[(N[Log[t], $MachinePrecision] - z), $MachinePrecision], (-y)]

Derivation

1. Split input into 2 regimes

2. if y < 4e46

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\left(\log t + x \cdot \log y\right) - z} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(x \cdot \log y + \log t\right) - z \]

      3. *-commutative N/A

         \[\leadsto \left(\log y \cdot x + \log t\right) - z \]

      4. lower-fma.f64 N/A

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

      5. lift-log.f64 N/A

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

      6. lift-log.f64 70.6

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

   4. Applied rewrites 70.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\log y, x, \log t\right) - z} \]

   5. Taylor expanded in x around 0

      \[\leadsto \log t - z \]
   6. Step-by-step derivation

      1. lift-log.f64 41.7

         \[\leadsto \log t - z \]

   7. Applied rewrites 41.7%

      \[\leadsto \log t - z \]

   if 4e46 < y

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

      3. *-commutative N/A

         \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

      4. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      5. lift-log.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

      7. lower-neg.f64 99.9

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 30.2

         \[\leadsto -y \]

   7. Applied rewrites 30.2%

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

Alternative 9: 48.0% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+46}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= y 4e+46) (- z) (- y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 4e+46) {
		tmp = -z;
	} else {
		tmp = -y;
	}
	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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= 4d+46) then
        tmp = -z
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 4e+46) {
		tmp = -z;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 4e+46:
		tmp = -z
	else:
		tmp = -y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 4e+46)
		tmp = Float64(-z);
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 4e+46)
		tmp = -z;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 4e+46], (-z), (-y)]

Derivation

1. Split input into 2 regimes

2. if y < 4e46

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 29.3

         \[\leadsto -z \]

   4. Applied rewrites 29.3%

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

   if 4e46 < y

   1. Initial program 99.9%

      \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

      3. *-commutative N/A

         \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

      4. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      5. lift-log.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

      6. mul-1-neg N/A

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

      7. lower-neg.f64 99.9

         \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 30.2

         \[\leadsto -y \]

   7. Applied rewrites 30.2%

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

Alternative 10: 30.2% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ -y \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

function code(x, y, z, t)
	return Float64(-y)
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := (-y)

Derivation

1. Initial program 99.9%

   \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]

2. Taylor expanded in z around 0

   \[\leadsto \color{blue}{\left(\left(-1 \cdot z + x \cdot \log y\right) - y\right)} + \log t \]
3. Step-by-step derivation

   1. lower--.f64 N/A

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

   2. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \log y + -1 \cdot z\right) - y\right) + \log t \]

   3. *-commutative N/A

      \[\leadsto \left(\left(\log y \cdot x + -1 \cdot z\right) - y\right) + \log t \]

   4. lower-fma.f64 N/A

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

   5. lift-log.f64 N/A

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, -1 \cdot z\right) - y\right) + \log t \]

   6. mul-1-neg N/A

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, \mathsf{neg}\left(z\right)\right) - y\right) + \log t \]

   7. lower-neg.f64 99.9

      \[\leadsto \left(\mathsf{fma}\left(\log y, x, -z\right) - y\right) + \log t \]

4. Applied rewrites 99.9%

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

5. Taylor expanded in y around inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 30.2

      \[\leadsto -y \]

7. Applied rewrites 30.2%

   \[\leadsto \color{blue}{-y} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025127 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (+ (- (- (* x (log y)) y) z) (log t)))