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

Percentage Accurate: 99.9% → 99.9%

Time: 4.1s

Alternatives: 12

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} \\ \mathsf{fma}\left(\log y, x, \left(\log t - y\right) - z\right) \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 fma(log(y), x, Float64(Float64(log(t) - y) - z))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[Log[y], $MachinePrecision] * x + N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision]), $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--r+ 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. lower--.f64 N/A

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

   11. +-commutative N/A

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

   12. *-commutative N/A

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

   13. lower-fma.f64 N/A

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

   14. lift-log.f64 N/A

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

   15. lift-log.f64 N/A

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

   16. +-commutative N/A

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

   17. lower-+.f64 99.9

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

3. Applied rewrites 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-log.f64 N/A

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

   4. lift-log.f64 N/A

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

   5. lift-fma.f64 N/A

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

   6. associate--l+ N/A

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

   7. +-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lift-log.f64 N/A

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

   10. associate--r+ N/A

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

   11. lower--.f64 N/A

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

   12. lower--.f64 N/A

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

   13. lift-log.f64 99.9

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

5. Applied rewrites 99.9%

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

Alternative 2: 65.4% accurate, 0.5× 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 -1 \cdot 10^{+305}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+177}:\\ \;\;\;\;-y\\ \mathbf{elif}\;t\_1 \leq 50:\\ \;\;\;\;\left(-z\right) + \log t\\ \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 -1e+305)
     t_2
     (if (<= t_1 -1e+177) (- y) (if (<= t_1 50.0) (+ (- z) (log t)) 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 <= -1e+305) {
		tmp = t_2;
	} else if (t_1 <= -1e+177) {
		tmp = -y;
	} else if (t_1 <= 50.0) {
		tmp = -z + log(t);
	} 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 <= (-1d+305)) then
        tmp = t_2
    else if (t_1 <= (-1d+177)) then
        tmp = -y
    else if (t_1 <= 50.0d0) then
        tmp = -z + log(t)
    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 <= -1e+305) {
		tmp = t_2;
	} else if (t_1 <= -1e+177) {
		tmp = -y;
	} else if (t_1 <= 50.0) {
		tmp = -z + Math.log(t);
	} 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 <= -1e+305:
		tmp = t_2
	elif t_1 <= -1e+177:
		tmp = -y
	elif t_1 <= 50.0:
		tmp = -z + math.log(t)
	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 <= -1e+305)
		tmp = t_2;
	elseif (t_1 <= -1e+177)
		tmp = Float64(-y);
	elseif (t_1 <= 50.0)
		tmp = Float64(Float64(-z) + log(t));
	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 <= -1e+305)
		tmp = t_2;
	elseif (t_1 <= -1e+177)
		tmp = -y;
	elseif (t_1 <= 50.0)
		tmp = -z + log(t);
	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, -1e+305], t$95$2, If[LessEqual[t$95$1, -1e+177], (-y), If[LessEqual[t$95$1, 50.0], N[((-z) + N[Log[t], $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x (log.f64 y)) y) < -9.9999999999999994e304 or 50 < (-.f64 (*.f64 x (log.f64 y)) y)

   1. Initial program 99.7%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \log y} \]
   3. 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 73.2

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

   4. Applied rewrites 73.2%

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

   if -9.9999999999999994e304 < (-.f64 (*.f64 x (log.f64 y)) y) < -1e177

   1. Initial program 99.9%

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

   2. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 59.1

         \[\leadsto -y \]

   4. Applied rewrites 59.1%

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

   if -1e177 < (-.f64 (*.f64 x (log.f64 y)) y) < 50

   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} + \log t \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 65.7

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

   4. Applied rewrites 65.7%

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

Alternative 3: 53.8% accurate, 0.5× 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 -1 \cdot 10^{+305}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+177}:\\ \;\;\;\;-y\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;-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 -1e+305)
     t_2
     (if (<= t_1 -1e+177) (- y) (if (<= t_1 5e-6) (- 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 <= -1e+305) {
		tmp = t_2;
	} else if (t_1 <= -1e+177) {
		tmp = -y;
	} else if (t_1 <= 5e-6) {
		tmp = -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 <= (-1d+305)) then
        tmp = t_2
    else if (t_1 <= (-1d+177)) then
        tmp = -y
    else if (t_1 <= 5d-6) then
        tmp = -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 <= -1e+305) {
		tmp = t_2;
	} else if (t_1 <= -1e+177) {
		tmp = -y;
	} else if (t_1 <= 5e-6) {
		tmp = -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 <= -1e+305:
		tmp = t_2
	elif t_1 <= -1e+177:
		tmp = -y
	elif t_1 <= 5e-6:
		tmp = -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 <= -1e+305)
		tmp = t_2;
	elseif (t_1 <= -1e+177)
		tmp = Float64(-y);
	elseif (t_1 <= 5e-6)
		tmp = Float64(-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 <= -1e+305)
		tmp = t_2;
	elseif (t_1 <= -1e+177)
		tmp = -y;
	elseif (t_1 <= 5e-6)
		tmp = -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, -1e+305], t$95$2, If[LessEqual[t$95$1, -1e+177], (-y), If[LessEqual[t$95$1, 5e-6], (-z), t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x (log.f64 y)) y) < -9.9999999999999994e304 or 5.00000000000000041e-6 < (-.f64 (*.f64 x (log.f64 y)) y)

   1. Initial program 99.7%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \log y} \]
   3. 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 72.5

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

   4. Applied rewrites 72.5%

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

   if -9.9999999999999994e304 < (-.f64 (*.f64 x (log.f64 y)) y) < -1e177

   1. Initial program 99.9%

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

   2. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 59.1

         \[\leadsto -y \]

   4. Applied rewrites 59.1%

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

   if -1e177 < (-.f64 (*.f64 x (log.f64 y)) y) < 5.00000000000000041e-6

   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 43.5

         \[\leadsto -z \]

   4. Applied rewrites 43.5%

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

Alternative 4: 98.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \log y - y\\ t_2 := \log y \cdot x - \left(z + y\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+23}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 50:\\ \;\;\;\;\left(\log t - y\right) - 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) (+ z y))))
   (if (<= t_1 -2e+23) t_2 (if (<= t_1 50.0) (- (- (log t) y) 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) - (z + y);
	double tmp;
	if (t_1 <= -2e+23) {
		tmp = t_2;
	} else if (t_1 <= 50.0) {
		tmp = (log(t) - y) - 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) - (z + y)
    if (t_1 <= (-2d+23)) then
        tmp = t_2
    else if (t_1 <= 50.0d0) then
        tmp = (log(t) - y) - 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) - (z + y);
	double tmp;
	if (t_1 <= -2e+23) {
		tmp = t_2;
	} else if (t_1 <= 50.0) {
		tmp = (Math.log(t) - y) - 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) - (z + y)
	tmp = 0
	if t_1 <= -2e+23:
		tmp = t_2
	elif t_1 <= 50.0:
		tmp = (math.log(t) - y) - 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(Float64(log(y) * x) - Float64(z + y))
	tmp = 0.0
	if (t_1 <= -2e+23)
		tmp = t_2;
	elseif (t_1 <= 50.0)
		tmp = Float64(Float64(log(t) - y) - 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) - (z + y);
	tmp = 0.0;
	if (t_1 <= -2e+23)
		tmp = t_2;
	elseif (t_1 <= 50.0)
		tmp = (log(t) - y) - 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[(N[Log[y], $MachinePrecision] * x), $MachinePrecision] - N[(z + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+23], t$95$2, If[LessEqual[t$95$1, 50.0], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x (log.f64 y)) y) < -1.9999999999999998e23 or 50 < (-.f64 (*.f64 x (log.f64 y)) y)

   1. Initial program 99.8%

      \[\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--r+ 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. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lift-log.f64 N/A

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

      15. lift-log.f64 N/A

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

      16. +-commutative N/A

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

      17. lower-+.f64 99.8

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

   3. Applied rewrites 99.8%

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

   4. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lift-log.f64 N/A

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

      3. lift-*.f64 99.6

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

   6. Applied rewrites 99.6%

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

   if -1.9999999999999998e23 < (-.f64 (*.f64 x (log.f64 y)) y) < 50

   1. Initial program 100.0%

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

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

   4. Applied rewrites 97.2%

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

Alternative 5: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 6.9 \cdot 10^{-15}:\\ \;\;\;\;\mathsf{fma}\left(\log y, x, \log t\right) - z\\ \mathbf{else}:\\ \;\;\;\;\log y \cdot x - \left(z + y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 6.9e-15) (- (fma (log y) x (log t)) z) (- (* (log y) x) (+ z y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 6.9e-15) {
		tmp = fma(log(y), x, log(t)) - z;
	} else {
		tmp = (log(y) * x) - (z + y);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 6.9e-15)
		tmp = Float64(fma(log(y), x, log(t)) - z);
	else
		tmp = Float64(Float64(log(y) * x) - Float64(z + y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.9000000000000001e-15

   1. Initial program 99.8%

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

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

   4. Applied rewrites 99.8%

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

   if 6.9000000000000001e-15 < y

   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--r+ 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. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lift-log.f64 N/A

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

      15. lift-log.f64 N/A

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

      16. +-commutative N/A

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

      17. lower-+.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lift-log.f64 N/A

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

      3. lift-*.f64 98.2

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

   6. Applied rewrites 98.2%

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

Alternative 6: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[Log[y], $MachinePrecision] * x + N[Log[t], $MachinePrecision]), $MachinePrecision] - N[(z + y), $MachinePrecision]), $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--r+ 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. lower--.f64 N/A

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

   11. +-commutative N/A

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

   12. *-commutative N/A

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

   13. lower-fma.f64 N/A

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

   14. lift-log.f64 N/A

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

   15. lift-log.f64 N/A

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

   16. +-commutative N/A

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

   17. lower-+.f64 99.9

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

3. Applied rewrites 99.9%

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

Alternative 7: 51.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log y \cdot x\\ \mathbf{if}\;x \leq -7.5 \cdot 10^{+96}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -1.3 \cdot 10^{-136}:\\ \;\;\;\;\left(-y\right) + \log t\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{+30}:\\ \;\;\;\;-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.5e+96)
     t_1
     (if (<= x -1.3e-136) (+ (- y) (log t)) (if (<= x 6.8e+30) (- 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.5e+96) {
		tmp = t_1;
	} else if (x <= -1.3e-136) {
		tmp = -y + log(t);
	} else if (x <= 6.8e+30) {
		tmp = -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.5d+96)) then
        tmp = t_1
    else if (x <= (-1.3d-136)) then
        tmp = -y + log(t)
    else if (x <= 6.8d+30) then
        tmp = -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.5e+96) {
		tmp = t_1;
	} else if (x <= -1.3e-136) {
		tmp = -y + Math.log(t);
	} else if (x <= 6.8e+30) {
		tmp = -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.5e+96:
		tmp = t_1
	elif x <= -1.3e-136:
		tmp = -y + math.log(t)
	elif x <= 6.8e+30:
		tmp = -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.5e+96)
		tmp = t_1;
	elseif (x <= -1.3e-136)
		tmp = Float64(Float64(-y) + log(t));
	elseif (x <= 6.8e+30)
		tmp = Float64(-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.5e+96)
		tmp = t_1;
	elseif (x <= -1.3e-136)
		tmp = -y + log(t);
	elseif (x <= 6.8e+30)
		tmp = -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.5e+96], t$95$1, If[LessEqual[x, -1.3e-136], N[((-y) + N[Log[t], $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 6.8e+30], (-z), t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if x < -7.4999999999999996e96 or 6.8000000000000005e30 < x

   1. Initial program 99.7%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \log y} \]
   3. 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 65.7

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

   4. Applied rewrites 65.7%

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

   if -7.4999999999999996e96 < x < -1.29999999999999998e-136

   1. Initial program 99.9%

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

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-1 \cdot y} + \log t \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 50.2

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

   4. Applied rewrites 50.2%

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

   if -1.29999999999999998e-136 < x < 6.8000000000000005e30

   1. Initial program 100.0%

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

         \[\leadsto -z \]

   4. Applied rewrites 39.1%

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

Alternative 8: 89.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.6 \cdot 10^{+18}:\\ \;\;\;\;\mathsf{fma}\left(\log y, x, -y\right)\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{+70}:\\ \;\;\;\;\left(\log t - y\right) - z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\log y, x, -z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -3.6e+18)
   (fma (log y) x (- y))
   (if (<= x 1.5e+70) (- (- (log t) y) z) (fma (log y) x (- z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -3.6e+18) {
		tmp = fma(log(y), x, -y);
	} else if (x <= 1.5e+70) {
		tmp = (log(t) - y) - z;
	} else {
		tmp = fma(log(y), x, -z);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -3.6e+18)
		tmp = fma(log(y), x, Float64(-y));
	elseif (x <= 1.5e+70)
		tmp = Float64(Float64(log(t) - y) - z);
	else
		tmp = fma(log(y), x, Float64(-z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -3.6e+18], N[(N[Log[y], $MachinePrecision] * x + (-y)), $MachinePrecision], If[LessEqual[x, 1.5e+70], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], N[(N[Log[y], $MachinePrecision] * x + (-z)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.6e18

   1. Initial program 99.7%

      \[\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--r+ 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. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lift-log.f64 N/A

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

      15. lift-log.f64 N/A

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

      16. +-commutative N/A

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

      17. lower-+.f64 99.7

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

   3. Applied rewrites 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. lift-fma.f64 N/A

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

      6. associate--l+ N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-log.f64 N/A

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

      10. associate--r+ N/A

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

      11. lower--.f64 N/A

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

      12. lower--.f64 N/A

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

      13. lift-log.f64 99.7

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 78.8

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

   8. Applied rewrites 78.8%

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

   if -3.6e18 < x < 1.49999999999999988e70

   1. Initial program 100.0%

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

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

   4. Applied rewrites 95.6%

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

   if 1.49999999999999988e70 < x

   1. Initial program 99.7%

      \[\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--r+ 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. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lift-log.f64 N/A

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

      15. lift-log.f64 N/A

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

      16. +-commutative N/A

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

      17. lower-+.f64 99.7

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

   3. Applied rewrites 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. lift-fma.f64 N/A

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

      6. associate--l+ N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-log.f64 N/A

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

      10. associate--r+ N/A

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

      11. lower--.f64 N/A

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

      12. lower--.f64 N/A

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

      13. lift-log.f64 99.8

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

   5. Applied rewrites 99.8%

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

   6. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 82.5

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

   8. Applied rewrites 82.5%

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

Alternative 9: 89.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\log y, x, -y\right)\\ \mathbf{if}\;x \leq -3.6 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+35}:\\ \;\;\;\;\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 (- y))))
   (if (<= x -3.6e+18) t_1 (if (<= x 4.5e+35) (- (- (log t) y) z) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(log(y), x, -y);
	double tmp;
	if (x <= -3.6e+18) {
		tmp = t_1;
	} else if (x <= 4.5e+35) {
		tmp = (log(t) - y) - z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(log(y), x, Float64(-y))
	tmp = 0.0
	if (x <= -3.6e+18)
		tmp = t_1;
	elseif (x <= 4.5e+35)
		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[Log[y], $MachinePrecision] * x + (-y)), $MachinePrecision]}, If[LessEqual[x, -3.6e+18], t$95$1, If[LessEqual[x, 4.5e+35], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -3.6e18 or 4.4999999999999997e35 < x

   1. Initial program 99.7%

      \[\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--r+ 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. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lift-log.f64 N/A

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

      15. lift-log.f64 N/A

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

      16. +-commutative N/A

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

      17. lower-+.f64 99.7

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

   3. Applied rewrites 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. lift-fma.f64 N/A

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

      6. associate--l+ N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-log.f64 N/A

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

      10. associate--r+ N/A

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

      11. lower--.f64 N/A

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

      12. lower--.f64 N/A

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

      13. lift-log.f64 99.8

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

   5. Applied rewrites 99.8%

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

   6. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 79.9

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

   8. Applied rewrites 79.9%

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

   if -3.6e18 < x < 4.4999999999999997e35

   1. Initial program 100.0%

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

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

   4. Applied rewrites 97.1%

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

Alternative 10: 83.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log y \cdot x\\ \mathbf{if}\;x \leq -1.25 \cdot 10^{+97}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 4.15 \cdot 10^{+71}:\\ \;\;\;\;\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 -1.25e+97) t_1 (if (<= x 4.15e+71) (- (- (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 <= -1.25e+97) {
		tmp = t_1;
	} else if (x <= 4.15e+71) {
		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 <= (-1.25d+97)) then
        tmp = t_1
    else if (x <= 4.15d+71) 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 <= -1.25e+97) {
		tmp = t_1;
	} else if (x <= 4.15e+71) {
		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 <= -1.25e+97:
		tmp = t_1
	elif x <= 4.15e+71:
		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 <= -1.25e+97)
		tmp = t_1;
	elseif (x <= 4.15e+71)
		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 <= -1.25e+97)
		tmp = t_1;
	elseif (x <= 4.15e+71)
		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, -1.25e+97], t$95$1, If[LessEqual[x, 4.15e+71], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.25e97 or 4.1499999999999998e71 < x

   1. Initial program 99.7%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \log y} \]
   3. 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 68.6

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

   4. Applied rewrites 68.6%

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

   if -1.25e97 < x < 4.1499999999999998e71

   1. Initial program 100.0%

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

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

   4. Applied rewrites 92.8%

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

Alternative 11: 47.5% accurate, 23.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 6e+109) {
		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 <= 6d+109) 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 <= 6e+109) {
		tmp = -z;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 6e+109)
		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 <= 6e+109)
		tmp = -z;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.00000000000000031e109

   1. Initial program 99.8%

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

         \[\leadsto -z \]

   4. Applied rewrites 37.4%

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

   if 6.00000000000000031e109 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 68.2

         \[\leadsto -y \]

   4. Applied rewrites 68.2%

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

Alternative 12: 29.6% accurate, 71.7× 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 y around inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 29.6

      \[\leadsto -y \]

4. Applied rewrites 29.6%

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

Reproduce

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