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

Percentage Accurate: 58.1% → 94.9%

Time: 12.1s

Alternatives: 10

Speedup: 11.3×

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.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 94.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 96.1%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 99.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 99.0%

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

Alternative 2: 72.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \left(1.6453555072203998 \cdot y\right)\\ t_2 := \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}\\ \mathbf{if}\;t\_2 \leq -2 \cdot 10^{+113}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 10^{+77}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(3.13060547623, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (* 1.6453555072203998 y)))
        (t_2
         (/
          (*
           y
           (+
            (* (+ (* (+ (* (+ (* z 3.13060547623) 11.1667541262) z) t) z) a) z)
            b))
          (+
           (*
            (+ (* (+ (* (+ z 15.234687407) z) 31.4690115749) z) 11.9400905721)
            z)
           0.607771387771))))
   (if (<= t_2 -2e+113)
     t_1
     (if (<= t_2 1e+77)
       (* 1.0 x)
       (if (<= t_2 INFINITY) t_1 (fma 3.13060547623 y x))))))

C

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

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(b * Float64(1.6453555072203998 * y))
	t_2 = 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))
	tmp = 0.0
	if (t_2 <= -2e+113)
		tmp = t_1;
	elseif (t_2 <= 1e+77)
		tmp = Float64(1.0 * x);
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = fma(3.13060547623, y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(1.6453555072203998 * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, If[LessEqual[t$95$2, -2e+113], t$95$1, If[LessEqual[t$95$2, 1e+77], N[(1.0 * x), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$1, N[(3.13060547623 * y + x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

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

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

      \[\leadsto x + \frac{\color{blue}{b \cdot y}}{\left(\left(\left(z + \frac{15234687407}{1000000000}\right) \cdot z + \frac{314690115749}{10000000000}\right) \cdot z + \frac{119400905721}{10000000000}\right) \cdot z + \frac{607771387771}{1000000000000}} \]
   4. Step-by-step derivation

      1. lower-*.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{b \cdot y}{\frac{607771387771}{1000000000000} + z \cdot \left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right)\right)}} \]
   7. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto \color{blue}{b \cdot \frac{y}{\frac{607771387771}{1000000000000} + z \cdot \left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{b \cdot \frac{y}{\frac{607771387771}{1000000000000} + z \cdot \left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right)\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto b \cdot \color{blue}{\frac{y}{\frac{607771387771}{1000000000000} + z \cdot \left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right)\right)}} \]

      4. +-commutative N/A

         \[\leadsto b \cdot \frac{y}{\color{blue}{z \cdot \left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right)\right) + \frac{607771387771}{1000000000000}}} \]

      5. *-commutative N/A

         \[\leadsto b \cdot \frac{y}{\color{blue}{\left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right)\right) \cdot z} + \frac{607771387771}{1000000000000}} \]

      6. lower-fma.f64 N/A

         \[\leadsto b \cdot \frac{y}{\color{blue}{\mathsf{fma}\left(\frac{119400905721}{10000000000} + z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right), z, \frac{607771387771}{1000000000000}\right)}} \]

      7. +-commutative N/A

         \[\leadsto b \cdot \frac{y}{\mathsf{fma}\left(\color{blue}{z \cdot \left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right) + \frac{119400905721}{10000000000}}, z, \frac{607771387771}{1000000000000}\right)} \]

      8. *-commutative N/A

         \[\leadsto b \cdot \frac{y}{\mathsf{fma}\left(\color{blue}{\left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right)\right) \cdot z} + \frac{119400905721}{10000000000}, z, \frac{607771387771}{1000000000000}\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto b \cdot \frac{y}{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{314690115749}{10000000000} + z \cdot \left(\frac{15234687407}{1000000000} + z\right), z, \frac{119400905721}{10000000000}\right)}, z, \frac{607771387771}{1000000000000}\right)} \]

      10. +-commutative N/A

          \[\leadsto b \cdot \frac{y}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot \left(\frac{15234687407}{1000000000} + z\right) + \frac{314690115749}{10000000000}}, z, \frac{119400905721}{10000000000}\right), z, \frac{607771387771}{1000000000000}\right)} \]

      11. *-commutative N/A

          \[\leadsto b \cdot \frac{y}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\left(\frac{15234687407}{1000000000} + z\right) \cdot z} + \frac{314690115749}{10000000000}, z, \frac{119400905721}{10000000000}\right), z, \frac{607771387771}{1000000000000}\right)} \]

      12. lower-fma.f64 N/A

          \[\leadsto b \cdot \frac{y}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{15234687407}{1000000000} + z, z, \frac{314690115749}{10000000000}\right)}, z, \frac{119400905721}{10000000000}\right), z, \frac{607771387771}{1000000000000}\right)} \]

      13. lower-+.f64 58.3

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

   8. Applied rewrites 58.3%

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

   9. Taylor expanded in z around 0

      \[\leadsto b \cdot \left(\frac{1000000000000}{607771387771} \cdot \color{blue}{y}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 57.0%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 66.7

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 66.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + \frac{313060547623}{100000000000} \cdot \frac{y}{x}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.6%

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

   9. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 70.9%

       \[\leadsto 1 \cdot x \]

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

   1. Initial program 0.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 99.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 99.0%

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

Alternative 3: 93.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 96.1%

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

   3. Taylor expanded in z around 0

      \[\leadsto x + \frac{y \cdot \color{blue}{\left(b + z \cdot \left(a + t \cdot z\right)\right)}}{\left(\left(\left(z + \frac{15234687407}{1000000000}\right) \cdot z + \frac{314690115749}{10000000000}\right) \cdot z + \frac{119400905721}{10000000000}\right) \cdot z + \frac{607771387771}{1000000000000}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x + \frac{y \cdot \color{blue}{\left(z \cdot \left(a + t \cdot z\right) + b\right)}}{\left(\left(\left(z + \frac{15234687407}{1000000000}\right) \cdot z + \frac{314690115749}{10000000000}\right) \cdot z + \frac{119400905721}{10000000000}\right) \cdot z + \frac{607771387771}{1000000000000}} \]

      2. *-commutative N/A

         \[\leadsto x + \frac{y \cdot \left(\color{blue}{\left(a + t \cdot z\right) \cdot z} + b\right)}{\left(\left(\left(z + \frac{15234687407}{1000000000}\right) \cdot z + \frac{314690115749}{10000000000}\right) \cdot z + \frac{119400905721}{10000000000}\right) \cdot z + \frac{607771387771}{1000000000000}} \]

      3. lower-fma.f64 N/A

         \[\leadsto x + \frac{y \cdot \color{blue}{\mathsf{fma}\left(a + t \cdot z, z, b\right)}}{\left(\left(\left(z + \frac{15234687407}{1000000000}\right) \cdot z + \frac{314690115749}{10000000000}\right) \cdot z + \frac{119400905721}{10000000000}\right) \cdot z + \frac{607771387771}{1000000000000}} \]

      4. +-commutative N/A

         \[\leadsto x + \frac{y \cdot \mathsf{fma}\left(\color{blue}{t \cdot z + a}, z, b\right)}{\left(\left(\left(z + \frac{15234687407}{1000000000}\right) \cdot z + \frac{314690115749}{10000000000}\right) \cdot z + \frac{119400905721}{10000000000}\right) \cdot z + \frac{607771387771}{1000000000000}} \]

      5. lower-fma.f64 95.1

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

   5. Applied rewrites 95.1%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 99.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 99.0%

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

Alternative 4: 92.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -30000000000000 \lor \neg \left(z \leq 1.7 \cdot 10^{+31}\right):\\ \;\;\;\;\mathsf{fma}\left(3.13060547623, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \mathsf{fma}\left(\mathsf{fma}\left(t, z, a\right), z, b\right)}{11.9400905721 \cdot z + 0.607771387771}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -30000000000000.0) (not (<= z 1.7e+31)))
   (fma 3.13060547623 y x)
   (+
    x
    (/ (* y (fma (fma t z a) z b)) (+ (* 11.9400905721 z) 0.607771387771)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -30000000000000.0) || !(z <= 1.7e+31)) {
		tmp = fma(3.13060547623, y, x);
	} else {
		tmp = x + ((y * fma(fma(t, z, a), z, b)) / ((11.9400905721 * z) + 0.607771387771));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -30000000000000.0) || !(z <= 1.7e+31))
		tmp = fma(3.13060547623, y, x);
	else
		tmp = Float64(x + Float64(Float64(y * fma(fma(t, z, a), z, b)) / Float64(Float64(11.9400905721 * z) + 0.607771387771)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -3e13 or 1.6999999999999999e31 < z

   1. Initial program 12.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 93.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 93.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   if -3e13 < z < 1.6999999999999999e31

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\left(z \cdot \frac{313060547623}{100000000000} + \frac{55833770631}{5000000000}\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\color{blue}{\frac{119400905721}{10000000000} \cdot z} + \frac{607771387771}{1000000000000}} \]
   4. Step-by-step derivation

      1. lower-*.f64 96.3

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

   5. Applied rewrites 96.3%

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

   6. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto x + \frac{y \cdot \color{blue}{\left(z \cdot \left(a + t \cdot z\right) + b\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]

      2. *-commutative N/A

         \[\leadsto x + \frac{y \cdot \left(\color{blue}{\left(a + t \cdot z\right) \cdot z} + b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]

      3. lower-fma.f64 N/A

         \[\leadsto x + \frac{y \cdot \color{blue}{\mathsf{fma}\left(a + t \cdot z, z, b\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]

      4. +-commutative N/A

         \[\leadsto x + \frac{y \cdot \mathsf{fma}\left(\color{blue}{t \cdot z + a}, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]

      5. lower-fma.f64 97.0

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

   8. Applied rewrites 97.0%

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

4. Final simplification 95.5%

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

Alternative 5: 89.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -30000000000000 \lor \neg \left(z \leq 5.5 \cdot 10^{+30}\right):\\ \;\;\;\;\mathsf{fma}\left(3.13060547623, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\mathsf{fma}\left(a, z, b\right)}{11.9400905721 \cdot z + 0.607771387771}, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -30000000000000.0) (not (<= z 5.5e+30)))
   (fma 3.13060547623 y x)
   (fma (/ (fma a z b) (+ (* 11.9400905721 z) 0.607771387771)) y x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -30000000000000.0) || !(z <= 5.5e+30)) {
		tmp = fma(3.13060547623, y, x);
	} else {
		tmp = fma((fma(a, z, b) / ((11.9400905721 * z) + 0.607771387771)), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -30000000000000.0) || !(z <= 5.5e+30))
		tmp = fma(3.13060547623, y, x);
	else
		tmp = fma(Float64(fma(a, z, b) / Float64(Float64(11.9400905721 * z) + 0.607771387771)), y, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -3e13 or 5.50000000000000025e30 < z

   1. Initial program 12.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 93.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 93.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   if -3e13 < z < 5.50000000000000025e30

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\left(z \cdot \frac{313060547623}{100000000000} + \frac{55833770631}{5000000000}\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\color{blue}{\frac{119400905721}{10000000000} \cdot z} + \frac{607771387771}{1000000000000}} \]
   4. Step-by-step derivation

      1. lower-*.f64 96.3

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

   5. Applied rewrites 96.3%

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

   6. Taylor expanded in z around 0

      \[\leadsto x + \frac{y \cdot \color{blue}{\left(b + a \cdot z\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x + \frac{y \cdot \color{blue}{\left(a \cdot z + b\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]

      2. lower-fma.f64 92.4

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

   8. Applied rewrites 92.4%

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

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + \frac{y \cdot \mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\frac{y \cdot \mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} + x} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y \cdot \mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}}} + x \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{y \cdot \mathsf{fma}\left(a, z, b\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} + x \]

      5. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{\mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}}} + x \]

      6. *-commutative N/A

         \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \cdot y} + x \]

   10. Applied rewrites 92.4%

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

4. Final simplification 93.1%

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

Alternative 6: 89.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -30000000000000 \lor \neg \left(z \leq 5.5 \cdot 10^{+30}\right):\\ \;\;\;\;\mathsf{fma}\left(3.13060547623, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, z, b\right), \frac{y}{11.9400905721 \cdot z + 0.607771387771}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -30000000000000.0) (not (<= z 5.5e+30)))
   (fma 3.13060547623 y x)
   (fma (fma a z b) (/ y (+ (* 11.9400905721 z) 0.607771387771)) x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -30000000000000.0) || !(z <= 5.5e+30)) {
		tmp = fma(3.13060547623, y, x);
	} else {
		tmp = fma(fma(a, z, b), (y / ((11.9400905721 * z) + 0.607771387771)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -30000000000000.0) || !(z <= 5.5e+30))
		tmp = fma(3.13060547623, y, x);
	else
		tmp = fma(fma(a, z, b), Float64(y / Float64(Float64(11.9400905721 * z) + 0.607771387771)), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -3e13 or 5.50000000000000025e30 < z

   1. Initial program 12.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 93.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 93.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   if -3e13 < z < 5.50000000000000025e30

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

      \[\leadsto x + \frac{y \cdot \left(\left(\left(\left(z \cdot \frac{313060547623}{100000000000} + \frac{55833770631}{5000000000}\right) \cdot z + t\right) \cdot z + a\right) \cdot z + b\right)}{\color{blue}{\frac{119400905721}{10000000000} \cdot z} + \frac{607771387771}{1000000000000}} \]
   4. Step-by-step derivation

      1. lower-*.f64 96.3

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

   5. Applied rewrites 96.3%

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

   6. Taylor expanded in z around 0

      \[\leadsto x + \frac{y \cdot \color{blue}{\left(b + a \cdot z\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x + \frac{y \cdot \color{blue}{\left(a \cdot z + b\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} \]

      2. lower-fma.f64 92.4

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

   8. Applied rewrites 92.4%

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

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + \frac{y \cdot \mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\frac{y \cdot \mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} + x} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y \cdot \mathsf{fma}\left(a, z, b\right)}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}}} + x \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{y \cdot \mathsf{fma}\left(a, z, b\right)}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} + x \]

      5. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(a, z, b\right) \cdot y}}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}} + x \]

      6. associate-/l* N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(a, z, b\right) \cdot \frac{y}{\frac{119400905721}{10000000000} \cdot z + \frac{607771387771}{1000000000000}}} + x \]

   10. Applied rewrites 91.8%

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

4. Final simplification 92.8%

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

Alternative 7: 83.1% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -58000000000000 \lor \neg \left(z \leq 3.5 \cdot 10^{+28}\right):\\ \;\;\;\;\mathsf{fma}\left(3.13060547623, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot y, 1.6453555072203998, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -58000000000000.0) (not (<= z 3.5e+28)))
   (fma 3.13060547623 y x)
   (fma (* b y) 1.6453555072203998 x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.8e13 or 3.5e28 < z

   1. Initial program 12.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 93.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 93.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   if -5.8e13 < z < 3.5e28

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot y, \frac{1000000000000}{607771387771}, x\right)} \]

      4. lower-*.f64 79.1

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

   5. Applied rewrites 79.1%

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

4. Final simplification 85.9%

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

Alternative 8: 51.2% accurate, 4.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+113} \lor \neg \left(y \leq 4.9 \cdot 10^{+83}\right):\\ \;\;\;\;3.13060547623 \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -5.8e+113) (not (<= y 4.9e+83))) (* 3.13060547623 y) (* 1.0 x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -5.8e+113) || !(y <= 4.9e+83)) {
		tmp = 3.13060547623 * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-5.8d+113)) .or. (.not. (y <= 4.9d+83))) then
        tmp = 3.13060547623d0 * y
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -5.8e+113) || !(y <= 4.9e+83)) {
		tmp = 3.13060547623 * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -5.8e+113) or not (y <= 4.9e+83):
		tmp = 3.13060547623 * y
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -5.8e+113) || !(y <= 4.9e+83))
		tmp = Float64(3.13060547623 * y);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -5.8e+113) || ~((y <= 4.9e+83)))
		tmp = 3.13060547623 * y;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -5.8e+113], N[Not[LessEqual[y, 4.9e+83]], $MachinePrecision]], N[(3.13060547623 * y), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.79999999999999968e113 or 4.89999999999999979e83 < y

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

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 49.7

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 49.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{313060547623}{100000000000} \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 39.8%

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

   if -5.79999999999999968e113 < y < 4.89999999999999979e83

   1. Initial program 61.1%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

      2. lower-fma.f64 74.4

         \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   5. Applied rewrites 74.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + \frac{313060547623}{100000000000} \cdot \frac{y}{x}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 73.7%

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

   9. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 68.1%

       \[\leadsto 1 \cdot x \]
3. Recombined 2 regimes into one program.

4. Final simplification 57.5%

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

Alternative 9: 62.3% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(3.13060547623, y, x\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 58.9%

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

3. Taylor expanded in z around inf

   \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

   2. lower-fma.f64 65.1

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

5. Applied rewrites 65.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]
6. Add Preprocessing

Alternative 10: 21.7% accurate, 13.2× speedup

Math

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

FPCore

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

C

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

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 = 3.13060547623d0 * y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 58.9%

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

3. Taylor expanded in z around inf

   \[\leadsto \color{blue}{x + \frac{313060547623}{100000000000} \cdot y} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\frac{313060547623}{100000000000} \cdot y + x} \]

   2. lower-fma.f64 65.1

      \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

5. Applied rewrites 65.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(3.13060547623, y, x\right)} \]

6. Taylor expanded in x around 0

   \[\leadsto \frac{313060547623}{100000000000} \cdot \color{blue}{y} \]
7. Step-by-step derivation

8. Applied rewrites 22.3%

   \[\leadsto 3.13060547623 \cdot \color{blue}{y} \]
9. Add Preprocessing

Developer Target 1: 98.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (if (< z -649934499625263200000000000000000000000000000000000000) (+ x (* (+ (- 313060547623/100000000000 (/ 18263520849403207/500000000000000 z)) (/ t (* z z))) (/ y 1))) (if (< z 706696543691428700000000000000000000000000000000000000000000) (+ x (/ y (/ (+ (* (+ (* (+ (* (+ z 15234687407/1000000000) z) 314690115749/10000000000) z) 119400905721/10000000000) z) 607771387771/1000000000000) (+ (* (+ (* (+ (* (+ (* z 313060547623/100000000000) 55833770631/5000000000) z) t) z) a) z) b)))) (+ x (* (+ (- 313060547623/100000000000 (/ 18263520849403207/500000000000000 z)) (/ t (* z z))) (/ y 1))))))

  (+ 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))))