Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2

Percentage Accurate: 99.6% → 99.6%

Time: 25.1s

Alternatives: 15

Speedup: 1.0×

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-undefine 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. Add Preprocessing

Alternative 2: 67.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (- a 0.5) -2e+33) (not (<= (- a 0.5) 1e+83)))
   (* (log t) a)
   (- (+ (log y) (+ (log z) (* (log t) -0.5))) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a - 0.5) <= -2e+33) || !((a - 0.5) <= 1e+83)) {
		tmp = log(t) * a;
	} else {
		tmp = (log(y) + (log(z) + (log(t) * -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) :: tmp
    if (((a - 0.5d0) <= (-2d+33)) .or. (.not. ((a - 0.5d0) <= 1d+83))) then
        tmp = log(t) * a
    else
        tmp = (log(y) + (log(z) + (log(t) * (-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 tmp;
	if (((a - 0.5) <= -2e+33) || !((a - 0.5) <= 1e+83)) {
		tmp = Math.log(t) * a;
	} else {
		tmp = (Math.log(y) + (Math.log(z) + (Math.log(t) * -0.5))) - t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((a - 0.5) <= -2e+33) || ~(((a - 0.5) <= 1e+83)))
		tmp = log(t) * a;
	else
		tmp = (log(y) + (log(z) + (log(t) * -0.5))) - t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 a #s(literal 1/2 binary64)) < -1.9999999999999999e33 or 1.00000000000000003e83 < (-.f64 a #s(literal 1/2 binary64))

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -1.9999999999999999e33 < (-.f64 a #s(literal 1/2 binary64)) < 1.00000000000000003e83

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.7%

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

      4. +-commutative 99.7%

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

      5. fma-define 99.7%

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

      6. sub-neg 99.7%

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

      7. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in x around 0 61.8%

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

   6. Taylor expanded in a around 0 60.4%

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

4. Final simplification 69.5%

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

Alternative 3: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(\log \left(x + y\right) + \log z\right) - t\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(Float64(log(Float64(x + y)) + 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[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] - t), $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. Add Preprocessing

3. Final simplification 99.6%

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

Alternative 4: 69.7% 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. +-commutative 99.6%

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

   3. associate-+l+ 99.7%

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

   4. +-commutative 99.7%

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

   5. fma-define 99.6%

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

   6. sub-neg 99.6%

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

   7. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 65.8%

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

Alternative 5: 69.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return (log(z) - t) + (log(y) + (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(z) - t) + (log(y) + (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(z) - t) + (Math.log(y) + (Math.log(t) * (a - 0.5)));
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision] + N[(N[Log[y], $MachinePrecision] + N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $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. +-commutative 99.6%

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

   3. associate-+l+ 99.7%

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

   4. +-commutative 99.7%

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

   5. fma-define 99.6%

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

   6. sub-neg 99.6%

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

   7. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 65.8%

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

Alternative 6: 59.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log t \cdot a\\ \mathbf{if}\;a \leq -1.4 \cdot 10^{+28}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-192}:\\ \;\;\;\;\log \left(z \cdot \left(y \cdot {t}^{-0.5}\right)\right) - t\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{-64}:\\ \;\;\;\;\left(\log \left(y \cdot z\right) + \log t \cdot -0.5\right) - t\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{+82}:\\ \;\;\;\;\log \left(x + y\right) + \left(\log z - t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (log t) a)))
   (if (<= a -1.4e+28)
     t_1
     (if (<= a 2.2e-192)
       (- (log (* z (* y (pow t -0.5)))) t)
       (if (<= a 7.2e-64)
         (- (+ (log (* y z)) (* (log t) -0.5)) t)
         (if (<= a 7.2e+82) (+ (log (+ x y)) (- (log z) t)) t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log(t) * a;
	double tmp;
	if (a <= -1.4e+28) {
		tmp = t_1;
	} else if (a <= 2.2e-192) {
		tmp = log((z * (y * pow(t, -0.5)))) - t;
	} else if (a <= 7.2e-64) {
		tmp = (log((y * z)) + (log(t) * -0.5)) - t;
	} else if (a <= 7.2e+82) {
		tmp = log((x + y)) + (log(z) - t);
	} else {
		tmp = t_1;
	}
	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 (a <= (-1.4d+28)) then
        tmp = t_1
    else if (a <= 2.2d-192) then
        tmp = log((z * (y * (t ** (-0.5d0))))) - t
    else if (a <= 7.2d-64) then
        tmp = (log((y * z)) + (log(t) * (-0.5d0))) - t
    else if (a <= 7.2d+82) then
        tmp = log((x + y)) + (log(z) - t)
    else
        tmp = t_1
    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 (a <= -1.4e+28) {
		tmp = t_1;
	} else if (a <= 2.2e-192) {
		tmp = Math.log((z * (y * Math.pow(t, -0.5)))) - t;
	} else if (a <= 7.2e-64) {
		tmp = (Math.log((y * z)) + (Math.log(t) * -0.5)) - t;
	} else if (a <= 7.2e+82) {
		tmp = Math.log((x + y)) + (Math.log(z) - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = math.log(t) * a
	tmp = 0
	if a <= -1.4e+28:
		tmp = t_1
	elif a <= 2.2e-192:
		tmp = math.log((z * (y * math.pow(t, -0.5)))) - t
	elif a <= 7.2e-64:
		tmp = (math.log((y * z)) + (math.log(t) * -0.5)) - t
	elif a <= 7.2e+82:
		tmp = math.log((x + y)) + (math.log(z) - t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(t) * a)
	tmp = 0.0
	if (a <= -1.4e+28)
		tmp = t_1;
	elseif (a <= 2.2e-192)
		tmp = Float64(log(Float64(z * Float64(y * (t ^ -0.5)))) - t);
	elseif (a <= 7.2e-64)
		tmp = Float64(Float64(log(Float64(y * z)) + Float64(log(t) * -0.5)) - t);
	elseif (a <= 7.2e+82)
		tmp = Float64(log(Float64(x + y)) + Float64(log(z) - t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log(t) * a;
	tmp = 0.0;
	if (a <= -1.4e+28)
		tmp = t_1;
	elseif (a <= 2.2e-192)
		tmp = log((z * (y * (t ^ -0.5)))) - t;
	elseif (a <= 7.2e-64)
		tmp = (log((y * z)) + (log(t) * -0.5)) - t;
	elseif (a <= 7.2e+82)
		tmp = log((x + y)) + (log(z) - t);
	else
		tmp = t_1;
	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[a, -1.4e+28], t$95$1, If[LessEqual[a, 2.2e-192], N[(N[Log[N[(z * N[(y * N[Power[t, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision], If[LessEqual[a, 7.2e-64], N[(N[(N[Log[N[(y * z), $MachinePrecision]], $MachinePrecision] + N[(N[Log[t], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], If[LessEqual[a, 7.2e+82], N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -1.4000000000000001e28 or 7.20000000000000028e82 < a

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -1.4000000000000001e28 < a < 2.20000000000000006e-192

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.7%

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

      4. +-commutative 99.7%

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

      5. fma-define 99.7%

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

      6. sub-neg 99.7%

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

      7. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

      1. add-sqr-sqrt 32.2%

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

      2. pow2 32.2%

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

   6. Applied egg-rr 27.1%

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

   7. Taylor expanded in a around 0 73.4%

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

   8. Taylor expanded in x around 0 47.0%

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

      1. +-commutative 47.0%

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

      2. *-commutative 47.0%

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

   10. Simplified 47.0%

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

       1. *-un-lft-identity 47.0%

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

       2. +-commutative 47.0%

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

       3. add-log-exp 47.0%

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

       4. sum-log 45.4%

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

       5. pow-to-exp 45.4%

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

   12. Applied egg-rr 45.4%

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

       1. *-lft-identity 45.4%

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

       2. *-commutative 45.4%

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

       3. associate-*l* 48.5%

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

   14. Simplified 48.5%

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

   if 2.20000000000000006e-192 < a < 7.1999999999999996e-64

   1. Initial program 99.5%

      \[\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.5%

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

      2. +-commutative 99.5%

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

      3. associate-+l+ 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

      6. sub-neg 99.4%

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

      7. metadata-eval 99.4%

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

   3. Simplified 99.4%

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

      1. add-sqr-sqrt 37.2%

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

      2. pow2 37.2%

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

   6. Applied egg-rr 34.3%

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

   7. Taylor expanded in a around 0 93.8%

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

   8. Taylor expanded in x around 0 63.3%

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

      1. +-commutative 63.3%

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

      2. *-commutative 63.3%

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

   10. Simplified 63.3%

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

   if 7.1999999999999996e-64 < a < 7.20000000000000028e82

   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) + \log z\right) - \left(t - \left(a - 0.5\right) \cdot \log t\right)} \]

      2. associate--l+ 99.8%

         \[\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.8%

         \[\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.8%

         \[\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.8%

         \[\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.8%

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

         \[\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.8%

         \[\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.8%

         \[\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.8%

          \[\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.8%

          \[\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.8%

          \[\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.8%

          \[\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.8%

      \[\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 72.8%

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

4. Final simplification 67.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.4 \cdot 10^{+28}:\\ \;\;\;\;\log t \cdot a\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-192}:\\ \;\;\;\;\log \left(z \cdot \left(y \cdot {t}^{-0.5}\right)\right) - t\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{-64}:\\ \;\;\;\;\left(\log \left(y \cdot z\right) + \log t \cdot -0.5\right) - t\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{+82}:\\ \;\;\;\;\log \left(x + y\right) + \left(\log z - t\right)\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 62.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log t \cdot a\\ t_2 := \log \left(x + y\right) + \left(\log z - t\right)\\ \mathbf{if}\;a \leq -4.4 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq -1.1 \cdot 10^{-276}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;a \leq 8.6 \cdot 10^{-247}:\\ \;\;\;\;\log \left(y \cdot \left(z \cdot {t}^{\left(a + -0.5\right)}\right)\right)\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{+82}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (log t) a)) (t_2 (+ (log (+ x y)) (- (log z) t))))
   (if (<= a -4.4e+31)
     t_1
     (if (<= a -1.1e-276)
       t_2
       (if (<= a 8.6e-247)
         (log (* y (* z (pow t (+ a -0.5)))))
         (if (<= a 7.2e+82) t_2 t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log(t) * a;
	double t_2 = log((x + y)) + (log(z) - t);
	double tmp;
	if (a <= -4.4e+31) {
		tmp = t_1;
	} else if (a <= -1.1e-276) {
		tmp = t_2;
	} else if (a <= 8.6e-247) {
		tmp = log((y * (z * pow(t, (a + -0.5)))));
	} else if (a <= 7.2e+82) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	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
    t_2 = log((x + y)) + (log(z) - t)
    if (a <= (-4.4d+31)) then
        tmp = t_1
    else if (a <= (-1.1d-276)) then
        tmp = t_2
    else if (a <= 8.6d-247) then
        tmp = log((y * (z * (t ** (a + (-0.5d0))))))
    else if (a <= 7.2d+82) then
        tmp = t_2
    else
        tmp = t_1
    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 t_2 = Math.log((x + y)) + (Math.log(z) - t);
	double tmp;
	if (a <= -4.4e+31) {
		tmp = t_1;
	} else if (a <= -1.1e-276) {
		tmp = t_2;
	} else if (a <= 8.6e-247) {
		tmp = Math.log((y * (z * Math.pow(t, (a + -0.5)))));
	} else if (a <= 7.2e+82) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = math.log(t) * a
	t_2 = math.log((x + y)) + (math.log(z) - t)
	tmp = 0
	if a <= -4.4e+31:
		tmp = t_1
	elif a <= -1.1e-276:
		tmp = t_2
	elif a <= 8.6e-247:
		tmp = math.log((y * (z * math.pow(t, (a + -0.5)))))
	elif a <= 7.2e+82:
		tmp = t_2
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(t) * a)
	t_2 = Float64(log(Float64(x + y)) + Float64(log(z) - t))
	tmp = 0.0
	if (a <= -4.4e+31)
		tmp = t_1;
	elseif (a <= -1.1e-276)
		tmp = t_2;
	elseif (a <= 8.6e-247)
		tmp = log(Float64(y * Float64(z * (t ^ Float64(a + -0.5)))));
	elseif (a <= 7.2e+82)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log(t) * a;
	t_2 = log((x + y)) + (log(z) - t);
	tmp = 0.0;
	if (a <= -4.4e+31)
		tmp = t_1;
	elseif (a <= -1.1e-276)
		tmp = t_2;
	elseif (a <= 8.6e-247)
		tmp = log((y * (z * (t ^ (a + -0.5)))));
	elseif (a <= 7.2e+82)
		tmp = t_2;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision]}, Block[{t$95$2 = N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -4.4e+31], t$95$1, If[LessEqual[a, -1.1e-276], t$95$2, If[LessEqual[a, 8.6e-247], N[Log[N[(y * N[(z * N[Power[t, N[(a + -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[a, 7.2e+82], t$95$2, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if a < -4.4000000000000002e31 or 7.20000000000000028e82 < a

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -4.4000000000000002e31 < a < -1.0999999999999999e-276 or 8.6000000000000001e-247 < a < 7.20000000000000028e82

   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) + \log z\right) - \left(t - \left(a - 0.5\right) \cdot \log t\right)} \]

      2. associate--l+ 99.8%

         \[\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.8%

         \[\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.8%

         \[\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.8%

         \[\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.8%

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

         \[\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.8%

         \[\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.8%

         \[\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.8%

          \[\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.8%

          \[\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.8%

          \[\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.8%

          \[\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.8%

      \[\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 67.0%

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

   if -1.0999999999999999e-276 < a < 8.6000000000000001e-247

   1. Initial program 98.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+ 98.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. +-commutative 98.8%

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

      3. associate-+l+ 99.0%

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

      4. +-commutative 99.0%

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

      5. fma-define 99.0%

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

      6. sub-neg 99.0%

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

      7. metadata-eval 99.0%

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

   3. Simplified 99.0%

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

   5. Taylor expanded in x around 0 48.0%

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

      1. add-log-exp 37.1%

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

      2. exp-sum 31.6%

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

      3. exp-diff 31.6%

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

      4. add-exp-log 31.4%

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

      5. exp-sum 31.5%

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

      6. add-exp-log 32.6%

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

      7. sub-neg 32.6%

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

      8. metadata-eval 32.6%

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

      9. exp-to-pow 32.7%

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

   7. Applied egg-rr 32.7%

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

   8. Taylor expanded in t around 0 37.0%

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

      1. exp-to-pow 37.1%

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

      2. sub-neg 37.1%

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

      3. metadata-eval 37.1%

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

   10. Simplified 37.1%

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

Alternative 8: 77.5% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (- a 0.5) -1e+52) (not (<= (- a 0.5) 5e+111)))
   (* (log t) a)
   (- (+ (* (log t) (- a 0.5)) (log (* (+ x y) z))) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a - 0.5) <= -1e+52) || !((a - 0.5) <= 5e+111)) {
		tmp = log(t) * a;
	} else {
		tmp = ((log(t) * (a - 0.5)) + log(((x + y) * z))) - 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 (((a - 0.5d0) <= (-1d+52)) .or. (.not. ((a - 0.5d0) <= 5d+111))) then
        tmp = log(t) * a
    else
        tmp = ((log(t) * (a - 0.5d0)) + log(((x + y) * z))) - 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 (((a - 0.5) <= -1e+52) || !((a - 0.5) <= 5e+111)) {
		tmp = Math.log(t) * a;
	} else {
		tmp = ((Math.log(t) * (a - 0.5)) + Math.log(((x + y) * z))) - t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((a - 0.5) <= -1e+52) || ~(((a - 0.5) <= 5e+111)))
		tmp = log(t) * a;
	else
		tmp = ((log(t) * (a - 0.5)) + log(((x + y) * z))) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(a - 0.5), $MachinePrecision], -1e+52], N[Not[LessEqual[N[(a - 0.5), $MachinePrecision], 5e+111]], $MachinePrecision]], N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision], N[(N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] + N[Log[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 a #s(literal 1/2 binary64)) < -9.9999999999999999e51 or 4.9999999999999997e111 < (-.f64 a #s(literal 1/2 binary64))

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 69.8%

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

   6. Taylor expanded in a around inf 86.4%

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

      1. *-commutative 86.4%

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

   8. Simplified 86.4%

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

   if -9.9999999999999999e51 < (-.f64 a #s(literal 1/2 binary64)) < 4.9999999999999997e111

   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-undefine 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-undefine 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 77.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 77.8%

      \[\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 80.7%

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

Alternative 9: 62.2% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (- a 0.5) -1e+52) (not (<= (- a 0.5) 5e+111)))
   (* (log t) a)
   (- (+ (* (log t) (- a 0.5)) (log (* y z))) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a - 0.5) <= -1e+52) || !((a - 0.5) <= 5e+111)) {
		tmp = log(t) * a;
	} else {
		tmp = ((log(t) * (a - 0.5)) + log((y * z))) - 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 (((a - 0.5d0) <= (-1d+52)) .or. (.not. ((a - 0.5d0) <= 5d+111))) then
        tmp = log(t) * a
    else
        tmp = ((log(t) * (a - 0.5d0)) + log((y * z))) - 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 (((a - 0.5) <= -1e+52) || !((a - 0.5) <= 5e+111)) {
		tmp = Math.log(t) * a;
	} else {
		tmp = ((Math.log(t) * (a - 0.5)) + Math.log((y * z))) - t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((a - 0.5) <= -1e+52) || ~(((a - 0.5) <= 5e+111)))
		tmp = log(t) * a;
	else
		tmp = ((log(t) * (a - 0.5)) + log((y * z))) - t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 a #s(literal 1/2 binary64)) < -9.9999999999999999e51 or 4.9999999999999997e111 < (-.f64 a #s(literal 1/2 binary64))

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 69.8%

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

   6. Taylor expanded in a around inf 86.4%

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

      1. *-commutative 86.4%

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

   8. Simplified 86.4%

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

   if -9.9999999999999999e51 < (-.f64 a #s(literal 1/2 binary64)) < 4.9999999999999997e111

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.7%

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

      4. +-commutative 99.7%

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

      5. fma-define 99.7%

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

      6. sub-neg 99.7%

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

      7. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

      1. add-sqr-sqrt 31.0%

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

      2. pow2 31.0%

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

   6. Applied egg-rr 26.0%

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

   7. Taylor expanded in x around 0 47.3%

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

4. Final simplification 60.6%

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

Alternative 10: 59.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log t \cdot a\\ \mathbf{if}\;a \leq -5.7 \cdot 10^{+30}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 7.7 \cdot 10^{-100}:\\ \;\;\;\;\log \left(z \cdot \left(y \cdot {t}^{-0.5}\right)\right) - t\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{+82}:\\ \;\;\;\;\log \left(x + y\right) + \left(\log z - t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (log t) a)))
   (if (<= a -5.7e+30)
     t_1
     (if (<= a 7.7e-100)
       (- (log (* z (* y (pow t -0.5)))) t)
       (if (<= a 7.2e+82) (+ (log (+ x y)) (- (log z) t)) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log(t) * a;
	double tmp;
	if (a <= -5.7e+30) {
		tmp = t_1;
	} else if (a <= 7.7e-100) {
		tmp = log((z * (y * pow(t, -0.5)))) - t;
	} else if (a <= 7.2e+82) {
		tmp = log((x + y)) + (log(z) - t);
	} else {
		tmp = t_1;
	}
	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 (a <= (-5.7d+30)) then
        tmp = t_1
    else if (a <= 7.7d-100) then
        tmp = log((z * (y * (t ** (-0.5d0))))) - t
    else if (a <= 7.2d+82) then
        tmp = log((x + y)) + (log(z) - t)
    else
        tmp = t_1
    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 (a <= -5.7e+30) {
		tmp = t_1;
	} else if (a <= 7.7e-100) {
		tmp = Math.log((z * (y * Math.pow(t, -0.5)))) - t;
	} else if (a <= 7.2e+82) {
		tmp = Math.log((x + y)) + (Math.log(z) - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = math.log(t) * a
	tmp = 0
	if a <= -5.7e+30:
		tmp = t_1
	elif a <= 7.7e-100:
		tmp = math.log((z * (y * math.pow(t, -0.5)))) - t
	elif a <= 7.2e+82:
		tmp = math.log((x + y)) + (math.log(z) - t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(t) * a)
	tmp = 0.0
	if (a <= -5.7e+30)
		tmp = t_1;
	elseif (a <= 7.7e-100)
		tmp = Float64(log(Float64(z * Float64(y * (t ^ -0.5)))) - t);
	elseif (a <= 7.2e+82)
		tmp = Float64(log(Float64(x + y)) + Float64(log(z) - t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log(t) * a;
	tmp = 0.0;
	if (a <= -5.7e+30)
		tmp = t_1;
	elseif (a <= 7.7e-100)
		tmp = log((z * (y * (t ^ -0.5)))) - t;
	elseif (a <= 7.2e+82)
		tmp = log((x + y)) + (log(z) - t);
	else
		tmp = t_1;
	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[a, -5.7e+30], t$95$1, If[LessEqual[a, 7.7e-100], N[(N[Log[N[(z * N[(y * N[Power[t, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision], If[LessEqual[a, 7.2e+82], N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if a < -5.7000000000000002e30 or 7.20000000000000028e82 < a

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -5.7000000000000002e30 < a < 7.69999999999999975e-100

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

      1. add-sqr-sqrt 33.8%

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

      2. pow2 33.8%

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

   6. Applied egg-rr 29.0%

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

   7. Taylor expanded in a around 0 77.4%

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

   8. Taylor expanded in x around 0 51.7%

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

      1. +-commutative 51.7%

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

      2. *-commutative 51.7%

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

   10. Simplified 51.7%

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

       1. *-un-lft-identity 51.7%

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

       2. +-commutative 51.7%

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

       3. add-log-exp 51.7%

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

       4. sum-log 47.9%

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

       5. pow-to-exp 48.0%

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

   12. Applied egg-rr 48.0%

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

       1. *-lft-identity 48.0%

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

       2. *-commutative 48.0%

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

       3. associate-*l* 49.6%

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

   14. Simplified 49.6%

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

   if 7.69999999999999975e-100 < a < 7.20000000000000028e82

   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) + \log z\right) - \left(t - \left(a - 0.5\right) \cdot \log t\right)} \]

      2. associate--l+ 99.8%

         \[\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.8%

         \[\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.8%

         \[\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.8%

         \[\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.8%

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

         \[\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.8%

         \[\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.8%

         \[\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.8%

          \[\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.8%

          \[\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.8%

          \[\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.8%

          \[\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.8%

      \[\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 71.1%

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

Alternative 11: 66.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.7 \cdot 10^{+29} \lor \neg \left(a \leq 7.6 \cdot 10^{+82}\right):\\ \;\;\;\;\log t \cdot a\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + y\right) + \left(\log z - t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.7e+29) (not (<= a 7.6e+82)))
   (* (log t) a)
   (+ (log (+ x y)) (- (log z) t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.7e+29) || !(a <= 7.6e+82)) {
		tmp = log(t) * a;
	} else {
		tmp = log((x + y)) + (log(z) - 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 ((a <= (-2.7d+29)) .or. (.not. (a <= 7.6d+82))) then
        tmp = log(t) * a
    else
        tmp = log((x + y)) + (log(z) - 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 ((a <= -2.7e+29) || !(a <= 7.6e+82)) {
		tmp = Math.log(t) * a;
	} else {
		tmp = Math.log((x + y)) + (Math.log(z) - t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -2.7e+29) or not (a <= 7.6e+82):
		tmp = math.log(t) * a
	else:
		tmp = math.log((x + y)) + (math.log(z) - t)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.7e+29) || !(a <= 7.6e+82))
		tmp = Float64(log(t) * a);
	else
		tmp = Float64(log(Float64(x + y)) + Float64(log(z) - t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -2.7e+29) || ~((a <= 7.6e+82)))
		tmp = log(t) * a;
	else
		tmp = log((x + y)) + (log(z) - t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -2.7e+29], N[Not[LessEqual[a, 7.6e+82]], $MachinePrecision]], N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision], N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -2.7e29 or 7.60000000000000067e82 < a

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -2.7e29 < a < 7.60000000000000067e82

   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-undefine 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 63.7%

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

4. Final simplification 71.5%

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

Alternative 12: 57.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -6.3 \cdot 10^{+28} \lor \neg \left(a \leq 8.8 \cdot 10^{+82}\right):\\ \;\;\;\;\log t \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(\log z + \log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -6.3e+28) (not (<= a 8.8e+82)))
   (* (log t) a)
   (- (+ (log z) (log y)) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -6.3e+28) || !(a <= 8.8e+82)) {
		tmp = log(t) * a;
	} else {
		tmp = (log(z) + log(y)) - 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 ((a <= (-6.3d+28)) .or. (.not. (a <= 8.8d+82))) then
        tmp = log(t) * a
    else
        tmp = (log(z) + log(y)) - 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 ((a <= -6.3e+28) || !(a <= 8.8e+82)) {
		tmp = Math.log(t) * a;
	} else {
		tmp = (Math.log(z) + Math.log(y)) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -6.3e+28) or not (a <= 8.8e+82):
		tmp = math.log(t) * a
	else:
		tmp = (math.log(z) + math.log(y)) - t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -6.3e+28) || !(a <= 8.8e+82))
		tmp = Float64(log(t) * a);
	else
		tmp = Float64(Float64(log(z) + log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -6.3e+28) || ~((a <= 8.8e+82)))
		tmp = log(t) * a;
	else
		tmp = (log(z) + log(y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -6.3e+28], N[Not[LessEqual[a, 8.8e+82]], $MachinePrecision]], N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision], N[(N[(N[Log[z], $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -6.3000000000000001e28 or 8.8000000000000005e82 < a

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -6.3000000000000001e28 < a < 8.8000000000000005e82

   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-undefine 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 99.7%

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

      1. mul-1-neg 99.7%

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

      2. unsub-neg 99.7%

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

      3. associate-/l* 99.7%

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

      4. log-rec 99.7%

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

   7. Simplified 99.7%

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

   8. Taylor expanded in x around 0 61.7%

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

      1. sub-neg 61.7%

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

      2. mul-1-neg 61.7%

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

      3. remove-double-neg 61.7%

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

      4. associate-/l* 61.7%

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

   10. Simplified 61.7%

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

   11. Taylor expanded in t around inf 44.3%

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

4. Final simplification 59.7%

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

Alternative 13: 65.0% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.28 \cdot 10^{+29} \lor \neg \left(a \leq 8 \cdot 10^{+82}\right):\\ \;\;\;\;\log t \cdot a\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1.28e+29) (not (<= a 8e+82)))
   (* (log t) a)
   (- (log (+ x y)) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.28e+29) || !(a <= 8e+82)) {
		tmp = log(t) * a;
	} else {
		tmp = log((x + y)) - 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 ((a <= (-1.28d+29)) .or. (.not. (a <= 8d+82))) then
        tmp = log(t) * a
    else
        tmp = log((x + y)) - 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 ((a <= -1.28e+29) || !(a <= 8e+82)) {
		tmp = Math.log(t) * a;
	} else {
		tmp = Math.log((x + y)) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -1.28e+29) or not (a <= 8e+82):
		tmp = math.log(t) * a
	else:
		tmp = math.log((x + y)) - t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -1.28e+29) || !(a <= 8e+82))
		tmp = Float64(log(t) * a);
	else
		tmp = Float64(log(Float64(x + y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -1.28e+29) || ~((a <= 8e+82)))
		tmp = log(t) * a;
	else
		tmp = log((x + y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -1.28e+29], N[Not[LessEqual[a, 8e+82]], $MachinePrecision]], N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision], N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.28e29 or 7.9999999999999997e82 < a

   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. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 72.0%

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

   6. Taylor expanded in a around inf 83.4%

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

      1. *-commutative 83.4%

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

   8. Simplified 83.4%

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

   if -1.28e29 < a < 7.9999999999999997e82

   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-undefine 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 62.8%

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

      1. neg-mul-1 62.8%

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

   7. Simplified 62.8%

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

4. Final simplification 70.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.28 \cdot 10^{+29} \lor \neg \left(a \leq 8 \cdot 10^{+82}\right):\\ \;\;\;\;\log t \cdot a\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + y\right) - t\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 63.1% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 8 \cdot 10^{+27}:\\ \;\;\;\;\log t \cdot a\\ \mathbf{else}:\\ \;\;\;\;-t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (if (<= t 8e+27) (* (log t) a) (- t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 8e+27) {
		tmp = log(t) * a;
	} 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 <= 8d+27) then
        tmp = log(t) * a
    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 <= 8e+27) {
		tmp = Math.log(t) * a;
	} else {
		tmp = -t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 8.0000000000000001e27

   1. Initial program 99.4%

      \[\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) + \left(\log z - t\right)\right)} + \left(a - 0.5\right) \cdot \log t \]

      2. +-commutative 99.4%

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

      3. associate-+l+ 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

      6. sub-neg 99.4%

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

      7. metadata-eval 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in x around 0 59.4%

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

   6. Taylor expanded in a around inf 51.9%

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

      1. *-commutative 51.9%

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

   8. Simplified 51.9%

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

   if 8.0000000000000001e27 < 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. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. fma-define 99.9%

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

      6. sub-neg 99.9%

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

      7. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 72.9%

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

   6. Taylor expanded in t around inf 82.8%

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

      1. neg-mul-1 82.8%

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

   8. Simplified 82.8%

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

Alternative 15: 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. +-commutative 99.6%

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

   3. associate-+l+ 99.7%

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

   4. +-commutative 99.7%

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

   5. fma-define 99.6%

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

   6. sub-neg 99.6%

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

   7. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 65.8%

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

6. Taylor expanded in t around inf 41.5%

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

   1. neg-mul-1 41.5%

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

8. Simplified 41.5%

   \[\leadsto \color{blue}{-t} \]
9. 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 2024086 
(FPCore (x y z t a)
  :name "Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2"
  :precision binary64

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

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