Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, B

Percentage Accurate: 99.8% → 99.8%

Time: 17.9s

Alternatives: 18

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.1%

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

   1. associate-+l+ 99.1%

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

   2. associate-+l+ 99.1%

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

   3. +-commutative 99.1%

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

   4. associate-+l+ 99.1%

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

   5. +-commutative 99.1%

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

   6. associate-+l+ 99.1%

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

   7. +-commutative 99.1%

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

   8. associate-+l+ 99.1%

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

   9. +-commutative 99.1%

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

   10. fma-define 99.1%

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

   11. +-commutative 99.1%

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

   12. fma-define 99.5%

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

3. Simplified 99.5%

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

Alternative 2: 88.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log c \cdot \left(b - 0.5\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+166}:\\ \;\;\;\;y \cdot i + \left(z + b \cdot \log c\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+84}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + t\_1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (log c) (- b 0.5))))
   (if (<= t_1 -5e+166)
     (+ (* y i) (+ z (* b (log c))))
     (if (<= t_1 5e+84)
       (+ a (+ t (+ z (+ (* x (log y)) (* y i)))))
       (+ a (+ t (+ z t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = log(c) * (b - 0.5);
	double tmp;
	if (t_1 <= -5e+166) {
		tmp = (y * i) + (z + (b * log(c)));
	} else if (t_1 <= 5e+84) {
		tmp = a + (t + (z + ((x * log(y)) + (y * i))));
	} else {
		tmp = a + (t + (z + t_1));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: t_1
    real(8) :: tmp
    t_1 = log(c) * (b - 0.5d0)
    if (t_1 <= (-5d+166)) then
        tmp = (y * i) + (z + (b * log(c)))
    else if (t_1 <= 5d+84) then
        tmp = a + (t + (z + ((x * log(y)) + (y * i))))
    else
        tmp = a + (t + (z + t_1))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = Math.log(c) * (b - 0.5);
	double tmp;
	if (t_1 <= -5e+166) {
		tmp = (y * i) + (z + (b * Math.log(c)));
	} else if (t_1 <= 5e+84) {
		tmp = a + (t + (z + ((x * Math.log(y)) + (y * i))));
	} else {
		tmp = a + (t + (z + t_1));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = math.log(c) * (b - 0.5)
	tmp = 0
	if t_1 <= -5e+166:
		tmp = (y * i) + (z + (b * math.log(c)))
	elif t_1 <= 5e+84:
		tmp = a + (t + (z + ((x * math.log(y)) + (y * i))))
	else:
		tmp = a + (t + (z + t_1))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(log(c) * Float64(b - 0.5))
	tmp = 0.0
	if (t_1 <= -5e+166)
		tmp = Float64(Float64(y * i) + Float64(z + Float64(b * log(c))));
	elseif (t_1 <= 5e+84)
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(x * log(y)) + Float64(y * i)))));
	else
		tmp = Float64(a + Float64(t + Float64(z + t_1)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = log(c) * (b - 0.5);
	tmp = 0.0;
	if (t_1 <= -5e+166)
		tmp = (y * i) + (z + (b * log(c)));
	elseif (t_1 <= 5e+84)
		tmp = a + (t + (z + ((x * log(y)) + (y * i))));
	else
		tmp = a + (t + (z + t_1));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+166], N[(N[(y * i), $MachinePrecision] + N[(z + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+84], N[(a + N[(t + N[(z + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c)) < -5.0000000000000002e166

   1. Initial program 99.8%

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

      1. add-cbrt-cube 99.8%

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

      2. pow3 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in b around inf 99.8%

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

   6. Taylor expanded in z around inf 84.5%

      \[\leadsto \left(\color{blue}{z} + b \cdot \log c\right) + y \cdot i \]

   if -5.0000000000000002e166 < (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c)) < 5.0000000000000001e84

   1. Initial program 99.3%

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

      1. add-cbrt-cube 99.3%

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

      2. pow3 99.3%

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

   4. Applied egg-rr 99.3%

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

   5. Taylor expanded in b around inf 97.2%

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

   6. Taylor expanded in b around 0 94.1%

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

   if 5.0000000000000001e84 < (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))

   1. Initial program 97.7%

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

      1. associate-+l+ 97.7%

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

      2. associate-+l+ 97.7%

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

      3. +-commutative 97.7%

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

      4. associate-+l+ 97.7%

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

      5. +-commutative 97.7%

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

      6. associate-+l+ 97.7%

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

      7. +-commutative 97.7%

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

      8. associate-+l+ 97.7%

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

      9. +-commutative 97.7%

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

      10. fma-define 97.7%

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

      11. +-commutative 97.7%

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

      12. fma-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in x around 0 94.1%

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

   6. Taylor expanded in y around 0 84.7%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\log c \cdot \left(b - 0.5\right) \leq -5 \cdot 10^{+166}:\\ \;\;\;\;y \cdot i + \left(z + b \cdot \log c\right)\\ \mathbf{elif}\;\log c \cdot \left(b - 0.5\right) \leq 5 \cdot 10^{+84}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \log c \cdot \left(b - 0.5\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.3 \cdot 10^{+164}:\\ \;\;\;\;a + \left(t + x \cdot \left(\left(\log y + \frac{z}{x}\right) + i \cdot \frac{y}{x}\right)\right)\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{+149}:\\ \;\;\;\;\mathsf{fma}\left(y, i, a + \left(t + \left(z + \log c \cdot \left(b - 0.5\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + b \cdot \log c\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= x -4.3e+164)
   (+ a (+ t (* x (+ (+ (log y) (/ z x)) (* i (/ y x))))))
   (if (<= x 2.3e+149)
     (fma y i (+ a (+ t (+ z (* (log c) (- b 0.5))))))
     (+ a (+ t (+ z (+ (* x (log y)) (* b (log c)))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (x <= -4.3e+164) {
		tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))));
	} else if (x <= 2.3e+149) {
		tmp = fma(y, i, (a + (t + (z + (log(c) * (b - 0.5))))));
	} else {
		tmp = a + (t + (z + ((x * log(y)) + (b * log(c)))));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (x <= -4.3e+164)
		tmp = Float64(a + Float64(t + Float64(x * Float64(Float64(log(y) + Float64(z / x)) + Float64(i * Float64(y / x))))));
	elseif (x <= 2.3e+149)
		tmp = fma(y, i, Float64(a + Float64(t + Float64(z + Float64(log(c) * Float64(b - 0.5))))));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(x * log(y)) + Float64(b * log(c))))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[x, -4.3e+164], N[(a + N[(t + N[(x * N[(N[(N[Log[y], $MachinePrecision] + N[(z / x), $MachinePrecision]), $MachinePrecision] + N[(i * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.3e+149], N[(y * i + N[(a + N[(t + N[(z + N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.3e164

   1. Initial program 93.3%

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

      1. add-cbrt-cube 93.3%

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

      2. pow3 93.3%

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

   4. Applied egg-rr 93.3%

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

   5. Taylor expanded in b around inf 93.3%

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

   6. Taylor expanded in b around 0 93.6%

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

   7. Taylor expanded in x around inf 96.8%

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

      1. associate-+r+ 96.8%

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

      2. associate-/l* 96.8%

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

   9. Simplified 96.8%

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

   if -4.3e164 < x < 2.2999999999999998e149

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

      7. +-commutative 99.9%

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

      8. associate-+l+ 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. +-commutative 99.9%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 97.4%

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

   if 2.2999999999999998e149 < x

   1. Initial program 99.6%

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

      1. add-cbrt-cube 99.3%

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

      2. pow3 99.3%

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

   4. Applied egg-rr 99.3%

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

   5. Taylor expanded in b around inf 99.3%

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

   6. Taylor expanded in y around 0 90.6%

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

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.3 \cdot 10^{+164}:\\ \;\;\;\;a + \left(t + x \cdot \left(\left(\log y + \frac{z}{x}\right) + i \cdot \frac{y}{x}\right)\right)\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{+149}:\\ \;\;\;\;\mathsf{fma}\left(y, i, a + \left(t + \left(z + \log c \cdot \left(b - 0.5\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + b \cdot \log c\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 93.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.06 \cdot 10^{+164}:\\ \;\;\;\;a + \left(t + x \cdot \left(\left(\log y + \frac{z}{x}\right) + i \cdot \frac{y}{x}\right)\right)\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{+148}:\\ \;\;\;\;a + \left(t + \left(z + \left(\log c \cdot \left(b - 0.5\right) + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + b \cdot \log c\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= x -1.06e+164)
   (+ a (+ t (* x (+ (+ (log y) (/ z x)) (* i (/ y x))))))
   (if (<= x 8.8e+148)
     (+ a (+ t (+ z (+ (* (log c) (- b 0.5)) (* y i)))))
     (+ a (+ t (+ z (+ (* x (log y)) (* b (log c)))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (x <= -1.06e+164) {
		tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))));
	} else if (x <= 8.8e+148) {
		tmp = a + (t + (z + ((log(c) * (b - 0.5)) + (y * i))));
	} else {
		tmp = a + (t + (z + ((x * log(y)) + (b * log(c)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (x <= (-1.06d+164)) then
        tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))))
    else if (x <= 8.8d+148) then
        tmp = a + (t + (z + ((log(c) * (b - 0.5d0)) + (y * i))))
    else
        tmp = a + (t + (z + ((x * log(y)) + (b * log(c)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (x <= -1.06e+164) {
		tmp = a + (t + (x * ((Math.log(y) + (z / x)) + (i * (y / x)))));
	} else if (x <= 8.8e+148) {
		tmp = a + (t + (z + ((Math.log(c) * (b - 0.5)) + (y * i))));
	} else {
		tmp = a + (t + (z + ((x * Math.log(y)) + (b * Math.log(c)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if x <= -1.06e+164:
		tmp = a + (t + (x * ((math.log(y) + (z / x)) + (i * (y / x)))))
	elif x <= 8.8e+148:
		tmp = a + (t + (z + ((math.log(c) * (b - 0.5)) + (y * i))))
	else:
		tmp = a + (t + (z + ((x * math.log(y)) + (b * math.log(c)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (x <= -1.06e+164)
		tmp = Float64(a + Float64(t + Float64(x * Float64(Float64(log(y) + Float64(z / x)) + Float64(i * Float64(y / x))))));
	elseif (x <= 8.8e+148)
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(log(c) * Float64(b - 0.5)) + Float64(y * i)))));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(x * log(y)) + Float64(b * log(c))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (x <= -1.06e+164)
		tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))));
	elseif (x <= 8.8e+148)
		tmp = a + (t + (z + ((log(c) * (b - 0.5)) + (y * i))));
	else
		tmp = a + (t + (z + ((x * log(y)) + (b * log(c)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[x, -1.06e+164], N[(a + N[(t + N[(x * N[(N[(N[Log[y], $MachinePrecision] + N[(z / x), $MachinePrecision]), $MachinePrecision] + N[(i * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.8e+148], N[(a + N[(t + N[(z + N[(N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.05999999999999997e164

   1. Initial program 93.3%

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

      1. add-cbrt-cube 93.3%

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

      2. pow3 93.3%

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

   4. Applied egg-rr 93.3%

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

   5. Taylor expanded in b around inf 93.3%

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

   6. Taylor expanded in b around 0 93.6%

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

   7. Taylor expanded in x around inf 96.8%

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

      1. associate-+r+ 96.8%

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

      2. associate-/l* 96.8%

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

   9. Simplified 96.8%

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

   if -1.05999999999999997e164 < x < 8.7999999999999995e148

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

      7. +-commutative 99.9%

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

      8. associate-+l+ 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. +-commutative 99.9%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 97.4%

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

   if 8.7999999999999995e148 < x

   1. Initial program 99.6%

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

      1. add-cbrt-cube 99.3%

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

      2. pow3 99.3%

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

   4. Applied egg-rr 99.3%

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

   5. Taylor expanded in b around inf 99.3%

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

   6. Taylor expanded in y around 0 90.6%

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

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.06 \cdot 10^{+164}:\\ \;\;\;\;a + \left(t + x \cdot \left(\left(\log y + \frac{z}{x}\right) + i \cdot \frac{y}{x}\right)\right)\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{+148}:\\ \;\;\;\;a + \left(t + \left(z + \left(\log c \cdot \left(b - 0.5\right) + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + b \cdot \log c\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = ((a + (t + (z + (x * log(y))))) + (log(c) * (b - 0.5d0))) + (y * i)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.1%

   \[\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i \]
2. Add Preprocessing

3. Final simplification 99.1%

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

Alternative 6: 98.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (+ (* y i) (+ (+ a (+ t (+ z (* x (log y))))) (* b (log c)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return (y * i) + ((a + (t + (z + (x * log(y))))) + (b * log(c)));
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = (y * i) + ((a + (t + (z + (x * log(y))))) + (b * log(c)))
end function

Java

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

Python

def code(x, y, z, t, a, b, c, i):
	return (y * i) + ((a + (t + (z + (x * math.log(y))))) + (b * math.log(c)))

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(y * i) + Float64(Float64(a + Float64(t + Float64(z + Float64(x * log(y))))) + Float64(b * log(c))))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = (y * i) + ((a + (t + (z + (x * log(y))))) + (b * log(c)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(y * i), $MachinePrecision] + N[(N[(a + N[(t + N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.1%

   \[\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i \]
2. Add Preprocessing

3. Taylor expanded in b around inf 97.6%

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

   1. *-commutative 97.6%

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

5. Simplified 97.6%

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

6. Final simplification 97.6%

   \[\leadsto y \cdot i + \left(\left(a + \left(t + \left(z + x \cdot \log y\right)\right)\right) + b \cdot \log c\right) \]
7. Add Preprocessing

Alternative 7: 94.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.5 \cdot 10^{+164} \lor \neg \left(x \leq 1.8 \cdot 10^{+48}\right):\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(\log c \cdot \left(b - 0.5\right) + y \cdot i\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= x -6.5e+164) (not (<= x 1.8e+48)))
   (+ a (+ t (+ z (+ (* x (log y)) (* y i)))))
   (+ a (+ t (+ z (+ (* (log c) (- b 0.5)) (* y i)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x <= -6.5e+164) || !(x <= 1.8e+48)) {
		tmp = a + (t + (z + ((x * log(y)) + (y * i))));
	} else {
		tmp = a + (t + (z + ((log(c) * (b - 0.5)) + (y * i))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if ((x <= (-6.5d+164)) .or. (.not. (x <= 1.8d+48))) then
        tmp = a + (t + (z + ((x * log(y)) + (y * i))))
    else
        tmp = a + (t + (z + ((log(c) * (b - 0.5d0)) + (y * i))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x <= -6.5e+164) || !(x <= 1.8e+48)) {
		tmp = a + (t + (z + ((x * Math.log(y)) + (y * i))));
	} else {
		tmp = a + (t + (z + ((Math.log(c) * (b - 0.5)) + (y * i))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (x <= -6.5e+164) or not (x <= 1.8e+48):
		tmp = a + (t + (z + ((x * math.log(y)) + (y * i))))
	else:
		tmp = a + (t + (z + ((math.log(c) * (b - 0.5)) + (y * i))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((x <= -6.5e+164) || !(x <= 1.8e+48))
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(x * log(y)) + Float64(y * i)))));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(log(c) * Float64(b - 0.5)) + Float64(y * i)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((x <= -6.5e+164) || ~((x <= 1.8e+48)))
		tmp = a + (t + (z + ((x * log(y)) + (y * i))));
	else
		tmp = a + (t + (z + ((log(c) * (b - 0.5)) + (y * i))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[x, -6.5e+164], N[Not[LessEqual[x, 1.8e+48]], $MachinePrecision]], N[(a + N[(t + N[(z + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -6.5000000000000003e164 or 1.79999999999999992e48 < x

   1. Initial program 97.6%

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

      1. add-cbrt-cube 97.4%

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

      2. pow3 97.5%

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

   4. Applied egg-rr 97.5%

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

   5. Taylor expanded in b around inf 97.5%

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

   6. Taylor expanded in b around 0 88.5%

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

   if -6.5000000000000003e164 < x < 1.79999999999999992e48

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

      7. +-commutative 99.9%

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

      8. associate-+l+ 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. +-commutative 99.9%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 99.9%

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

4. Final simplification 95.8%

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

Alternative 8: 94.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{+164}:\\ \;\;\;\;a + \left(t + x \cdot \left(\left(\log y + \frac{z}{x}\right) + i \cdot \frac{y}{x}\right)\right)\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{+45}:\\ \;\;\;\;a + \left(t + \left(z + \left(\log c \cdot \left(b - 0.5\right) + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + y \cdot i\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= x -1.35e+164)
   (+ a (+ t (* x (+ (+ (log y) (/ z x)) (* i (/ y x))))))
   (if (<= x 7.8e+45)
     (+ a (+ t (+ z (+ (* (log c) (- b 0.5)) (* y i)))))
     (+ a (+ t (+ z (+ (* x (log y)) (* y i))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (x <= -1.35e+164) {
		tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))));
	} else if (x <= 7.8e+45) {
		tmp = a + (t + (z + ((log(c) * (b - 0.5)) + (y * i))));
	} else {
		tmp = a + (t + (z + ((x * log(y)) + (y * i))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (x <= (-1.35d+164)) then
        tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))))
    else if (x <= 7.8d+45) then
        tmp = a + (t + (z + ((log(c) * (b - 0.5d0)) + (y * i))))
    else
        tmp = a + (t + (z + ((x * log(y)) + (y * i))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (x <= -1.35e+164) {
		tmp = a + (t + (x * ((Math.log(y) + (z / x)) + (i * (y / x)))));
	} else if (x <= 7.8e+45) {
		tmp = a + (t + (z + ((Math.log(c) * (b - 0.5)) + (y * i))));
	} else {
		tmp = a + (t + (z + ((x * Math.log(y)) + (y * i))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if x <= -1.35e+164:
		tmp = a + (t + (x * ((math.log(y) + (z / x)) + (i * (y / x)))))
	elif x <= 7.8e+45:
		tmp = a + (t + (z + ((math.log(c) * (b - 0.5)) + (y * i))))
	else:
		tmp = a + (t + (z + ((x * math.log(y)) + (y * i))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (x <= -1.35e+164)
		tmp = Float64(a + Float64(t + Float64(x * Float64(Float64(log(y) + Float64(z / x)) + Float64(i * Float64(y / x))))));
	elseif (x <= 7.8e+45)
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(log(c) * Float64(b - 0.5)) + Float64(y * i)))));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(Float64(x * log(y)) + Float64(y * i)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (x <= -1.35e+164)
		tmp = a + (t + (x * ((log(y) + (z / x)) + (i * (y / x)))));
	elseif (x <= 7.8e+45)
		tmp = a + (t + (z + ((log(c) * (b - 0.5)) + (y * i))));
	else
		tmp = a + (t + (z + ((x * log(y)) + (y * i))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[x, -1.35e+164], N[(a + N[(t + N[(x * N[(N[(N[Log[y], $MachinePrecision] + N[(z / x), $MachinePrecision]), $MachinePrecision] + N[(i * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 7.8e+45], N[(a + N[(t + N[(z + N[(N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.35000000000000003e164

   1. Initial program 93.3%

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

      1. add-cbrt-cube 93.3%

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

      2. pow3 93.3%

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

   4. Applied egg-rr 93.3%

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

   5. Taylor expanded in b around inf 93.3%

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

   6. Taylor expanded in b around 0 93.6%

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

   7. Taylor expanded in x around inf 96.8%

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

      1. associate-+r+ 96.8%

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

      2. associate-/l* 96.8%

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

   9. Simplified 96.8%

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

   if -1.35000000000000003e164 < x < 7.7999999999999999e45

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

      7. +-commutative 99.9%

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

      8. associate-+l+ 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. +-commutative 99.9%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around 0 99.9%

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

   if 7.7999999999999999e45 < x

   1. Initial program 99.8%

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

      1. add-cbrt-cube 99.6%

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

      2. pow3 99.5%

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

   4. Applied egg-rr 99.5%

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

   5. Taylor expanded in b around inf 99.5%

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

   6. Taylor expanded in b around 0 85.8%

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

4. Final simplification 96.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{+164}:\\ \;\;\;\;a + \left(t + x \cdot \left(\left(\log y + \frac{z}{x}\right) + i \cdot \frac{y}{x}\right)\right)\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{+45}:\\ \;\;\;\;a + \left(t + \left(z + \left(\log c \cdot \left(b - 0.5\right) + y \cdot i\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + \left(x \cdot \log y + y \cdot i\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 75.6% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= x -1.2e+164) (not (<= x 4.4e+150)))
   (+ a (+ t (+ z (* x (log y)))))
   (+ a (+ t (+ z (* y i))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x <= -1.2e+164) || !(x <= 4.4e+150)) {
		tmp = a + (t + (z + (x * log(y))));
	} else {
		tmp = a + (t + (z + (y * i)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if ((x <= (-1.2d+164)) .or. (.not. (x <= 4.4d+150))) then
        tmp = a + (t + (z + (x * log(y))))
    else
        tmp = a + (t + (z + (y * i)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x <= -1.2e+164) || !(x <= 4.4e+150)) {
		tmp = a + (t + (z + (x * Math.log(y))));
	} else {
		tmp = a + (t + (z + (y * i)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (x <= -1.2e+164) or not (x <= 4.4e+150):
		tmp = a + (t + (z + (x * math.log(y))))
	else:
		tmp = a + (t + (z + (y * i)))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((x <= -1.2e+164) || !(x <= 4.4e+150))
		tmp = Float64(a + Float64(t + Float64(z + Float64(x * log(y)))));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(y * i))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((x <= -1.2e+164) || ~((x <= 4.4e+150)))
		tmp = a + (t + (z + (x * log(y))));
	else
		tmp = a + (t + (z + (y * i)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[x, -1.2e+164], N[Not[LessEqual[x, 4.4e+150]], $MachinePrecision]], N[(a + N[(t + N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.20000000000000005e164 or 4.39999999999999999e150 < x

   1. Initial program 96.4%

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

      1. add-cbrt-cube 96.3%

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

      2. pow3 96.3%

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

   4. Applied egg-rr 96.3%

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

   5. Taylor expanded in b around inf 96.3%

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

   6. Taylor expanded in b around 0 86.1%

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

   7. Taylor expanded in i around 0 78.4%

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

   if -1.20000000000000005e164 < x < 4.39999999999999999e150

   1. Initial program 99.9%

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

      1. add-cbrt-cube 99.9%

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

      2. pow3 99.9%

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

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in b around inf 98.0%

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

   6. Taylor expanded in b around 0 79.2%

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

   7. Taylor expanded in x around 0 76.7%

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

4. Final simplification 77.1%

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

Alternative 10: 59.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 1.85 \cdot 10^{+84}:\\ \;\;\;\;y \cdot i + \left(z + \log c \cdot \left(b - 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= a 1.85e+84)
   (+ (* y i) (+ z (* (log c) (- b 0.5))))
   (+ (* y i) (+ a (* b (log c))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 1.85e+84) {
		tmp = (y * i) + (z + (log(c) * (b - 0.5)));
	} else {
		tmp = (y * i) + (a + (b * log(c)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (a <= 1.85d+84) then
        tmp = (y * i) + (z + (log(c) * (b - 0.5d0)))
    else
        tmp = (y * i) + (a + (b * log(c)))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if a <= 1.85e+84:
		tmp = (y * i) + (z + (math.log(c) * (b - 0.5)))
	else:
		tmp = (y * i) + (a + (b * math.log(c)))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (a <= 1.85e+84)
		tmp = Float64(Float64(y * i) + Float64(z + Float64(log(c) * Float64(b - 0.5))));
	else
		tmp = Float64(Float64(y * i) + Float64(a + Float64(b * log(c))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (a <= 1.85e+84)
		tmp = (y * i) + (z + (log(c) * (b - 0.5)));
	else
		tmp = (y * i) + (a + (b * log(c)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[a, 1.85e+84], N[(N[(y * i), $MachinePrecision] + N[(z + N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(a + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 1.85e84

   1. Initial program 99.4%

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

      1. add-cbrt-cube 99.3%

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

      2. pow3 99.3%

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

   4. Applied egg-rr 99.3%

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

   5. Taylor expanded in z around inf 57.8%

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

   if 1.85e84 < a

   1. Initial program 97.7%

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

      1. add-cbrt-cube 97.7%

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

      2. pow3 97.8%

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

   4. Applied egg-rr 97.8%

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

   5. Taylor expanded in b around inf 97.8%

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

   6. Taylor expanded in a around inf 79.1%

      \[\leadsto \left(\color{blue}{a} + b \cdot \log c\right) + y \cdot i \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq 1.85 \cdot 10^{+84}:\\ \;\;\;\;y \cdot i + \left(z + \log c \cdot \left(b - 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 58.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \log c\\ \mathbf{if}\;a \leq 1.1 \cdot 10^{+85}:\\ \;\;\;\;y \cdot i + \left(z + t\_1\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot i + \left(a + t\_1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* b (log c))))
   (if (<= a 1.1e+85) (+ (* y i) (+ z t_1)) (+ (* y i) (+ a t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = b * log(c);
	double tmp;
	if (a <= 1.1e+85) {
		tmp = (y * i) + (z + t_1);
	} else {
		tmp = (y * i) + (a + t_1);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: t_1
    real(8) :: tmp
    t_1 = b * log(c)
    if (a <= 1.1d+85) then
        tmp = (y * i) + (z + t_1)
    else
        tmp = (y * i) + (a + t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = b * Math.log(c);
	double tmp;
	if (a <= 1.1e+85) {
		tmp = (y * i) + (z + t_1);
	} else {
		tmp = (y * i) + (a + t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = b * math.log(c)
	tmp = 0
	if a <= 1.1e+85:
		tmp = (y * i) + (z + t_1)
	else:
		tmp = (y * i) + (a + t_1)
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(b * log(c))
	tmp = 0.0
	if (a <= 1.1e+85)
		tmp = Float64(Float64(y * i) + Float64(z + t_1));
	else
		tmp = Float64(Float64(y * i) + Float64(a + t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = b * log(c);
	tmp = 0.0;
	if (a <= 1.1e+85)
		tmp = (y * i) + (z + t_1);
	else
		tmp = (y * i) + (a + t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, 1.1e+85], N[(N[(y * i), $MachinePrecision] + N[(z + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(a + t$95$1), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < 1.1000000000000001e85

   1. Initial program 99.4%

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

      1. add-cbrt-cube 99.3%

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

      2. pow3 99.3%

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

   4. Applied egg-rr 99.3%

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

   5. Taylor expanded in b around inf 97.5%

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

   6. Taylor expanded in z around inf 56.0%

      \[\leadsto \left(\color{blue}{z} + b \cdot \log c\right) + y \cdot i \]

   if 1.1000000000000001e85 < a

   1. Initial program 97.7%

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

      1. add-cbrt-cube 97.7%

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

      2. pow3 97.8%

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

   4. Applied egg-rr 97.8%

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

   5. Taylor expanded in b around inf 97.8%

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

   6. Taylor expanded in a around inf 79.1%

      \[\leadsto \left(\color{blue}{a} + b \cdot \log c\right) + y \cdot i \]
3. Recombined 2 regimes into one program.

4. Final simplification 60.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq 1.1 \cdot 10^{+85}:\\ \;\;\;\;y \cdot i + \left(z + b \cdot \log c\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 60.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+100}:\\ \;\;\;\;a + \left(t + \left(z + y \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= z -3.4e+100)
   (+ a (+ t (+ z (* y i))))
   (+ (* y i) (+ a (* b (log c))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (z <= -3.4e+100) {
		tmp = a + (t + (z + (y * i)));
	} else {
		tmp = (y * i) + (a + (b * log(c)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (z <= (-3.4d+100)) then
        tmp = a + (t + (z + (y * i)))
    else
        tmp = (y * i) + (a + (b * log(c)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (z <= -3.4e+100) {
		tmp = a + (t + (z + (y * i)));
	} else {
		tmp = (y * i) + (a + (b * Math.log(c)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if z <= -3.4e+100:
		tmp = a + (t + (z + (y * i)))
	else:
		tmp = (y * i) + (a + (b * math.log(c)))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (z <= -3.4e+100)
		tmp = Float64(a + Float64(t + Float64(z + Float64(y * i))));
	else
		tmp = Float64(Float64(y * i) + Float64(a + Float64(b * log(c))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (z <= -3.4e+100)
		tmp = a + (t + (z + (y * i)));
	else
		tmp = (y * i) + (a + (b * log(c)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[z, -3.4e+100], N[(a + N[(t + N[(z + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(a + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.39999999999999994e100

   1. Initial program 99.8%

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

      1. add-cbrt-cube 99.8%

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

      2. pow3 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in b around inf 99.8%

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

   6. Taylor expanded in b around 0 75.7%

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

   7. Taylor expanded in x around 0 66.4%

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

   if -3.39999999999999994e100 < z

   1. Initial program 98.9%

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

      1. add-cbrt-cube 98.8%

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

      2. pow3 98.8%

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

   4. Applied egg-rr 98.8%

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

   5. Taylor expanded in b around inf 97.0%

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

   6. Taylor expanded in a around inf 56.8%

      \[\leadsto \left(\color{blue}{a} + b \cdot \log c\right) + y \cdot i \]
3. Recombined 2 regimes into one program.

4. Final simplification 58.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+100}:\\ \;\;\;\;a + \left(t + \left(z + y \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 70.8% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= x -9e+253) (not (<= x 3.2e+161)))
   (* x (log y))
   (+ a (+ t (+ z (* y i))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x <= -9e+253) || !(x <= 3.2e+161)) {
		tmp = x * log(y);
	} else {
		tmp = a + (t + (z + (y * i)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if ((x <= (-9d+253)) .or. (.not. (x <= 3.2d+161))) then
        tmp = x * log(y)
    else
        tmp = a + (t + (z + (y * i)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x <= -9e+253) || !(x <= 3.2e+161)) {
		tmp = x * Math.log(y);
	} else {
		tmp = a + (t + (z + (y * i)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (x <= -9e+253) or not (x <= 3.2e+161):
		tmp = x * math.log(y)
	else:
		tmp = a + (t + (z + (y * i)))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((x <= -9e+253) || !(x <= 3.2e+161))
		tmp = Float64(x * log(y));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(y * i))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((x <= -9e+253) || ~((x <= 3.2e+161)))
		tmp = x * log(y);
	else
		tmp = a + (t + (z + (y * i)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[x, -9e+253], N[Not[LessEqual[x, 3.2e+161]], $MachinePrecision]], N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.99999999999999943e253 or 3.20000000000000002e161 < x

   1. Initial program 94.7%

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

      1. add-cbrt-cube 94.5%

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

      2. pow3 94.5%

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

   4. Applied egg-rr 94.5%

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

   5. Taylor expanded in b around inf 94.5%

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

   6. Taylor expanded in x around inf 64.9%

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

   if -8.99999999999999943e253 < x < 3.20000000000000002e161

   1. Initial program 99.9%

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

      1. add-cbrt-cube 99.9%

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

      2. pow3 99.9%

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

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in b around inf 98.1%

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

   6. Taylor expanded in b around 0 80.8%

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

   7. Taylor expanded in x around 0 75.6%

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

4. Final simplification 73.9%

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

Alternative 14: 72.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.7 \cdot 10^{+244} \lor \neg \left(b \leq 1.8 \cdot 10^{+228}\right):\\ \;\;\;\;b \cdot \log c\\ \mathbf{else}:\\ \;\;\;\;a + \left(t + \left(z + y \cdot i\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= b -3.7e+244) (not (<= b 1.8e+228)))
   (* b (log c))
   (+ a (+ t (+ z (* y i))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((b <= -3.7e+244) || !(b <= 1.8e+228)) {
		tmp = b * log(c);
	} else {
		tmp = a + (t + (z + (y * i)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if ((b <= (-3.7d+244)) .or. (.not. (b <= 1.8d+228))) then
        tmp = b * log(c)
    else
        tmp = a + (t + (z + (y * i)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((b <= -3.7e+244) || !(b <= 1.8e+228)) {
		tmp = b * Math.log(c);
	} else {
		tmp = a + (t + (z + (y * i)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (b <= -3.7e+244) or not (b <= 1.8e+228):
		tmp = b * math.log(c)
	else:
		tmp = a + (t + (z + (y * i)))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((b <= -3.7e+244) || !(b <= 1.8e+228))
		tmp = Float64(b * log(c));
	else
		tmp = Float64(a + Float64(t + Float64(z + Float64(y * i))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((b <= -3.7e+244) || ~((b <= 1.8e+228)))
		tmp = b * log(c);
	else
		tmp = a + (t + (z + (y * i)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[b, -3.7e+244], N[Not[LessEqual[b, 1.8e+228]], $MachinePrecision]], N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision], N[(a + N[(t + N[(z + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -3.7000000000000002e244 or 1.8e228 < b

   1. Initial program 96.3%

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

      1. associate-+l+ 96.3%

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

      2. associate-+l+ 96.3%

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

      3. +-commutative 96.3%

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

      4. associate-+l+ 96.3%

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

      5. +-commutative 96.3%

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

      6. associate-+l+ 96.3%

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

      7. +-commutative 96.3%

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

      8. associate-+l+ 96.3%

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

      9. +-commutative 96.3%

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

      10. fma-define 96.3%

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

      11. +-commutative 96.3%

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

      12. fma-define 99.5%

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

   3. Simplified 99.5%

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

   5. Taylor expanded in t around inf 66.5%

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

      1. associate-/l* 66.5%

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

      2. associate-/l* 66.5%

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

      3. sub-neg 66.5%

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

      4. metadata-eval 66.5%

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

      5. associate-/l* 69.6%

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

      6. +-commutative 69.6%

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

   7. Simplified 69.6%

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

   8. Taylor expanded in b around inf 52.2%

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

      1. associate-/l* 52.4%

         \[\leadsto t \cdot \left(1 + \color{blue}{b \cdot \frac{\log c}{t}}\right) \]

   10. Simplified 52.4%

       \[\leadsto t \cdot \left(1 + \color{blue}{b \cdot \frac{\log c}{t}}\right) \]

   11. Taylor expanded in t around 0 72.7%

       \[\leadsto \color{blue}{b \cdot \log c} \]

   if -3.7000000000000002e244 < b < 1.8e228

   1. Initial program 99.4%

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

      1. add-cbrt-cube 99.4%

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

      2. pow3 99.4%

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

   4. Applied egg-rr 99.4%

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

   5. Taylor expanded in b around inf 97.7%

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

   6. Taylor expanded in b around 0 88.8%

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

   7. Taylor expanded in x around 0 73.4%

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

4. Final simplification 73.3%

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

Alternative 15: 23.7% accurate, 16.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 1.25 \cdot 10^{-233}:\\ \;\;\;\;z\\ \mathbf{elif}\;a \leq 3.5 \cdot 10^{+95}:\\ \;\;\;\;y \cdot i\\ \mathbf{else}:\\ \;\;\;\;a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= a 1.25e-233) z (if (<= a 3.5e+95) (* y i) a)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 1.25e-233) {
		tmp = z;
	} else if (a <= 3.5e+95) {
		tmp = y * i;
	} else {
		tmp = a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (a <= 1.25d-233) then
        tmp = z
    else if (a <= 3.5d+95) then
        tmp = y * i
    else
        tmp = a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 1.25e-233) {
		tmp = z;
	} else if (a <= 3.5e+95) {
		tmp = y * i;
	} else {
		tmp = a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if a <= 1.25e-233:
		tmp = z
	elif a <= 3.5e+95:
		tmp = y * i
	else:
		tmp = a
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (a <= 1.25e-233)
		tmp = z;
	elseif (a <= 3.5e+95)
		tmp = Float64(y * i);
	else
		tmp = a;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (a <= 1.25e-233)
		tmp = z;
	elseif (a <= 3.5e+95)
		tmp = y * i;
	else
		tmp = a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[a, 1.25e-233], z, If[LessEqual[a, 3.5e+95], N[(y * i), $MachinePrecision], a]]

Derivation

1. Split input into 3 regimes

2. if a < 1.25000000000000003e-233

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

      7. +-commutative 99.9%

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

      8. associate-+l+ 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. +-commutative 99.9%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 23.1%

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

   if 1.25000000000000003e-233 < a < 3.5e95

   1. Initial program 97.0%

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

      1. associate-+l+ 97.0%

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

      2. associate-+l+ 97.0%

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

      3. +-commutative 97.0%

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

      4. associate-+l+ 97.0%

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

      5. +-commutative 97.0%

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

      6. associate-+l+ 97.0%

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

      7. +-commutative 97.0%

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

      8. associate-+l+ 97.0%

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

      9. +-commutative 97.0%

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

      10. fma-define 97.0%

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

      11. +-commutative 97.0%

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

      12. fma-define 98.4%

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

   3. Simplified 98.4%

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

   5. Taylor expanded in y around inf 33.6%

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

      1. *-commutative 33.6%

         \[\leadsto \color{blue}{y \cdot i} \]

   7. Simplified 33.6%

      \[\leadsto \color{blue}{y \cdot i} \]

   if 3.5e95 < a

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

      7. +-commutative 99.9%

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

      8. associate-+l+ 99.9%

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

      9. +-commutative 99.9%

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

      10. fma-define 99.9%

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

      11. +-commutative 99.9%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in a around inf 52.6%

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

Alternative 16: 67.8% accurate, 24.3× speedup

Math

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

FPCore

(FPCore (x y z t a b c i) :precision binary64 (+ a (+ t (+ z (* y i)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return a + (t + (z + (y * i)));
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = a + (t + (z + (y * i)))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return a + (t + (z + (y * i)));
}

Python

def code(x, y, z, t, a, b, c, i):
	return a + (t + (z + (y * i)))

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(a + Float64(t + Float64(z + Float64(y * i))))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = a + (t + (z + (y * i)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(a + N[(t + N[(z + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.1%

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

   1. add-cbrt-cube 99.0%

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

   2. pow3 99.0%

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

4. Applied egg-rr 99.0%

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

5. Taylor expanded in b around inf 97.6%

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

6. Taylor expanded in b around 0 80.9%

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

7. Taylor expanded in x around 0 67.3%

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

8. Final simplification 67.3%

   \[\leadsto a + \left(t + \left(z + y \cdot i\right)\right) \]
9. Add Preprocessing

Alternative 17: 21.3% accurate, 36.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 7.5 \cdot 10^{+83}:\\ \;\;\;\;z\\ \mathbf{else}:\\ \;\;\;\;a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i) :precision binary64 (if (<= a 7.5e+83) z a))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 7.5e+83) {
		tmp = z;
	} else {
		tmp = a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (a <= 7.5d+83) then
        tmp = z
    else
        tmp = a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 7.5e+83) {
		tmp = z;
	} else {
		tmp = a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if a <= 7.5e+83:
		tmp = z
	else:
		tmp = a
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (a <= 7.5e+83)
		tmp = z;
	else
		tmp = a;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (a <= 7.5e+83)
		tmp = z;
	else
		tmp = a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[a, 7.5e+83], z, a]

Derivation

1. Split input into 2 regimes

2. if a < 7.49999999999999989e83

   1. Initial program 99.4%

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

      1. associate-+l+ 99.4%

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

      2. associate-+l+ 99.4%

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

      3. +-commutative 99.4%

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

      4. associate-+l+ 99.4%

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

      5. +-commutative 99.4%

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

      6. associate-+l+ 99.4%

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

      7. +-commutative 99.4%

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

      8. associate-+l+ 99.4%

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

      9. +-commutative 99.4%

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

      10. fma-define 99.4%

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

      11. +-commutative 99.4%

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

      12. fma-define 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in z around inf 19.6%

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

   if 7.49999999999999989e83 < a

   1. Initial program 97.7%

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

      1. associate-+l+ 97.7%

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

      2. associate-+l+ 97.7%

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

      3. +-commutative 97.7%

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

      4. associate-+l+ 97.7%

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

      5. +-commutative 97.7%

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

      6. associate-+l+ 97.7%

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

      7. +-commutative 97.7%

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

      8. associate-+l+ 97.7%

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

      9. +-commutative 97.7%

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

      10. fma-define 97.7%

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

      11. +-commutative 97.7%

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

      12. fma-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in a around inf 49.1%

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

Alternative 18: 16.8% accurate, 219.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c i) :precision binary64 a)

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return a;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = a
end function

Java

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

Python

def code(x, y, z, t, a, b, c, i):
	return a

Julia

function code(x, y, z, t, a, b, c, i)
	return a
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = a;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := a

Derivation

1. Initial program 99.1%

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

   1. associate-+l+ 99.1%

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

   2. associate-+l+ 99.1%

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

   3. +-commutative 99.1%

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

   4. associate-+l+ 99.1%

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

   5. +-commutative 99.1%

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

   6. associate-+l+ 99.1%

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

   7. +-commutative 99.1%

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

   8. associate-+l+ 99.1%

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

   9. +-commutative 99.1%

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

   10. fma-define 99.1%

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

   11. +-commutative 99.1%

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

   12. fma-define 99.5%

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

3. Simplified 99.5%

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

5. Taylor expanded in a around inf 18.0%

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

Reproduce

herbie shell --seed 2024157 
(FPCore (x y z t a b c i)
  :name "Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, B"
  :precision binary64
  (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))