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

Percentage Accurate: 58.7% → 98.8%

Time: 22.6s

Alternatives: 15

Speedup: 7.4×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 58.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.5 \cdot 10^{+28} \lor \neg \left(z \leq 5200000000\right):\\ \;\;\;\;\mathsf{fma}\left(y, \left(3.13060547623 + \frac{-36.52704169880642}{z}\right) + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) + \frac{a + \left(-5864.8025282699045 + t \cdot -15.234687407\right)}{{z}^{3}}\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\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)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} + x\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.5e+28], N[Not[LessEqual[z, 5200000000.0]], $MachinePrecision]], N[(y * N[(N[(3.13060547623 + N[(-36.52704169880642 / z), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(457.9610022158428 / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision] + N[(t / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a + N[(-5864.8025282699045 + N[(t * -15.234687407), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(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[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.5e28 or 5.2e9 < z

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

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

   5. Taylor expanded in z around -inf 98.3%

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

   7. Simplified 98.3%

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

   if -1.5e28 < z < 5.2e9

   1. Initial program 99.6%

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

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.5 \cdot 10^{+28} \lor \neg \left(z \leq 5200000000\right):\\ \;\;\;\;\mathsf{fma}\left(y, \left(3.13060547623 + \frac{-36.52704169880642}{z}\right) + \left(\left(\frac{457.9610022158428}{{z}^{2}} + \frac{t}{{z}^{2}}\right) + \frac{a + \left(-5864.8025282699045 + t \cdot -15.234687407\right)}{{z}^{3}}\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\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)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771} + x\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 98.3% accurate, 0.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[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[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision], Infinity], N[(y * N[(N[(z * N[(z * N[(z * N[(z * 3.13060547623 + 11.1667541262), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + b), $MachinePrecision] / N[(z * N[(z * N[(z * N[(z + 15.234687407), $MachinePrecision] + 31.4690115749), $MachinePrecision] + 11.9400905721), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(y * N[(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]]

Derivation

1. Split input into 2 regimes

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

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

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

   1. Initial program 0.0%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in z around inf 99.9%

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

      1. +-commutative 99.9%

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

      2. associate--l+ 99.9%

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

      3. associate-*r/ 99.9%

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

      4. metadata-eval 99.9%

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

      5. sub-neg 99.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) \]

      6. associate-*r/ 99.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) \]

      7. metadata-eval 99.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) \]

      8. distribute-neg-frac 99.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) \]

      9. metadata-eval 99.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 99.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) \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.9%

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

Alternative 3: 96.4% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = 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[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + x), $MachinePrecision], N[(y * N[(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]]]

Derivation

1. Split input into 2 regimes

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

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

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

   1. Initial program 0.0%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in z around inf 99.9%

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

      1. +-commutative 99.9%

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

      2. associate--l+ 99.9%

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

      3. associate-*r/ 99.9%

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

      4. metadata-eval 99.9%

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

      5. sub-neg 99.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) \]

      6. associate-*r/ 99.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) \]

      7. metadata-eval 99.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) \]

      8. distribute-neg-frac 99.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) \]

      9. metadata-eval 99.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 99.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) \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.1%

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

Alternative 4: 95.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \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)}{z \cdot \left(z \cdot \left(z \cdot \left(z + 15.234687407\right) + 31.4690115749\right) + 11.9400905721\right) + 0.607771387771}\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1 + x\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot 3.13060547623\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(y * N[(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[(N[(z * N[(N[(z * N[(N[(z * N[(z + 15.234687407), $MachinePrecision]), $MachinePrecision] + 31.4690115749), $MachinePrecision]), $MachinePrecision] + 11.9400905721), $MachinePrecision]), $MachinePrecision] + 0.607771387771), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + x), $MachinePrecision], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

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

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

   1. Initial program 0.0%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in z around inf 99.1%

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

      1. +-commutative 99.1%

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

      2. *-commutative 99.1%

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

   7. Simplified 99.1%

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

4. Final simplification 95.7%

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

Alternative 5: 95.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.6e+66) (not (<= z 1e+57)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (* y (+ b (* z (+ a (* z (+ t (* z 11.1667541262)))))))
     (+
      (* z (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
      0.607771387771)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.6e66 or 1.00000000000000005e57 < z

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

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

   5. Taylor expanded in z around inf 98.3%

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

      1. +-commutative 98.3%

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

      2. *-commutative 98.3%

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

   7. Simplified 98.3%

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

   if -1.6e66 < z < 1.00000000000000005e57

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

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

Alternative 6: 93.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+36} \lor \neg \left(z \leq 7.2 \cdot 10^{+56}\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 31.4690115749\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.25e+36) (not (<= z 7.2e+56)))
   (+ 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))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.25e+36) || !(z <= 7.2e+56)) {
		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)))));
	}
	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.25d+36)) .or. (.not. (z <= 7.2d+56))) 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)))))
    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.25e+36) || !(z <= 7.2e+56)) {
		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)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.25e+36) or not (z <= 7.2e+56):
		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)))))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.25e+36) || !(z <= 7.2e+56))
		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 * 31.4690115749))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.25e+36) || ~((z <= 7.2e+56)))
		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)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.25e+36], N[Not[LessEqual[z, 7.2e+56]], $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 * 31.4690115749), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.24999999999999994e36 or 7.19999999999999996e56 < z

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

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

      1. +-commutative 96.0%

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

      2. *-commutative 96.0%

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

   7. Simplified 96.0%

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

   if -1.24999999999999994e36 < z < 7.19999999999999996e56

   1. Initial program 97.6%

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

   3. Taylor expanded in z around 0 94.1%

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

      1. *-commutative 71.8%

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

   5. Simplified 94.1%

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

4. Final simplification 95.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+36} \lor \neg \left(z \leq 7.2 \cdot 10^{+56}\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 31.4690115749\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 92.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -13 \lor \neg \left(z \leq 7.2 \cdot 10^{+56}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot b + y \cdot \left(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 11.9400905721}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -13.0], N[Not[LessEqual[z, 7.2e+56]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(N[(y * b), $MachinePrecision] + N[(y * 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 * 11.9400905721), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -13 or 7.19999999999999996e56 < z

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

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

   5. Taylor expanded in z around inf 93.6%

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

      1. +-commutative 93.6%

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

      2. *-commutative 93.6%

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

   7. Simplified 93.6%

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

   if -13 < z < 7.19999999999999996e56

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

   3. Taylor expanded in b around 0 96.0%

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

   4. Taylor expanded in z around 0 92.6%

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

      1. *-commutative 86.2%

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

   6. Simplified 92.6%

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

4. Final simplification 93.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -13 \lor \neg \left(z \leq 7.2 \cdot 10^{+56}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot b + y \cdot \left(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 11.9400905721}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 91.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -4200000000.0) (not (<= z 3e+58)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (+ (* y b) (* a (* y z)))
     (+
      (* z (+ (* z (+ (* z (+ z 15.234687407)) 31.4690115749)) 11.9400905721))
      0.607771387771)))))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -4200000000.0) or not (z <= 3e+58):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + (((y * b) + (a * (y * z))) / ((z * ((z * ((z * (z + 15.234687407)) + 31.4690115749)) + 11.9400905721)) + 0.607771387771))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -4.2e9 or 3.0000000000000002e58 < z

   1. Initial program 8.6%

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

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

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

      1. +-commutative 95.0%

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

      2. *-commutative 95.0%

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

   7. Simplified 95.0%

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

   if -4.2e9 < z < 3.0000000000000002e58

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

   3. Taylor expanded in z around 0 88.0%

      \[\leadsto x + \frac{\color{blue}{a \cdot \left(y \cdot z\right) + b \cdot y}}{\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 91.3%

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

Alternative 9: 84.2% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2020000000 \lor \neg \left(z \leq 2.4 \cdot 10^{+34}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot b}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot 31.4690115749\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -2020000000.0) (not (<= z 2.4e+34)))
   (+ x (* y 3.13060547623))
   (+
    x
    (/
     (* y b)
     (+ 0.607771387771 (* z (+ 11.9400905721 (* z 31.4690115749))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -2020000000.0) || !(z <= 2.4e+34)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * b) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))));
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -2020000000.0) or not (z <= 2.4e+34):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + ((y * b) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -2020000000.0) || ~((z <= 2.4e+34)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + ((y * b) / (0.607771387771 + (z * (11.9400905721 + (z * 31.4690115749)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -2020000000.0], N[Not[LessEqual[z, 2.4e+34]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * b), $MachinePrecision] / N[(0.607771387771 + N[(z * N[(11.9400905721 + N[(z * 31.4690115749), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.02e9 or 2.39999999999999987e34 < z

   1. Initial program 14.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 17.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 92.3%

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

      1. +-commutative 92.3%

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

      2. *-commutative 92.3%

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

   7. Simplified 92.3%

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

   if -2.02e9 < z < 2.39999999999999987e34

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

   3. Taylor expanded in z around 0 74.0%

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

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

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

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

   8. Simplified 74.0%

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

4. Final simplification 83.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2020000000 \lor \neg \left(z \leq 2.4 \cdot 10^{+34}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot b}{0.607771387771 + z \cdot \left(11.9400905721 + z \cdot 31.4690115749\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 90.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.2 \cdot 10^{+22} \lor \neg \left(z \leq 4.5 \cdot 10^{+34}\right):\\ \;\;\;\;x + y \cdot 3.13060547623\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \left(b + z \cdot a\right)}{0.607771387771 + z \cdot 11.9400905721}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -2.2e+22) (not (<= z 4.5e+34)))
   (+ x (* y 3.13060547623))
   (+ x (/ (* y (+ b (* z a))) (+ 0.607771387771 (* z 11.9400905721))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -2.2e+22) || !(z <= 4.5e+34)) {
		tmp = x + (y * 3.13060547623);
	} else {
		tmp = x + ((y * (b + (z * a))) / (0.607771387771 + (z * 11.9400905721)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-2.2d+22)) .or. (.not. (z <= 4.5d+34))) then
        tmp = x + (y * 3.13060547623d0)
    else
        tmp = x + ((y * (b + (z * a))) / (0.607771387771d0 + (z * 11.9400905721d0)))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -2.2e+22) or not (z <= 4.5e+34):
		tmp = x + (y * 3.13060547623)
	else:
		tmp = x + ((y * (b + (z * a))) / (0.607771387771 + (z * 11.9400905721)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -2.2e+22) || !(z <= 4.5e+34))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(Float64(y * Float64(b + Float64(z * a))) / Float64(0.607771387771 + Float64(z * 11.9400905721))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -2.2e+22) || ~((z <= 4.5e+34)))
		tmp = x + (y * 3.13060547623);
	else
		tmp = x + ((y * (b + (z * a))) / (0.607771387771 + (z * 11.9400905721)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -2.2e+22], N[Not[LessEqual[z, 4.5e+34]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * N[(b + N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.607771387771 + N[(z * 11.9400905721), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.2e22 or 4.5e34 < z

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

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

   5. Taylor expanded in z around inf 93.2%

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

      1. +-commutative 93.2%

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

      2. *-commutative 93.2%

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

   7. Simplified 93.2%

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

   if -2.2e22 < z < 4.5e34

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

   3. Taylor expanded in z around 0 87.8%

      \[\leadsto x + \frac{\color{blue}{a \cdot \left(y \cdot z\right) + 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. Taylor expanded in z around 0 86.8%

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

      1. *-commutative 86.8%

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

   6. Simplified 86.8%

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

   7. Taylor expanded in y around 0 88.8%

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

      1. *-commutative 88.8%

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

   9. Simplified 88.8%

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

4. Final simplification 91.0%

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

Alternative 11: 60.8% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -5300000.0) (not (<= z 1.9e-131)))
   (+ x (* y 3.13060547623))
   (* y (+ 3.13060547623 (* b 1.6453555072203998)))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.3e6 or 1.89999999999999997e-131 < z

   1. Initial program 29.1%

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

   3. Simplified 32.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 80.8%

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

      1. +-commutative 80.8%

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

      2. *-commutative 80.8%

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

   7. Simplified 80.8%

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

   if -5.3e6 < z < 1.89999999999999997e-131

   1. Initial program 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in y around inf 76.4%

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

   6. Taylor expanded in z around inf 49.2%

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

   7. Taylor expanded in z around 0 48.6%

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

      1. *-commutative 48.6%

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

   9. Simplified 48.6%

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

4. Final simplification 68.6%

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

Alternative 12: 84.1% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4200000000 \lor \neg \left(z \leq 4.1 \cdot 10^{+34}\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 -4200000000.0) (not (<= z 4.1e+34)))
   (+ 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 <= -4200000000.0) || !(z <= 4.1e+34)) {
		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 <= (-4200000000.0d0)) .or. (.not. (z <= 4.1d+34))) 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 <= -4200000000.0) || !(z <= 4.1e+34)) {
		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 <= -4200000000.0) or not (z <= 4.1e+34):
		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 <= -4200000000.0) || !(z <= 4.1e+34))
		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 <= -4200000000.0) || ~((z <= 4.1e+34)))
		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, -4200000000.0], N[Not[LessEqual[z, 4.1e+34]], $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 < -4.2e9 or 4.0999999999999998e34 < z

   1. Initial program 14.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 17.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 92.3%

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

      1. +-commutative 92.3%

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

      2. *-commutative 92.3%

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

   7. Simplified 92.3%

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

   if -4.2e9 < z < 4.0999999999999998e34

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

   3. Taylor expanded in z around 0 73.6%

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

      1. *-commutative 73.6%

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

      2. *-commutative 73.6%

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

      3. associate-*l* 73.6%

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

   5. Simplified 73.6%

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

4. Final simplification 83.0%

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

Alternative 13: 84.1% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -940000000.0) (not (<= z 2.6e+34)))
   (+ 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 <= -940000000.0) || !(z <= 2.6e+34)) {
		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 <= (-940000000.0d0)) .or. (.not. (z <= 2.6d+34))) 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 <= -940000000.0) || !(z <= 2.6e+34)) {
		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 <= -940000000.0) or not (z <= 2.6e+34):
		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 <= -940000000.0) || !(z <= 2.6e+34))
		tmp = Float64(x + Float64(y * 3.13060547623));
	else
		tmp = Float64(x + Float64(Float64(y * b) * 1.6453555072203998));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -940000000.0) || ~((z <= 2.6e+34)))
		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, -940000000.0], N[Not[LessEqual[z, 2.6e+34]], $MachinePrecision]], N[(x + N[(y * 3.13060547623), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * b), $MachinePrecision] * 1.6453555072203998), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.4e8 or 2.59999999999999997e34 < z

   1. Initial program 14.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 17.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 92.3%

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

      1. +-commutative 92.3%

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

      2. *-commutative 92.3%

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

   7. Simplified 92.3%

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

   if -9.4e8 < z < 2.59999999999999997e34

   1. Initial program 98.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 98.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 0 73.6%

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

      1. +-commutative 73.6%

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

      2. *-commutative 73.6%

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

   7. Simplified 73.6%

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

4. Final simplification 83.0%

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

Alternative 14: 62.5% accurate, 7.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

5. Taylor expanded in z around inf 58.1%

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

   1. +-commutative 58.1%

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

   2. *-commutative 58.1%

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

7. Simplified 58.1%

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

8. Final simplification 58.1%

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

Alternative 15: 45.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 55.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 57.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 38.1%

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

6. Final simplification 38.1%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 98.9% 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 2024043 
(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))))