Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2

Percentage Accurate: 99.6% → 99.6%

Time: 17.1s

Alternatives: 16

Speedup: 0.8×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

   2. fma-define 99.6%

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

   3. sub-neg 99.6%

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

   4. metadata-eval 99.6%

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

   5. associate--l+ 99.6%

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

3. Simplified 99.6%

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

5. Final simplification 99.6%

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

Alternative 2: 93.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   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. remove-double-neg 99.8%

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

      2. associate--l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. sub-neg 99.8%

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

      5. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 70.9%

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

   6. Taylor expanded in a around inf 68.1%

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

      1. *-commutative 68.1%

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

   8. Simplified 68.1%

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

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

   1. Initial program 99.6%

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

      1. associate-+l- 99.6%

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

      2. associate--l+ 99.6%

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

      3. sub-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. *-commutative 99.6%

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

      6. distribute-rgt-neg-in 99.6%

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

      7. fma-undefine 99.6%

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

      8. sub-neg 99.6%

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

      9. +-commutative 99.6%

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

      10. distribute-neg-in 99.6%

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

      11. metadata-eval 99.6%

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

      12. metadata-eval 99.6%

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

      13. unsub-neg 99.6%

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

   3. Simplified 99.6%

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

      1. associate-+r- 99.6%

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

      2. fma-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. sum-log 99.6%

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

   6. Applied egg-rr 99.6%

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

4. Final simplification 92.5%

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

Alternative 3: 67.5% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   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. remove-double-neg 99.8%

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

      2. associate--l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. sub-neg 99.8%

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

      5. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 70.9%

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

   6. Taylor expanded in a around inf 68.1%

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

      1. *-commutative 68.1%

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

   8. Simplified 68.1%

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

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

   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. remove-double-neg 99.6%

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

      2. associate--l+ 99.6%

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

      3. remove-double-neg 99.6%

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

      4. sub-neg 99.6%

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

      5. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

      1. +-commutative 99.6%

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

      2. associate-+r+ 99.6%

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

      3. fma-undefine 99.6%

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

      4. +-commutative 99.6%

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

      5. add-cube-cbrt 98.0%

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

      6. pow3 98.1%

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

   6. Applied egg-rr 98.0%

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

   7. Taylor expanded in x around 0 68.2%

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

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

Alternative 4: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 460

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-undefine 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around 0 97.9%

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

      1. associate--l+ 97.9%

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

      2. +-commutative 97.9%

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

   7. Simplified 97.9%

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

   if 460 < 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. remove-double-neg 99.9%

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

      2. associate--l+ 99.9%

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

      3. remove-double-neg 99.9%

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

      4. sub-neg 99.9%

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

      5. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 81.9%

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

   6. Taylor expanded in a around inf 99.0%

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

      1. *-commutative 99.0%

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

   8. Simplified 99.0%

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

4. Final simplification 98.4%

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

Alternative 5: 81.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 230

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-undefine 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around 0 97.9%

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

      1. associate--l+ 97.9%

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

      2. +-commutative 97.9%

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

   7. Simplified 97.9%

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

   8. Taylor expanded in x around 0 63.4%

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

   if 230 < 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. remove-double-neg 99.9%

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

      2. associate--l+ 99.9%

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

      3. remove-double-neg 99.9%

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

      4. sub-neg 99.9%

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

      5. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 81.9%

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

   6. Taylor expanded in a around inf 99.0%

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

      1. *-commutative 99.0%

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

   8. Simplified 99.0%

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

4. Final simplification 80.5%

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

Alternative 6: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\log \left(x + y\right) + \left(\log z - t\right)\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(log(Float64(x + y)) + 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[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision] + N[(N[(a + -0.5), $MachinePrecision] * N[Log[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. remove-double-neg 99.6%

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

   2. associate--l+ 99.6%

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

   3. remove-double-neg 99.6%

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

   4. sub-neg 99.6%

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

   5. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Final simplification 99.6%

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

Alternative 7: 69.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[Log[z], $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - N[(t - 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) + \log z\right) - \left(t - \left(a - 0.5\right) \cdot \log t\right)} \]

   2. associate--l+ 99.6%

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

   3. sub-neg 99.6%

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

   4. +-commutative 99.6%

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

   5. *-commutative 99.6%

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

   6. distribute-rgt-neg-in 99.6%

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

   7. fma-undefine 99.6%

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

   8. sub-neg 99.6%

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

   9. +-commutative 99.6%

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

   10. distribute-neg-in 99.6%

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

   11. metadata-eval 99.6%

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

   12. metadata-eval 99.6%

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

   13. unsub-neg 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 72.8%

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

6. Final simplification 72.8%

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

Alternative 8: 69.0% 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. remove-double-neg 99.6%

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

   2. associate--l+ 99.6%

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

   3. remove-double-neg 99.6%

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

   4. sub-neg 99.6%

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

   5. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 72.8%

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

6. Final simplification 72.8%

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

Alternative 9: 71.1% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -0.68) (not (<= a 1.8)))
   (- (* a (log t)) t)
   (- (log (* (* y z) (pow t (+ a -0.5)))) t)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -0.680000000000000049 or 1.80000000000000004 < a

   1. Initial program 99.7%

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

      1. remove-double-neg 99.7%

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

      2. associate--l+ 99.7%

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

      3. remove-double-neg 99.7%

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

      4. sub-neg 99.7%

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

      5. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in x around 0 77.1%

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

   6. Taylor expanded in a around inf 97.3%

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

      1. *-commutative 97.3%

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

   8. Simplified 97.3%

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

   if -0.680000000000000049 < a < 1.80000000000000004

   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. remove-double-neg 99.6%

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

      2. associate--l+ 99.6%

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

      3. remove-double-neg 99.6%

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

      4. sub-neg 99.6%

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

      5. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 68.5%

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

      1. *-un-lft-identity 68.5%

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

      2. add-log-exp 60.7%

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

      3. sum-log 46.8%

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

      4. exp-sum 46.8%

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

      5. add-exp-log 46.8%

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

      6. sub-neg 46.8%

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

      7. metadata-eval 46.8%

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

      8. exp-to-pow 46.9%

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

   7. Applied egg-rr 46.9%

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

      1. *-lft-identity 46.9%

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

      2. associate-*r* 49.2%

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

      3. *-commutative 49.2%

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

   9. Simplified 49.2%

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

4. Final simplification 73.3%

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

Alternative 10: 86.6% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 105

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-undefine 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around 0 97.9%

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

      1. associate--l+ 97.9%

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

      2. +-commutative 97.9%

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

   7. Simplified 97.9%

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

      1. associate-+r- 97.9%

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

      2. +-commutative 97.9%

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

      3. sum-log 72.5%

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

      4. +-commutative 72.5%

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

   9. Applied egg-rr 72.5%

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

   if 105 < 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. remove-double-neg 99.9%

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

      2. associate--l+ 99.9%

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

      3. remove-double-neg 99.9%

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

      4. sub-neg 99.9%

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

      5. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 81.9%

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

   6. Taylor expanded in a around inf 99.0%

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

      1. *-commutative 99.0%

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

   8. Simplified 99.0%

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

4. Final simplification 85.3%

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

Alternative 11: 70.7% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.9000000000000001e-4

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-undefine 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around inf 73.6%

      \[\leadsto \log \left(x + y\right) + \color{blue}{t \cdot \left(\frac{\log z}{t} - \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 73.6%

         \[\leadsto \log \left(x + y\right) + t \cdot \left(\frac{\log z}{t} - \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 73.6%

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

      3. associate-/l* 73.5%

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

      4. log-rec 73.5%

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

   7. Simplified 73.5%

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

   8. Taylor expanded in a around inf 32.4%

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

      1. associate-/l* 32.3%

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

   10. Simplified 32.3%

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

   11. Taylor expanded in x around 0 41.0%

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

       1. +-commutative 41.0%

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

       2. *-commutative 41.0%

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

   13. Simplified 41.0%

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

   if 1.9000000000000001e-4 < t

   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. remove-double-neg 99.8%

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

      2. associate--l+ 99.9%

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

      3. remove-double-neg 99.9%

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

      4. sub-neg 99.9%

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

      5. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 81.4%

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

   6. Taylor expanded in a around inf 97.5%

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

      1. *-commutative 97.5%

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

   8. Simplified 97.5%

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

4. Final simplification 68.6%

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

Alternative 12: 77.8% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -0.00132 \lor \neg \left(a \leq 2.3\right):\\ \;\;\;\;a \cdot \log t - t\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -0.00132) (not (<= a 2.3)))
   (- (* a (log t)) t)
   (- (log (+ x y)) t)))

C

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

Python

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

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -0.00132) || !(a <= 2.3))
		tmp = Float64(Float64(a * log(t)) - t);
	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 <= -0.00132) || ~((a <= 2.3)))
		tmp = (a * log(t)) - t;
	else
		tmp = log((x + y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -0.00132 or 2.2999999999999998 < 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. remove-double-neg 99.6%

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

      2. associate--l+ 99.6%

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

      3. remove-double-neg 99.6%

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

      4. sub-neg 99.6%

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

      5. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 77.3%

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

   6. Taylor expanded in a around inf 96.6%

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

      1. *-commutative 96.6%

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

   8. Simplified 96.6%

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

   if -0.00132 < a < 2.2999999999999998

   1. Initial program 99.6%

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

      1. associate-+l- 99.6%

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

      2. associate--l+ 99.6%

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

      3. sub-neg 99.6%

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

      4. +-commutative 99.6%

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

      5. *-commutative 99.6%

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

      6. distribute-rgt-neg-in 99.6%

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

      7. fma-undefine 99.6%

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

      8. sub-neg 99.6%

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

      9. +-commutative 99.6%

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

      10. distribute-neg-in 99.6%

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

      11. metadata-eval 99.6%

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

      12. metadata-eval 99.6%

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

      13. unsub-neg 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in t around inf 98.8%

      \[\leadsto \log \left(x + y\right) + \color{blue}{t \cdot \left(\frac{\log z}{t} - \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 98.8%

         \[\leadsto \log \left(x + y\right) + t \cdot \left(\frac{\log z}{t} - \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 98.8%

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

      3. associate-/l* 98.8%

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

      4. log-rec 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in t around inf 57.0%

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

      1. mul-1-neg 57.0%

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

   10. Simplified 57.0%

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

4. Final simplification 76.9%

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

Alternative 13: 40.6% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 2.09999999999999994e-8

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-undefine 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in t around inf 73.0%

      \[\leadsto \log \left(x + y\right) + \color{blue}{t \cdot \left(\frac{\log z}{t} - \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 73.0%

         \[\leadsto \log \left(x + y\right) + t \cdot \left(\frac{\log z}{t} - \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 73.0%

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

      3. associate-/l* 72.9%

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

      4. log-rec 72.9%

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

   7. Simplified 72.9%

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

   8. Taylor expanded in a around inf 32.6%

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

      1. associate-/l* 32.4%

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

   10. Simplified 32.4%

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

   11. Taylor expanded in a around 0 9.7%

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

       1. +-commutative 9.7%

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

   13. Simplified 9.7%

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

   if 2.09999999999999994e-8 < t

   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 73.2%

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

      1. neg-mul-1 73.2%

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

   7. Simplified 73.2%

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

4. Final simplification 41.5%

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

Alternative 14: 62.3% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 0.00019:\\ \;\;\;\;a \cdot \log t\\ \mathbf{else}:\\ \;\;\;\;-t\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.9000000000000001e-4

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

      2. associate--l+ 99.4%

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

      3. sub-neg 99.4%

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

      4. +-commutative 99.4%

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

      5. *-commutative 99.4%

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

      6. distribute-rgt-neg-in 99.4%

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

      7. fma-undefine 99.4%

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

      8. sub-neg 99.4%

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

      9. +-commutative 99.4%

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

      10. distribute-neg-in 99.4%

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

      11. metadata-eval 99.4%

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

      12. metadata-eval 99.4%

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

      13. unsub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in a around inf 51.1%

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

      1. *-commutative 51.1%

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

   7. Simplified 51.1%

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

   if 1.9000000000000001e-4 < t

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

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

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

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

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

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

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

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

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

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

      1. neg-mul-1 74.8%

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

   7. Simplified 74.8%

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

4. Final simplification 62.7%

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

Alternative 15: 74.9% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(a * N[Log[t], $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. remove-double-neg 99.6%

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

   2. associate--l+ 99.6%

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

   3. remove-double-neg 99.6%

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

   4. sub-neg 99.6%

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

   5. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 72.8%

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

6. Taylor expanded in a around inf 73.7%

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

   1. *-commutative 73.7%

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

8. Simplified 73.7%

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

9. Final simplification 73.7%

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

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

   2. associate--l+ 99.6%

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

   3. sub-neg 99.6%

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

   4. +-commutative 99.6%

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

   5. *-commutative 99.6%

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

   6. distribute-rgt-neg-in 99.6%

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

   7. fma-undefine 99.6%

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

   8. sub-neg 99.6%

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

   9. +-commutative 99.6%

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

   10. distribute-neg-in 99.6%

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

   11. metadata-eval 99.6%

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

   12. metadata-eval 99.6%

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

   13. unsub-neg 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in t around inf 38.0%

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

   1. neg-mul-1 38.0%

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

7. Simplified 38.0%

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

8. Final simplification 38.0%

   \[\leadsto -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 2024071 
(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))))