Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2

Percentage Accurate: 99.6% → 99.6%

Time: 21.1s

Alternatives: 16

Speedup: 0.8×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate-+l- 99.6%

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

   2. associate--l+ 99.7%

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

   3. sub-neg 99.7%

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

   4. +-commutative 99.7%

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

   5. *-commutative 99.7%

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

   6. distribute-rgt-neg-in 99.7%

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

   7. fma-udef 99.7%

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

   8. sub-neg 99.7%

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

   9. +-commutative 99.7%

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

   10. distribute-neg-in 99.7%

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

   11. metadata-eval 99.7%

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

   12. metadata-eval 99.7%

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

   13. unsub-neg 99.7%

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

3. Simplified 99.7%

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

5. Final simplification 99.7%

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

Alternative 2: 93.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log \left(x + y\right) + \log z\\ \mathbf{if}\;t_1 \leq -750 \lor \neg \left(t_1 \leq 680\right):\\ \;\;\;\;\log t \cdot a - t\\ \mathbf{else}:\\ \;\;\;\;\left(\log \left(\left(x + y\right) \cdot z\right) + \log t \cdot \left(a - 0.5\right)\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (log (+ x y)) (log z))))
   (if (or (<= t_1 -750.0) (not (<= t_1 680.0)))
     (- (* (log t) a) t)
     (- (+ (log (* (+ x y) z)) (* (log t) (- a 0.5))) t))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log((x + y)) + log(z);
	double tmp;
	if ((t_1 <= -750.0) || !(t_1 <= 680.0)) {
		tmp = (log(t) * a) - t;
	} else {
		tmp = (log(((x + y) * z)) + (log(t) * (a - 0.5))) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = log((x + y)) + log(z)
    if ((t_1 <= (-750.0d0)) .or. (.not. (t_1 <= 680.0d0))) then
        tmp = (log(t) * a) - t
    else
        tmp = (log(((x + y) * z)) + (log(t) * (a - 0.5d0))) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = Math.log((x + y)) + Math.log(z);
	double tmp;
	if ((t_1 <= -750.0) || !(t_1 <= 680.0)) {
		tmp = (Math.log(t) * a) - t;
	} else {
		tmp = (Math.log(((x + y) * z)) + (Math.log(t) * (a - 0.5))) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = math.log((x + y)) + math.log(z)
	tmp = 0
	if (t_1 <= -750.0) or not (t_1 <= 680.0):
		tmp = (math.log(t) * a) - t
	else:
		tmp = (math.log(((x + y) * z)) + (math.log(t) * (a - 0.5))) - t
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(Float64(x + y)) + log(z))
	tmp = 0.0
	if ((t_1 <= -750.0) || !(t_1 <= 680.0))
		tmp = Float64(Float64(log(t) * a) - t);
	else
		tmp = Float64(Float64(log(Float64(Float64(x + y) * z)) + Float64(log(t) * Float64(a - 0.5))) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log((x + y)) + log(z);
	tmp = 0.0;
	if ((t_1 <= -750.0) || ~((t_1 <= 680.0)))
		tmp = (log(t) * a) - t;
	else
		tmp = (log(((x + y) * z)) + (log(t) * (a - 0.5))) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -750.0], N[Not[LessEqual[t$95$1, 680.0]], $MachinePrecision]], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision], N[(N[(N[Log[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] + N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < -750 or 680 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z))

   1. Initial program 99.6%

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

      1. associate--l+ 99.6%

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

      2. sub-neg 99.6%

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

      3. metadata-eval 99.6%

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

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 68.7%

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

   6. Taylor expanded in a around inf 75.0%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 75.0%

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

   8. Simplified 75.0%

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

   if -750 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 680

   1. Initial program 99.6%

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

      1. associate-+l- 99.6%

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

      2. associate--l+ 99.6%

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

      3. sub-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. *-commutative 99.6%

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

      6. distribute-rgt-neg-in 99.6%

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

      7. fma-udef 99.6%

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

      8. sub-neg 99.6%

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

      9. +-commutative 99.6%

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

      10. distribute-neg-in 99.6%

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

      11. metadata-eval 99.6%

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

      12. metadata-eval 99.6%

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

      13. unsub-neg 99.6%

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

   3. Simplified 99.6%

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

      1. associate-+r- 99.6%

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

      2. fma-udef 99.6%

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

      3. associate--r+ 99.6%

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

      4. +-commutative 99.6%

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

      5. sum-log 99.6%

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

   6. Applied egg-rr 99.6%

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

4. Final simplification 93.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\log \left(x + y\right) + \log z \leq -750 \lor \neg \left(\log \left(x + y\right) + \log z \leq 680\right):\\ \;\;\;\;\log t \cdot a - t\\ \mathbf{else}:\\ \;\;\;\;\left(\log \left(\left(x + y\right) \cdot z\right) + \log t \cdot \left(a - 0.5\right)\right) - t\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 68.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log \left(x + y\right) + \log z\\ \mathbf{if}\;t_1 \leq -750 \lor \neg \left(t_1 \leq 680\right):\\ \;\;\;\;\log t \cdot a - t\\ \mathbf{else}:\\ \;\;\;\;\log \left(y \cdot z\right) + \left(\log t \cdot \left(a - 0.5\right) - t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (log (+ x y)) (log z))))
   (if (or (<= t_1 -750.0) (not (<= t_1 680.0)))
     (- (* (log t) a) t)
     (+ (log (* y z)) (- (* (log t) (- a 0.5)) t)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log((x + y)) + log(z);
	double tmp;
	if ((t_1 <= -750.0) || !(t_1 <= 680.0)) {
		tmp = (log(t) * a) - t;
	} else {
		tmp = log((y * z)) + ((log(t) * (a - 0.5)) - t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = log((x + y)) + log(z)
    if ((t_1 <= (-750.0d0)) .or. (.not. (t_1 <= 680.0d0))) then
        tmp = (log(t) * a) - t
    else
        tmp = log((y * z)) + ((log(t) * (a - 0.5d0)) - t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = Math.log((x + y)) + Math.log(z);
	double tmp;
	if ((t_1 <= -750.0) || !(t_1 <= 680.0)) {
		tmp = (Math.log(t) * a) - t;
	} else {
		tmp = Math.log((y * z)) + ((Math.log(t) * (a - 0.5)) - t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = math.log((x + y)) + math.log(z)
	tmp = 0
	if (t_1 <= -750.0) or not (t_1 <= 680.0):
		tmp = (math.log(t) * a) - t
	else:
		tmp = math.log((y * z)) + ((math.log(t) * (a - 0.5)) - t)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(Float64(x + y)) + log(z))
	tmp = 0.0
	if ((t_1 <= -750.0) || !(t_1 <= 680.0))
		tmp = Float64(Float64(log(t) * a) - t);
	else
		tmp = Float64(log(Float64(y * z)) + Float64(Float64(log(t) * Float64(a - 0.5)) - t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log((x + y)) + log(z);
	tmp = 0.0;
	if ((t_1 <= -750.0) || ~((t_1 <= 680.0)))
		tmp = (log(t) * a) - t;
	else
		tmp = log((y * z)) + ((log(t) * (a - 0.5)) - t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -750.0], N[Not[LessEqual[t$95$1, 680.0]], $MachinePrecision]], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision], N[(N[Log[N[(y * z), $MachinePrecision]], $MachinePrecision] + N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < -750 or 680 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z))

   1. Initial program 99.6%

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

      1. associate--l+ 99.6%

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

      2. sub-neg 99.6%

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

      3. metadata-eval 99.6%

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

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 68.7%

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

   6. Taylor expanded in a around inf 75.0%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 75.0%

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

   8. Simplified 75.0%

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

   if -750 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 680

   1. Initial program 99.6%

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

      1. associate-+l- 99.6%

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

      2. associate--l+ 99.6%

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

      3. sub-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. *-commutative 99.6%

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

      6. distribute-rgt-neg-in 99.6%

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

      7. fma-udef 99.6%

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

      8. sub-neg 99.6%

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

      9. +-commutative 99.6%

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

      10. distribute-neg-in 99.6%

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

      11. metadata-eval 99.6%

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

      12. metadata-eval 99.6%

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

      13. unsub-neg 99.6%

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

   3. Simplified 99.6%

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

      1. associate-+r- 99.6%

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

      2. fma-udef 99.6%

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

      3. associate--r+ 99.6%

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

      4. +-commutative 99.6%

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

      5. sum-log 99.6%

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

   6. Applied egg-rr 99.6%

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

   7. Taylor expanded in x around 0 64.3%

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

4. Final simplification 66.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\log \left(x + y\right) + \log z \leq -750 \lor \neg \left(\log \left(x + y\right) + \log z \leq 680\right):\\ \;\;\;\;\log t \cdot a - t\\ \mathbf{else}:\\ \;\;\;\;\log \left(y \cdot z\right) + \left(\log t \cdot \left(a - 0.5\right) - t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t 0.0073)
   (+ (log z) (+ (log (+ x y)) (* (log t) (- a 0.5))))
   (- (* (log t) a) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 0.0073) {
		tmp = log(z) + (log((x + y)) + (log(t) * (a - 0.5)));
	} else {
		tmp = (log(t) * a) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= 0.0073d0) then
        tmp = log(z) + (log((x + y)) + (log(t) * (a - 0.5d0)))
    else
        tmp = (log(t) * a) - t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 0.00730000000000000007

   1. Initial program 99.3%

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

      1. associate--l+ 99.3%

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

      2. sub-neg 99.3%

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

      3. metadata-eval 99.3%

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

   3. Simplified 99.3%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 98.3%

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

   if 0.00730000000000000007 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in a around inf 98.3%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

      \[\leadsto \color{blue}{\log t \cdot a} - t \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

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

Alternative 5: 98.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t 0.0073)
   (+ (log (+ x y)) (+ (log z) (* (log t) (- a 0.5))))
   (- (* (log t) a) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 0.0073) {
		tmp = log((x + y)) + (log(z) + (log(t) * (a - 0.5)));
	} else {
		tmp = (log(t) * a) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= 0.0073d0) then
        tmp = log((x + y)) + (log(z) + (log(t) * (a - 0.5d0)))
    else
        tmp = (log(t) * a) - t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 0.00730000000000000007

   1. Initial program 99.3%

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

      1. associate-+l- 99.4%

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-udef 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around 0 98.4%

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

   if 0.00730000000000000007 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in a around inf 98.3%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

      \[\leadsto \color{blue}{\log t \cdot a} - t \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.4%

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

Alternative 6: 81.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t 0.0073)
   (+ (log y) (+ (log z) (* (log t) (- a 0.5))))
   (- (* (log t) a) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 0.0073) {
		tmp = log(y) + (log(z) + (log(t) * (a - 0.5)));
	} else {
		tmp = (log(t) * a) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= 0.0073d0) then
        tmp = log(y) + (log(z) + (log(t) * (a - 0.5d0)))
    else
        tmp = (log(t) * a) - t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, 0.0073], N[(N[Log[y], $MachinePrecision] + N[(N[Log[z], $MachinePrecision] + N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 0.00730000000000000007

   1. Initial program 99.3%

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

      1. associate--l+ 99.3%

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

      2. sub-neg 99.3%

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

      3. metadata-eval 99.3%

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

   3. Simplified 99.3%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 64.9%

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

   6. Taylor expanded in t around 0 64.2%

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

   if 0.00730000000000000007 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in a around inf 98.3%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

      \[\leadsto \color{blue}{\log t \cdot a} - t \]
3. Recombined 2 regimes into one program.

4. Final simplification 81.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 0.0073:\\ \;\;\;\;\log y + \left(\log z + \log t \cdot \left(a - 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot a - t\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate--l+ 99.6%

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

   2. sub-neg 99.6%

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

   3. metadata-eval 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
4. Add Preprocessing

5. Final simplification 99.6%

   \[\leadsto \left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \log t \cdot \left(a + -0.5\right) \]
6. Add Preprocessing

Alternative 8: 69.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate--l+ 99.6%

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

   2. sub-neg 99.6%

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

   3. metadata-eval 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 68.1%

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

6. Final simplification 68.1%

   \[\leadsto \left(\log y + \left(\log z + \log t \cdot \left(a - 0.5\right)\right)\right) - t \]
7. Add Preprocessing

Alternative 9: 73.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log t \cdot \left(a - 0.5\right)\\ t_2 := \log \left(y \cdot z\right) + t_1\\ \mathbf{if}\;t \leq 1.5 \cdot 10^{-110}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq 1.9 \cdot 10^{-69}:\\ \;\;\;\;\log y + t_1\\ \mathbf{elif}\;t \leq 0.0013:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot a - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (log t) (- a 0.5))) (t_2 (+ (log (* y z)) t_1)))
   (if (<= t 1.5e-110)
     t_2
     (if (<= t 1.9e-69)
       (+ (log y) t_1)
       (if (<= t 0.0013) t_2 (- (* (log t) a) t))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log(t) * (a - 0.5);
	double t_2 = log((y * z)) + t_1;
	double tmp;
	if (t <= 1.5e-110) {
		tmp = t_2;
	} else if (t <= 1.9e-69) {
		tmp = log(y) + t_1;
	} else if (t <= 0.0013) {
		tmp = t_2;
	} else {
		tmp = (log(t) * a) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = log(t) * (a - 0.5d0)
    t_2 = log((y * z)) + t_1
    if (t <= 1.5d-110) then
        tmp = t_2
    else if (t <= 1.9d-69) then
        tmp = log(y) + t_1
    else if (t <= 0.0013d0) then
        tmp = t_2
    else
        tmp = (log(t) * a) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = Math.log(t) * (a - 0.5);
	double t_2 = Math.log((y * z)) + t_1;
	double tmp;
	if (t <= 1.5e-110) {
		tmp = t_2;
	} else if (t <= 1.9e-69) {
		tmp = Math.log(y) + t_1;
	} else if (t <= 0.0013) {
		tmp = t_2;
	} else {
		tmp = (Math.log(t) * a) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = math.log(t) * (a - 0.5)
	t_2 = math.log((y * z)) + t_1
	tmp = 0
	if t <= 1.5e-110:
		tmp = t_2
	elif t <= 1.9e-69:
		tmp = math.log(y) + t_1
	elif t <= 0.0013:
		tmp = t_2
	else:
		tmp = (math.log(t) * a) - t
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(t) * Float64(a - 0.5))
	t_2 = Float64(log(Float64(y * z)) + t_1)
	tmp = 0.0
	if (t <= 1.5e-110)
		tmp = t_2;
	elseif (t <= 1.9e-69)
		tmp = Float64(log(y) + t_1);
	elseif (t <= 0.0013)
		tmp = t_2;
	else
		tmp = Float64(Float64(log(t) * a) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log(t) * (a - 0.5);
	t_2 = log((y * z)) + t_1;
	tmp = 0.0;
	if (t <= 1.5e-110)
		tmp = t_2;
	elseif (t <= 1.9e-69)
		tmp = log(y) + t_1;
	elseif (t <= 0.0013)
		tmp = t_2;
	else
		tmp = (log(t) * a) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Log[N[(y * z), $MachinePrecision]], $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[t, 1.5e-110], t$95$2, If[LessEqual[t, 1.9e-69], N[(N[Log[y], $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[t, 0.0013], t$95$2, N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if t < 1.49999999999999993e-110 or 1.8999999999999999e-69 < t < 0.0012999999999999999

   1. Initial program 99.3%

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

      1. associate-+l- 99.3%

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-udef 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

      1. associate-+r- 99.3%

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

      2. fma-udef 99.3%

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

      3. associate--r+ 99.3%

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

      4. +-commutative 99.3%

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

      5. sum-log 76.8%

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

   6. Applied egg-rr 76.8%

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

   7. Taylor expanded in x around 0 49.3%

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

   8. Taylor expanded in t around 0 48.4%

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

   if 1.49999999999999993e-110 < t < 1.8999999999999999e-69

   1. Initial program 99.8%

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

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

      1. add-cube-cbrt 99.8%

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

      2. pow3 99.8%

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in t around inf 88.6%

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

      1. +-commutative 88.6%

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

      2. mul-1-neg 88.6%

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

      3. unsub-neg 88.6%

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

      4. log-rec 88.6%

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

      5. sub-neg 88.6%

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

      6. metadata-eval 88.6%

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

      7. distribute-lft-neg-in 88.6%

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

      8. distribute-rgt-neg-in 88.6%

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

   9. Simplified 88.6%

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

   10. Taylor expanded in x around 0 58.9%

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

   if 0.0012999999999999999 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in a around inf 98.3%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

      \[\leadsto \color{blue}{\log t \cdot a} - t \]
3. Recombined 3 regimes into one program.

4. Final simplification 74.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.5 \cdot 10^{-110}:\\ \;\;\;\;\log \left(y \cdot z\right) + \log t \cdot \left(a - 0.5\right)\\ \mathbf{elif}\;t \leq 1.9 \cdot 10^{-69}:\\ \;\;\;\;\log y + \log t \cdot \left(a - 0.5\right)\\ \mathbf{elif}\;t \leq 0.0013:\\ \;\;\;\;\log \left(y \cdot z\right) + \log t \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot a - t\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 73.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -122000000000 \lor \neg \left(a \leq 7.8 \cdot 10^{-24}\right):\\ \;\;\;\;\log t \cdot a - t\\ \mathbf{else}:\\ \;\;\;\;\log \left(y \cdot z\right) - \left(t + \log t \cdot 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -122000000000.0) (not (<= a 7.8e-24)))
   (- (* (log t) a) t)
   (- (log (* y z)) (+ t (* (log t) 0.5)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -122000000000.0) || !(a <= 7.8e-24)) {
		tmp = (log(t) * a) - t;
	} else {
		tmp = log((y * z)) - (t + (log(t) * 0.5));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-122000000000.0d0)) .or. (.not. (a <= 7.8d-24))) then
        tmp = (log(t) * a) - t
    else
        tmp = log((y * z)) - (t + (log(t) * 0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -122000000000.0) || !(a <= 7.8e-24)) {
		tmp = (Math.log(t) * a) - t;
	} else {
		tmp = Math.log((y * z)) - (t + (Math.log(t) * 0.5));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -122000000000.0) or not (a <= 7.8e-24):
		tmp = (math.log(t) * a) - t
	else:
		tmp = math.log((y * z)) - (t + (math.log(t) * 0.5))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -122000000000.0) || !(a <= 7.8e-24))
		tmp = Float64(Float64(log(t) * a) - t);
	else
		tmp = Float64(log(Float64(y * z)) - Float64(t + Float64(log(t) * 0.5)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -122000000000.0) || ~((a <= 7.8e-24)))
		tmp = (log(t) * a) - t;
	else
		tmp = log((y * z)) - (t + (log(t) * 0.5));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -122000000000.0], N[Not[LessEqual[a, 7.8e-24]], $MachinePrecision]], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision], N[(N[Log[N[(y * z), $MachinePrecision]], $MachinePrecision] - N[(t + N[(N[Log[t], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.22e11 or 7.8e-24 < a

   1. Initial program 99.7%

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

      1. associate--l+ 99.7%

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

      2. sub-neg 99.7%

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

      3. metadata-eval 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 74.4%

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

   6. Taylor expanded in a around inf 97.7%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 97.7%

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

   8. Simplified 97.7%

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

   if -1.22e11 < a < 7.8e-24

   1. Initial program 99.6%

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

      1. associate-+l- 99.6%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-udef 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

      1. associate-+r- 99.6%

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

      2. fma-udef 99.6%

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

      3. associate--r+ 99.6%

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

      4. +-commutative 99.6%

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

      5. sum-log 80.0%

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

   6. Applied egg-rr 80.0%

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

   7. Taylor expanded in x around 0 48.6%

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

   8. Taylor expanded in a around 0 48.1%

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

      1. *-commutative 48.1%

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

   10. Simplified 48.1%

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

4. Final simplification 74.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -122000000000 \lor \neg \left(a \leq 7.8 \cdot 10^{-24}\right):\\ \;\;\;\;\log t \cdot a - t\\ \mathbf{else}:\\ \;\;\;\;\log \left(y \cdot z\right) - \left(t + \log t \cdot 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 71.2% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 0.0073:\\ \;\;\;\;\log y + \log t \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot a - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t 0.0073) (+ (log y) (* (log t) (- a 0.5))) (- (* (log t) a) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 0.0073) {
		tmp = log(y) + (log(t) * (a - 0.5));
	} else {
		tmp = (log(t) * a) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= 0.0073d0) then
        tmp = log(y) + (log(t) * (a - 0.5d0))
    else
        tmp = (log(t) * a) - t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, 0.0073], N[(N[Log[y], $MachinePrecision] + N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 0.00730000000000000007

   1. Initial program 99.3%

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

      1. associate--l+ 99.3%

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

      2. sub-neg 99.3%

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

      3. metadata-eval 99.3%

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

   3. Simplified 99.3%

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

      1. add-cube-cbrt 98.9%

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

      2. pow3 98.9%

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

   6. Applied egg-rr 98.9%

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

   7. Taylor expanded in t around inf 58.0%

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

      1. +-commutative 58.0%

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

      2. mul-1-neg 58.0%

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

      3. unsub-neg 58.0%

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

      4. log-rec 58.0%

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

      5. sub-neg 58.0%

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

      6. metadata-eval 58.0%

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

      7. distribute-lft-neg-in 58.0%

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

      8. distribute-rgt-neg-in 58.0%

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

   9. Simplified 58.0%

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

   10. Taylor expanded in x around 0 45.5%

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

   if 0.00730000000000000007 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in a around inf 98.3%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

      \[\leadsto \color{blue}{\log t \cdot a} - t \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.5%

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

Alternative 12: 71.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log t \cdot a\\ \mathbf{if}\;t \leq 0.0073:\\ \;\;\;\;\log y + t_1\\ \mathbf{else}:\\ \;\;\;\;t_1 - t\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = log(t) * a
    if (t <= 0.0073d0) then
        tmp = log(y) + t_1
    else
        tmp = t_1 - t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 0.00730000000000000007

   1. Initial program 99.3%

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

      1. associate-+l- 99.4%

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-udef 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in a around inf 57.9%

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

      1. *-commutative 57.9%

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

   7. Simplified 57.9%

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

   8. Taylor expanded in x around 0 45.5%

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

      1. *-commutative 45.5%

         \[\leadsto \log y + \color{blue}{\log t \cdot a} \]

   10. Simplified 45.5%

       \[\leadsto \color{blue}{\log y + \log t \cdot a} \]

   if 0.00730000000000000007 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in a around inf 98.3%

      \[\leadsto \color{blue}{a \cdot \log t} - t \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

      \[\leadsto \color{blue}{\log t \cdot a} - t \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 0.0073:\\ \;\;\;\;\log y + \log t \cdot a\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot a - t\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 41.4% accurate, 2.9× speedup

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 (if (<= t 0.0073) (log (+ x y)) (- t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 0.0073) {
		tmp = log((x + y));
	} else {
		tmp = -t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= 0.0073d0) then
        tmp = log((x + y))
    else
        tmp = -t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, 0.0073], N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision], (-t)]

Derivation

1. Split input into 2 regimes

2. if t < 0.00730000000000000007

   1. Initial program 99.3%

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

      1. associate-+l- 99.4%

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-udef 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around inf 9.2%

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

      1. neg-mul-1 9.2%

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

   7. Simplified 9.2%

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

   8. Taylor expanded in t around 0 9.2%

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

      1. +-commutative 9.2%

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

   10. Simplified 9.2%

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

   if 0.00730000000000000007 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.1%

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

   6. Taylor expanded in t around inf 71.4%

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

      1. neg-mul-1 71.4%

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

   8. Simplified 71.4%

      \[\leadsto \color{blue}{-t} \]
3. Recombined 2 regimes into one program.

4. Final simplification 41.0%

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

Alternative 14: 75.3% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \log t \cdot a - t \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision]

Derivation

1. Initial program 99.6%

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

   1. associate--l+ 99.6%

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

   2. sub-neg 99.6%

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

   3. metadata-eval 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 68.1%

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

6. Taylor expanded in a around inf 75.8%

   \[\leadsto \color{blue}{a \cdot \log t} - t \]
7. Step-by-step derivation

   1. *-commutative 75.8%

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

8. Simplified 75.8%

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

9. Final simplification 75.8%

   \[\leadsto \log t \cdot a - t \]
10. Add Preprocessing

Alternative 15: 30.6% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = log(y) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate-+l- 99.6%

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

   2. associate--l+ 99.7%

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

   3. sub-neg 99.7%

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

   4. +-commutative 99.7%

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

   5. *-commutative 99.7%

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

   6. distribute-rgt-neg-in 99.7%

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

   7. fma-udef 99.7%

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

   8. sub-neg 99.7%

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

   9. +-commutative 99.7%

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

   10. distribute-neg-in 99.7%

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

   11. metadata-eval 99.7%

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

   12. metadata-eval 99.7%

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

   13. unsub-neg 99.7%

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

3. Simplified 99.7%

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

5. Taylor expanded in t around inf 41.0%

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

   1. neg-mul-1 41.0%

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

7. Simplified 41.0%

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

8. Taylor expanded in x around 0 28.3%

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

9. Final simplification 28.3%

   \[\leadsto \log y - t \]
10. Add Preprocessing

Alternative 16: 38.3% accurate, 156.5× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = -t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate--l+ 99.6%

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

   2. sub-neg 99.6%

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

   3. metadata-eval 99.6%

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

3. Simplified 99.6%

   \[\leadsto \color{blue}{\left(\log \left(x + y\right) + \left(\log z - t\right)\right) + \left(a + -0.5\right) \cdot \log t} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 68.1%

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

6. Taylor expanded in t around inf 37.9%

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

   1. neg-mul-1 37.9%

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

8. Simplified 37.9%

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

9. Final simplification 37.9%

   \[\leadsto -t \]
10. Add Preprocessing

Developer target: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024019 
(FPCore (x y z t a)
  :name "Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (+ (log (+ x y)) (+ (- (log z) t) (* (- a 0.5) (log t))))

  (+ (- (+ (log (+ x y)) (log z)) t) (* (- a 0.5) (log t))))