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

Percentage Accurate: 58.8% → 98.1%

Time: 21.0s

Alternatives: 15

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: 58.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = x + ((y * ((((((((z * 3.13060547623d0) + 11.1667541262d0) * z) + t) * z) + a) * z) + b)) / (((((((z + 15.234687407d0) * z) + 31.4690115749d0) * z) + 11.9400905721d0) * z) + 0.607771387771d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.1% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.5 \cdot 10^{+54}:\\ \;\;\;\;\mathsf{fma}\left(y, \left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) + \left(3.13060547623 + \frac{-36.52704169880642}{z}\right), x\right)\\ \mathbf{elif}\;z \leq 9.5 \cdot 10^{+23}:\\ \;\;\;\;\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{\frac{457.9610022158428 + t}{z} - 36.52704169880642}{z}, x\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -2.50000000000000003e54

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

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

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

      1. +-commutative 97.9%

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

      2. associate--l+ 97.9%

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

      3. sub-neg 97.9%

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

      4. associate-*r/ 97.9%

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

      5. metadata-eval 97.9%

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

      6. distribute-neg-frac 97.9%

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

      7. metadata-eval 97.9%

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

   7. Simplified 97.9%

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

   if -2.50000000000000003e54 < z < 9.50000000000000038e23

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

   3. Simplified 99.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

   if 9.50000000000000038e23 < z

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

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

   5. Taylor expanded in z around -inf 98.5%

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

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

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

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

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

      5. +-commutative 98.5%

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

   7. Simplified 98.5%

      \[\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 -2.5 \cdot 10^{+54}:\\ \;\;\;\;\mathsf{fma}\left(y, \left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) + \left(3.13060547623 + \frac{-36.52704169880642}{z}\right), x\right)\\ \mathbf{elif}\;z \leq 9.5 \cdot 10^{+23}:\\ \;\;\;\;\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{\frac{457.9610022158428 + t}{z} - 36.52704169880642}{z}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.2% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -2.50000000000000003e54

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

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

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

      1. +-commutative 97.9%

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

      2. associate--l+ 97.9%

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

      3. sub-neg 97.9%

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

      4. associate-*r/ 97.9%

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

      5. metadata-eval 97.9%

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

      6. distribute-neg-frac 97.9%

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

      7. metadata-eval 97.9%

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

   7. Simplified 97.9%

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

   if -2.50000000000000003e54 < z < 2.4e23

   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

   3. Taylor expanded in z around inf 98.0%

      \[\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)}{\left(\left(\color{blue}{{z}^{2} \cdot \left(1 + 15.234687407 \cdot \frac{1}{z}\right)} + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   4. Step-by-step derivation

      1. associate-*r/ 98.0%

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

      2. metadata-eval 98.0%

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

   5. Simplified 98.0%

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

   if 2.4e23 < z

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

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

   5. Taylor expanded in z around -inf 98.5%

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

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

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

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

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

      5. +-commutative 98.5%

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

   7. Simplified 98.5%

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

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

Alternative 3: 97.2% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -2.5e+54) (not (<= z 1.5e+21)))
   (fma
    y
    (+ 3.13060547623 (/ (- (/ (+ 457.9610022158428 t) z) 36.52704169880642) z))
    x)
   (+
    x
    (/
     (*
      y
      (+
       b
       (* z (+ a (* z (+ t (* z (+ 11.1667541262 (* z 3.13060547623)))))))))
     (+
      0.607771387771
      (*
       z
       (+
        11.9400905721
        (*
         z
         (+ 31.4690115749 (* (pow z 2.0) (+ (/ 15.234687407 z) 1.0)))))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -2.5e+54) || !(z <= 1.5e+21)) {
		tmp = fma(y, (3.13060547623 + ((((457.9610022158428 + t) / z) - 36.52704169880642) / z)), x);
	} else {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * (11.1667541262 + (z * 3.13060547623))))))))) / (0.607771387771 + (z * (11.9400905721 + (z * (31.4690115749 + (pow(z, 2.0) * ((15.234687407 / z) + 1.0))))))));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.50000000000000003e54 or 1.5e21 < z

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

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

   5. Taylor expanded in z around -inf 98.2%

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

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

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

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

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

      5. +-commutative 98.2%

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

   7. Simplified 98.2%

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

   if -2.50000000000000003e54 < z < 1.5e21

   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

   3. Taylor expanded in z around inf 98.0%

      \[\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)}{\left(\left(\color{blue}{{z}^{2} \cdot \left(1 + 15.234687407 \cdot \frac{1}{z}\right)} + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
   4. Step-by-step derivation

      1. associate-*r/ 98.0%

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

      2. metadata-eval 98.0%

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

   5. Simplified 98.0%

      \[\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)}{\left(\left(\color{blue}{{z}^{2} \cdot \left(1 + \frac{15.234687407}{z}\right)} + 31.4690115749\right) \cdot z + 11.9400905721\right) \cdot z + 0.607771387771} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.1%

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

Alternative 4: 97.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -2.5e+54) (not (<= z 8.6e+23)))
   (fma
    y
    (+ 3.13060547623 (/ (- (/ (+ 457.9610022158428 t) z) 36.52704169880642) z))
    x)
   (+
    x
    (/
     (*
      y
      (+
       b
       (* z (+ a (* z (+ t (* z (+ 11.1667541262 (* z 3.13060547623)))))))))
     (+
      0.607771387771
      (*
       z
       (+ 11.9400905721 (* z (+ 31.4690115749 (* z (+ z 15.234687407)))))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -2.5e+54) || !(z <= 8.6e+23)) {
		tmp = fma(y, (3.13060547623 + ((((457.9610022158428 + t) / z) - 36.52704169880642) / z)), x);
	} else {
		tmp = x + ((y * (b + (z * (a + (z * (t + (z * (11.1667541262 + (z * 3.13060547623))))))))) / (0.607771387771 + (z * (11.9400905721 + (z * (31.4690115749 + (z * (z + 15.234687407))))))));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -2.5e+54) || !(z <= 8.6e+23))
		tmp = fma(y, Float64(3.13060547623 + Float64(Float64(Float64(Float64(457.9610022158428 + t) / z) - 36.52704169880642) / z)), x);
	else
		tmp = Float64(x + Float64(Float64(y * Float64(b + Float64(z * Float64(a + Float64(z * Float64(t + Float64(z * Float64(11.1667541262 + Float64(z * 3.13060547623))))))))) / Float64(0.607771387771 + Float64(z * Float64(11.9400905721 + Float64(z * Float64(31.4690115749 + Float64(z * Float64(z + 15.234687407)))))))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -2.5e+54], N[Not[LessEqual[z, 8.6e+23]], $MachinePrecision]], N[(y * N[(3.13060547623 + N[(N[(N[(N[(457.9610022158428 + t), $MachinePrecision] / z), $MachinePrecision] - 36.52704169880642), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(x + N[(N[(y * N[(b + N[(z * N[(a + N[(z * N[(t + N[(z * N[(11.1667541262 + N[(z * 3.13060547623), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.607771387771 + N[(z * N[(11.9400905721 + N[(z * N[(31.4690115749 + N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.50000000000000003e54 or 8.5999999999999997e23 < z

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

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

   5. Taylor expanded in z around -inf 98.2%

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

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

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

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

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

      5. +-commutative 98.2%

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

   7. Simplified 98.2%

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

   if -2.50000000000000003e54 < z < 8.5999999999999997e23

   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
3. Recombined 2 regimes into one program.

4. Final simplification 98.1%

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

Alternative 5: 95.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -2.5e+54) (not (<= z 3.8e+33)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (*
      y
      (+
       b
       (* z (+ a (* z (+ t (* z (+ 11.1667541262 (* z 3.13060547623)))))))))
     (+
      0.607771387771
      (*
       z
       (+ 11.9400905721 (* z (+ 31.4690115749 (* z (+ z 15.234687407)))))))))))

C

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

Python

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

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -2.5e+54) || !(z <= 3.8e+33))
		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 * Float64(11.1667541262 + Float64(z * 3.13060547623))))))))) / Float64(0.607771387771 + Float64(z * Float64(11.9400905721 + Float64(z * Float64(31.4690115749 + Float64(z * Float64(z + 15.234687407)))))))));
	end
	return tmp
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -2.5e+54], N[Not[LessEqual[z, 3.8e+33]], $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 * N[(11.1667541262 + N[(z * 3.13060547623), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.607771387771 + N[(z * N[(11.9400905721 + N[(z * N[(31.4690115749 + N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.50000000000000003e54 or 3.80000000000000002e33 < z

   1. Initial program 6.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 95.7%

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

      1. +-commutative 95.7%

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

      2. *-commutative 95.7%

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

   7. Simplified 95.7%

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

   if -2.50000000000000003e54 < z < 3.80000000000000002e33

   1. Initial program 97.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. Recombined 2 regimes into one program.

4. Final simplification 96.7%

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

Alternative 6: 95.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.75e+56) (not (<= z 9.5e+23)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (* y (+ b (* z (+ a (* z (+ t (* z 11.1667541262)))))))
     (+
      0.607771387771
      (*
       z
       (+ 11.9400905721 (* z (+ 31.4690115749 (* z (+ z 15.234687407)))))))))))

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.75d+56)) .or. (.not. (z <= 9.5d+23))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + ((y * (b + (z * (a + (z * (t + (z * 11.1667541262d0))))))) / (0.607771387771d0 + (z * (11.9400905721d0 + (z * (31.4690115749d0 + (z * (z + 15.234687407d0))))))))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.75e56 or 9.50000000000000038e23 < z

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

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

   5. Taylor expanded in z around inf 94.9%

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

      1. +-commutative 94.9%

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

      2. *-commutative 94.9%

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

   7. Simplified 94.9%

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

   if -1.75e56 < z < 9.50000000000000038e23

   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

   3. Taylor expanded in z around 0 97.9%

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

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

   5. Simplified 97.9%

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

4. Final simplification 96.6%

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

Alternative 7: 90.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{+29}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 80:\\ \;\;\;\;x + y \cdot \left(b \cdot 1.6453555072203998 + z \cdot \left(a \cdot 1.6453555072203998 - b \cdot 32.324150453290734\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 -9.2e+29)
   (+ x (* y 3.13060547623))
   (if (<= z 80.0)
     (+
      x
      (*
       y
       (+
        (* b 1.6453555072203998)
        (* z (- (* a 1.6453555072203998) (* b 32.324150453290734))))))
     (+ 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 <= -9.2e+29) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 80.0) {
		tmp = x + (y * ((b * 1.6453555072203998) + (z * ((a * 1.6453555072203998) - (b * 32.324150453290734)))));
	} 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 <= (-9.2d+29)) then
        tmp = x + (y * 3.13060547623d0)
    else if (z <= 80.0d0) then
        tmp = x + (y * ((b * 1.6453555072203998d0) + (z * ((a * 1.6453555072203998d0) - (b * 32.324150453290734d0)))))
    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 <= -9.2e+29) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 80.0) {
		tmp = x + (y * ((b * 1.6453555072203998) + (z * ((a * 1.6453555072203998) - (b * 32.324150453290734)))));
	} 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 <= -9.2e+29:
		tmp = x + (y * 3.13060547623)
	elif z <= 80.0:
		tmp = x + (y * ((b * 1.6453555072203998) + (z * ((a * 1.6453555072203998) - (b * 32.324150453290734)))))
	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 <= -9.2e+29)
		tmp = Float64(x + Float64(y * 3.13060547623));
	elseif (z <= 80.0)
		tmp = Float64(x + Float64(y * Float64(Float64(b * 1.6453555072203998) + Float64(z * Float64(Float64(a * 1.6453555072203998) - Float64(b * 32.324150453290734))))));
	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 <= -9.2e+29)
		tmp = x + (y * 3.13060547623);
	elseif (z <= 80.0)
		tmp = x + (y * ((b * 1.6453555072203998) + (z * ((a * 1.6453555072203998) - (b * 32.324150453290734)))));
	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, -9.2e+29], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 80.0], N[(x + N[(y * N[(N[(b * 1.6453555072203998), $MachinePrecision] + N[(z * N[(N[(a * 1.6453555072203998), $MachinePrecision] - N[(b * 32.324150453290734), $MachinePrecision]), $MachinePrecision]), $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 < -9.2000000000000004e29

   1. Initial program 10.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 12.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 89.9%

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

      1. +-commutative 89.9%

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

      2. *-commutative 89.9%

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

   7. Simplified 89.9%

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

   if -9.2000000000000004e29 < z < 80

   1. Initial program 99.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 82.2%

      \[\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 y around 0 93.7%

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

   if 80 < z

   1. Initial program 22.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

   3. Taylor expanded in z around -inf 89.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 89.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 89.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 89.7%

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

      4. *-commutative 89.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-- 89.7%

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

      6. metadata-eval 89.7%

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

   5. Simplified 89.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 91.9%

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

Alternative 8: 89.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{+29}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 280000:\\ \;\;\;\;x + \left(1.6453555072203998 \cdot \left(a \cdot \left(z \cdot y\right)\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 -9.2e+29)
   (+ x (* y 3.13060547623))
   (if (<= z 280000.0)
     (+
      x
      (+ (* 1.6453555072203998 (* a (* z y))) (* 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 <= -9.2e+29) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 280000.0) {
		tmp = x + ((1.6453555072203998 * (a * (z * y))) + (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 <= (-9.2d+29)) then
        tmp = x + (y * 3.13060547623d0)
    else if (z <= 280000.0d0) then
        tmp = x + ((1.6453555072203998d0 * (a * (z * y))) + (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 <= -9.2e+29) {
		tmp = x + (y * 3.13060547623);
	} else if (z <= 280000.0) {
		tmp = x + ((1.6453555072203998 * (a * (z * y))) + (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 <= -9.2e+29:
		tmp = x + (y * 3.13060547623)
	elif z <= 280000.0:
		tmp = x + ((1.6453555072203998 * (a * (z * y))) + (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 <= -9.2e+29)
		tmp = Float64(x + Float64(y * 3.13060547623));
	elseif (z <= 280000.0)
		tmp = Float64(x + Float64(Float64(1.6453555072203998 * Float64(a * Float64(z * y))) + 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 <= -9.2e+29)
		tmp = x + (y * 3.13060547623);
	elseif (z <= 280000.0)
		tmp = x + ((1.6453555072203998 * (a * (z * y))) + (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, -9.2e+29], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 280000.0], N[(x + N[(N[(1.6453555072203998 * N[(a * N[(z * y), $MachinePrecision]), $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 < -9.2000000000000004e29

   1. Initial program 10.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 12.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 89.9%

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

      1. +-commutative 89.9%

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

      2. *-commutative 89.9%

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

   7. Simplified 89.9%

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

   if -9.2000000000000004e29 < z < 2.8e5

   1. Initial program 99.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 82.2%

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

      \[\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. *-commutative 63.8%

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

   6. Simplified 92.2%

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

   if 2.8e5 < z

   1. Initial program 22.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

   3. Taylor expanded in z around -inf 89.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 89.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 89.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 89.7%

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

      4. *-commutative 89.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-- 89.7%

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

      6. metadata-eval 89.7%

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

   5. Simplified 89.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 91.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{+29}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq 280000:\\ \;\;\;\;x + \left(1.6453555072203998 \cdot \left(a \cdot \left(z \cdot y\right)\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 9: 82.7% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + y \cdot 3.13060547623\\ \mathbf{if}\;z \leq -2.75 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-117}:\\ \;\;\;\;x + 1.6453555072203998 \cdot \left(a \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 960000:\\ \;\;\;\;x + 1.6453555072203998 \cdot \left(y \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (* y 3.13060547623))))
   (if (<= z -2.75e+31)
     t_1
     (if (<= z -7.2e-117)
       (+ x (* 1.6453555072203998 (* a (* z y))))
       (if (<= z 960000.0) (+ x (* 1.6453555072203998 (* y b))) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + (y * 3.13060547623);
	double tmp;
	if (z <= -2.75e+31) {
		tmp = t_1;
	} else if (z <= -7.2e-117) {
		tmp = x + (1.6453555072203998 * (a * (z * y)));
	} else if (z <= 960000.0) {
		tmp = x + (1.6453555072203998 * (y * 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 + (y * 3.13060547623d0)
    if (z <= (-2.75d+31)) then
        tmp = t_1
    else if (z <= (-7.2d-117)) then
        tmp = x + (1.6453555072203998d0 * (a * (z * y)))
    else if (z <= 960000.0d0) then
        tmp = x + (1.6453555072203998d0 * (y * 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 + (y * 3.13060547623);
	double tmp;
	if (z <= -2.75e+31) {
		tmp = t_1;
	} else if (z <= -7.2e-117) {
		tmp = x + (1.6453555072203998 * (a * (z * y)));
	} else if (z <= 960000.0) {
		tmp = x + (1.6453555072203998 * (y * b));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x + (y * 3.13060547623)
	tmp = 0
	if z <= -2.75e+31:
		tmp = t_1
	elif z <= -7.2e-117:
		tmp = x + (1.6453555072203998 * (a * (z * y)))
	elif z <= 960000.0:
		tmp = x + (1.6453555072203998 * (y * b))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(y * 3.13060547623))
	tmp = 0.0
	if (z <= -2.75e+31)
		tmp = t_1;
	elseif (z <= -7.2e-117)
		tmp = Float64(x + Float64(1.6453555072203998 * Float64(a * Float64(z * y))));
	elseif (z <= 960000.0)
		tmp = Float64(x + Float64(1.6453555072203998 * Float64(y * b)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x + (y * 3.13060547623);
	tmp = 0.0;
	if (z <= -2.75e+31)
		tmp = t_1;
	elseif (z <= -7.2e-117)
		tmp = x + (1.6453555072203998 * (a * (z * y)));
	elseif (z <= 960000.0)
		tmp = x + (1.6453555072203998 * (y * 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[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.75e+31], t$95$1, If[LessEqual[z, -7.2e-117], N[(x + N[(1.6453555072203998 * N[(a * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 960000.0], N[(x + N[(1.6453555072203998 * N[(y * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.75000000000000001e31 or 9.6e5 < z

   1. Initial program 16.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 20.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 90.9%

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

      1. +-commutative 90.9%

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

      2. *-commutative 90.9%

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

   7. Simplified 90.9%

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

   if -2.75000000000000001e31 < z < -7.2000000000000001e-117

   1. Initial program 96.8%

      \[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 73.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 z around inf 67.7%

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

   5. Taylor expanded in a around inf 76.1%

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

      1. *-commutative 76.1%

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

   7. Simplified 76.1%

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

   if -7.2000000000000001e-117 < z < 9.6e5

   1. Initial program 99.8%

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

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

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

      1. +-commutative 89.4%

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

      2. *-commutative 89.4%

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

   7. Simplified 89.4%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.75 \cdot 10^{+31}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-117}:\\ \;\;\;\;x + 1.6453555072203998 \cdot \left(a \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 960000:\\ \;\;\;\;x + 1.6453555072203998 \cdot \left(y \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 83.8% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -0.105) (not (<= z 960000.0)))
   (+ x (* y 3.13060547623))
   (+ x (* b (* y 1.6453555072203998)))))

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-0.105d0)) .or. (.not. (z <= 960000.0d0))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + (b * (y * 1.6453555072203998d0))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -0.104999999999999996 or 9.6e5 < z

   1. Initial program 21.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 26.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 87.0%

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

      1. +-commutative 87.0%

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

      2. *-commutative 87.0%

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

   7. Simplified 87.0%

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

   if -0.104999999999999996 < z < 9.6e5

   1. Initial program 99.8%

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

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

      1. *-commutative 83.6%

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

   5. Simplified 83.6%

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

   6. Taylor expanded in z around 0 83.0%

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

      1. *-commutative 83.0%

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

   8. Simplified 83.0%

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

   9. Taylor expanded in z around 0 83.0%

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

       1. *-commutative 83.0%

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

       2. associate-*r* 83.0%

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

   11. Simplified 83.0%

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

4. Final simplification 85.0%

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

Alternative 11: 83.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.06 \lor \neg \left(z \leq 960000\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 -0.06) (not (<= z 960000.0)))
   (+ 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 <= -0.06) || !(z <= 960000.0)) {
		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 <= (-0.06d0)) .or. (.not. (z <= 960000.0d0))) 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 <= -0.06) || !(z <= 960000.0)) {
		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 <= -0.06) or not (z <= 960000.0):
		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 <= -0.06) || !(z <= 960000.0))
		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 <= -0.06) || ~((z <= 960000.0)))
		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, -0.06], N[Not[LessEqual[z, 960000.0]], $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 < -0.059999999999999998 or 9.6e5 < z

   1. Initial program 21.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 26.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 87.0%

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

      1. +-commutative 87.0%

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

      2. *-commutative 87.0%

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

   7. Simplified 87.0%

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

   if -0.059999999999999998 < z < 9.6e5

   1. Initial program 99.8%

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

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

      1. associate-*r* 83.0%

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

      2. *-commutative 83.0%

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

   5. Simplified 83.0%

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

4. Final simplification 85.0%

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

Alternative 12: 83.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.082 \lor \neg \left(z \leq 960000\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 -0.082) (not (<= z 960000.0)))
   (+ 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 <= -0.082) || !(z <= 960000.0)) {
		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 <= (-0.082d0)) .or. (.not. (z <= 960000.0d0))) 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 <= -0.082) || !(z <= 960000.0)) {
		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 <= -0.082) or not (z <= 960000.0):
		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 <= -0.082) || !(z <= 960000.0))
		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 <= -0.082) || ~((z <= 960000.0)))
		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, -0.082], N[Not[LessEqual[z, 960000.0]], $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 < -0.0820000000000000034 or 9.6e5 < z

   1. Initial program 21.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 26.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 87.0%

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

      1. +-commutative 87.0%

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

      2. *-commutative 87.0%

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

   7. Simplified 87.0%

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

   if -0.0820000000000000034 < z < 9.6e5

   1. Initial program 99.8%

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

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

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

      1. +-commutative 83.0%

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

      2. *-commutative 83.0%

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

   7. Simplified 83.0%

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

4. Final simplification 85.0%

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

Alternative 13: 81.5% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1.9e-17)
   (* x (+ (* 3.13060547623 (/ y x)) 1.0))
   (if (<= z 960000.0)
     (+ x (* 1.6453555072203998 (* y b)))
     (+ x (* y 3.13060547623)))))

C

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -1.9e-17:
		tmp = x * ((3.13060547623 * (y / x)) + 1.0)
	elif z <= 960000.0:
		tmp = x + (1.6453555072203998 * (y * b))
	else:
		tmp = x + (y * 3.13060547623)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -1.9e-17)
		tmp = Float64(x * Float64(Float64(3.13060547623 * Float64(y / x)) + 1.0));
	elseif (z <= 960000.0)
		tmp = Float64(x + Float64(1.6453555072203998 * Float64(y * b)));
	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 <= -1.9e-17)
		tmp = x * ((3.13060547623 * (y / x)) + 1.0);
	elseif (z <= 960000.0)
		tmp = x + (1.6453555072203998 * (y * b));
	else
		tmp = x + (y * 3.13060547623);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1.9e-17], N[(x * N[(N[(3.13060547623 * N[(y / x), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 960000.0], N[(x + N[(1.6453555072203998 * N[(y * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.9000000000000001e-17

   1. Initial program 30.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 33.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 x around inf 28.4%

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

   6. Taylor expanded in z around inf 77.1%

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

   if -1.9000000000000001e-17 < z < 9.6e5

   1. Initial program 99.8%

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

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

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

      1. +-commutative 86.0%

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

      2. *-commutative 86.0%

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

   7. Simplified 86.0%

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

   if 9.6e5 < z

   1. Initial program 20.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 26.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 91.5%

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

      1. +-commutative 91.5%

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

      2. *-commutative 91.5%

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

   7. Simplified 91.5%

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

4. Final simplification 85.3%

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

Alternative 14: 64.3% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{-7} \lor \neg \left(z \leq 1.75 \cdot 10^{-72}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -3.8e-7) (not (<= z 1.75e-72))) (+ x (* y 3.13060547623)) x))

C

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -3.8e-7) or not (z <= 1.75e-72):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x
	return tmp

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -3.8e-7], N[Not[LessEqual[z, 1.75e-72]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -3.80000000000000015e-7 or 1.75e-72 < z

   1. Initial program 30.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 34.8%

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

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

      1. +-commutative 81.0%

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

      2. *-commutative 81.0%

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

   7. Simplified 81.0%

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

   if -3.80000000000000015e-7 < z < 1.75e-72

   1. Initial program 99.8%

      \[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 y around 0 51.9%

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

4. Final simplification 68.2%

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

Alternative 15: 44.6% 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 61.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 63.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 y around 0 52.4%

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

6. Final simplification 52.4%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 98.4% 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 2024073 
(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))))