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

Percentage Accurate: 57.7% → 97.5%

Time: 22.1s

Alternatives: 18

Speedup: 2.5×

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: 57.7% 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: 97.5% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -6.6e+41)
   (fma
    y
    (-
     3.13060547623
     (/
      (-
       36.52704169880642
       (/
        (+
         457.9610022158428
         (+ t (/ (+ a (+ -5864.8025282699045 (* t -15.234687407))) z)))
        z))
      z))
    x)
   (if (<= z 2.4e+66)
     (+
      x
      (/
       (* y (fma (fma (fma (fma z 3.13060547623 11.1667541262) z t) z a) z b))
       (fma
        (fma (fma (+ z 15.234687407) z 31.4690115749) z 11.9400905721)
        z
        0.607771387771)))
     (fma
      y
      (-
       3.13060547623
       (/ (- 36.52704169880642 (/ (+ t 457.9610022158428) z)) z))
      x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -6.6e+41) {
		tmp = fma(y, (3.13060547623 - ((36.52704169880642 - ((457.9610022158428 + (t + ((a + (-5864.8025282699045 + (t * -15.234687407))) / z))) / z)) / z)), x);
	} else if (z <= 2.4e+66) {
		tmp = x + ((y * fma(fma(fma(fma(z, 3.13060547623, 11.1667541262), z, t), z, a), z, b)) / fma(fma(fma((z + 15.234687407), z, 31.4690115749), z, 11.9400905721), z, 0.607771387771));
	} else {
		tmp = fma(y, (3.13060547623 - ((36.52704169880642 - ((t + 457.9610022158428) / z)) / z)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -6.6e+41)
		tmp = fma(y, Float64(3.13060547623 - Float64(Float64(36.52704169880642 - Float64(Float64(457.9610022158428 + Float64(t + Float64(Float64(a + Float64(-5864.8025282699045 + Float64(t * -15.234687407))) / z))) / z)) / z)), x);
	elseif (z <= 2.4e+66)
		tmp = Float64(x + Float64(Float64(y * fma(fma(fma(fma(z, 3.13060547623, 11.1667541262), z, t), z, a), z, b)) / fma(fma(fma(Float64(z + 15.234687407), z, 31.4690115749), z, 11.9400905721), z, 0.607771387771)));
	else
		tmp = fma(y, Float64(3.13060547623 - Float64(Float64(36.52704169880642 - Float64(Float64(t + 457.9610022158428) / z)) / z)), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -6.6000000000000001e41

   1. Initial program 5.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} \]

   3. Simplified 7.5%

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

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

   7. Simplified 100.0%

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

   if -6.6000000000000001e41 < z < 2.4000000000000002e66

   1. Initial program 97.9%

      \[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. Step-by-step derivation

      1. remove-double-neg 97.9%

         \[\leadsto x + \frac{\color{blue}{-\left(-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)\right)}}{\left(\left(\left(z + 15.234687407\right) \cdot z + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]

      2. distribute-lft-neg-out 97.9%

         \[\leadsto x + \frac{-\color{blue}{\left(-y\right) \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. distribute-lft-neg-in 97.9%

         \[\leadsto x + \frac{\color{blue}{\left(-\left(-y\right)\right) \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} \]

      4. remove-double-neg 97.9%

         \[\leadsto x + \frac{\color{blue}{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} \]

      5. fma-define 97.9%

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

      6. fma-define 97.9%

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

      7. fma-define 97.9%

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

      8. fma-define 97.9%

         \[\leadsto x + \frac{y \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right)}, z, t\right), z, a\right), 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}{x + \frac{y \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, 3.13060547623, 11.1667541262\right), z, t\right), z, a\right), z, b\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z + 15.234687407, z, 31.4690115749\right), z, 11.9400905721\right), z, 0.607771387771\right)}} \]
   4. Add Preprocessing

   if 2.4000000000000002e66 < z

   1. Initial program 2.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 2.3%

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

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

      1. mul-1-neg 99.9%

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

      2. unsub-neg 99.9%

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

      3. mul-1-neg 99.9%

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

      4. unsub-neg 99.9%

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

      5. +-commutative 99.9%

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

   7. Simplified 99.9%

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

4. Final simplification 98.7%

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

Alternative 2: 98.2% 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 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}, 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 (/ (- 36.52704169880642 (/ (+ t 457.9610022158428) z)) 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 - ((36.52704169880642 - ((t + 457.9610022158428) / z)) / 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(36.52704169880642 - Float64(Float64(t + 457.9610022158428) / z)) / 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[(36.52704169880642 - N[(N[(t + 457.9610022158428), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / z), $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 #s(literal 313060547623/100000000000 binary64)) #s(literal 55833770631/5000000000 binary64)) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z #s(literal 15234687407/1000000000 binary64)) z) #s(literal 314690115749/10000000000 binary64)) z) #s(literal 119400905721/10000000000 binary64)) z) #s(literal 607771387771/1000000000000 binary64))) < +inf.0

   1. Initial program 95.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 97.3%

      \[\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 #s(literal 313060547623/100000000000 binary64)) #s(literal 55833770631/5000000000 binary64)) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z #s(literal 15234687407/1000000000 binary64)) z) #s(literal 314690115749/10000000000 binary64)) z) #s(literal 119400905721/10000000000 binary64)) z) #s(literal 607771387771/1000000000000 binary64)))

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

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

      1. mul-1-neg 100.0%

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

      2. unsub-neg 100.0%

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

      3. mul-1-neg 100.0%

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

      4. unsub-neg 100.0%

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

      5. +-commutative 100.0%

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

   7. Simplified 100.0%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{3.13060547623 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}}, 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 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 95.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \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}\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}, x\right)\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (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 tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1 + x;
	} else {
		tmp = fma(y, (3.13060547623 - ((36.52704169880642 - ((t + 457.9610022158428) / z)) / z)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = 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))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = Float64(t_1 + x);
	else
		tmp = fma(y, Float64(3.13060547623 - Float64(Float64(36.52704169880642 - Float64(Float64(t + 457.9610022158428) / z)) / z)), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = 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]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + x), $MachinePrecision], N[(y * N[(3.13060547623 - N[(N[(36.52704169880642 - N[(N[(t + 457.9610022158428), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / z), $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 #s(literal 313060547623/100000000000 binary64)) #s(literal 55833770631/5000000000 binary64)) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z #s(literal 15234687407/1000000000 binary64)) z) #s(literal 314690115749/10000000000 binary64)) z) #s(literal 119400905721/10000000000 binary64)) z) #s(literal 607771387771/1000000000000 binary64))) < +inf.0

   1. Initial program 95.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} \]
   2. Add Preprocessing

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

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

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

      1. mul-1-neg 100.0%

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

      2. unsub-neg 100.0%

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

      3. mul-1-neg 100.0%

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

      4. unsub-neg 100.0%

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

      5. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 96.8%

   \[\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:\\ \;\;\;\;\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} + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 94.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \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}\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1 + x\\ \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
         (/
          (*
           y
           (+
            (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))
            b))
          (+
           (*
            z
            (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
           0.607771387771))))
   (if (<= t_1 INFINITY) (+ t_1 x) (fma y 3.13060547623 x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (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 tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1 + x;
	} else {
		tmp = fma(y, 3.13060547623, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = 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))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = Float64(t_1 + x);
	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[(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]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + x), $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 #s(literal 313060547623/100000000000 binary64)) #s(literal 55833770631/5000000000 binary64)) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z #s(literal 15234687407/1000000000 binary64)) z) #s(literal 314690115749/10000000000 binary64)) z) #s(literal 119400905721/10000000000 binary64)) z) #s(literal 607771387771/1000000000000 binary64))) < +inf.0

   1. Initial program 95.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} \]
   2. Add Preprocessing

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

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

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

4. Final simplification 96.1%

   \[\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:\\ \;\;\;\;\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} + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{+43}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 - \frac{36.52704169880642 - \frac{457.9610022158428 + \left(t + \frac{a + \left(-5864.8025282699045 + t \cdot -15.234687407\right)}{z}\right)}{z}}{z}, x\right)\\ \mathbf{elif}\;z \leq 2.8 \cdot 10^{+66}:\\ \;\;\;\;\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} + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -3.8e+43)
   (fma
    y
    (-
     3.13060547623
     (/
      (-
       36.52704169880642
       (/
        (+
         457.9610022158428
         (+ t (/ (+ a (+ -5864.8025282699045 (* t -15.234687407))) z)))
        z))
      z))
    x)
   (if (<= z 2.8e+66)
     (+
      (/
       (*
        y
        (+
         (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))
         b))
       (+
        (*
         z
         (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
        0.607771387771))
      x)
     (fma
      y
      (-
       3.13060547623
       (/ (- 36.52704169880642 (/ (+ t 457.9610022158428) z)) z))
      x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -3.8e+43) {
		tmp = fma(y, (3.13060547623 - ((36.52704169880642 - ((457.9610022158428 + (t + ((a + (-5864.8025282699045 + (t * -15.234687407))) / z))) / z)) / z)), x);
	} else if (z <= 2.8e+66) {
		tmp = ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771)) + x;
	} else {
		tmp = fma(y, (3.13060547623 - ((36.52704169880642 - ((t + 457.9610022158428) / z)) / z)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -3.8e+43)
		tmp = fma(y, Float64(3.13060547623 - Float64(Float64(36.52704169880642 - Float64(Float64(457.9610022158428 + Float64(t + Float64(Float64(a + Float64(-5864.8025282699045 + Float64(t * -15.234687407))) / z))) / z)) / z)), x);
	elseif (z <= 2.8e+66)
		tmp = Float64(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)) + x);
	else
		tmp = fma(y, Float64(3.13060547623 - Float64(Float64(36.52704169880642 - Float64(Float64(t + 457.9610022158428) / z)) / z)), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -3.8e+43], N[(y * N[(3.13060547623 - N[(N[(36.52704169880642 - N[(N[(457.9610022158428 + N[(t + N[(N[(a + N[(-5864.8025282699045 + N[(t * -15.234687407), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[z, 2.8e+66], N[(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] + x), $MachinePrecision], N[(y * N[(3.13060547623 - N[(N[(36.52704169880642 - N[(N[(t + 457.9610022158428), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.80000000000000008e43

   1. Initial program 5.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} \]

   3. Simplified 7.5%

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

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

   7. Simplified 100.0%

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

   if -3.80000000000000008e43 < z < 2.8000000000000001e66

   1. Initial program 97.9%

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

   if 2.8000000000000001e66 < z

   1. Initial program 2.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 2.3%

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

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

      1. mul-1-neg 99.9%

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

      2. unsub-neg 99.9%

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

      3. mul-1-neg 99.9%

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

      4. unsub-neg 99.9%

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

      5. +-commutative 99.9%

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

   7. Simplified 99.9%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{+43}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 - \frac{36.52704169880642 - \frac{457.9610022158428 + \left(t + \frac{a + \left(-5864.8025282699045 + t \cdot -15.234687407\right)}{z}\right)}{z}}{z}, x\right)\\ \mathbf{elif}\;z \leq 2.8 \cdot 10^{+66}:\\ \;\;\;\;\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} + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 3.13060547623 - \frac{36.52704169880642 - \frac{t + 457.9610022158428}{z}}{z}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 94.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \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}\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1 + x\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (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 tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1 + x;
	} 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 = (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 tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1 + x;
	} else {
		tmp = x + (y * 3.13060547623);
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a, b)
	t_1 = 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))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = Float64(t_1 + x);
	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 = (y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771);
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1 + x;
	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[(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]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + x), $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 #s(literal 313060547623/100000000000 binary64)) #s(literal 55833770631/5000000000 binary64)) z) t) z) a) z) b)) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 z #s(literal 15234687407/1000000000 binary64)) z) #s(literal 314690115749/10000000000 binary64)) z) #s(literal 119400905721/10000000000 binary64)) z) #s(literal 607771387771/1000000000000 binary64))) < +inf.0

   1. Initial program 95.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} \]
   2. Add Preprocessing

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

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

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

      1. +-commutative 98.0%

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

      2. *-commutative 98.0%

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

   7. Simplified 98.0%

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

4. Final simplification 96.1%

   \[\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:\\ \;\;\;\;\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} + x\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 94.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5 \cdot 10^{+42} \lor \neg \left(z \leq 2.8 \cdot 10^{+71}\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 -5e+42) (not (<= z 2.8e+71)))
   (+ 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 <= -5e+42) || !(z <= 2.8e+71)) {
		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 <= (-5d+42)) .or. (.not. (z <= 2.8d+71))) 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 <= -5e+42) || !(z <= 2.8e+71)) {
		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 <= -5e+42) or not (z <= 2.8e+71):
		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 <= -5e+42) || !(z <= 2.8e+71))
		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 <= -5e+42) || ~((z <= 2.8e+71)))
		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, -5e+42], N[Not[LessEqual[z, 2.8e+71]], $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 < -5.00000000000000007e42 or 2.80000000000000002e71 < z

   1. Initial program 4.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 5.1%

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

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

      1. +-commutative 95.4%

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

      2. *-commutative 95.4%

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

   7. Simplified 95.4%

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

   if -5.00000000000000007e42 < z < 2.80000000000000002e71

   1. Initial program 97.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} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 96.0%

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

         \[\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} \]

   5. Simplified 96.0%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5 \cdot 10^{+42} \lor \neg \left(z \leq 2.8 \cdot 10^{+71}\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 8: 93.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+41} \lor \neg \left(z \leq 1.18 \cdot 10^{+27}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \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)}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot 31.4690115749\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -6.6e+41) (not (<= z 1.18e+27)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (*
      y
      (+
       (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))
       b))
     (+ 0.607771387771 (* z (+ 11.9400905721 (* z 31.4690115749))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -6.6e+41) || !(z <= 1.18e+27)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))));
	}
	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 <= (-6.6d+41)) .or. (.not. (z <= 1.18d+27))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623d0) + 11.1667541262d0)) + t)) + a)) + b)) / (0.607771387771d0 + (z * (11.9400905721d0 + (z * 31.4690115749d0)))))
    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 <= -6.6e+41) || !(z <= 1.18e+27)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -6.6e+41) or not (z <= 1.18e+27):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -6.6e+41) || ~((z <= 1.18e+27)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -6.6e+41], N[Not[LessEqual[z, 1.18e+27]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + 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[(0.607771387771 + N[(z * N[(11.9400905721 + N[(z * 31.4690115749), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.6000000000000001e41 or 1.18000000000000006e27 < z

   1. Initial program 6.9%

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

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

      1. +-commutative 92.8%

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

      2. *-commutative 92.8%

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

   7. Simplified 92.8%

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

   if -6.6000000000000001e41 < z < 1.18000000000000006e27

   1. Initial program 98.4%

      \[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 94.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 \left(11.9400905721 + 31.4690115749 \cdot z\right)} + 0.607771387771} \]
   4. Step-by-step derivation

      1. *-commutative 94.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)}{z \cdot \left(11.9400905721 + \color{blue}{z \cdot 31.4690115749}\right) + 0.607771387771} \]

   5. Simplified 94.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 \left(11.9400905721 + z \cdot 31.4690115749\right)} + 0.607771387771} \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+41} \lor \neg \left(z \leq 1.18 \cdot 10^{+27}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \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)}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot 31.4690115749\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 93.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.41:\\ \;\;\;\;\left(x + \left(y \cdot 3.13060547623 + 11.1667541262 \cdot \frac{y}{z}\right)\right) - \frac{y}{z} \cdot 47.69379582500642\\ \mathbf{elif}\;z \leq 2.3 \cdot 10^{+26}:\\ \;\;\;\;x + \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)}{0.607771387771 + z \cdot 11.9400905721}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -0.41)
   (-
    (+ x (+ (* y 3.13060547623) (* 11.1667541262 (/ y z))))
    (* (/ y z) 47.69379582500642))
   (if (<= z 2.3e+26)
     (+
      x
      (/
       (*
        y
        (+
         (* z (+ (* z (+ (* z (+ (* z 3.13060547623) 11.1667541262)) t)) a))
         b))
       (+ 0.607771387771 (* z 11.9400905721))))
     (+ x (* y 3.13060547623)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -0.41) {
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642);
	} else if (z <= 2.3e+26) {
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * 11.9400905721)));
	} else {
		tmp = x + (y * 3.13060547623);
	}
	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)) then
        tmp = (x + ((y * 3.13060547623d0) + (11.1667541262d0 * (y / z)))) - ((y / z) * 47.69379582500642d0)
    else if (z <= 2.3d+26) then
        tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623d0) + 11.1667541262d0)) + t)) + a)) + b)) / (0.607771387771d0 + (z * 11.9400905721d0)))
    else
        tmp = x + (y * 3.13060547623d0)
    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) {
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642);
	} else if (z <= 2.3e+26) {
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * 11.9400905721)));
	} else {
		tmp = x + (y * 3.13060547623);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -0.41:
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642)
	elif z <= 2.3e+26:
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * 11.9400905721)))
	else:
		tmp = x + (y * 3.13060547623)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -0.41)
		tmp = Float64(Float64(x + Float64(Float64(y * 3.13060547623) + Float64(11.1667541262 * Float64(y / z)))) - Float64(Float64(y / z) * 47.69379582500642));
	elseif (z <= 2.3e+26)
		tmp = Float64(x + Float64(Float64(y * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * Float64(Float64(z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / Float64(0.607771387771 + Float64(z * 11.9400905721))));
	else
		tmp = Float64(x + Float64(y * 3.13060547623));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -0.41)
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642);
	elseif (z <= 2.3e+26)
		tmp = x + ((y * ((z * ((z * ((z * ((z * 3.13060547623) + 11.1667541262)) + t)) + a)) + b)) / (0.607771387771 + (z * 11.9400905721)));
	else
		tmp = x + (y * 3.13060547623);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -0.41], N[(N[(x + N[(N[(y * 3.13060547623), $MachinePrecision] + N[(11.1667541262 * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(y / z), $MachinePrecision] * 47.69379582500642), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.3e+26], N[(x + 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[(0.607771387771 + N[(z * 11.9400905721), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -0.409999999999999976

   1. Initial program 23.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 27.2%

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

      \[\leadsto \color{blue}{\left(x + \left(3.13060547623 \cdot y + 11.1667541262 \cdot \frac{y}{z}\right)\right) - 47.69379582500642 \cdot \frac{y}{z}} \]

   if -0.409999999999999976 < z < 2.3000000000000001e26

   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(z \cdot 11.1667541262 + 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} \]

   if 2.3000000000000001e26 < z

   1. Initial program 8.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 10.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 92.3%

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

      1. +-commutative 92.3%

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

      2. *-commutative 92.3%

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

   7. Simplified 92.3%

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

4. Final simplification 93.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.41:\\ \;\;\;\;\left(x + \left(y \cdot 3.13060547623 + 11.1667541262 \cdot \frac{y}{z}\right)\right) - \frac{y}{z} \cdot 47.69379582500642\\ \mathbf{elif}\;z \leq 2.3 \cdot 10^{+26}:\\ \;\;\;\;x + \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)}{0.607771387771 + z \cdot 11.9400905721}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 93.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.41:\\ \;\;\;\;\left(x + \left(y \cdot 3.13060547623 + 11.1667541262 \cdot \frac{y}{z}\right)\right) - \frac{y}{z} \cdot 47.69379582500642\\ \mathbf{elif}\;z \leq 1.35 \cdot 10^{+28}:\\ \;\;\;\;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}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -0.41)
   (-
    (+ x (+ (* y 3.13060547623) (* 11.1667541262 (/ y z))))
    (* (/ y z) 47.69379582500642))
   (if (<= z 1.35e+28)
     (+
      x
      (/
       (* y (+ b (* z (+ a (* z (+ t (* z 11.1667541262)))))))
       (+ 0.607771387771 (* z 11.9400905721))))
     (+ x (* y 3.13060547623)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -0.41) {
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642);
	} else if (z <= 1.35e+28) {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)));
	} else {
		tmp = x + (y * 3.13060547623);
	}
	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)) then
        tmp = (x + ((y * 3.13060547623d0) + (11.1667541262d0 * (y / z)))) - ((y / z) * 47.69379582500642d0)
    else if (z <= 1.35d+28) then
        tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262d0))))))) / (0.607771387771d0 + (z * 11.9400905721d0)))
    else
        tmp = x + (y * 3.13060547623d0)
    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) {
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642);
	} else if (z <= 1.35e+28) {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)));
	} else {
		tmp = x + (y * 3.13060547623);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -0.41:
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642)
	elif z <= 1.35e+28:
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)))
	else:
		tmp = x + (y * 3.13060547623)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -0.41)
		tmp = Float64(Float64(x + Float64(Float64(y * 3.13060547623) + Float64(11.1667541262 * Float64(y / z)))) - Float64(Float64(y / z) * 47.69379582500642));
	elseif (z <= 1.35e+28)
		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))));
	else
		tmp = Float64(x + Float64(y * 3.13060547623));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -0.41)
		tmp = (x + ((y * 3.13060547623) + (11.1667541262 * (y / z)))) - ((y / z) * 47.69379582500642);
	elseif (z <= 1.35e+28)
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262))))))) / (0.607771387771 + (z * 11.9400905721)));
	else
		tmp = x + (y * 3.13060547623);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -0.41], N[(N[(x + N[(N[(y * 3.13060547623), $MachinePrecision] + N[(11.1667541262 * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(y / z), $MachinePrecision] * 47.69379582500642), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.35e+28], 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], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -0.409999999999999976

   1. Initial program 23.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 27.2%

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

      \[\leadsto \color{blue}{\left(x + \left(3.13060547623 \cdot y + 11.1667541262 \cdot \frac{y}{z}\right)\right) - 47.69379582500642 \cdot \frac{y}{z}} \]

   if -0.409999999999999976 < z < 1.3500000000000001e28

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

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

         \[\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} \]

   5. Simplified 99.0%

      \[\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} \]

   6. Taylor expanded in z around 0 98.3%

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

      1. *-commutative 98.3%

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

   8. Simplified 98.3%

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

   if 1.3500000000000001e28 < z

   1. Initial program 8.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 10.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 92.3%

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

      1. +-commutative 92.3%

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

      2. *-commutative 92.3%

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

   7. Simplified 92.3%

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

4. Final simplification 93.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.41:\\ \;\;\;\;\left(x + \left(y \cdot 3.13060547623 + 11.1667541262 \cdot \frac{y}{z}\right)\right) - \frac{y}{z} \cdot 47.69379582500642\\ \mathbf{elif}\;z \leq 1.35 \cdot 10^{+28}:\\ \;\;\;\;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}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 88.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.8 \cdot 10^{+41}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 16000000:\\ \;\;\;\;x + \left(\left(a \cdot 1.6453555072203998\right) \cdot \left(y \cdot z\right) + 1.6453555072203998 \cdot \left(y \cdot b\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y \cdot 3.13060547623 - \frac{y \cdot 36.52704169880642}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -6.8e+41)
   (+ x (* y 3.13060547623))
   (if (<= z 16000000.0)
     (+
      x
      (+ (* (* a 1.6453555072203998) (* y z)) (* 1.6453555072203998 (* y b))))
     (+ x (- (* y 3.13060547623) (/ (* y 36.52704169880642) z))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -6.8e+41) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 16000000.0) {
		tmp = x + (((a * 1.6453555072203998) * (y * z)) + (1.6453555072203998 * (y * b)));
	} else {
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z));
	}
	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 <= (-6.8d+41)) then
        tmp = x + (y * 3.13060547623d0)
    else if (z <= 16000000.0d0) then
        tmp = x + (((a * 1.6453555072203998d0) * (y * z)) + (1.6453555072203998d0 * (y * b)))
    else
        tmp = x + ((y * 3.13060547623d0) - ((y * 36.52704169880642d0) / z))
    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 <= -6.8e+41) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 16000000.0) {
		tmp = x + (((a * 1.6453555072203998) * (y * z)) + (1.6453555072203998 * (y * b)));
	} else {
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -6.8e+41:
		tmp = x + (y * 3.13060547623)
	elif z <= 16000000.0:
		tmp = x + (((a * 1.6453555072203998) * (y * z)) + (1.6453555072203998 * (y * b)))
	else:
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -6.8e+41)
		tmp = Float64(x + Float64(y * 3.13060547623));
	elseif (z <= 16000000.0)
		tmp = Float64(x + Float64(Float64(Float64(a * 1.6453555072203998) * Float64(y * z)) + Float64(1.6453555072203998 * Float64(y * b))));
	else
		tmp = Float64(x + Float64(Float64(y * 3.13060547623) - Float64(Float64(y * 36.52704169880642) / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -6.8e+41)
		tmp = x + (y * 3.13060547623);
	elseif (z <= 16000000.0)
		tmp = x + (((a * 1.6453555072203998) * (y * z)) + (1.6453555072203998 * (y * b)));
	else
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -6.8e+41], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 16000000.0], N[(x + N[(N[(N[(a * 1.6453555072203998), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(1.6453555072203998 * N[(y * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * 3.13060547623), $MachinePrecision] - N[(N[(y * 36.52704169880642), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -6.79999999999999996e41

   1. Initial program 5.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} \]

   3. Simplified 7.5%

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

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

      1. +-commutative 93.3%

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

      2. *-commutative 93.3%

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

   7. Simplified 93.3%

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

   if -6.79999999999999996e41 < z < 1.6e7

   1. Initial program 98.4%

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

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

   4. Taylor expanded in a around inf 87.0%

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

      1. associate-*r* 87.0%

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

      2. *-commutative 87.0%

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

   6. Simplified 87.0%

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

   if 1.6e7 < z

   1. Initial program 11.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 -inf 90.7%

      \[\leadsto x + \color{blue}{\left(-1 \cdot \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z} + 3.13060547623 \cdot y\right)} \]
   4. Step-by-step derivation

      1. +-commutative 90.7%

         \[\leadsto x + \color{blue}{\left(3.13060547623 \cdot y + -1 \cdot \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right)} \]

      2. mul-1-neg 90.7%

         \[\leadsto x + \left(3.13060547623 \cdot y + \color{blue}{\left(-\frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right)}\right) \]

      3. unsub-neg 90.7%

         \[\leadsto x + \color{blue}{\left(3.13060547623 \cdot y - \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right)} \]

      4. *-commutative 90.7%

         \[\leadsto x + \left(\color{blue}{y \cdot 3.13060547623} - \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right) \]

      5. distribute-rgt-out-- 90.7%

         \[\leadsto x + \left(y \cdot 3.13060547623 - \frac{\color{blue}{y \cdot \left(-11.1667541262 - -47.69379582500642\right)}}{z}\right) \]

      6. metadata-eval 90.7%

         \[\leadsto x + \left(y \cdot 3.13060547623 - \frac{y \cdot \color{blue}{36.52704169880642}}{z}\right) \]

   5. Simplified 90.7%

      \[\leadsto x + \color{blue}{\left(y \cdot 3.13060547623 - \frac{y \cdot 36.52704169880642}{z}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.8 \cdot 10^{+41}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 16000000:\\ \;\;\;\;x + \left(\left(a \cdot 1.6453555072203998\right) \cdot \left(y \cdot z\right) + 1.6453555072203998 \cdot \left(y \cdot b\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y \cdot 3.13060547623 - \frac{y \cdot 36.52704169880642}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 83.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+41}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 45000:\\ \;\;\;\;x + 1.6453555072203998 \cdot \left(y \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y \cdot 3.13060547623 - \frac{y \cdot 36.52704169880642}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -6.6e+41)
   (+ x (* y 3.13060547623))
   (if (<= z 45000.0)
     (+ x (* 1.6453555072203998 (* y b)))
     (+ x (- (* y 3.13060547623) (/ (* y 36.52704169880642) z))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -6.6e+41) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 45000.0) {
		tmp = x + (1.6453555072203998 * (y * b));
	} else {
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z));
	}
	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 <= (-6.6d+41)) then
        tmp = x + (y * 3.13060547623d0)
    else if (z <= 45000.0d0) then
        tmp = x + (1.6453555072203998d0 * (y * b))
    else
        tmp = x + ((y * 3.13060547623d0) - ((y * 36.52704169880642d0) / z))
    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 <= -6.6e+41) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 45000.0) {
		tmp = x + (1.6453555072203998 * (y * b));
	} else {
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -6.6e+41:
		tmp = x + (y * 3.13060547623)
	elif z <= 45000.0:
		tmp = x + (1.6453555072203998 * (y * b))
	else:
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -6.6e+41)
		tmp = Float64(x + Float64(y * 3.13060547623));
	elseif (z <= 45000.0)
		tmp = Float64(x + Float64(1.6453555072203998 * Float64(y * b)));
	else
		tmp = Float64(x + Float64(Float64(y * 3.13060547623) - Float64(Float64(y * 36.52704169880642) / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -6.6e+41)
		tmp = x + (y * 3.13060547623);
	elseif (z <= 45000.0)
		tmp = x + (1.6453555072203998 * (y * b));
	else
		tmp = x + ((y * 3.13060547623) - ((y * 36.52704169880642) / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -6.6e+41], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 45000.0], N[(x + N[(1.6453555072203998 * N[(y * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * 3.13060547623), $MachinePrecision] - N[(N[(y * 36.52704169880642), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -6.6000000000000001e41

   1. Initial program 5.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} \]

   3. Simplified 7.5%

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

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

      1. +-commutative 93.3%

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

      2. *-commutative 93.3%

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

   7. Simplified 93.3%

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

   if -6.6000000000000001e41 < z < 45000

   1. Initial program 98.4%

      \[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(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 0 78.6%

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

      1. +-commutative 78.6%

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

      2. *-commutative 78.6%

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

   7. Simplified 78.6%

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

   if 45000 < z

   1. Initial program 15.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} \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf 87.5%

      \[\leadsto x + \color{blue}{\left(-1 \cdot \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z} + 3.13060547623 \cdot y\right)} \]
   4. Step-by-step derivation

      1. +-commutative 87.5%

         \[\leadsto x + \color{blue}{\left(3.13060547623 \cdot y + -1 \cdot \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right)} \]

      2. mul-1-neg 87.5%

         \[\leadsto x + \left(3.13060547623 \cdot y + \color{blue}{\left(-\frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right)}\right) \]

      3. unsub-neg 87.5%

         \[\leadsto x + \color{blue}{\left(3.13060547623 \cdot y - \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right)} \]

      4. *-commutative 87.5%

         \[\leadsto x + \left(\color{blue}{y \cdot 3.13060547623} - \frac{-11.1667541262 \cdot y - -47.69379582500642 \cdot y}{z}\right) \]

      5. distribute-rgt-out-- 87.5%

         \[\leadsto x + \left(y \cdot 3.13060547623 - \frac{\color{blue}{y \cdot \left(-11.1667541262 - -47.69379582500642\right)}}{z}\right) \]

      6. metadata-eval 87.5%

         \[\leadsto x + \left(y \cdot 3.13060547623 - \frac{y \cdot \color{blue}{36.52704169880642}}{z}\right) \]

   5. Simplified 87.5%

      \[\leadsto x + \color{blue}{\left(y \cdot 3.13060547623 - \frac{y \cdot 36.52704169880642}{z}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+41}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 45000:\\ \;\;\;\;x + 1.6453555072203998 \cdot \left(y \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y \cdot 3.13060547623 - \frac{y \cdot 36.52704169880642}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 83.3% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -6.6e+41) (not (<= z 2.1e+26)))
   (+ x (* y 3.13060547623))
   (+ x (* y (* b 1.6453555072203998)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -6.6e+41) || !(z <= 2.1e+26)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (y * (b * 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 <= (-6.6d+41)) .or. (.not. (z <= 2.1d+26))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + (y * (b * 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 <= -6.6e+41) || !(z <= 2.1e+26)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (y * (b * 1.6453555072203998));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -6.6e+41) or not (z <= 2.1e+26):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + (y * (b * 1.6453555072203998))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -6.6000000000000001e41 or 2.1000000000000001e26 < z

   1. Initial program 6.9%

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

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

      1. +-commutative 92.8%

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

      2. *-commutative 92.8%

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

   7. Simplified 92.8%

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

   if -6.6000000000000001e41 < z < 2.1000000000000001e26

   1. Initial program 98.4%

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

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

      1. associate-*r* 77.2%

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

      2. *-commutative 77.2%

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

   5. Simplified 77.2%

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

4. Final simplification 83.6%

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

Alternative 14: 83.3% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -8.6e+41) (not (<= z 2.1e+26)))
   (+ x (* y 3.13060547623))
   (+ x (* 1.6453555072203998 (* y b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -8.6e+41) || !(z <= 2.1e+26)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (1.6453555072203998 * (y * b));
	}
	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 <= (-8.6d+41)) .or. (.not. (z <= 2.1d+26))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + (1.6453555072203998d0 * (y * b))
    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 <= -8.6e+41) || !(z <= 2.1e+26)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + (1.6453555072203998 * (y * b));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -8.6e+41) or not (z <= 2.1e+26):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + (1.6453555072203998 * (y * b))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8.60000000000000048e41 or 2.1000000000000001e26 < z

   1. Initial program 6.9%

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

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

      1. +-commutative 92.8%

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

      2. *-commutative 92.8%

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

   7. Simplified 92.8%

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

   if -8.60000000000000048e41 < z < 2.1000000000000001e26

   1. Initial program 98.4%

      \[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(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 0 77.2%

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

      1. +-commutative 77.2%

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

      2. *-commutative 77.2%

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

   7. Simplified 77.2%

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

4. Final simplification 83.6%

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

Alternative 15: 62.3% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.2 \cdot 10^{+174} \lor \neg \left(b \leq 1.42 \cdot 10^{+222}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(y \cdot 1.6453555072203998\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b 6.2e+174) (not (<= b 1.42e+222)))
   (+ x (* y 3.13060547623))
   (* b (* y 1.6453555072203998))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= 6.2e+174) || !(b <= 1.42e+222)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = 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 ((b <= 6.2d+174) .or. (.not. (b <= 1.42d+222))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = 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 ((b <= 6.2e+174) || !(b <= 1.42e+222)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = b * (y * 1.6453555072203998);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= 6.2e+174) or not (b <= 1.42e+222):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = b * (y * 1.6453555072203998)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= 6.2e+174) || !(b <= 1.42e+222))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = 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 ((b <= 6.2e+174) || ~((b <= 1.42e+222)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = b * (y * 1.6453555072203998);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, 6.2e+174], N[Not[LessEqual[b, 1.42e+222]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(b * N[(y * 1.6453555072203998), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.2e174 or 1.41999999999999997e222 < b

   1. Initial program 59.5%

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

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

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

      1. +-commutative 63.1%

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

      2. *-commutative 63.1%

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

   7. Simplified 63.1%

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

   if 6.2e174 < b < 1.41999999999999997e222

   1. Initial program 81.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} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 62.9%

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

   4. Taylor expanded in b around inf 81.8%

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

   5. Taylor expanded in x around 0 81.8%

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

   6. Taylor expanded in z around 0 82.3%

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

      1. *-commutative 82.3%

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

   8. Simplified 82.3%

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

4. Final simplification 64.3%

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

Alternative 16: 51.5% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{+79} \lor \neg \left(y \leq 0.0275\right):\\ \;\;\;\;y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -4.4e+79) (not (<= y 0.0275))) (* y 3.13060547623) x))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -4.4e+79) || !(y <= 0.0275)) {
		tmp = y * 3.13060547623;
	} else {
		tmp = x;
	}
	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 ((y <= (-4.4d+79)) .or. (.not. (y <= 0.0275d0))) then
        tmp = y * 3.13060547623d0
    else
        tmp = x
    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 ((y <= -4.4e+79) || !(y <= 0.0275)) {
		tmp = y * 3.13060547623;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -4.4e+79) or not (y <= 0.0275):
		tmp = y * 3.13060547623
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -4.4e+79) || ~((y <= 0.0275)))
		tmp = y * 3.13060547623;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -4.4e+79], N[Not[LessEqual[y, 0.0275]], $MachinePrecision]], N[(y * 3.13060547623), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -4.3999999999999998e79 or 0.0275000000000000001 < y

   1. Initial program 53.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 56.5%

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

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

      1. +-commutative 48.7%

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

      2. *-commutative 48.7%

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

   7. Simplified 48.7%

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

   8. Taylor expanded in y around inf 48.7%

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

   9. Taylor expanded in y around inf 37.1%

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

       1. *-commutative 37.1%

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

   11. Simplified 37.1%

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

   if -4.3999999999999998e79 < y < 0.0275000000000000001

   1. Initial program 66.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} \]

   3. Simplified 66.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 y around 0 62.7%

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

4. Final simplification 51.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{+79} \lor \neg \left(y \leq 0.0275\right):\\ \;\;\;\;y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 50.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+87}:\\ \;\;\;\;b \cdot \left(y \cdot 1.6453555072203998\right)\\ \mathbf{elif}\;y \leq 0.019:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot 3.13060547623\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -8e+87)
   (* b (* y 1.6453555072203998))
   (if (<= y 0.019) x (* y 3.13060547623))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -8e+87) {
		tmp = b * (y * 1.6453555072203998);
	} else if (y <= 0.019) {
		tmp = x;
	} else {
		tmp = y * 3.13060547623;
	}
	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 (y <= (-8d+87)) then
        tmp = b * (y * 1.6453555072203998d0)
    else if (y <= 0.019d0) then
        tmp = x
    else
        tmp = y * 3.13060547623d0
    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 (y <= -8e+87) {
		tmp = b * (y * 1.6453555072203998);
	} else if (y <= 0.019) {
		tmp = x;
	} else {
		tmp = y * 3.13060547623;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -8e+87:
		tmp = b * (y * 1.6453555072203998)
	elif y <= 0.019:
		tmp = x
	else:
		tmp = y * 3.13060547623
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -8e+87)
		tmp = Float64(b * Float64(y * 1.6453555072203998));
	elseif (y <= 0.019)
		tmp = x;
	else
		tmp = Float64(y * 3.13060547623);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -8e+87)
		tmp = b * (y * 1.6453555072203998);
	elseif (y <= 0.019)
		tmp = x;
	else
		tmp = y * 3.13060547623;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -8e+87], N[(b * N[(y * 1.6453555072203998), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 0.019], x, N[(y * 3.13060547623), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -7.9999999999999997e87

   1. Initial program 58.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 45.1%

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

   4. Taylor expanded in b around inf 39.5%

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

   5. Taylor expanded in x around 0 36.9%

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

   6. Taylor expanded in z around 0 39.5%

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

      1. *-commutative 39.5%

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

   8. Simplified 39.5%

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

   if -7.9999999999999997e87 < y < 0.0189999999999999995

   1. Initial program 66.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} \]

   3. Simplified 66.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 y around 0 62.7%

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

   if 0.0189999999999999995 < y

   1. Initial program 50.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 54.2%

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

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

      1. +-commutative 51.4%

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

      2. *-commutative 51.4%

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

   7. Simplified 51.4%

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

   8. Taylor expanded in y around inf 51.4%

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

   9. Taylor expanded in y around inf 38.1%

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

       1. *-commutative 38.1%

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

   11. Simplified 38.1%

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

4. Final simplification 52.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+87}:\\ \;\;\;\;b \cdot \left(y \cdot 1.6453555072203998\right)\\ \mathbf{elif}\;y \leq 0.019:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot 3.13060547623\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 45.1% 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 60.9%

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

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

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

6. Final simplification 42.8%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 98.5% 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 2024077 
(FPCore (x y z t a b)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, D"
  :precision binary64

  :alt
  (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))))