Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2

Percentage Accurate: 99.6% → 99.6%

Time: 16.3s

Alternatives: 16

Speedup: N/A×

• Could not converge on a ground truth

  1. x = -2.1541959858649852e-142
  2. y = 5.196099816245286e-97
  3. z = 7.009601569709487e+234
  4. t = 8.258750579722807e+201
  5. a = -4.833777425623611e-220

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, 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. associate--l+ 99.6%

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

   2. sub-neg 99.6%

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

   3. metadata-eval 99.6%

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

3. Simplified 99.6%

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

Alternative 2: 83.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log t \cdot \left(a - 0.5\right)\\ t_2 := \log \left(x + y\right) + \log z\\ t_3 := \log z + \left(\log y + t\_1\right)\\ \mathbf{if}\;t\_2 \leq -750:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 670:\\ \;\;\;\;t\_1 + \left(\log \left(\left(x + y\right) \cdot z\right) - t\right)\\ \mathbf{elif}\;t\_2 \leq 1050:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\left(\log z - t\right) + \left(\log y + -0.5 \cdot \log t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (log t) (- a 0.5)))
        (t_2 (+ (log (+ x y)) (log z)))
        (t_3 (+ (log z) (+ (log y) t_1))))
   (if (<= t_2 -750.0)
     t_3
     (if (<= t_2 670.0)
       (+ t_1 (- (log (* (+ x y) z)) t))
       (if (<= t_2 1050.0)
         t_3
         (+ (- (log z) t) (+ (log y) (* -0.5 (log t)))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = log(t) * (a - 0.5);
	double t_2 = log((x + y)) + log(z);
	double t_3 = log(z) + (log(y) + t_1);
	double tmp;
	if (t_2 <= -750.0) {
		tmp = t_3;
	} else if (t_2 <= 670.0) {
		tmp = t_1 + (log(((x + y) * z)) - t);
	} else if (t_2 <= 1050.0) {
		tmp = t_3;
	} else {
		tmp = (log(z) - t) + (log(y) + (-0.5 * log(t)));
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x, y, z, t, a):
	t_1 = math.log(t) * (a - 0.5)
	t_2 = math.log((x + y)) + math.log(z)
	t_3 = math.log(z) + (math.log(y) + t_1)
	tmp = 0
	if t_2 <= -750.0:
		tmp = t_3
	elif t_2 <= 670.0:
		tmp = t_1 + (math.log(((x + y) * z)) - t)
	elif t_2 <= 1050.0:
		tmp = t_3
	else:
		tmp = (math.log(z) - t) + (math.log(y) + (-0.5 * math.log(t)))
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(log(t) * Float64(a - 0.5))
	t_2 = Float64(log(Float64(x + y)) + log(z))
	t_3 = Float64(log(z) + Float64(log(y) + t_1))
	tmp = 0.0
	if (t_2 <= -750.0)
		tmp = t_3;
	elseif (t_2 <= 670.0)
		tmp = Float64(t_1 + Float64(log(Float64(Float64(x + y) * z)) - t));
	elseif (t_2 <= 1050.0)
		tmp = t_3;
	else
		tmp = Float64(Float64(log(z) - t) + Float64(log(y) + Float64(-0.5 * log(t))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = log(t) * (a - 0.5);
	t_2 = log((x + y)) + log(z);
	t_3 = log(z) + (log(y) + t_1);
	tmp = 0.0;
	if (t_2 <= -750.0)
		tmp = t_3;
	elseif (t_2 <= 670.0)
		tmp = t_1 + (log(((x + y) * z)) - t);
	elseif (t_2 <= 1050.0)
		tmp = t_3;
	else
		tmp = (log(z) - t) + (log(y) + (-0.5 * log(t)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.7%

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

      1. associate--l+ 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. fma-define 99.8%

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

      6. sub-neg 99.8%

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

      7. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 71.8%

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

   6. Taylor expanded in t around 0 50.3%

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

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

   1. Initial program 99.6%

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

      1. sum-log 99.7%

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

   4. Applied egg-rr 99.7%

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

   if 1050 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z))

   1. Initial program 100.0%

      \[\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+ 100.0%

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

      2. +-commutative 100.0%

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

      3. associate-+l+ 100.0%

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

      4. +-commutative 100.0%

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

      5. fma-define 100.0%

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

      6. sub-neg 100.0%

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

      7. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 66.7%

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

   6. Taylor expanded in a around 0 58.6%

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

      1. *-commutative 58.6%

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

   8. Simplified 58.6%

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

4. Final simplification 87.8%

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

Alternative 3: 83.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. associate--l+ 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. fma-define 99.8%

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

      6. sub-neg 99.8%

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

      7. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 70.8%

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

   6. Taylor expanded in t around 0 45.7%

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

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

   1. Initial program 99.6%

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

      1. sum-log 99.7%

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

   4. Applied egg-rr 99.7%

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

4. Final simplification 86.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 670\right):\\ \;\;\;\;\log z + \left(\log y + \log t \cdot \left(a - 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot \left(a - 0.5\right) + \left(\log \left(\left(x + y\right) \cdot z\right) - t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.7%

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

      1. associate--l+ 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. fma-define 99.8%

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

      6. sub-neg 99.8%

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

      7. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 70.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 t around 0 45.6%

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

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

   1. Initial program 99.6%

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

      1. sum-log 99.7%

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

   4. Applied egg-rr 99.7%

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

4. Final simplification 86.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 670\right):\\ \;\;\;\;\log y + \left(\log z + \log t \cdot \left(a - 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log t \cdot \left(a - 0.5\right) + \left(\log \left(\left(x + y\right) \cdot z\right) - t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 79.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (log (+ x y)) (log z))))
   (if (<= t_1 670.0)
     (+ (* (log t) (- a 0.5)) (- (log (* (+ x y) z)) t))
     (if (<= t_1 1050.0)
       (+ (log z) (+ (log y) (* a (log t))))
       (- (+ (log z) (log y)) 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 <= 670.0) {
		tmp = (log(t) * (a - 0.5)) + (log(((x + y) * z)) - t);
	} else if (t_1 <= 1050.0) {
		tmp = log(z) + (log(y) + (a * log(t)));
	} else {
		tmp = (log(z) + log(y)) - t;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = Math.log((x + y)) + Math.log(z);
	double tmp;
	if (t_1 <= 670.0) {
		tmp = (Math.log(t) * (a - 0.5)) + (Math.log(((x + y) * z)) - t);
	} else if (t_1 <= 1050.0) {
		tmp = Math.log(z) + (Math.log(y) + (a * Math.log(t)));
	} else {
		tmp = (Math.log(z) + Math.log(y)) - 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 <= 670.0:
		tmp = (math.log(t) * (a - 0.5)) + (math.log(((x + y) * z)) - t)
	elif t_1 <= 1050.0:
		tmp = math.log(z) + (math.log(y) + (a * math.log(t)))
	else:
		tmp = (math.log(z) + math.log(y)) - 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 <= 670.0)
		tmp = Float64(Float64(log(t) * Float64(a - 0.5)) + Float64(log(Float64(Float64(x + y) * z)) - t));
	elseif (t_1 <= 1050.0)
		tmp = Float64(log(z) + Float64(log(y) + Float64(a * log(t))));
	else
		tmp = Float64(Float64(log(z) + log(y)) - 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 <= 670.0)
		tmp = (log(t) * (a - 0.5)) + (log(((x + y) * z)) - t);
	elseif (t_1 <= 1050.0)
		tmp = log(z) + (log(y) + (a * log(t)));
	else
		tmp = (log(z) + log(y)) - 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[LessEqual[t$95$1, 670.0], N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] + N[(N[Log[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1050.0], N[(N[Log[z], $MachinePrecision] + N[(N[Log[y], $MachinePrecision] + N[(a * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[z], $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 670

   1. Initial program 99.6%

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

      1. sum-log 96.8%

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

   4. Applied egg-rr 96.8%

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

   if 670 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 1050

   1. Initial program 99.7%

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

      1. associate-+l- 99.7%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-undefine 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in a around inf 56.1%

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

      1. mul-1-neg 56.1%

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

      2. *-commutative 56.1%

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

      3. distribute-rgt-neg-in 56.1%

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

   7. Simplified 56.1%

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

   8. Taylor expanded in x around 0 40.4%

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

      1. +-commutative 40.4%

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

      2. remove-double-neg 40.4%

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

      3. log-rec 40.4%

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

      4. mul-1-neg 40.4%

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

      5. associate--l+ 40.4%

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

      6. sub-neg 40.4%

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

      7. mul-1-neg 40.4%

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

      8. log-rec 40.4%

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

      9. remove-double-neg 40.4%

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

      10. mul-1-neg 40.4%

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

      11. remove-double-neg 40.4%

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

   10. Simplified 40.4%

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

   if 1050 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z))

   1. Initial program 100.0%

      \[\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+ 100.0%

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

      2. +-commutative 100.0%

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

      3. associate-+l+ 100.0%

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

      4. +-commutative 100.0%

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

      5. fma-define 100.0%

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

      6. sub-neg 100.0%

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

      7. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 66.7%

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

   6. Taylor expanded in a around inf 54.1%

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

   7. Taylor expanded in a around 0 46.1%

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

      1. +-commutative 46.1%

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

   9. Simplified 46.1%

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

4. Final simplification 84.3%

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

Alternative 6: 82.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (log (+ x y)) (log z))))
   (if (<= t_1 711.5)
     (+ (* (log t) (- a 0.5)) (- (log (* (+ x y) z)) t))
     (if (<= t_1 887.5) (* a (log t)) (- (+ (log z) (log y)) 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 <= 711.5) {
		tmp = (log(t) * (a - 0.5)) + (log(((x + y) * z)) - t);
	} else if (t_1 <= 887.5) {
		tmp = a * log(t);
	} else {
		tmp = (log(z) + log(y)) - t;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = Math.log((x + y)) + Math.log(z);
	double tmp;
	if (t_1 <= 711.5) {
		tmp = (Math.log(t) * (a - 0.5)) + (Math.log(((x + y) * z)) - t);
	} else if (t_1 <= 887.5) {
		tmp = a * Math.log(t);
	} else {
		tmp = (Math.log(z) + Math.log(y)) - 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 <= 711.5:
		tmp = (math.log(t) * (a - 0.5)) + (math.log(((x + y) * z)) - t)
	elif t_1 <= 887.5:
		tmp = a * math.log(t)
	else:
		tmp = (math.log(z) + math.log(y)) - 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 <= 711.5)
		tmp = Float64(Float64(log(t) * Float64(a - 0.5)) + Float64(log(Float64(Float64(x + y) * z)) - t));
	elseif (t_1 <= 887.5)
		tmp = Float64(a * log(t));
	else
		tmp = Float64(Float64(log(z) + log(y)) - 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 <= 711.5)
		tmp = (log(t) * (a - 0.5)) + (log(((x + y) * z)) - t);
	elseif (t_1 <= 887.5)
		tmp = a * log(t);
	else
		tmp = (log(z) + log(y)) - 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[LessEqual[t$95$1, 711.5], N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] + N[(N[Log[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 887.5], N[(a * N[Log[t], $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[z], $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 711.5

   1. Initial program 99.6%

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

      1. sum-log 95.9%

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

   4. Applied egg-rr 95.9%

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

   if 711.5 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 887.5

   1. Initial program 99.7%

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

      1. associate-+l- 99.7%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-undefine 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in a around inf 57.3%

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

      1. *-commutative 57.3%

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

   7. Simplified 57.3%

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

   if 887.5 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z))

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. fma-define 99.9%

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

      6. sub-neg 99.9%

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

      7. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 74.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 61.5%

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

   7. Taylor expanded in a around 0 40.7%

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

      1. +-commutative 40.7%

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

   9. Simplified 40.7%

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

4. Final simplification 86.1%

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

Alternative 7: 56.2% 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 711.5:\\ \;\;\;\;\left(\log t \cdot \left(a - 0.5\right) + \log \left(y \cdot z\right)\right) - t\\ \mathbf{elif}\;t\_1 \leq 887.5:\\ \;\;\;\;a \cdot \log t\\ \mathbf{else}:\\ \;\;\;\;\left(\log z + \log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (log (+ x y)) (log z))))
   (if (<= t_1 711.5)
     (- (+ (* (log t) (- a 0.5)) (log (* y z))) t)
     (if (<= t_1 887.5) (* a (log t)) (- (+ (log z) (log y)) 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 <= 711.5) {
		tmp = ((log(t) * (a - 0.5)) + log((y * z))) - t;
	} else if (t_1 <= 887.5) {
		tmp = a * log(t);
	} else {
		tmp = (log(z) + log(y)) - t;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = Math.log((x + y)) + Math.log(z);
	double tmp;
	if (t_1 <= 711.5) {
		tmp = ((Math.log(t) * (a - 0.5)) + Math.log((y * z))) - t;
	} else if (t_1 <= 887.5) {
		tmp = a * Math.log(t);
	} else {
		tmp = (Math.log(z) + Math.log(y)) - 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 <= 711.5:
		tmp = ((math.log(t) * (a - 0.5)) + math.log((y * z))) - t
	elif t_1 <= 887.5:
		tmp = a * math.log(t)
	else:
		tmp = (math.log(z) + math.log(y)) - 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 <= 711.5)
		tmp = Float64(Float64(Float64(log(t) * Float64(a - 0.5)) + log(Float64(y * z))) - t);
	elseif (t_1 <= 887.5)
		tmp = Float64(a * log(t));
	else
		tmp = Float64(Float64(log(z) + log(y)) - 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 <= 711.5)
		tmp = ((log(t) * (a - 0.5)) + log((y * z))) - t;
	elseif (t_1 <= 887.5)
		tmp = a * log(t);
	else
		tmp = (log(z) + log(y)) - 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[LessEqual[t$95$1, 711.5], N[(N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] + N[Log[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], If[LessEqual[t$95$1, 887.5], N[(a * N[Log[t], $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[z], $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 711.5

   1. Initial program 99.6%

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

      1. associate--l+ 99.6%

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

      2. sub-neg 99.6%

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

      3. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

      1. add-cube-cbrt 97.9%

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

      2. pow3 97.9%

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

      3. +-commutative 97.9%

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

      4. *-commutative 97.9%

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

      5. fma-define 97.9%

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

      6. associate-+r- 97.9%

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

      7. sum-log 94.3%

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

   6. Applied egg-rr 94.3%

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

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

   if 711.5 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 887.5

   1. Initial program 99.7%

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

      1. associate-+l- 99.7%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-undefine 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in a around inf 57.3%

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

      1. *-commutative 57.3%

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

   7. Simplified 57.3%

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

   if 887.5 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z))

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. fma-define 99.9%

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

      6. sub-neg 99.9%

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

      7. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 74.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 61.5%

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

   7. Taylor expanded in a around 0 40.7%

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

      1. +-commutative 40.7%

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

   9. Simplified 40.7%

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

4. Final simplification 60.8%

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

Alternative 8: 68.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 0.429999999999999993

   1. Initial program 99.4%

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

      1. associate--l+ 99.4%

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

      2. +-commutative 99.4%

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

      3. associate-+l+ 99.4%

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

      4. +-commutative 99.4%

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

      5. fma-define 99.4%

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

      6. sub-neg 99.4%

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

      7. metadata-eval 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in x around 0 59.9%

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

   6. Taylor expanded in t around 0 58.4%

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

   if 0.429999999999999993 < t

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. fma-define 99.9%

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

      6. sub-neg 99.9%

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

      7. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 82.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 82.7%

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

Alternative 9: 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. associate--l+ 99.6%

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

   2. +-commutative 99.6%

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

   3. associate-+l+ 99.6%

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

   4. +-commutative 99.6%

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

   5. fma-define 99.6%

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

   6. sub-neg 99.6%

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

   7. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 71.4%

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

Alternative 10: 69.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate--l+ 99.6%

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

   2. +-commutative 99.6%

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

   3. associate-+l+ 99.6%

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

   4. +-commutative 99.6%

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

   5. fma-define 99.6%

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

   6. sub-neg 99.6%

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

   7. metadata-eval 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in x around 0 71.5%

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

Alternative 11: 58.8% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (- a 0.5) -100000.0) (not (<= (- a 0.5) -0.4)))
   (* a (log 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.5) <= -100000.0) || !((a - 0.5) <= -0.4)) {
		tmp = a * log(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.5d0) <= (-100000.0d0)) .or. (.not. ((a - 0.5d0) <= (-0.4d0)))) then
        tmp = a * log(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.5) <= -100000.0) || !((a - 0.5) <= -0.4)) {
		tmp = a * Math.log(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.5) <= -100000.0) or not ((a - 0.5) <= -0.4):
		tmp = a * math.log(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 ((Float64(a - 0.5) <= -100000.0) || !(Float64(a - 0.5) <= -0.4))
		tmp = Float64(a * log(t));
	else
		tmp = Float64(log(Float64(y * Float64(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.5) <= -100000.0) || ~(((a - 0.5) <= -0.4)))
		tmp = a * log(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[N[(a - 0.5), $MachinePrecision], -100000.0], N[Not[LessEqual[N[(a - 0.5), $MachinePrecision], -0.4]], $MachinePrecision]], N[(a * N[Log[t], $MachinePrecision]), $MachinePrecision], N[(N[Log[N[(y * N[(z * N[Power[t, N[(a + -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 a #s(literal 1/2 binary64)) < -1e5 or -0.40000000000000002 < (-.f64 a #s(literal 1/2 binary64))

   1. Initial program 99.7%

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

      1. associate-+l- 99.7%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-undefine 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in a around inf 73.4%

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

      1. *-commutative 73.4%

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

   7. Simplified 73.4%

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

   if -1e5 < (-.f64 a #s(literal 1/2 binary64)) < -0.40000000000000002

   1. Initial program 99.6%

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

      1. associate--l+ 99.6%

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

      2. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 67.0%

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

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

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

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

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

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

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

         \[\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. pow-to-exp 44.1%

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

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

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

   9. Simplified 44.1%

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

4. Final simplification 58.2%

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

Alternative 12: 65.7% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1.55e+18) (not (<= a 1e+79)))
   (* a (log t))
   (+ (log (+ x y)) (- (log z) t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.55e+18) || !(a <= 1e+79)) {
		tmp = a * log(t);
	} else {
		tmp = log((x + y)) + (log(z) - t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-1.55d+18)) .or. (.not. (a <= 1d+79))) then
        tmp = a * log(t)
    else
        tmp = log((x + y)) + (log(z) - t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.55e+18) || !(a <= 1e+79)) {
		tmp = a * Math.log(t);
	} else {
		tmp = Math.log((x + y)) + (Math.log(z) - t);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -1.55e+18) || ~((a <= 1e+79)))
		tmp = a * log(t);
	else
		tmp = log((x + y)) + (log(z) - t);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.55e18 or 9.99999999999999967e78 < a

   1. Initial program 99.7%

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

      1. associate-+l- 99.7%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-undefine 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in a around inf 80.5%

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

      1. *-commutative 80.5%

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

   7. Simplified 80.5%

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

   if -1.55e18 < a < 9.99999999999999967e78

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

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

4. Final simplification 67.2%

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

Alternative 13: 57.1% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.1 \cdot 10^{+15} \lor \neg \left(a \leq 2.5 \cdot 10^{+79}\right):\\ \;\;\;\;a \cdot \log t\\ \mathbf{else}:\\ \;\;\;\;\left(\log z + \log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -4.1e+15) (not (<= a 2.5e+79)))
   (* a (log t))
   (- (+ (log z) (log y)) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.1e+15) || !(a <= 2.5e+79)) {
		tmp = a * log(t);
	} else {
		tmp = (log(z) + log(y)) - t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-4.1d+15)) .or. (.not. (a <= 2.5d+79))) then
        tmp = a * log(t)
    else
        tmp = (log(z) + log(y)) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.1e+15) || !(a <= 2.5e+79)) {
		tmp = a * Math.log(t);
	} else {
		tmp = (Math.log(z) + Math.log(y)) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -4.1e+15) or not (a <= 2.5e+79):
		tmp = a * math.log(t)
	else:
		tmp = (math.log(z) + math.log(y)) - t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -4.1e+15) || !(a <= 2.5e+79))
		tmp = Float64(a * log(t));
	else
		tmp = Float64(Float64(log(z) + log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -4.1e+15) || ~((a <= 2.5e+79)))
		tmp = a * log(t);
	else
		tmp = (log(z) + log(y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -4.1e+15], N[Not[LessEqual[a, 2.5e+79]], $MachinePrecision]], N[(a * N[Log[t], $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[z], $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -4.1e15 or 2.5e79 < a

   1. Initial program 99.7%

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

      1. associate-+l- 99.7%

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

      2. associate--l+ 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-undefine 99.7%

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

      8. sub-neg 99.7%

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

      9. +-commutative 99.7%

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

      10. distribute-neg-in 99.7%

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

      11. metadata-eval 99.7%

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

      12. metadata-eval 99.7%

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

      13. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in a around inf 80.5%

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

      1. *-commutative 80.5%

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

   7. Simplified 80.5%

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

   if -4.1e15 < a < 2.5e79

   1. Initial program 99.6%

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

      1. associate--l+ 99.6%

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

      2. +-commutative 99.6%

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

      3. associate-+l+ 99.6%

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

      4. +-commutative 99.6%

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

      5. fma-define 99.6%

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

      6. sub-neg 99.6%

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

      7. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around 0 69.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 51.5%

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

   7. Taylor expanded in a around 0 48.0%

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

      1. +-commutative 48.0%

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

   9. Simplified 48.0%

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

4. Final simplification 60.8%

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

Alternative 14: 61.9% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= 5.8e+16)
		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 <= 5.8e+16)
		tmp = a * log(t);
	else
		tmp = -t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 5.8e16

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

      1. *-commutative 48.9%

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

   7. Simplified 48.9%

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

   if 5.8e16 < t

   1. Initial program 99.9%

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

      1. associate-+l- 99.9%

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

      2. associate--l+ 99.9%

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

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

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

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

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

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

      1. neg-mul-1 77.3%

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

   7. Simplified 77.3%

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

4. Final simplification 62.7%

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

Alternative 15: 37.8% 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 39.3%

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

   1. neg-mul-1 39.3%

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

7. Simplified 39.3%

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

Alternative 16: 2.4% accurate, 313.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

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

C

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

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 = 0.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := 0.0

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

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

   1. neg-mul-1 39.3%

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

7. Simplified 39.3%

   \[\leadsto \color{blue}{-t} \]
8. Step-by-step derivation

   1. expm1-log1p-u 1.5%

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

   2. expm1-undefine 1.4%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(-t\right)} - 1} \]

9. Applied egg-rr 1.4%

   \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(-t\right)} - 1} \]
10. Step-by-step derivation

    1. sub-neg 1.4%

       \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(-t\right)} + \left(-1\right)} \]

    2. log1p-undefine 1.4%

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

    3. rem-exp-log 39.2%

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

    4. unsub-neg 39.2%

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

    5. metadata-eval 39.2%

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

11. Simplified 39.2%

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

12. Taylor expanded in t around 0 2.4%

    \[\leadsto \color{blue}{1} + -1 \]
13. Step-by-step derivation

    1. metadata-eval 2.4%

       \[\leadsto \color{blue}{0} \]

14. Applied egg-rr 2.4%

    \[\leadsto \color{blue}{0} \]
15. Add Preprocessing

Developer Target 1: 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 2024180 
(FPCore (x y z t a)
  :name "Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2"
  :precision binary64

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

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