Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, B

Percentage Accurate: 85.6% → 99.8%

Time: 13.5s

Alternatives: 13

Speedup: 1.9×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((x * log(y)) + (z * log((1.0 - y)))) - 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)) + (z * log((1.0d0 - y)))) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((x * log(y)) + (z * log((1.0 - y)))) - 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)) + (z * log((1.0d0 - y)))) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. +-commutative N/A

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

   4. associate--l+ N/A

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lift-log.f64 N/A

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

   9. lift--.f64 N/A

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

   10. *-rgt-identity N/A

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

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

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

   12. distribute-lft-neg-in N/A

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

   13. *-rgt-identity N/A

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

   14. lower-log1p.f64 N/A

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

   15. lower-neg.f64 N/A

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

   16. lower--.f64 99.9

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

   17. lift-*.f64 N/A

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

   18. *-commutative N/A

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

   19. lower-*.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 99.6% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-rgt-neg-in N/A

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

   5. log-rec N/A

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

   6. lower-fma.f64 N/A

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

   7. log-rec N/A

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

   8. distribute-rgt-neg-in N/A

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

   9. mul-1-neg N/A

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

   10. remove-double-neg N/A

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

   11. lower-log.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

5. Applied rewrites 99.6%

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

Alternative 3: 90.6% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -3.5e-74) (not (<= t 6e-110)))
   (fma (log y) x (- t))
   (fma (- z) y (* (log y) x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -3.5e-74) || !(t <= 6e-110)) {
		tmp = fma(log(y), x, -t);
	} else {
		tmp = fma(-z, y, (log(y) * x));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -3.5e-74) || !(t <= 6e-110))
		tmp = fma(log(y), x, Float64(-t));
	else
		tmp = fma(Float64(-z), y, Float64(log(y) * x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -3.50000000000000015e-74 or 5.99999999999999972e-110 < t

   1. Initial program 94.6%

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

   3. Taylor expanded in y around 0

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

      1. remove-double-neg N/A

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

      2. mul-1-neg N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. mul-1-neg N/A

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

      5. log-rec N/A

         \[\leadsto \left(\mathsf{neg}\left(x \cdot \color{blue}{\log \left(\frac{1}{y}\right)}\right)\right) - t \]

      6. mul-1-neg N/A

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

      7. *-rgt-identity N/A

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

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

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

      9. log-rec N/A

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

      10. mul-1-neg N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. mul-1-neg N/A

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

      14. log-rec N/A

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

      15. mul-1-neg N/A

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

      16. *-rgt-identity N/A

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

      17. lower-fma.f64 N/A

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

   5. Applied rewrites 94.5%

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

   if -3.50000000000000015e-74 < t < 5.99999999999999972e-110

   1. Initial program 73.1%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. distribute-rgt-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. log-rec N/A

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

      7. mul-1-neg N/A

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

      8. *-commutative N/A

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

      9. cancel-sign-sub N/A

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

      10. distribute-lft-neg-out N/A

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

      11. *-commutative N/A

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

      12. associate--l- N/A

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

      13. lower--.f64 N/A

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

   5. Applied rewrites 97.1%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 88.7%

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

4. Final simplification 92.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3.5 \cdot 10^{-74} \lor \neg \left(t \leq 6 \cdot 10^{-110}\right):\\ \;\;\;\;\mathsf{fma}\left(\log y, x, -t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, \log y \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.5% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-rgt-neg-in N/A

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

   5. log-rec N/A

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

   6. lower-fma.f64 N/A

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

   7. log-rec N/A

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

   8. distribute-rgt-neg-in N/A

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

   9. mul-1-neg N/A

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

   10. remove-double-neg N/A

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

   11. lower-log.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

   14. +-commutative N/A

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

   15. associate-*r* N/A

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

   16. distribute-rgt-out N/A

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

   17. lower-*.f64 N/A

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

   18. lower-fma.f64 99.4

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

5. Applied rewrites 99.4%

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

Alternative 5: 89.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{-26} \lor \neg \left(x \leq 3.1 \cdot 10^{-168}\right):\\ \;\;\;\;\mathsf{fma}\left(\log y, x, -t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot \mathsf{fma}\left(-0.3333333333333333, y, -0.5\right), y, -z\right) \cdot y - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -3.3e-26) (not (<= x 3.1e-168)))
   (fma (log y) x (- t))
   (- (* (fma (* z (fma -0.3333333333333333 y -0.5)) y (- z)) y) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -3.3e-26) || !(x <= 3.1e-168)) {
		tmp = fma(log(y), x, -t);
	} else {
		tmp = (fma((z * fma(-0.3333333333333333, y, -0.5)), y, -z) * y) - t;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -3.3e-26) || !(x <= 3.1e-168))
		tmp = fma(log(y), x, Float64(-t));
	else
		tmp = Float64(Float64(fma(Float64(z * fma(-0.3333333333333333, y, -0.5)), y, Float64(-z)) * y) - t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -3.3e-26], N[Not[LessEqual[x, 3.1e-168]], $MachinePrecision]], N[(N[Log[y], $MachinePrecision] * x + (-t)), $MachinePrecision], N[(N[(N[(N[(z * N[(-0.3333333333333333 * y + -0.5), $MachinePrecision]), $MachinePrecision] * y + (-z)), $MachinePrecision] * y), $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.2999999999999998e-26 or 3.1e-168 < x

   1. Initial program 95.2%

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

   3. Taylor expanded in y around 0

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

      1. remove-double-neg N/A

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

      2. mul-1-neg N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. mul-1-neg N/A

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

      5. log-rec N/A

         \[\leadsto \left(\mathsf{neg}\left(x \cdot \color{blue}{\log \left(\frac{1}{y}\right)}\right)\right) - t \]

      6. mul-1-neg N/A

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

      7. *-rgt-identity N/A

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

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

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

      9. log-rec N/A

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

      10. mul-1-neg N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. mul-1-neg N/A

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

      14. log-rec N/A

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

      15. mul-1-neg N/A

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

      16. *-rgt-identity N/A

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

      17. lower-fma.f64 N/A

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

   5. Applied rewrites 93.6%

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

   if -3.2999999999999998e-26 < x < 3.1e-168

   1. Initial program 75.8%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. lower--.f64 66.1

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

   5. Applied rewrites 66.1%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 89.7%

      \[\leadsto \mathsf{fma}\left(z \cdot \mathsf{fma}\left(-0.3333333333333333, y, -0.5\right), y, -z\right) \cdot \color{blue}{y} - t \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{-26} \lor \neg \left(x \leq 3.1 \cdot 10^{-168}\right):\\ \;\;\;\;\mathsf{fma}\left(\log y, x, -t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot \mathsf{fma}\left(-0.3333333333333333, y, -0.5\right), y, -z\right) \cdot y - t\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 99.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-rgt-neg-in N/A

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

   5. mul-1-neg N/A

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

   6. log-rec N/A

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

   7. mul-1-neg N/A

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

   8. *-commutative N/A

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

   9. cancel-sign-sub N/A

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

   10. distribute-lft-neg-out N/A

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

   11. *-commutative N/A

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

   12. associate--l- N/A

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

   13. lower--.f64 N/A

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

5. Applied rewrites 99.0%

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

Alternative 7: 57.8% accurate, 5.6× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\left(z \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.25, y, -0.3333333333333333\right), y, -0.5\right)\right) \cdot y, y, \left(-y\right) \cdot z\right) - t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (-
  (fma
   (* (* z (fma (fma -0.25 y -0.3333333333333333) y -0.5)) y)
   y
   (* (- y) z))
  t))

C

double code(double x, double y, double z, double t) {
	return fma(((z * fma(fma(-0.25, y, -0.3333333333333333), y, -0.5)) * y), y, (-y * z)) - t;
}

Julia

function code(x, y, z, t)
	return Float64(fma(Float64(Float64(z * fma(fma(-0.25, y, -0.3333333333333333), y, -0.5)) * y), y, Float64(Float64(-y) * z)) - t)
end

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-log.f64 N/A

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

   4. lower--.f64 48.4

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

5. Applied rewrites 48.4%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 59.7%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z \cdot \mathsf{fma}\left(-0.25, y, -0.3333333333333333\right), y, -0.5 \cdot z\right), y, -z\right) \cdot \color{blue}{y} - t \]
9. Step-by-step derivation

10. Applied rewrites 59.7%

    \[\leadsto \mathsf{fma}\left(\left(z \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.25, y, -0.3333333333333333\right), y, -0.5\right)\right) \cdot y, y, \left(-y\right) \cdot z\right) - t \]
11. Add Preprocessing

Alternative 8: 57.8% accurate, 6.5× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.25, y, -0.3333333333333333\right), y, -0.5\right), y, -z\right) \cdot y - t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (-
  (* (fma (* z (fma (fma -0.25 y -0.3333333333333333) y -0.5)) y (- z)) y)
  t))

C

double code(double x, double y, double z, double t) {
	return (fma((z * fma(fma(-0.25, y, -0.3333333333333333), y, -0.5)), y, -z) * y) - t;
}

Julia

function code(x, y, z, t)
	return Float64(Float64(fma(Float64(z * fma(fma(-0.25, y, -0.3333333333333333), y, -0.5)), y, Float64(-z)) * y) - t)
end

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-log.f64 N/A

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

   4. lower--.f64 48.4

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

5. Applied rewrites 48.4%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 59.7%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z \cdot \mathsf{fma}\left(-0.25, y, -0.3333333333333333\right), y, -0.5 \cdot z\right), y, -z\right) \cdot \color{blue}{y} - t \]
9. Step-by-step derivation

10. Applied rewrites 59.7%

    \[\leadsto \mathsf{fma}\left(z \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.25, y, -0.3333333333333333\right), y, -0.5\right), y, -z\right) \cdot y - t \]
11. Add Preprocessing

Alternative 9: 57.8% accurate, 7.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (- (* (fma (* z (fma -0.3333333333333333 y -0.5)) y (- z)) y) t))

C

double code(double x, double y, double z, double t) {
	return (fma((z * fma(-0.3333333333333333, y, -0.5)), y, -z) * y) - t;
}

Julia

function code(x, y, z, t)
	return Float64(Float64(fma(Float64(z * fma(-0.3333333333333333, y, -0.5)), y, Float64(-z)) * y) - t)
end

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-log.f64 N/A

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

   4. lower--.f64 48.4

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

5. Applied rewrites 48.4%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 59.7%

   \[\leadsto \mathsf{fma}\left(z \cdot \mathsf{fma}\left(-0.3333333333333333, y, -0.5\right), y, -z\right) \cdot \color{blue}{y} - t \]
9. Add Preprocessing

Alternative 10: 49.1% accurate, 11.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.35 \cdot 10^{-68} \lor \neg \left(t \leq 6 \cdot 10^{-110}\right):\\ \;\;\;\;-t\\ \mathbf{else}:\\ \;\;\;\;-z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -1.35e-68) (not (<= t 6e-110))) (- t) (- (* z y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -1.35e-68) || !(t <= 6e-110)) {
		tmp = -t;
	} else {
		tmp = -(z * 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 ((t <= (-1.35d-68)) .or. (.not. (t <= 6d-110))) then
        tmp = -t
    else
        tmp = -(z * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -1.35e-68) || !(t <= 6e-110)) {
		tmp = -t;
	} else {
		tmp = -(z * y);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -1.35e-68) or not (t <= 6e-110):
		tmp = -t
	else:
		tmp = -(z * y)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -1.35e-68) || !(t <= 6e-110))
		tmp = Float64(-t);
	else
		tmp = Float64(-Float64(z * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -1.35e-68) || ~((t <= 6e-110)))
		tmp = -t;
	else
		tmp = -(z * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -1.35e-68], N[Not[LessEqual[t, 6e-110]], $MachinePrecision]], (-t), (-N[(z * y), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if t < -1.3500000000000001e-68 or 5.99999999999999972e-110 < t

   1. Initial program 94.6%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(t\right)} \]

      2. lower-neg.f64 63.8

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

   5. Applied rewrites 63.8%

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

   if -1.3500000000000001e-68 < t < 5.99999999999999972e-110

   1. Initial program 73.5%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. distribute-rgt-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. log-rec N/A

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

      7. mul-1-neg N/A

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

      8. *-commutative N/A

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

      9. cancel-sign-sub N/A

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

      10. distribute-lft-neg-out N/A

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

      11. *-commutative N/A

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

      12. associate--l- N/A

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

      13. lower--.f64 N/A

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

   5. Applied rewrites 97.1%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 37.1%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 30.0%

       \[\leadsto -z \cdot y \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.35 \cdot 10^{-68} \lor \neg \left(t \leq 6 \cdot 10^{-110}\right):\\ \;\;\;\;-t\\ \mathbf{else}:\\ \;\;\;\;-z \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 57.7% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* (* z y) (fma -0.5 y -1.0)) t))

C

double code(double x, double y, double z, double t) {
	return ((z * y) * fma(-0.5, y, -1.0)) - t;
}

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(z * y) * fma(-0.5, y, -1.0)) - t)
end

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-rgt-neg-in N/A

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

   5. log-rec N/A

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

   6. lower-fma.f64 N/A

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

   7. log-rec N/A

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

   8. distribute-rgt-neg-in N/A

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

   9. mul-1-neg N/A

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

   10. remove-double-neg N/A

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

   11. lower-log.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

   14. +-commutative N/A

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

   15. associate-*r* N/A

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

   16. distribute-rgt-out N/A

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

   17. lower-*.f64 N/A

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

   18. lower-fma.f64 99.4

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

5. Applied rewrites 99.4%

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

6. Taylor expanded in x around 0

   \[\leadsto y \cdot \color{blue}{\left(z \cdot \left(\frac{-1}{2} \cdot y - 1\right)\right)} - t \]
7. Step-by-step derivation

8. Applied rewrites 59.5%

   \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{\mathsf{fma}\left(-0.5, y, -1\right)} - t \]
9. Add Preprocessing

Alternative 12: 57.3% accurate, 24.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. remove-double-neg N/A

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

   3. mul-1-neg N/A

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

   4. distribute-rgt-neg-in N/A

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

   5. mul-1-neg N/A

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

   6. log-rec N/A

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

   7. mul-1-neg N/A

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

   8. *-commutative N/A

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

   9. cancel-sign-sub N/A

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

   10. distribute-lft-neg-out N/A

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

   11. *-commutative N/A

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

   12. associate--l- N/A

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

   13. lower--.f64 N/A

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

5. Applied rewrites 99.0%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 59.1%

   \[\leadsto -\mathsf{fma}\left(z, y, t\right) \]
9. Add Preprocessing

Alternative 13: 43.2% accurate, 73.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return -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 = -t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.0%

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

3. Taylor expanded in t around inf

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(t\right)} \]

   2. lower-neg.f64 47.1

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

5. Applied rewrites 47.1%

   \[\leadsto \color{blue}{-t} \]
6. Add Preprocessing

Developer Target 1: 99.6% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (-
  (*
   (- z)
   (+
    (+ (* 0.5 (* y y)) y)
    (* (/ 0.3333333333333333 (* 1.0 (* 1.0 1.0))) (* y (* y y)))))
  (- t (* x (log y)))))

C

double code(double x, double y, double z, double t) {
	return (-z * (((0.5 * (y * y)) + y) + ((0.3333333333333333 / (1.0 * (1.0 * 1.0))) * (y * (y * y))))) - (t - (x * log(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 = (-z * (((0.5d0 * (y * y)) + y) + ((0.3333333333333333d0 / (1.0d0 * (1.0d0 * 1.0d0))) * (y * (y * y))))) - (t - (x * log(y)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024359 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, B"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* (- z) (+ (+ (* 1/2 (* y y)) y) (* (/ 1/3 (* 1 (* 1 1))) (* y (* y y))))) (- t (* x (log y)))))

  (- (+ (* x (log y)) (* z (log (- 1.0 y)))) t))