Statistics.Distribution.Beta:$cdensity from math-functions-0.1.5.2

Percentage Accurate: 89.1% → 99.6%

Time: 19.6s

Alternatives: 15

Speedup: 1.9×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((x - 1.0d0) * log(y)) + ((z - 1.0d0) * log((1.0d0 - y)))) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 89.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((x - 1.0d0) * log(y)) + ((z - 1.0d0) * log((1.0d0 - y)))) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

3. Taylor expanded in y around 0

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

   1. lower-*.f64 N/A

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

   2. sub-neg N/A

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

   3. metadata-eval N/A

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

   4. lower-fma.f64 N/A

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

   5. sub-neg N/A

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

   6. metadata-eval N/A

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

   7. lower-fma.f64 N/A

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

   8. sub-neg N/A

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

   9. *-commutative N/A

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

   10. metadata-eval N/A

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

   11. lower-fma.f64 99.8

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

5. Applied rewrites 99.8%

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

6. Final simplification 99.8%

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

Alternative 2: 99.5% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

3. Taylor expanded in y around 0

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

   1. lower-*.f64 N/A

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

   2. sub-neg N/A

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

   3. metadata-eval N/A

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

   4. lower-fma.f64 N/A

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

   5. sub-neg N/A

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

   6. *-commutative N/A

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

   7. metadata-eval N/A

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

   8. lower-fma.f64 99.7

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

5. Applied rewrites 99.7%

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

6. Final simplification 99.7%

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

Alternative 3: 99.4% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. associate-*r* N/A

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

   3. *-commutative N/A

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

   4. lower-fma.f64 N/A

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

5. Applied rewrites 99.7%

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

6. Final simplification 99.7%

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

Alternative 4: 95.7% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma (log y) (+ x -1.0) y)))
   (if (<= t -9.5)
     (- t_1 t)
     (if (<= t 1.5e-15) (fma y (- z) t_1) (fma (log y) (+ x -1.0) (- t))))))

C

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

Julia

function code(x, y, z, t)
	t_1 = fma(log(y), Float64(x + -1.0), y)
	tmp = 0.0
	if (t <= -9.5)
		tmp = Float64(t_1 - t);
	elseif (t <= 1.5e-15)
		tmp = fma(y, Float64(-z), t_1);
	else
		tmp = fma(log(y), Float64(x + -1.0), Float64(-t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Log[y], $MachinePrecision] * N[(x + -1.0), $MachinePrecision] + y), $MachinePrecision]}, If[LessEqual[t, -9.5], N[(t$95$1 - t), $MachinePrecision], If[LessEqual[t, 1.5e-15], N[(y * (-z) + t$95$1), $MachinePrecision], N[(N[Log[y], $MachinePrecision] * N[(x + -1.0), $MachinePrecision] + (-t)), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if t < -9.5

   1. Initial program 96.7%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 99.8

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

   5. Applied rewrites 99.8%

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

   6. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. sub-neg N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 96.7

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

   8. Applied rewrites 96.7%

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

   if -9.5 < t < 1.5e-15

   1. Initial program 85.8%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 99.4

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

   5. Applied rewrites 99.4%

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

   6. Taylor expanded in t around 0

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-rgt-identity N/A

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

      5. mul-1-neg N/A

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

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

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

      7. mul-1-neg N/A

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

      8. associate-+r+ N/A

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

      9. +-commutative N/A

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

      10. associate-+l+ N/A

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

      11. +-commutative N/A

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

      12. mul-1-neg N/A

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

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

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

      14. mul-1-neg N/A

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

      15. lower-fma.f64 N/A

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

      16. mul-1-neg N/A

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

      17. lower-neg.f64 N/A

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

      18. +-commutative N/A

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

      19. lower-fma.f64 N/A

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

      20. lower-log.f64 N/A

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

      21. sub-neg N/A

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

      22. metadata-eval N/A

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

      23. lower-+.f64 99.4

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

   8. Applied rewrites 99.4%

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

   if 1.5e-15 < t

   1. Initial program 95.9%

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

   3. Taylor expanded in y around 0

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

      1. sub-neg N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-neg.f64 95.9

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

   5. Applied rewrites 95.9%

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

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -9.5:\\ \;\;\;\;\mathsf{fma}\left(\log y, x + -1, y\right) - t\\ \mathbf{elif}\;t \leq 1.5 \cdot 10^{-15}:\\ \;\;\;\;\mathsf{fma}\left(y, -z, \mathsf{fma}\left(\log y, x + -1, y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\log y, x + -1, -t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 87.1% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* x (log y)) t)))
   (if (<= (+ x -1.0) -20.0)
     t_1
     (if (<= (+ x -1.0) -1.0) (- (- t) (log y)) t_1))))

C

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

Fortran

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * log(y)) - t;
	tmp = 0.0;
	if ((x + -1.0) <= -20.0)
		tmp = t_1;
	elseif ((x + -1.0) <= -1.0)
		tmp = -t - log(y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]}, If[LessEqual[N[(x + -1.0), $MachinePrecision], -20.0], t$95$1, If[LessEqual[N[(x + -1.0), $MachinePrecision], -1.0], N[((-t) - N[Log[y], $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 x #s(literal 1 binary64)) < -20 or -1 < (-.f64 x #s(literal 1 binary64))

   1. Initial program 94.7%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 94.0

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

   5. Applied rewrites 94.0%

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

   if -20 < (-.f64 x #s(literal 1 binary64)) < -1

   1. Initial program 87.3%

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

   3. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. sub-neg N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. sub-neg N/A

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

      9. *-commutative N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around 0

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

      1. sub-neg N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-+.f64 N/A

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

      7. lower-neg.f64 86.7

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

   8. Applied rewrites 86.7%

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

   9. Taylor expanded in x around 0

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

       1. sub-neg N/A

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

       2. +-commutative N/A

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

       3. mul-1-neg N/A

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

       4. unsub-neg N/A

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

       5. lower--.f64 N/A

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

       6. lower-neg.f64 N/A

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

       7. lower-log.f64 86.3

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

   11. Applied rewrites 86.3%

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

4. Final simplification 90.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + -1 \leq -20:\\ \;\;\;\;x \cdot \log y - t\\ \mathbf{elif}\;x + -1 \leq -1:\\ \;\;\;\;\left(-t\right) - \log y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \log y - t\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 76.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \log y\\ \mathbf{if}\;x + -1 \leq -2 \cdot 10^{+24}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x + -1 \leq 10^{+19}:\\ \;\;\;\;\left(-t\right) - \log y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (log y))))
   (if (<= (+ x -1.0) -2e+24)
     t_1
     (if (<= (+ x -1.0) 1e+19) (- (- t) (log y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * log(y);
	double tmp;
	if ((x + -1.0) <= -2e+24) {
		tmp = t_1;
	} else if ((x + -1.0) <= 1e+19) {
		tmp = -t - log(y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    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)
    if ((x + (-1.0d0)) <= (-2d+24)) then
        tmp = t_1
    else if ((x + (-1.0d0)) <= 1d+19) then
        tmp = -t - log(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 = x * Math.log(y);
	double tmp;
	if ((x + -1.0) <= -2e+24) {
		tmp = t_1;
	} else if ((x + -1.0) <= 1e+19) {
		tmp = -t - Math.log(y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * log(y);
	tmp = 0.0;
	if ((x + -1.0) <= -2e+24)
		tmp = t_1;
	elseif ((x + -1.0) <= 1e+19)
		tmp = -t - log(y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 x #s(literal 1 binary64)) < -2e24 or 1e19 < (-.f64 x #s(literal 1 binary64))

   1. Initial program 98.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 75.8

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

   5. Applied rewrites 75.8%

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

   if -2e24 < (-.f64 x #s(literal 1 binary64)) < 1e19

   1. Initial program 84.6%

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

   3. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. sub-neg N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. sub-neg N/A

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

      9. *-commutative N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around 0

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

      1. sub-neg N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-+.f64 N/A

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

      7. lower-neg.f64 84.1

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

   8. Applied rewrites 84.1%

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

   9. Taylor expanded in x around 0

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

       1. sub-neg N/A

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

       2. +-commutative N/A

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

       3. mul-1-neg N/A

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

       4. unsub-neg N/A

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

       5. lower--.f64 N/A

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

       6. lower-neg.f64 N/A

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

       7. lower-log.f64 82.4

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

   11. Applied rewrites 82.4%

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

4. Final simplification 79.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + -1 \leq -2 \cdot 10^{+24}:\\ \;\;\;\;x \cdot \log y\\ \mathbf{elif}\;x + -1 \leq 10^{+19}:\\ \;\;\;\;\left(-t\right) - \log y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \log y\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 67.2% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (log y))))
   (if (<= (+ x -1.0) -2e+24)
     t_1
     (if (<= (+ x -1.0) 1e+19) (- (fma y (- z) y) t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * log(y);
	double tmp;
	if ((x + -1.0) <= -2e+24) {
		tmp = t_1;
	} else if ((x + -1.0) <= 1e+19) {
		tmp = fma(y, -z, y) - t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x * log(y))
	tmp = 0.0
	if (Float64(x + -1.0) <= -2e+24)
		tmp = t_1;
	elseif (Float64(x + -1.0) <= 1e+19)
		tmp = Float64(fma(y, Float64(-z), y) - t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 x #s(literal 1 binary64)) < -2e24 or 1e19 < (-.f64 x #s(literal 1 binary64))

   1. Initial program 98.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 75.8

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

   5. Applied rewrites 75.8%

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

   if -2e24 < (-.f64 x #s(literal 1 binary64)) < 1e19

   1. Initial program 84.6%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 63.3

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

   8. Applied rewrites 63.3%

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

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + -1 \leq -2 \cdot 10^{+24}:\\ \;\;\;\;x \cdot \log y\\ \mathbf{elif}\;x + -1 \leq 10^{+19}:\\ \;\;\;\;\mathsf{fma}\left(y, -z, y\right) - t\\ \mathbf{else}:\\ \;\;\;\;x \cdot \log y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 88.9% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ z -1.0) 5e+244)
   (- (fma (log y) (+ x -1.0) y) t)
   (- (fma y (- z) y) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z + -1.0) <= 5e+244) {
		tmp = fma(log(y), (x + -1.0), y) - t;
	} else {
		tmp = fma(y, -z, y) - t;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 z #s(literal 1 binary64)) < 5.00000000000000022e244

   1. Initial program 94.2%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. sub-neg N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 94.0

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

   8. Applied rewrites 94.0%

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

   if 5.00000000000000022e244 < (-.f64 z #s(literal 1 binary64))

   1. Initial program 28.1%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 88.3

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

   8. Applied rewrites 88.3%

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

4. Final simplification 93.8%

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

Alternative 9: 77.3% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (fma y z t))))
   (if (<= t -2.5e+52) t_1 (if (<= t 1.22e+58) (* (+ x -1.0) (log y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -fma(y, z, t);
	double tmp;
	if (t <= -2.5e+52) {
		tmp = t_1;
	} else if (t <= 1.22e+58) {
		tmp = (x + -1.0) * log(y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(-fma(y, z, t))
	tmp = 0.0
	if (t <= -2.5e+52)
		tmp = t_1;
	elseif (t <= 1.22e+58)
		tmp = Float64(Float64(x + -1.0) * log(y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.5e52 or 1.21999999999999995e58 < t

   1. Initial program 98.0%

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

   3. Taylor expanded in z around inf

      \[\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. sub-neg N/A

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

      4. lower-log1p.f64 N/A

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

      5. lower-neg.f64 79.9

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

   5. Applied rewrites 79.9%

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

   6. Taylor expanded in y around 0

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. distribute-neg-out N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-fma.f64 79.9

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

   8. Applied rewrites 79.9%

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

   if -2.5e52 < t < 1.21999999999999995e58

   1. Initial program 86.6%

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

   3. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. sub-neg N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. sub-neg N/A

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

      9. *-commutative N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 99.7

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in y around 0

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

      1. sub-neg N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-+.f64 N/A

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

      7. lower-neg.f64 86.1

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

   8. Applied rewrites 86.1%

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

   9. Taylor expanded in t around 0

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

       1. lower-*.f64 N/A

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

       2. lower-log.f64 N/A

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

       3. sub-neg N/A

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

       4. metadata-eval N/A

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

       5. lower-+.f64 82.2

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

   11. Applied rewrites 82.2%

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

4. Final simplification 81.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -2.5 \cdot 10^{+52}:\\ \;\;\;\;-\mathsf{fma}\left(y, z, t\right)\\ \mathbf{elif}\;t \leq 1.22 \cdot 10^{+58}:\\ \;\;\;\;\left(x + -1\right) \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;-\mathsf{fma}\left(y, z, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 88.8% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ z -1.0) 5e+244)
   (fma (log y) (+ x -1.0) (- t))
   (- (fma y (- z) y) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z + -1.0) <= 5e+244) {
		tmp = fma(log(y), (x + -1.0), -t);
	} else {
		tmp = fma(y, -z, y) - t;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 z #s(literal 1 binary64)) < 5.00000000000000022e244

   1. Initial program 94.2%

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

   3. Taylor expanded in y around 0

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

      1. sub-neg N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-neg.f64 93.9

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

   5. Applied rewrites 93.9%

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

   if 5.00000000000000022e244 < (-.f64 z #s(literal 1 binary64))

   1. Initial program 28.1%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. *-rgt-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 88.3

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

   8. Applied rewrites 88.3%

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

4. Final simplification 93.7%

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

Alternative 11: 99.1% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

   1. mul-1-neg N/A

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

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

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

   3. mul-1-neg N/A

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

   4. lower-fma.f64 N/A

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

   5. mul-1-neg N/A

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

   6. neg-sub0 N/A

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

   7. sub-neg N/A

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

   8. metadata-eval N/A

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

   9. +-commutative N/A

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

   10. associate--r+ N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. lower-*.f64 N/A

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

   14. lower-log.f64 N/A

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

   15. sub-neg N/A

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

   16. metadata-eval N/A

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

   17. +-commutative N/A

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

   18. lower-+.f64 99.6

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

5. Applied rewrites 99.6%

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

6. Final simplification 99.6%

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

Alternative 12: 42.1% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.8 \cdot 10^{+33}:\\ \;\;\;\;-t\\ \mathbf{elif}\;t \leq 2.5 \cdot 10^{+60}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;-t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -1.8e+33) (- t) (if (<= t 2.5e+60) (* y (- z)) (- t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.8e+33) {
		tmp = -t;
	} else if (t <= 2.5e+60) {
		tmp = y * -z;
	} else {
		tmp = -t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    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.8d+33)) then
        tmp = -t
    else if (t <= 2.5d+60) then
        tmp = y * -z
    else
        tmp = -t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.8e+33) {
		tmp = -t;
	} else if (t <= 2.5e+60) {
		tmp = y * -z;
	} else {
		tmp = -t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -1.8e+33:
		tmp = -t
	elif t <= 2.5e+60:
		tmp = y * -z
	else:
		tmp = -t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -1.8e+33)
		tmp = Float64(-t);
	elseif (t <= 2.5e+60)
		tmp = Float64(y * Float64(-z));
	else
		tmp = Float64(-t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -1.8e+33)
		tmp = -t;
	elseif (t <= 2.5e+60)
		tmp = y * -z;
	else
		tmp = -t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -1.8e+33], (-t), If[LessEqual[t, 2.5e+60], N[(y * (-z)), $MachinePrecision], (-t)]]

Derivation

1. Split input into 2 regimes

2. if t < -1.8000000000000001e33 or 2.49999999999999987e60 < t

   1. Initial program 99.0%

      \[\left(\left(x - 1\right) \cdot \log y + \left(z - 1\right) \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 76.9

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

   5. Applied rewrites 76.9%

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

   if -1.8000000000000001e33 < t < 2.49999999999999987e60

   1. Initial program 85.6%

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. neg-sub0 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-log.f64 N/A

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

      15. sub-neg N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 99.4

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

   5. Applied rewrites 99.4%

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

   6. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(y \cdot z\right)} \]

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

         \[\leadsto \color{blue}{y \cdot \left(\mathsf{neg}\left(z\right)\right)} \]

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto y \cdot \color{blue}{\left(\mathsf{neg}\left(z\right)\right)} \]

      6. lower-neg.f64 16.5

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

   8. Applied rewrites 16.5%

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

Alternative 13: 46.7% accurate, 18.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

   1. mul-1-neg N/A

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

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

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

   3. mul-1-neg N/A

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

   4. lower-fma.f64 N/A

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

   5. mul-1-neg N/A

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

   6. neg-sub0 N/A

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

   7. sub-neg N/A

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

   8. metadata-eval N/A

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

   9. +-commutative N/A

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

   10. associate--r+ N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. lower-*.f64 N/A

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

   14. lower-log.f64 N/A

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

   15. sub-neg N/A

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

   16. metadata-eval N/A

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

   17. +-commutative N/A

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

   18. lower-+.f64 99.6

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

5. Applied rewrites 99.6%

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

6. Taylor expanded in y around inf

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

   1. sub-neg N/A

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

   2. mul-1-neg N/A

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

   3. +-commutative N/A

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

   4. distribute-lft-in N/A

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

   5. *-rgt-identity N/A

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

   6. lower-fma.f64 N/A

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

   7. mul-1-neg N/A

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

   8. lower-neg.f64 44.0

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

8. Applied rewrites 44.0%

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

Alternative 14: 46.5% accurate, 25.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

3. Taylor expanded in z around inf

   \[\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. sub-neg N/A

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

   4. lower-log1p.f64 N/A

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

   5. lower-neg.f64 43.8

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

5. Applied rewrites 43.8%

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

6. Taylor expanded in y around 0

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

   1. sub-neg N/A

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

   2. mul-1-neg N/A

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

   3. distribute-neg-out N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-fma.f64 43.8

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

8. Applied rewrites 43.8%

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

Alternative 15: 36.0% accurate, 75.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

real(8) function code(x, y, z, t)
    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 91.4%

   \[\left(\left(x - 1\right) \cdot \log y + \left(z - 1\right) \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 35.5

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

5. Applied rewrites 35.5%

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

Reproduce

herbie shell --seed 2024219 
(FPCore (x y z t)
  :name "Statistics.Distribution.Beta:$cdensity from math-functions-0.1.5.2"
  :precision binary64
  (- (+ (* (- x 1.0) (log y)) (* (- z 1.0) (log (- 1.0 y)))) t))