Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, D

Percentage Accurate: 59.1% → 98.0%

Time: 20.7s

Alternatives: 11

Speedup: 7.4×

Specification

Math

\[\begin{array}{l} \\ x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+
  x
  (/
   (*
    y
    (+ (* (+ (* (+ (* (+ (* z 3.13060547623) 11.1667541262) z) t) z) a) z) b))
   (+
    (* (+ (* (+ (* (+ z 15.234687407) z) 31.4690115749) z) 11.9400905721) z)
    0.607771387771))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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
    code = x + ((y * ((((((((z * 3.13060547623d0) + 11.1667541262d0) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407d0) * z) + 31.4690115749d0) * z) + 11.9400905721d0) * z) + 0.607771387771d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771));
}

Python

def code(x, y, z, t, a, b):
	return x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771))

Julia

function code(x, y, z, t, a, b)
	return Float64(x + Float64(Float64(y * Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x + N[(N[(y * N[(N[(N[(N[(N[(N[(N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision] * z), $MachinePrecision] + t), $MachinePrecision] * z), $MachinePrecision] + a), $MachinePrecision] * z), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(z + 15.234687407), $MachinePrecision] * z), $MachinePrecision] + 31.4690115749), $MachinePrecision] * z), $MachinePrecision] + 11.9400905721), $MachinePrecision] * z), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 59.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+
  x
  (/
   (*
    y
    (+ (* (+ (* (+ (* (+ (* z 3.13060547623) 11.1667541262) z) t) z) a) z) b))
   (+
    (* (+ (* (+ (* (+ z 15.234687407) z) 31.4690115749) z) 11.9400905721) z)
    0.607771387771))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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
    code = x + ((y * ((((((((z * 3.13060547623d0) + 11.1667541262d0) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407d0) * z) + 31.4690115749d0) * z) + 11.9400905721d0) * z) + 0.607771387771d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771));
}

Python

def code(x, y, z, t, a, b):
	return x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771))

Julia

function code(x, y, z, t, a, b)
	return Float64(x + Float64(Float64(y * Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = x + ((y * ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x + N[(N[(y * N[(N[(N[(N[(N[(N[(N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision] * z), $MachinePrecision] + t), $MachinePrecision] * z), $MachinePrecision] + a), $MachinePrecision] * z), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(z + 15.234687407), $MachinePrecision] * z), $MachinePrecision] + 31.4690115749), $MachinePrecision] * z), $MachinePrecision] + 11.9400905721), $MachinePrecision] * z), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.0% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{y \cdot \left(z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right) + b\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{36.52704169880642}{z}\right), x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<=
      (/
       (*
        y
        (+
         (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))
         b))
       (+
        (*
         z
         (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
        0.607771387771))
      INFINITY)
   (fma
    y
    (/
     (fma z (fma z (fma z (fma z 3.13060547623 11.1667541262) t) a) b)
     (fma
      z
      (fma z (fma z (+ z 15.234687407) 31.4690115749) 11.9400905721)
      0.607771387771))
    x)
   (fma
    y
    (+
     3.13060547623
     (-
      (+ (/ 457.9610022158428 (pow z 2.0)) (/ t (pow z 2.0)))
      (/ 36.52704169880642 z)))
    x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)) <= ((double) INFINITY)) {
		tmp = fma(y, (fma(z, fma(z, fma(z, fma(z, 3.13060547623, 11.1667541262), t), a), b) / fma(z, fma(z, fma(z, (z + 15.234687407), 31.4690115749), 11.9400905721), 0.607771387771)), x);
	} else {
		tmp = fma(y, (3.13060547623 + (((457.9610022158428 / pow(z, 2.0)) + (t / pow(z, 2.0))) - (36.52704169880642 / z))), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(Float64(y * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)) <= Inf)
		tmp = fma(y, Float64(fma(z, fma(z, fma(z, fma(z, 3.13060547623, 11.1667541262), t), a), b) / fma(z, fma(z, fma(z, Float64(z + 15.234687407), 31.4690115749), 11.9400905721), 0.607771387771)), x);
	else
		tmp = fma(y, Float64(3.13060547623 + Float64(Float64(Float64(457.9610022158428 / (z ^ 2.0)) + Float64(t / (z ^ 2.0))) - Float64(36.52704169880642 / z))), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(N[(y * N[(N[(z * N[(N[(z * N[(N[(z * N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision], Infinity], N[(y * N[(N[(z * N[(z * N[(z * N[(z * 3.13060547623 + 11.1667541262), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + b), $MachinePrecision] / N[(z * N[(z * N[(z * N[(z + 15.234687407), $MachinePrecision] + 31.4690115749), $MachinePrecision] + 11.9400905721), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(y * N[(3.13060547623 + N[(N[(N[(457.9610022158428 / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision] + N[(t / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(36.52704169880642 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000)) < +inf.0

   1. Initial program 92.1%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 97.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   if +inf.0 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000))

   1. Initial program 0.0%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 0.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 98.9%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{\left(3.13060547623 + \left(457.9610022158428 \cdot \frac{1}{{z}^{2}} + \frac{t}{{z}^{2}}\right)\right) - 36.52704169880642 \cdot \frac{1}{z}}, x\right) \]
   6. Step-by-step derivation

      1. associate--l+ 98.9%

         \[\leadsto \mathsf{fma}\left(y, \color{blue}{3.13060547623 + \left(\left(457.9610022158428 \cdot \frac{1}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - 36.52704169880642 \cdot \frac{1}{z}\right)}, x\right) \]

      2. associate-*r/ 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\color{blue}{\frac{457.9610022158428 \cdot 1}{{z}^{2}}} + \frac{t}{{z}^{2}}\right) - 36.52704169880642 \cdot \frac{1}{z}\right), x\right) \]

      3. metadata-eval 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{\color{blue}{457.9610022158428}}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - 36.52704169880642 \cdot \frac{1}{z}\right), x\right) \]

      4. associate-*r/ 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \color{blue}{\frac{36.52704169880642 \cdot 1}{z}}\right), x\right) \]

      5. metadata-eval 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{\color{blue}{36.52704169880642}}{z}\right), x\right) \]

   7. Simplified 98.9%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{36.52704169880642}{z}\right)}, x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y \cdot \left(z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right) + b\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{36.52704169880642}{z}\right), x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 98.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771\\ t_2 := z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right)\\ \mathbf{if}\;\frac{y \cdot \left(t\_2 + b\right)}{t\_1} \leq \infty:\\ \;\;\;\;x + y \cdot \left(\frac{b}{t\_1} + \frac{t\_2}{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{36.52704169880642}{z}\right), x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (+
          (*
           z
           (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
          0.607771387771))
        (t_2
         (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))))
   (if (<= (/ (* y (+ t_2 b)) t_1) INFINITY)
     (+ x (* y (+ (/ b t_1) (/ t_2 t_1))))
     (fma
      y
      (+
       3.13060547623
       (-
        (+ (/ 457.9610022158428 (pow z 2.0)) (/ t (pow z 2.0)))
        (/ 36.52704169880642 z)))
      x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771;
	double t_2 = z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a);
	double tmp;
	if (((y * (t_2 + b)) / t_1) <= ((double) INFINITY)) {
		tmp = x + (y * ((b / t_1) + (t_2 / t_1)));
	} else {
		tmp = fma(y, (3.13060547623 + (((457.9610022158428 / pow(z, 2.0)) + (t / pow(z, 2.0))) - (36.52704169880642 / z))), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)
	t_2 = Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * 3.13060547623) + 11.1667541262)) + t)) + a))
	tmp = 0.0
	if (Float64(Float64(y * Float64(t_2 + b)) / t_1) <= Inf)
		tmp = Float64(x + Float64(y * Float64(Float64(b / t_1) + Float64(t_2 / t_1))));
	else
		tmp = fma(y, Float64(3.13060547623 + Float64(Float64(Float64(457.9610022158428 / (z ^ 2.0)) + Float64(t / (z ^ 2.0))) - Float64(36.52704169880642 / z))), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(z * N[(N[(z * N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(y * N[(t$95$2 + b), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], Infinity], N[(x + N[(y * N[(N[(b / t$95$1), $MachinePrecision] + N[(t$95$2 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(3.13060547623 + N[(N[(N[(457.9610022158428 / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision] + N[(t / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(36.52704169880642 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000)) < +inf.0

   1. Initial program 92.1%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 97.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 97.9%

      \[\leadsto \color{blue}{x + y \cdot \left(\frac{b}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot \left(31.4690115749 + z \cdot \left(15.234687407 + z\right)\right)\right)} + \frac{z \cdot \left(a + z \cdot \left(t + z \cdot \left(11.1667541262 + 3.13060547623 \cdot z\right)\right)\right)}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot \left(31.4690115749 + z \cdot \left(15.234687407 + z\right)\right)\right)}\right)} \]

   if +inf.0 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000))

   1. Initial program 0.0%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 0.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 98.9%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{\left(3.13060547623 + \left(457.9610022158428 \cdot \frac{1}{{z}^{2}} + \frac{t}{{z}^{2}}\right)\right) - 36.52704169880642 \cdot \frac{1}{z}}, x\right) \]
   6. Step-by-step derivation

      1. associate--l+ 98.9%

         \[\leadsto \mathsf{fma}\left(y, \color{blue}{3.13060547623 + \left(\left(457.9610022158428 \cdot \frac{1}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - 36.52704169880642 \cdot \frac{1}{z}\right)}, x\right) \]

      2. associate-*r/ 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\color{blue}{\frac{457.9610022158428 \cdot 1}{{z}^{2}}} + \frac{t}{{z}^{2}}\right) - 36.52704169880642 \cdot \frac{1}{z}\right), x\right) \]

      3. metadata-eval 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{\color{blue}{457.9610022158428}}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - 36.52704169880642 \cdot \frac{1}{z}\right), x\right) \]

      4. associate-*r/ 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \color{blue}{\frac{36.52704169880642 \cdot 1}{z}}\right), x\right) \]

      5. metadata-eval 98.9%

         \[\leadsto \mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{\color{blue}{36.52704169880642}}{z}\right), x\right) \]

   7. Simplified 98.9%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{36.52704169880642}{z}\right)}, x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y \cdot \left(z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right) + b\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} \leq \infty:\\ \;\;\;\;x + y \cdot \left(\frac{b}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} + \frac{z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) - \frac{36.52704169880642}{z}\right), x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771\\ t_2 := z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right)\\ \mathbf{if}\;\frac{y \cdot \left(t\_2 + b\right)}{t\_1} \leq \infty:\\ \;\;\;\;x + y \cdot \left(\frac{b}{t\_1} + \frac{t\_2}{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (+
          (*
           z
           (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
          0.607771387771))
        (t_2
         (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))))
   (if (<= (/ (* y (+ t_2 b)) t_1) INFINITY)
     (+ x (* y (+ (/ b t_1) (/ t_2 t_1))))
     (fma y 3.13060547623 x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771;
	double t_2 = z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a);
	double tmp;
	if (((y * (t_2 + b)) / t_1) <= ((double) INFINITY)) {
		tmp = x + (y * ((b / t_1) + (t_2 / t_1)));
	} else {
		tmp = fma(y, 3.13060547623, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)
	t_2 = Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * 3.13060547623) + 11.1667541262)) + t)) + a))
	tmp = 0.0
	if (Float64(Float64(y * Float64(t_2 + b)) / t_1) <= Inf)
		tmp = Float64(x + Float64(y * Float64(Float64(b / t_1) + Float64(t_2 / t_1))));
	else
		tmp = fma(y, 3.13060547623, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(z * N[(N[(z * N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(y * N[(t$95$2 + b), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], Infinity], N[(x + N[(y * N[(N[(b / t$95$1), $MachinePrecision] + N[(t$95$2 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * 3.13060547623 + x), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000)) < +inf.0

   1. Initial program 92.1%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 97.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 97.9%

      \[\leadsto \color{blue}{x + y \cdot \left(\frac{b}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot \left(31.4690115749 + z \cdot \left(15.234687407 + z\right)\right)\right)} + \frac{z \cdot \left(a + z \cdot \left(t + z \cdot \left(11.1667541262 + 3.13060547623 \cdot z\right)\right)\right)}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot \left(31.4690115749 + z \cdot \left(15.234687407 + z\right)\right)\right)}\right)} \]

   if +inf.0 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000))

   1. Initial program 0.0%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 0.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 96.9%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{3.13060547623}, x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y \cdot \left(z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right) + b\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} \leq \infty:\\ \;\;\;\;x + y \cdot \left(\frac{b}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} + \frac{z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 96.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771\\ t_2 := z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right)\\ \mathbf{if}\;\frac{y \cdot \left(t\_2 + b\right)}{t\_1} \leq \infty:\\ \;\;\;\;x + y \cdot \left(\frac{b}{t\_1} + \frac{t\_2}{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (+
          (*
           z
           (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
          0.607771387771))
        (t_2
         (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))))
   (if (<= (/ (* y (+ t_2 b)) t_1) INFINITY)
     (+ x (* y (+ (/ b t_1) (/ t_2 t_1))))
     (+ x (* y 3.13060547623)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771;
	double t_2 = z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a);
	double tmp;
	if (((y * (t_2 + b)) / t_1) <= ((double) INFINITY)) {
		tmp = x + (y * ((b / t_1) + (t_2 / t_1)));
	} else {
		tmp = x + (y * 3.13060547623);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771;
	double t_2 = z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a);
	double tmp;
	if (((y * (t_2 + b)) / t_1) <= Double.POSITIVE_INFINITY) {
		tmp = x + (y * ((b / t_1) + (t_2 / t_1)));
	} else {
		tmp = x + (y * 3.13060547623);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771
	t_2 = z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)
	tmp = 0
	if ((y * (t_2 + b)) / t_1) <= math.inf:
		tmp = x + (y * ((b / t_1) + (t_2 / t_1)))
	else:
		tmp = x + (y * 3.13060547623)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)
	t_2 = Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * 3.13060547623) + 11.1667541262)) + t)) + a))
	tmp = 0.0
	if (Float64(Float64(y * Float64(t_2 + b)) / t_1) <= Inf)
		tmp = Float64(x + Float64(y * Float64(Float64(b / t_1) + Float64(t_2 / t_1))));
	else
		tmp = Float64(x + Float64(y * 3.13060547623));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771;
	t_2 = z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a);
	tmp = 0.0;
	if (((y * (t_2 + b)) / t_1) <= Inf)
		tmp = x + (y * ((b / t_1) + (t_2 / t_1)));
	else
		tmp = x + (y * 3.13060547623);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(z * N[(N[(z * N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(y * N[(t$95$2 + b), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], Infinity], N[(x + N[(y * N[(N[(b / t$95$1), $MachinePrecision] + N[(t$95$2 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000)) < +inf.0

   1. Initial program 92.1%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 97.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 97.9%

      \[\leadsto \color{blue}{x + y \cdot \left(\frac{b}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot \left(31.4690115749 + z \cdot \left(15.234687407 + z\right)\right)\right)} + \frac{z \cdot \left(a + z \cdot \left(t + z \cdot \left(11.1667541262 + 3.13060547623 \cdot z\right)\right)\right)}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot \left(31.4690115749 + z \cdot \left(15.234687407 + z\right)\right)\right)}\right)} \]

   if +inf.0 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000))

   1. Initial program 0.0%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 0.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 96.8%

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

      1. +-commutative 96.8%

         \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

      2. *-commutative 96.8%

         \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

   7. Simplified 96.8%

      \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y \cdot \left(z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right) + b\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} \leq \infty:\\ \;\;\;\;x + y \cdot \left(\frac{b}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} + \frac{z \cdot \left(z \cdot \left(z \cdot \left(z \cdot 3.13060547623 + 11.1667541262\right) + t\right) + a\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771}\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 94.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+17} \lor \neg \left(z \leq 3.5 \cdot 10^{+29}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \left(b + z \cdot \left(a + z \cdot \left(t + z \cdot 11.1667541262\right)\right)\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -3.4e+17) (not (<= z 3.5e+29)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (* y (+ b (* z (+ a (* z (+ t (* z 11.1667541262)))))))
     (+
      (* z (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
      0.607771387771)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -3.4e+17) || !(z <= 3.5e+29)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((z <= (-3.4d+17)) .or. (.not. (z <= 3.5d+29))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262d0))))))) / ((z * ((z * ((z * (z + 15.234687407d0)) + 31.4690115749d0)) + 11.9400905721d0)) + 0.607771387771d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -3.4e+17) || !(z <= 3.5e+29)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -3.4e+17) or not (z <= 3.5e+29):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -3.4e+17) || !(z <= 3.5e+29))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(Float64(y * Float64(b + Float64(z * Float64(a + Float64(z * Float64(t + Float64(z * 11.1667541262))))))) / Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -3.4e+17) || ~((z <= 3.5e+29)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -3.4e+17], N[Not[LessEqual[z, 3.5e+29]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * N[(b + N[(z * N[(a + N[(z * N[(t + N[(z * 11.1667541262), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.4e17 or 3.49999999999999979e29 < z

   1. Initial program 12.1%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 19.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 91.9%

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

      1. +-commutative 91.9%

         \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

      2. *-commutative 91.9%

         \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

   7. Simplified 91.9%

      \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]

   if -3.4e17 < z < 3.49999999999999979e29

   1. Initial program 99.7%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 99.7%

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\color{blue}{11.1667541262 \cdot z} + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   4. Step-by-step derivation

      1. *-commutative 96.9%

         \[\leadsto x + \frac{y \cdot \left(\left(\left(\color{blue}{z \cdot 11.1667541262} + t\right) \cdot z + a\right) \cdot z + b\right)}{z \cdot 11.9400905721 + 0.607771387771} \]

   5. Simplified 99.7%

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\color{blue}{z \cdot 11.1667541262} + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{+17} \lor \neg \left(z \leq 3.5 \cdot 10^{+29}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \left(b + z \cdot \left(a + z \cdot \left(t + z \cdot 11.1667541262\right)\right)\right)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 93.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.41 \lor \neg \left(z \leq 4.2 \cdot 10^{+29}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \left(b + z \cdot \left(a + z \cdot \left(t + z \cdot 11.1667541262\right)\right)\right)}{0.607771387771 + z \cdot 11.9400905721}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -0.41) (not (<= z 4.2e+29)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (* y (+ b (* z (+ a (* z (+ t (* z 11.1667541262)))))))
     (+ 0.607771387771 (* z 11.9400905721))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -0.41) || !(z <= 4.2e+29)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((z <= (-0.41d0)) .or. (.not. (z <= 4.2d+29))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262d0))))))) / (0.607771387771d0 + (z * 11.9400905721d0)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -0.41) || !(z <= 4.2e+29)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -0.41) or not (z <= 4.2e+29):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -0.41) || !(z <= 4.2e+29))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(Float64(y * Float64(b + Float64(z * Float64(a + Float64(z * Float64(t + Float64(z * 11.1667541262))))))) / Float64(0.607771387771 + Float64(z * 11.9400905721))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -0.41) || ~((z <= 4.2e+29)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -0.41], N[Not[LessEqual[z, 4.2e+29]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * N[(b + N[(z * N[(a + N[(z * N[(t + N[(z * 11.1667541262), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.607771387771 + N[(z * 11.9400905721), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -0.409999999999999976 or 4.2000000000000003e29 < z

   1. Initial program 14.1%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 21.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 90.5%

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

      1. +-commutative 90.5%

         \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

      2. *-commutative 90.5%

         \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

   7. Simplified 90.5%

      \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]

   if -0.409999999999999976 < z < 4.2000000000000003e29

   1. Initial program 99.7%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 98.3%

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\color{blue}{11.9400905721 \cdot z} + 0.607771387771} \]
   4. Step-by-step derivation

      1. *-commutative 98.3%

         \[\leadsto x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\color{blue}{z \cdot 11.9400905721} + 0.607771387771} \]

   5. Simplified 98.3%

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\color{blue}{z \cdot 11.9400905721} + 0.607771387771} \]

   6. Taylor expanded in z around 0 98.3%

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\color{blue}{11.1667541262 \cdot z} + t\right) \cdot z + a\right) \cdot z + b\right)}{z \cdot 11.9400905721 + 0.607771387771} \]
   7. Step-by-step derivation

      1. *-commutative 98.3%

         \[\leadsto x + \frac{y \cdot \left(\left(\left(\color{blue}{z \cdot 11.1667541262} + t\right) \cdot z + a\right) \cdot z + b\right)}{z \cdot 11.9400905721 + 0.607771387771} \]

   8. Simplified 98.3%

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\color{blue}{z \cdot 11.1667541262} + t\right) \cdot z + a\right) \cdot z + b\right)}{z \cdot 11.9400905721 + 0.607771387771} \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.41 \lor \neg \left(z \leq 4.2 \cdot 10^{+29}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \left(b + z \cdot \left(a + z \cdot \left(t + z \cdot 11.1667541262\right)\right)\right)}{0.607771387771 + z \cdot 11.9400905721}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 90.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.3 \cdot 10^{+15} \lor \neg \left(z \leq 6.2 \cdot 10^{-7}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(b \cdot 1.6453555072203998 + 1.6453555072203998 \cdot \left(z \cdot a\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.3e+15) (not (<= z 6.2e-7)))
   (+ x (* y 3.13060547623))
   (+ x (* y (+ (* b 1.6453555072203998) (* 1.6453555072203998 (* z a)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.3e+15) || !(z <= 6.2e-7)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (y * ((b * 1.6453555072203998) + (1.6453555072203998 * (z * a))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((z <= (-1.3d+15)) .or. (.not. (z <= 6.2d-7))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + (y * ((b * 1.6453555072203998d0) + (1.6453555072203998d0 * (z * 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 tmp;
	if ((z <= -1.3e+15) || !(z <= 6.2e-7)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (y * ((b * 1.6453555072203998) + (1.6453555072203998 * (z * a))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.3e+15) or not (z <= 6.2e-7):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + (y * ((b * 1.6453555072203998) + (1.6453555072203998 * (z * a))))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.3e+15) || !(z <= 6.2e-7))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(y * Float64(Float64(b * 1.6453555072203998) + Float64(1.6453555072203998 * Float64(z * a)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.3e+15) || ~((z <= 6.2e-7)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + (y * ((b * 1.6453555072203998) + (1.6453555072203998 * (z * a))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.3e+15], N[Not[LessEqual[z, 6.2e-7]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(N[(b * 1.6453555072203998), $MachinePrecision] + N[(1.6453555072203998 * N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.3e15 or 6.1999999999999999e-7 < z

   1. Initial program 15.6%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 23.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 90.7%

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

      1. +-commutative 90.7%

         \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

      2. *-commutative 90.7%

         \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

   7. Simplified 90.7%

      \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]

   if -1.3e15 < z < 6.1999999999999999e-7

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 99.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \color{blue}{1.6453555072203998 \cdot y}, x\right) \]
   6. Step-by-step derivation

      1. *-commutative 99.2%

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \color{blue}{y \cdot 1.6453555072203998}, x\right) \]

   7. Simplified 99.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \color{blue}{y \cdot 1.6453555072203998}, x\right) \]

   8. Taylor expanded in z around 0 89.9%

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

   9. Taylor expanded in y around 0 92.2%

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

4. Final simplification 91.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.3 \cdot 10^{+15} \lor \neg \left(z \leq 6.2 \cdot 10^{-7}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(b \cdot 1.6453555072203998 + 1.6453555072203998 \cdot \left(z \cdot a\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 90.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.36 \cdot 10^{+17} \lor \neg \left(z \leq 6.2 \cdot 10^{-7}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1.6453555072203998 \cdot \left(b + z \cdot a\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.36e+17) (not (<= z 6.2e-7)))
   (+ x (* y 3.13060547623))
   (+ x (* y (* 1.6453555072203998 (+ b (* z a)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.36e+17) || !(z <= 6.2e-7)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (y * (1.6453555072203998 * (b + (z * a))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((z <= (-1.36d+17)) .or. (.not. (z <= 6.2d-7))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + (y * (1.6453555072203998d0 * (b + (z * 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 tmp;
	if ((z <= -1.36e+17) || !(z <= 6.2e-7)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (y * (1.6453555072203998 * (b + (z * a))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.36e+17) or not (z <= 6.2e-7):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + (y * (1.6453555072203998 * (b + (z * a))))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.36e+17) || !(z <= 6.2e-7))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(y * Float64(1.6453555072203998 * Float64(b + Float64(z * a)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.36e+17) || ~((z <= 6.2e-7)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + (y * (1.6453555072203998 * (b + (z * a))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.36e+17], N[Not[LessEqual[z, 6.2e-7]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(1.6453555072203998 * N[(b + N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.36e17 or 6.1999999999999999e-7 < z

   1. Initial program 15.6%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 23.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 90.7%

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

      1. +-commutative 90.7%

         \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

      2. *-commutative 90.7%

         \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

   7. Simplified 90.7%

      \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]

   if -1.36e17 < z < 6.1999999999999999e-7

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \frac{y}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 99.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \color{blue}{1.6453555072203998 \cdot y}, x\right) \]
   6. Step-by-step derivation

      1. *-commutative 99.2%

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \color{blue}{y \cdot 1.6453555072203998}, x\right) \]

   7. Simplified 99.2%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right), \color{blue}{y \cdot 1.6453555072203998}, x\right) \]

   8. Taylor expanded in z around 0 89.9%

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

   9. Taylor expanded in y around 0 92.2%

      \[\leadsto x + \color{blue}{y \cdot \left(1.6453555072203998 \cdot b + 1.6453555072203998 \cdot \left(a \cdot z\right)\right)} \]
   10. Step-by-step derivation

       1. distribute-lft-out 92.2%

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

       2. *-commutative 92.2%

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

   11. Simplified 92.2%

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

4. Final simplification 91.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.36 \cdot 10^{+17} \lor \neg \left(z \leq 6.2 \cdot 10^{-7}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1.6453555072203998 \cdot \left(b + z \cdot a\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 82.9% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -490000000000 \lor \neg \left(z \leq 7.2 \cdot 10^{-13}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + b \cdot \left(y \cdot 1.6453555072203998\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -490000000000.0) (not (<= z 7.2e-13)))
   (+ x (* y 3.13060547623))
   (+ x (* b (* y 1.6453555072203998)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -490000000000.0) || !(z <= 7.2e-13)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (b * (y * 1.6453555072203998));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((z <= (-490000000000.0d0)) .or. (.not. (z <= 7.2d-13))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + (b * (y * 1.6453555072203998d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -490000000000.0) || !(z <= 7.2e-13)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (b * (y * 1.6453555072203998));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -490000000000.0) or not (z <= 7.2e-13):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + (b * (y * 1.6453555072203998))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -490000000000.0) || !(z <= 7.2e-13))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(b * Float64(y * 1.6453555072203998)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -490000000000.0) || ~((z <= 7.2e-13)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + (b * (y * 1.6453555072203998));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -490000000000.0], N[Not[LessEqual[z, 7.2e-13]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(b * N[(y * 1.6453555072203998), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.9e11 or 7.1999999999999996e-13 < z

   1. Initial program 16.2%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   3. Simplified 23.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 90.0%

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

      1. +-commutative 90.0%

         \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

      2. *-commutative 90.0%

         \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

   7. Simplified 90.0%

      \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]

   if -4.9e11 < z < 7.1999999999999996e-13

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 79.8%

      \[\leadsto x + \frac{\color{blue}{b \cdot y}}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   4. Step-by-step derivation

      1. *-commutative 79.8%

         \[\leadsto x + \frac{\color{blue}{y \cdot b}}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   5. Simplified 79.8%

      \[\leadsto x + \frac{\color{blue}{y \cdot b}}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

   6. Taylor expanded in z around 0 79.9%

      \[\leadsto x + \color{blue}{1.6453555072203998 \cdot \left(b \cdot y\right)} \]
   7. Step-by-step derivation

      1. *-commutative 79.9%

         \[\leadsto x + \color{blue}{\left(b \cdot y\right) \cdot 1.6453555072203998} \]

      2. associate-*l* 79.9%

         \[\leadsto x + \color{blue}{b \cdot \left(y \cdot 1.6453555072203998\right)} \]

   8. Simplified 79.9%

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

4. Final simplification 84.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -490000000000 \lor \neg \left(z \leq 7.2 \cdot 10^{-13}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + b \cdot \left(y \cdot 1.6453555072203998\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 61.9% accurate, 7.4× speedup

Math

\[\begin{array}{l} \\ x + y \cdot 3.13060547623 \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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
    code = x + (y * 3.13060547623d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 58.3%

   \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

3. Simplified 62.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
4. Add Preprocessing

5. Taylor expanded in z around inf 61.8%

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

   1. +-commutative 61.8%

      \[\leadsto \color{blue}{3.13060547623 \cdot y + x} \]

   2. *-commutative 61.8%

      \[\leadsto \color{blue}{y \cdot 3.13060547623} + x \]

7. Simplified 61.8%

   \[\leadsto \color{blue}{y \cdot 3.13060547623 + x} \]

8. Final simplification 61.8%

   \[\leadsto x + y \cdot 3.13060547623 \]
9. Add Preprocessing

Alternative 11: 45.4% accurate, 37.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := x

Derivation

1. Initial program 58.3%

   \[x + \frac{y \cdot \left(\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

3. Simplified 62.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), t\right), a\right), b\right)}{\mathsf{fma}\left(z, \mathsf{fma}\left(z, \mathsf{fma}\left(z, z + 15.234687407, 31.4690115749\right), 11.9400905721\right), 0.607771387771\right)}, x\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 45.9%

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

6. Final simplification 45.9%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 98.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(\left(3.13060547623 - \frac{36.527041698806414}{z}\right) + \frac{t}{z \cdot z}\right) \cdot \frac{y}{1}\\ \mathbf{if}\;z < -6.499344996252632 \cdot 10^{+53}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 7.066965436914287 \cdot 10^{+59}:\\ \;\;\;\;x + \frac{y}{\frac{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771}{\left(\left(\left(z \cdot 3.13060547623 + 11.1667541262\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (+
          x
          (*
           (+ (- 3.13060547623 (/ 36.527041698806414 z)) (/ t (* z z)))
           (/ y 1.0)))))
   (if (< z -6.499344996252632e+53)
     t_1
     (if (< z 7.066965436914287e+59)
       (+
        x
        (/
         y
         (/
          (+
           (*
            (+ (* (+ (* (+ z 15.234687407) z) 31.4690115749) z) 11.9400905721)
            z)
           0.607771387771)
          (+
           (* (+ (* (+ (* (+ (* z 3.13060547623) 11.1667541262) z) t) z) a) z)
           b))))
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + (((3.13060547623 - (36.527041698806414 / z)) + (t / (z * z))) * (y / 1.0));
	double tmp;
	if (z < -6.499344996252632e+53) {
		tmp = t_1;
	} else if (z < 7.066965436914287e+59) {
		tmp = x + (y / ((((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771) / ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: t_1
    real(8) :: tmp
    t_1 = x + (((3.13060547623d0 - (36.527041698806414d0 / z)) + (t / (z * z))) * (y / 1.0d0))
    if (z < (-6.499344996252632d+53)) then
        tmp = t_1
    else if (z < 7.066965436914287d+59) then
        tmp = x + (y / ((((((((z + 15.234687407d0) * z) + 31.4690115749d0) * z) + 11.9400905721d0) * z) + 0.607771387771d0) / ((((((((z * 3.13060547623d0) + 11.1667541262d0) * z) + t) * z) + a) * z) + b)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + (((3.13060547623 - (36.527041698806414 / z)) + (t / (z * z))) * (y / 1.0));
	double tmp;
	if (z < -6.499344996252632e+53) {
		tmp = t_1;
	} else if (z < 7.066965436914287e+59) {
		tmp = x + (y / ((((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771) / ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x + (((3.13060547623 - (36.527041698806414 / z)) + (t / (z * z))) * (y / 1.0))
	tmp = 0
	if z < -6.499344996252632e+53:
		tmp = t_1
	elif z < 7.066965436914287e+59:
		tmp = x + (y / ((((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771) / ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(Float64(Float64(3.13060547623 - Float64(36.527041698806414 / z)) + Float64(t / Float64(z * z))) * Float64(y / 1.0)))
	tmp = 0.0
	if (z < -6.499344996252632e+53)
		tmp = t_1;
	elseif (z < 7.066965436914287e+59)
		tmp = Float64(x + Float64(y / Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b))));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x + (((3.13060547623 - (36.527041698806414 / z)) + (t / (z * z))) * (y / 1.0));
	tmp = 0.0;
	if (z < -6.499344996252632e+53)
		tmp = t_1;
	elseif (z < 7.066965436914287e+59)
		tmp = x + (y / ((((((((z + 15.234687407) * z) + 31.4690115749) * z) + 11.9400905721) * z) + 0.607771387771) / ((((((((z * 3.13060547623) + 11.1667541262) * z) + t) * z) + a) * z) + b)));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x + N[(N[(N[(3.13060547623 - N[(36.527041698806414 / z), $MachinePrecision]), $MachinePrecision] + N[(t / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(y / 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -6.499344996252632e+53], t$95$1, If[Less[z, 7.066965436914287e+59], N[(x + N[(y / N[(N[(N[(N[(N[(N[(N[(N[(z + 15.234687407), $MachinePrecision] * z), $MachinePrecision] + 31.4690115749), $MachinePrecision] * z), $MachinePrecision] + 11.9400905721), $MachinePrecision] * z), $MachinePrecision] + 0.607771387771), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(N[(z * 3.13060547623), $MachinePrecision] + 11.1667541262), $MachinePrecision] * z), $MachinePrecision] + t), $MachinePrecision] * z), $MachinePrecision] + a), $MachinePrecision] * z), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2024039 
(FPCore (x y z t a b)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, D"
  :precision binary64

  :herbie-target
  (if (< z -6.499344996252632e+53) (+ x (* (+ (- 3.13060547623 (/ 36.527041698806414 z)) (/ t (* z z))) (/ y 1.0))) (if (< z 7.066965436914287e+59) (+ x (/ y (/ (+ (* (+ (* (+ (* (+ z 15.234687407) z) 31.4690115749) z) 11.9400905721) z) 0.607771387771) (+ (* (+ (* (+ (* (+ (* z 3.13060547623) 11.1667541262) z) t) z) a) z) b)))) (+ x (* (+ (- 3.13060547623 (/ 36.527041698806414 z)) (/ t (* z z))) (/ y 1.0)))))

  (+ x (/ (* y (+ (* (+ (* (+ (* (+ (* z 3.13060547623) 11.1667541262) z) t) z) a) z) b)) (+ (* (+ (* (+ (* (+ z 15.234687407) z) 31.4690115749) z) 11.9400905721) z) 0.607771387771))))