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

Percentage Accurate: 99.9% → 99.9%

Time: 4.1s

Alternatives: 15

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, -y\right) - \left(z - \log t\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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 \left(\color{blue}{\left(-1 \cdot y + x \cdot \log y\right)} - z\right) + \log t \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lift-log.f64 N/A

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

   5. mul-1-neg N/A

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

   6. lower-neg.f64 99.9

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

4. Applied rewrites 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-log.f64 N/A

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

   4. associate-+l- N/A

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

   5. lower--.f64 N/A

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

   6. lower--.f64 N/A

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

   7. lift-log.f64 99.9

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

6. Applied rewrites 99.9%

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

Alternative 2: 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]

Derivation

1. Initial program 99.9%

   \[\left(\left(x \cdot \log y - y\right) - z\right) + \log t \]
2. Add Preprocessing

Alternative 3: 99.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\log y, x, -y\right) - z\\ t_2 := \left(\left(x \cdot \log y - y\right) - z\right) + \log t\\ \mathbf{if}\;t\_2 \leq -50000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 500000000000:\\ \;\;\;\;\mathsf{fma}\left(\log y, x, \log t\right) - y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (fma (log y) x (- y)) z))
        (t_2 (+ (- (- (* x (log y)) y) z) (log t))))
   (if (<= t_2 -50000000000.0)
     t_1
     (if (<= t_2 500000000000.0) (- (fma (log y) x (log t)) y) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(log(y), x, -y) - z;
	double t_2 = (((x * log(y)) - y) - z) + log(t);
	double tmp;
	if (t_2 <= -50000000000.0) {
		tmp = t_1;
	} else if (t_2 <= 500000000000.0) {
		tmp = fma(log(y), x, log(t)) - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(log(y), x, Float64(-y)) - z)
	t_2 = Float64(Float64(Float64(Float64(x * log(y)) - y) - z) + log(t))
	tmp = 0.0
	if (t_2 <= -50000000000.0)
		tmp = t_1;
	elseif (t_2 <= 500000000000.0)
		tmp = Float64(fma(log(y), x, log(t)) - y);
	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 + (-y)), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision] + N[Log[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -50000000000.0], t$95$1, If[LessEqual[t$95$2, 500000000000.0], N[(N[(N[Log[y], $MachinePrecision] * x + N[Log[t], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t)) < -5e10 or 5e11 < (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t))

   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 \left(\color{blue}{\left(-1 \cdot y + x \cdot \log y\right)} - z\right) + \log t \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. associate-+l- N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lift-log.f64 99.9

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

   6. Applied rewrites 99.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 99.6%

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

   if -5e10 < (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t)) < 5e11

   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 95.9

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

   4. Applied rewrites 95.9%

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

Alternative 4: 99.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 1.4e-6) (- (fma (log y) x (log t)) z) (- (fma (log y) x (- y)) z)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 1.4e-6) {
		tmp = fma(log(y), x, log(t)) - z;
	} else {
		tmp = fma(log(y), x, -y) - z;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 1.4e-6)
		tmp = Float64(fma(log(y), x, log(t)) - z);
	else
		tmp = Float64(fma(log(y), x, Float64(-y)) - z);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.39999999999999994e-6

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

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

   4. Applied rewrites 99.7%

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

   if 1.39999999999999994e-6 < y

   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 \left(\color{blue}{\left(-1 \cdot y + x \cdot \log y\right)} - z\right) + \log t \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. associate-+l- N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lift-log.f64 99.9

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

   6. Applied rewrites 99.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 98.5%

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

Alternative 5: 99.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\log y, x, -y\right) - z\\ t_2 := \left(\left(x \cdot \log y - y\right) - z\right) + \log t\\ \mathbf{if}\;t\_2 \leq -10000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 500000000000:\\ \;\;\;\;\mathsf{fma}\left(\log y, x, \log t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (fma (log y) x (- y)) z))
        (t_2 (+ (- (- (* x (log y)) y) z) (log t))))
   (if (<= t_2 -10000000.0)
     t_1
     (if (<= t_2 500000000000.0) (fma (log y) x (log t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(log(y), x, -y) - z;
	double t_2 = (((x * log(y)) - y) - z) + log(t);
	double tmp;
	if (t_2 <= -10000000.0) {
		tmp = t_1;
	} else if (t_2 <= 500000000000.0) {
		tmp = fma(log(y), x, log(t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(log(y), x, Float64(-y)) - z)
	t_2 = Float64(Float64(Float64(Float64(x * log(y)) - y) - z) + log(t))
	tmp = 0.0
	if (t_2 <= -10000000.0)
		tmp = t_1;
	elseif (t_2 <= 500000000000.0)
		tmp = fma(log(y), x, log(t));
	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 + (-y)), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision] + N[Log[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -10000000.0], t$95$1, If[LessEqual[t$95$2, 500000000000.0], N[(N[Log[y], $MachinePrecision] * x + N[Log[t], $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t)) < -1e7 or 5e11 < (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t))

   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 \left(\color{blue}{\left(-1 \cdot y + x \cdot \log y\right)} - z\right) + \log t \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. associate-+l- N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lift-log.f64 99.9

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

   6. Applied rewrites 99.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 99.5%

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

   if -1e7 < (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t)) < 5e11

   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 96.2

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

   4. Applied rewrites 96.2%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. lift-log.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. lift-fma.f64 92.8

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

   7. Applied rewrites 92.8%

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

Alternative 6: 98.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\log y, x, -y\right) - z\\ t_2 := \left(\left(x \cdot \log y - y\right) - z\right) + \log t\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 1000:\\ \;\;\;\;\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)) z))
        (t_2 (+ (- (- (* x (log y)) y) z) (log t))))
   (if (<= t_2 -5e+18) t_1 (if (<= t_2 1000.0) (- (- (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) - z;
	double t_2 = (((x * log(y)) - y) - z) + log(t);
	double tmp;
	if (t_2 <= -5e+18) {
		tmp = t_1;
	} else if (t_2 <= 1000.0) {
		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, Float64(-y)) - z)
	t_2 = Float64(Float64(Float64(Float64(x * log(y)) - y) - z) + log(t))
	tmp = 0.0
	if (t_2 <= -5e+18)
		tmp = t_1;
	elseif (t_2 <= 1000.0)
		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 + (-y)), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision] + N[Log[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+18], t$95$1, If[LessEqual[t$95$2, 1000.0], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t)) < -5e18 or 1e3 < (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t))

   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 \left(\color{blue}{\left(-1 \cdot y + x \cdot \log y\right)} - z\right) + \log t \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. associate-+l- N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lift-log.f64 99.9

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

   6. Applied rewrites 99.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 99.5%

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

   if -5e18 < (+.f64 (-.f64 (-.f64 (*.f64 x (log.f64 y)) y) z) (log.f64 t)) < 1e3

   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 95.9

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

   4. Applied rewrites 95.9%

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

Alternative 7: 89.5% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (log y) x)))
   (if (<= x -2.7e+104)
     (- t_1 z)
     (if (<= x 5.7e+79) (- (- (log t) y) z) (- t_1 y)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = log(y) * x;
	double tmp;
	if (x <= -2.7e+104) {
		tmp = t_1 - z;
	} else if (x <= 5.7e+79) {
		tmp = (log(t) - y) - z;
	} else {
		tmp = t_1 - 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) :: t_1
    real(8) :: tmp
    t_1 = log(y) * x
    if (x <= (-2.7d+104)) then
        tmp = t_1 - z
    else if (x <= 5.7d+79) then
        tmp = (log(t) - y) - z
    else
        tmp = t_1 - y
    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 <= -2.7e+104) {
		tmp = t_1 - z;
	} else if (x <= 5.7e+79) {
		tmp = (Math.log(t) - y) - z;
	} else {
		tmp = t_1 - y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = math.log(y) * x
	tmp = 0
	if x <= -2.7e+104:
		tmp = t_1 - z
	elif x <= 5.7e+79:
		tmp = (math.log(t) - y) - z
	else:
		tmp = t_1 - y
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(log(y) * x)
	tmp = 0.0
	if (x <= -2.7e+104)
		tmp = Float64(t_1 - z);
	elseif (x <= 5.7e+79)
		tmp = Float64(Float64(log(t) - y) - z);
	else
		tmp = Float64(t_1 - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = log(y) * x;
	tmp = 0.0;
	if (x <= -2.7e+104)
		tmp = t_1 - z;
	elseif (x <= 5.7e+79)
		tmp = (log(t) - y) - z;
	else
		tmp = t_1 - y;
	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, -2.7e+104], N[(t$95$1 - z), $MachinePrecision], If[LessEqual[x, 5.7e+79], N[(N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision] - z), $MachinePrecision], N[(t$95$1 - y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.69999999999999985e104

   1. Initial program 99.7%

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

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

   4. Applied rewrites 85.1%

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

   5. Taylor expanded in x around inf

      \[\leadsto x \cdot \log y - z \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-log.f64 85.1

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

   7. Applied rewrites 85.1%

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

   if -2.69999999999999985e104 < x < 5.6999999999999997e79

   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.2

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

   4. Applied rewrites 92.2%

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

   if 5.6999999999999997e79 < x

   1. Initial program 99.7%

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

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

   4. Applied rewrites 81.5%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-log.f64 81.5

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

   7. Applied rewrites 81.5%

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

Alternative 8: 89.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log y \cdot x - y\\ \mathbf{if}\;x \leq -1.32 \cdot 10^{+75}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 5.7 \cdot 10^{+79}:\\ \;\;\;\;\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) y)))
   (if (<= x -1.32e+75) t_1 (if (<= x 5.7e+79) (- (- (log t) y) z) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (log(y) * x) - y;
	double tmp;
	if (x <= -1.32e+75) {
		tmp = t_1;
	} else if (x <= 5.7e+79) {
		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) - y
    if (x <= (-1.32d+75)) then
        tmp = t_1
    else if (x <= 5.7d+79) 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) - y;
	double tmp;
	if (x <= -1.32e+75) {
		tmp = t_1;
	} else if (x <= 5.7e+79) {
		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) - y
	tmp = 0
	if x <= -1.32e+75:
		tmp = t_1
	elif x <= 5.7e+79:
		tmp = (math.log(t) - y) - z
	else:
		tmp = t_1
	return tmp

Julia

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

Derivation

1. Split input into 2 regimes

2. if x < -1.3200000000000001e75 or 5.6999999999999997e79 < x

   1. Initial program 99.7%

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

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

   4. Applied rewrites 83.2%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-log.f64 83.2

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

   7. Applied rewrites 83.2%

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

   if -1.3200000000000001e75 < x < 5.6999999999999997e79

   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 93.2

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

   4. Applied rewrites 93.2%

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

Alternative 9: 84.0% accurate, 1.2× speedup

Math

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

Derivation

1. Split input into 2 regimes

2. if x < -4.2000000000000002e105 or 1.39999999999999998e190 < 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 75.9

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

   4. Applied rewrites 75.9%

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

   if -4.2000000000000002e105 < x < 1.39999999999999998e190

   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 86.8

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

   4. Applied rewrites 86.8%

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

Alternative 10: 79.4% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* x (log y)) y)))
   (if (<= t_1 -10000000.0)
     (- (- y) z)
     (if (<= t_1 10.0) (- (log t) z) (* (log y) x)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * log(y)) - y;
	double tmp;
	if (t_1 <= -10000000.0) {
		tmp = -y - z;
	} else if (t_1 <= 10.0) {
		tmp = log(t) - z;
	} else {
		tmp = log(y) * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, 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 = (x * log(y)) - y
    if (t_1 <= (-10000000.0d0)) then
        tmp = -y - z
    else if (t_1 <= 10.0d0) then
        tmp = log(t) - z
    else
        tmp = log(y) * x
    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 tmp;
	if (t_1 <= -10000000.0) {
		tmp = -y - z;
	} else if (t_1 <= 10.0) {
		tmp = Math.log(t) - z;
	} else {
		tmp = Math.log(y) * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x * math.log(y)) - y
	tmp = 0
	if t_1 <= -10000000.0:
		tmp = -y - z
	elif t_1 <= 10.0:
		tmp = math.log(t) - z
	else:
		tmp = math.log(y) * x
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * log(y)) - y)
	tmp = 0.0
	if (t_1 <= -10000000.0)
		tmp = Float64(Float64(-y) - z);
	elseif (t_1 <= 10.0)
		tmp = Float64(log(t) - z);
	else
		tmp = Float64(log(y) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * log(y)) - y;
	tmp = 0.0;
	if (t_1 <= -10000000.0)
		tmp = -y - z;
	elseif (t_1 <= 10.0)
		tmp = log(t) - z;
	else
		tmp = log(y) * x;
	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]}, If[LessEqual[t$95$1, -10000000.0], N[((-y) - z), $MachinePrecision], If[LessEqual[t$95$1, 10.0], N[(N[Log[t], $MachinePrecision] - z), $MachinePrecision], N[(N[Log[y], $MachinePrecision] * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 x (log.f64 y)) y) < -1e7

   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 72.9

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

   4. Applied rewrites 72.9%

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

   5. Taylor expanded in y around inf

      \[\leadsto -1 \cdot y - z \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lift-neg.f64 72.7

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

   7. Applied rewrites 72.7%

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

   if -1e7 < (-.f64 (*.f64 x (log.f64 y)) y) < 10

   1. Initial program 100.0%

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

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

   4. Applied rewrites 97.9%

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

         \[\leadsto \log t - z \]

   7. Applied rewrites 96.6%

      \[\leadsto \log t - z \]

   if 10 < (-.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 74.9

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

   4. Applied rewrites 74.9%

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

Alternative 11: 70.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-y\right) - z\\ \mathbf{if}\;z \leq -7 \cdot 10^{-20}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 860:\\ \;\;\;\;\log t - y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (- y) z)))
   (if (<= z -7e-20) t_1 (if (<= z 860.0) (- (log t) y) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -y - z;
	double tmp;
	if (z <= -7e-20) {
		tmp = t_1;
	} else if (z <= 860.0) {
		tmp = log(t) - y;
	} 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 = -y - z
    if (z <= (-7d-20)) then
        tmp = t_1
    else if (z <= 860.0d0) then
        tmp = log(t) - y
    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 = -y - z;
	double tmp;
	if (z <= -7e-20) {
		tmp = t_1;
	} else if (z <= 860.0) {
		tmp = Math.log(t) - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = -y - z
	tmp = 0
	if z <= -7e-20:
		tmp = t_1
	elif z <= 860.0:
		tmp = math.log(t) - y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-y) - z)
	tmp = 0.0
	if (z <= -7e-20)
		tmp = t_1;
	elseif (z <= 860.0)
		tmp = Float64(log(t) - y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = -y - z;
	tmp = 0.0;
	if (z <= -7e-20)
		tmp = t_1;
	elseif (z <= 860.0)
		tmp = log(t) - y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[((-y) - z), $MachinePrecision]}, If[LessEqual[z, -7e-20], t$95$1, If[LessEqual[z, 860.0], N[(N[Log[t], $MachinePrecision] - y), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -7.00000000000000007e-20 or 860 < z

   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 77.1

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

   4. Applied rewrites 77.1%

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

   5. Taylor expanded in y around inf

      \[\leadsto -1 \cdot y - z \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lift-neg.f64 75.7

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

   7. Applied rewrites 75.7%

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

   if -7.00000000000000007e-20 < z < 860

   1. Initial program 99.8%

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

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

   4. Applied rewrites 99.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 63.6

         \[\leadsto \log t - y \]

   7. Applied rewrites 63.6%

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

Alternative 12: 69.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot \log y - y \leq -10000000:\\ \;\;\;\;\left(-y\right) - z\\ \mathbf{else}:\\ \;\;\;\;\log t - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (- (* x (log y)) y) -10000000.0) (- (- y) z) (- (log t) z)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x * log(y)) - y) <= -10000000.0) {
		tmp = -y - z;
	} else {
		tmp = log(t) - 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 (((x * log(y)) - y) <= (-10000000.0d0)) then
        tmp = -y - z
    else
        tmp = log(t) - z
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((x * math.log(y)) - y) <= -10000000.0:
		tmp = -y - z
	else:
		tmp = math.log(t) - z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(x * log(y)) - y) <= -10000000.0)
		tmp = Float64(Float64(-y) - z);
	else
		tmp = Float64(log(t) - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x * log(y)) - y) <= -10000000.0)
		tmp = -y - z;
	else
		tmp = log(t) - z;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x (log.f64 y)) y) < -1e7

   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 72.9

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

   4. Applied rewrites 72.9%

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

   5. Taylor expanded in y around inf

      \[\leadsto -1 \cdot y - z \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lift-neg.f64 72.7

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

   7. Applied rewrites 72.7%

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

   if -1e7 < (-.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. 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 98.3

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

   4. Applied rewrites 98.3%

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

         \[\leadsto \log t - z \]

   7. Applied rewrites 66.9%

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

Alternative 13: 57.5% accurate, 5.1× speedup

Math

\[\begin{array}{l} \\ \left(-y\right) - z \end{array} \]

FPCore

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

C

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

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 - z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[((-y) - z), $MachinePrecision]

Derivation

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.6

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

4. Applied rewrites 70.6%

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

5. Taylor expanded in y around inf

   \[\leadsto -1 \cdot y - z \]
6. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. lift-neg.f64 57.5

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

7. Applied rewrites 57.5%

   \[\leadsto \left(-y\right) - z \]
8. Add Preprocessing

Alternative 14: 46.9% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.1 \cdot 10^{+118}:\\ \;\;\;\;-z\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+76}:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -3.1e+118) (- z) (if (<= z 2.4e+76) (- y) (- z))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -3.1e+118:
		tmp = -z
	elif z <= 2.4e+76:
		tmp = -y
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -3.1e+118)
		tmp = Float64(-z);
	elseif (z <= 2.4e+76)
		tmp = Float64(-y);
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -3.1e+118)
		tmp = -z;
	elseif (z <= 2.4e+76)
		tmp = -y;
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -3.1e+118], (-z), If[LessEqual[z, 2.4e+76], (-y), (-z)]]

Derivation

1. Split input into 2 regimes

2. if z < -3.09999999999999986e118 or 2.4e76 < 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 66.7

         \[\leadsto -z \]

   4. Applied rewrites 66.7%

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

   if -3.09999999999999986e118 < z < 2.4e76

   1. Initial program 99.8%

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

         \[\leadsto -y \]

   4. Applied rewrites 36.6%

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

Alternative 15: 30.0% 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 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 30.0

      \[\leadsto -y \]

4. Applied rewrites 30.0%

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

Reproduce

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