Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2

Percentage Accurate: 54.9% → 81.9%

Time: 12.8s

Alternatives: 12

Speedup: 2.0×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (/
  (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t)
  (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: c
    real(8), intent (in) :: i
    code = ((((((((x * y) + z) * y) + 27464.7644705d0) * y) + 230661.510616d0) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Python

def code(x, y, z, t, a, b, c, i):
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]

Initial Program: 54.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (/
  (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t)
  (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: c
    real(8), intent (in) :: i
    code = ((((((((x * y) + z) * y) + 27464.7644705d0) * y) + 230661.510616d0) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Python

def code(x, y, z, t, a, b, c, i):
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]

Alternative 1: 81.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{+66} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\mathsf{fma}\left(x \cdot y, y, \mathsf{fma}\left(z, y, 27464.7644705\right)\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -7.6e+66) (not (<= y 3.2e+36)))
   (+ x (/ (- z (* a x)) y))
   (/
    (+ (* (+ (* (fma (* x y) y (fma z y 27464.7644705)) y) 230661.510616) y) t)
    (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -7.6e+66) || !(y <= 3.2e+36)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = ((((fma((x * y), y, fma(z, y, 27464.7644705)) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -7.6e+66) || !(y <= 3.2e+36))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(fma(Float64(x * y), y, fma(z, y, 27464.7644705)) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -7.6e+66], N[Not[LessEqual[y, 3.2e+36]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] * y + N[(z * y + 27464.7644705), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.6000000000000004e66 or 3.1999999999999999e36 < y

   1. Initial program 3.2%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.3

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 68.5

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

   8. Applied rewrites 68.5%

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

   if -7.6000000000000004e66 < y < 3.1999999999999999e36

   1. Initial program 94.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\left(x \cdot y + z\right) \cdot y} + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      2. *-commutative N/A

         \[\leadsto \frac{\left(\left(\color{blue}{y \cdot \left(x \cdot y + z\right)} + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      3. lift-+.f64 N/A

         \[\leadsto \frac{\left(\left(y \cdot \color{blue}{\left(x \cdot y + z\right)} + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      4. distribute-rgt-in N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\left(\left(x \cdot y\right) \cdot y + z \cdot y\right)} + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      5. lower-fma.f64 N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\mathsf{fma}\left(x \cdot y, y, z \cdot y\right)} + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{\left(\left(\mathsf{fma}\left(\color{blue}{x \cdot y}, y, z \cdot y\right) + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      7. *-commutative N/A

         \[\leadsto \frac{\left(\left(\mathsf{fma}\left(\color{blue}{y \cdot x}, y, z \cdot y\right) + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{\left(\left(\mathsf{fma}\left(\color{blue}{y \cdot x}, y, z \cdot y\right) + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      9. lower-*.f64 94.7

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

   4. Applied rewrites 94.7%

      \[\leadsto \frac{\left(\left(\color{blue}{\mathsf{fma}\left(y \cdot x, y, z \cdot y\right)} + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\left(\color{blue}{\left(\mathsf{fma}\left(y \cdot x, y, z \cdot y\right) + \frac{54929528941}{2000000}\right)} \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      2. lift-fma.f64 N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\left(\left(y \cdot x\right) \cdot y + z \cdot y\right)} + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      3. associate-+l+ N/A

         \[\leadsto \frac{\left(\color{blue}{\left(\left(y \cdot x\right) \cdot y + \left(z \cdot y + \frac{54929528941}{2000000}\right)\right)} \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\left(y \cdot x\right)} \cdot y + \left(z \cdot y + \frac{54929528941}{2000000}\right)\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      5. *-commutative N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\left(x \cdot y\right)} \cdot y + \left(z \cdot y + \frac{54929528941}{2000000}\right)\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{\left(\left(\color{blue}{\left(x \cdot y\right)} \cdot y + \left(z \cdot y + \frac{54929528941}{2000000}\right)\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      7. lift-*.f64 N/A

         \[\leadsto \frac{\left(\left(\left(x \cdot y\right) \cdot y + \left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}\right)\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      8. lift-fma.f64 N/A

         \[\leadsto \frac{\left(\left(\left(x \cdot y\right) \cdot y + \color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      9. lower-fma.f64 94.7

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

   6. Applied rewrites 94.7%

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

4. Final simplification 83.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{+66} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\mathsf{fma}\left(x \cdot y, y, \mathsf{fma}\left(z, y, 27464.7644705\right)\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 82.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)\\ \mathbf{if}\;\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), \frac{y}{t\_1}, \frac{t}{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma (fma (fma (+ a y) y b) y c) y i)))
   (if (<=
        (/
         (+
          (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y)
          t)
         (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))
        INFINITY)
     (fma
      (fma (fma (fma y x z) y 27464.7644705) y 230661.510616)
      (/ y t_1)
      (/ t t_1))
     (+ x (/ (- z (* a x)) y)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(fma(fma((a + y), y, b), y, c), y, i);
	double tmp;
	if ((((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)) <= ((double) INFINITY)) {
		tmp = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), (y / t_1), (t / t_1));
	} else {
		tmp = x + ((z - (a * x)) / y);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(fma(fma(Float64(a + y), y, b), y, c), y, i)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i)) <= Inf)
		tmp = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), Float64(y / t_1), Float64(t / t_1));
	else
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * N[(y / t$95$1), $MachinePrecision] + N[(t / t$95$1), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 x y) z) y) #s(literal 54929528941/2000000 binary64)) y) #s(literal 28832688827/125000 binary64)) y) t) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 y a) y) b) y) c) y) i)) < +inf.0

   1. Initial program 89.8%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(\left(\left(x \cdot y + z\right) \cdot y + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y + t}}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      3. div-add N/A

         \[\leadsto \color{blue}{\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} + \frac{t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(\left(\left(x \cdot y + z\right) \cdot y + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot y}}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} + \frac{t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      5. associate-/l* N/A

         \[\leadsto \color{blue}{\left(\left(\left(x \cdot y + z\right) \cdot y + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}\right) \cdot \frac{y}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}} + \frac{t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\left(\left(x \cdot y + z\right) \cdot y + \frac{54929528941}{2000000}\right) \cdot y + \frac{28832688827}{125000}, \frac{y}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}, \frac{t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\right)} \]

   4. Applied rewrites 91.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), \frac{y}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}, \frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\right)} \]

   if +inf.0 < (/.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 x y) z) y) #s(literal 54929528941/2000000 binary64)) y) #s(literal 28832688827/125000 binary64)) y) t) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 y a) y) b) y) c) y) i))

   1. Initial program 0.0%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.2

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.2%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 68.6

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

   8. Applied rewrites 68.6%

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

4. Final simplification 83.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), \frac{y}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}, \frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 34.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \leq \infty:\\ \;\;\;\;\frac{t}{i}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<=
      (/
       (+
        (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y)
        t)
       (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))
      INFINITY)
   (/ t i)
   (/ z y)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)) <= ((double) INFINITY)) {
		tmp = t / i;
	} else {
		tmp = z / y;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)) <= Double.POSITIVE_INFINITY) {
		tmp = t / i;
	} else {
		tmp = z / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)) <= math.inf:
		tmp = t / i
	else:
		tmp = z / y
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i)) <= Inf)
		tmp = Float64(t / i);
	else
		tmp = Float64(z / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)) <= Inf)
		tmp = t / i;
	else
		tmp = z / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision], Infinity], N[(t / i), $MachinePrecision], N[(z / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 x y) z) y) #s(literal 54929528941/2000000 binary64)) y) #s(literal 28832688827/125000 binary64)) y) t) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 y a) y) b) y) c) y) i)) < +inf.0

   1. Initial program 89.8%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 47.5

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 47.5%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   if +inf.0 < (/.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 x y) z) y) #s(literal 54929528941/2000000 binary64)) y) #s(literal 28832688827/125000 binary64)) y) t) (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 (*.f64 (+.f64 y a) y) b) y) c) y) i))

   1. Initial program 0.0%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot z\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot z, y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot z + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

      12. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

   5. Applied rewrites 0.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}} \]

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 19.3%

      \[\leadsto \frac{z}{\color{blue}{y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 81.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{+66} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -7.6e+66) (not (<= y 3.2e+36)))
   (+ x (/ (- z (* a x)) y))
   (/
    (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t)
    (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -7.6e+66) || !(y <= 3.2e+36)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-7.6d+66)) .or. (.not. (y <= 3.2d+36))) then
        tmp = x + ((z - (a * x)) / y)
    else
        tmp = ((((((((x * y) + z) * y) + 27464.7644705d0) * y) + 230661.510616d0) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -7.6e+66) || !(y <= 3.2e+36)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -7.6e+66) or not (y <= 3.2e+36):
		tmp = x + ((z - (a * x)) / y)
	else:
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -7.6e+66) || !(y <= 3.2e+36))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -7.6e+66) || ~((y <= 3.2e+36)))
		tmp = x + ((z - (a * x)) / y);
	else
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -7.6e+66], N[Not[LessEqual[y, 3.2e+36]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.6000000000000004e66 or 3.1999999999999999e36 < y

   1. Initial program 3.2%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.3

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 68.5

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

   8. Applied rewrites 68.5%

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

   if -7.6000000000000004e66 < y < 3.1999999999999999e36

   1. Initial program 94.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 83.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{+66} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.2 \cdot 10^{+66} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -8.2e+66) (not (<= y 3.2e+36)))
   (+ x (/ (- z (* a x)) y))
   (/
    (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t)
    (fma (fma (fma y y b) y c) y i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -8.2e+66) || !(y <= 3.2e+36)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma(y, y, b), y, c), y, i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -8.2e+66) || !(y <= 3.2e+36))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma(y, y, b), y, c), y, i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -8.2e+66], N[Not[LessEqual[y, 3.2e+36]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(N[(N[(y * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -8.19999999999999989e66 or 3.1999999999999999e36 < y

   1. Initial program 3.2%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.3

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 68.5

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

   8. Applied rewrites 68.5%

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

   if -8.19999999999999989e66 < y < 3.1999999999999999e36

   1. Initial program 94.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right), y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot \left(z + x \cdot y\right) + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\left(z + x \cdot y\right) \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z + x \cdot y, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{x \cdot y + z}, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      12. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot x} + z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(y, x, z\right)}, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right)} \]

      14. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + {y}^{2}\right)\right) + i}} \]

   5. Applied rewrites 92.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, y, b\right), y, c\right), y, i\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8.2 \cdot 10^{+66} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 78.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+73} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -5.8e+73) (not (<= y 3.2e+36)))
   (+ x (/ (- z (* a x)) y))
   (/
    (fma (fma (fma z y 27464.7644705) y 230661.510616) y t)
    (fma (fma (fma (+ a y) y b) y c) y i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -5.8e+73) || !(y <= 3.2e+36)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma((a + y), y, b), y, c), y, i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -5.8e+73) || !(y <= 3.2e+36))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -5.8e+73], N[Not[LessEqual[y, 3.2e+36]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(z * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.8000000000000005e73 or 3.1999999999999999e36 < y

   1. Initial program 3.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.4

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.4%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 69.2

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

   8. Applied rewrites 69.2%

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

   if -5.8000000000000005e73 < y < 3.1999999999999999e36

   1. Initial program 94.1%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot z\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot z, y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot z + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

      12. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

   5. Applied rewrites 88.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+73} \lor \neg \left(y \leq 3.2 \cdot 10^{+36}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 74.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+73} \lor \neg \left(y \leq 1.55 \cdot 10^{+31}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + 27464.7644705 \cdot y\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -5.8e+73) (not (<= y 1.55e+31)))
   (+ x (/ (- z (* a x)) y))
   (/
    (+ t (* y (+ 230661.510616 (* 27464.7644705 y))))
    (fma (fma (fma (+ a y) y b) y c) y i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -5.8e+73) || !(y <= 1.55e+31)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = (t + (y * (230661.510616 + (27464.7644705 * y)))) / fma(fma(fma((a + y), y, b), y, c), y, i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -5.8e+73) || !(y <= 1.55e+31))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(27464.7644705 * y)))) / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -5.8e+73], N[Not[LessEqual[y, 1.55e+31]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * N[(230661.510616 + N[(27464.7644705 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.8000000000000005e73 or 1.5500000000000001e31 < y

   1. Initial program 5.1%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.4

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.4%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 67.9

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

   8. Applied rewrites 67.9%

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

   if -5.8000000000000005e73 < y < 1.5500000000000001e31

   1. Initial program 94.0%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot z\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot z, y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot z + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

      12. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

   5. Applied rewrites 88.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}} \]

   6. Taylor expanded in y around 0

      \[\leadsto \frac{t + y \cdot \left(\frac{28832688827}{125000} + \frac{54929528941}{2000000} \cdot y\right)}{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right)}, y, i\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 83.1%

      \[\leadsto \frac{t + y \cdot \left(230661.510616 + 27464.7644705 \cdot y\right)}{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right)}, y, i\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 76.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+73} \lor \neg \left(y \leq 1.55 \cdot 10^{+31}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + 27464.7644705 \cdot y\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 73.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+72} \lor \neg \left(y \leq 7.5 \cdot 10^{+32}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t + 230661.510616 \cdot y}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -1.35e+72) (not (<= y 7.5e+32)))
   (+ x (/ (- z (* a x)) y))
   (/ (+ t (* 230661.510616 y)) (fma (fma (fma (+ a y) y b) y c) y i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -1.35e+72) || !(y <= 7.5e+32)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = (t + (230661.510616 * y)) / fma(fma(fma((a + y), y, b), y, c), y, i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -1.35e+72) || !(y <= 7.5e+32))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(Float64(t + Float64(230661.510616 * y)) / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.35e+72], N[Not[LessEqual[y, 7.5e+32]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(230661.510616 * y), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.35e72 or 7.49999999999999959e32 < y

   1. Initial program 3.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.4

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.4%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 69.2

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

   8. Applied rewrites 69.2%

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

   if -1.35e72 < y < 7.49999999999999959e32

   1. Initial program 94.1%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot z\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot z, y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot z + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

      12. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

   5. Applied rewrites 88.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}} \]

   6. Taylor expanded in y around 0

      \[\leadsto \frac{t + \frac{28832688827}{125000} \cdot y}{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right)}, y, i\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 81.2%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+72} \lor \neg \left(y \leq 7.5 \cdot 10^{+32}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t + 230661.510616 \cdot y}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 66.4% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+72} \lor \neg \left(y \leq 7.5 \cdot 10^{+32}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -1.35e+72) (not (<= y 7.5e+32)))
   (+ x (/ (- z (* a x)) y))
   (/ t (fma (fma (fma (+ a y) y b) y c) y i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -1.35e+72) || !(y <= 7.5e+32)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = t / fma(fma(fma((a + y), y, b), y, c), y, i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -1.35e+72) || !(y <= 7.5e+32))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(t / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.35e+72], N[Not[LessEqual[y, 7.5e+32]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(t / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.35e72 or 7.49999999999999959e32 < y

   1. Initial program 3.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.4

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.4%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 69.2

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

   8. Applied rewrites 69.2%

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

   if -1.35e72 < y < 7.49999999999999959e32

   1. Initial program 94.1%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{t}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

      3. *-commutative N/A

         \[\leadsto \frac{t}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{t}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

      5. +-commutative N/A

         \[\leadsto \frac{t}{\mathsf{fma}\left(\color{blue}{y \cdot \left(b + y \cdot \left(a + y\right)\right) + c}, y, i\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{t}{\mathsf{fma}\left(\color{blue}{\left(b + y \cdot \left(a + y\right)\right) \cdot y} + c, y, i\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{t}{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(b + y \cdot \left(a + y\right), y, c\right)}, y, i\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot \left(a + y\right) + b}, y, c\right), y, i\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\left(a + y\right) \cdot y} + b, y, c\right), y, i\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(a + y, y, b\right)}, y, c\right), y, i\right)} \]

      11. lower-+.f64 68.8

          \[\leadsto \frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{a + y}, y, b\right), y, c\right), y, i\right)} \]

   5. Applied rewrites 68.8%

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

4. Final simplification 68.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+72} \lor \neg \left(y \leq 7.5 \cdot 10^{+32}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 55.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.2 \cdot 10^{+55} \lor \neg \left(y \leq 4.2 \cdot 10^{-6}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -5.2e+55) (not (<= y 4.2e-6)))
   (+ x (/ (- z (* a x)) y))
   (/ t i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -5.2e+55) || !(y <= 4.2e-6)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = t / i;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-5.2d+55)) .or. (.not. (y <= 4.2d-6))) then
        tmp = x + ((z - (a * x)) / y)
    else
        tmp = t / i
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -5.2e+55) || !(y <= 4.2e-6)) {
		tmp = x + ((z - (a * x)) / y);
	} else {
		tmp = t / i;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -5.2e+55) or not (y <= 4.2e-6):
		tmp = x + ((z - (a * x)) / y)
	else:
		tmp = t / i
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -5.2e+55) || !(y <= 4.2e-6))
		tmp = Float64(x + Float64(Float64(z - Float64(a * x)) / y));
	else
		tmp = Float64(t / i);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -5.2e+55) || ~((y <= 4.2e-6)))
		tmp = x + ((z - (a * x)) / y);
	else
		tmp = t / i;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -5.2e+55], N[Not[LessEqual[y, 4.2e-6]], $MachinePrecision]], N[(x + N[(N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(t / i), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.2e55 or 4.1999999999999996e-6 < y

   1. Initial program 7.5%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 3.3

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\frac{t}{i}} \]

   6. Taylor expanded in y around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

         \[\leadsto x + \color{blue}{\left(\mathsf{neg}\left(\frac{-1 \cdot z - -1 \cdot \left(a \cdot x\right)}{y}\right)\right)} \]

      3. distribute-lft-out-- N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\frac{\color{blue}{-1 \cdot \left(z - a \cdot x\right)}}{y}\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

         \[\leadsto x + \left(-\frac{\color{blue}{\mathsf{neg}\left(\left(z - a \cdot x\right)\right)}}{y}\right) \]

      7. lower-neg.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 63.4

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

   8. Applied rewrites 63.4%

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

   if -5.2e55 < y < 4.1999999999999996e-6

   1. Initial program 97.1%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{t}{i}} \]
   4. Step-by-step derivation

      1. lower-/.f64 54.0

         \[\leadsto \color{blue}{\frac{t}{i}} \]

   5. Applied rewrites 54.0%

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

4. Final simplification 58.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.2 \cdot 10^{+55} \lor \neg \left(y \leq 4.2 \cdot 10^{-6}\right):\\ \;\;\;\;x + \frac{z - a \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 12.3% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 1.55 \cdot 10^{+57}:\\ \;\;\;\;\frac{z}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= a 1.55e+57) (/ z y) (/ z a)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 1.55e+57) {
		tmp = z / y;
	} else {
		tmp = z / a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: tmp
    if (a <= 1.55d+57) then
        tmp = z / y
    else
        tmp = z / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (a <= 1.55e+57) {
		tmp = z / y;
	} else {
		tmp = z / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if a <= 1.55e+57:
		tmp = z / y
	else:
		tmp = z / a
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (a <= 1.55e+57)
		tmp = Float64(z / y);
	else
		tmp = Float64(z / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (a <= 1.55e+57)
		tmp = z / y;
	else
		tmp = z / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[a, 1.55e+57], N[(z / y), $MachinePrecision], N[(z / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 1.55000000000000007e57

   1. Initial program 57.5%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      3. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot z\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot z, y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot z + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

      12. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

   5. Applied rewrites 52.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}} \]

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 11.5%

      \[\leadsto \frac{z}{\color{blue}{y}} \]

   if 1.55000000000000007e57 < a

   1. Initial program 54.0%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right)}{a \cdot {y}^{3}}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right)}{a}}{{y}^{3}}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot \left(z + x \cdot y\right)\right)\right)}{a}}{{y}^{3}}} \]

   5. Applied rewrites 7.3%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{a}}{{y}^{3}}} \]

   6. Taylor expanded in z around inf

      \[\leadsto \frac{z}{\color{blue}{a}} \]
   7. Step-by-step derivation

   8. Applied rewrites 12.2%

      \[\leadsto \frac{z}{\color{blue}{a}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 11.0% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ \frac{z}{y} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: c
    real(8), intent (in) :: i
    code = z / y
end function

Java

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

Python

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

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(z / y)
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(z / y), $MachinePrecision]

Derivation

1. Initial program 56.8%

   \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

   2. +-commutative N/A

      \[\leadsto \frac{\color{blue}{y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) + t}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   3. *-commutative N/A

      \[\leadsto \frac{\color{blue}{\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right)\right) \cdot y} + t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   4. lower-fma.f64 N/A

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right), y, t\right)}}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   5. +-commutative N/A

      \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{54929528941}{2000000} + y \cdot z\right) + \frac{28832688827}{125000}}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   6. *-commutative N/A

      \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\left(\frac{54929528941}{2000000} + y \cdot z\right) \cdot y} + \frac{28832688827}{125000}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   7. lower-fma.f64 N/A

      \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{54929528941}{2000000} + y \cdot z, y, \frac{28832688827}{125000}\right)}, y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   8. +-commutative N/A

      \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot z + \frac{54929528941}{2000000}}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   9. *-commutative N/A

      \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{z \cdot y} + \frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   10. lower-fma.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right)}, y, \frac{28832688827}{125000}\right), y, t\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

   11. +-commutative N/A

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) + i}} \]

   12. *-commutative N/A

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right) \cdot y} + i} \]

   13. lower-fma.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, \frac{54929528941}{2000000}\right), y, \frac{28832688827}{125000}\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right), y, i\right)}} \]

5. Applied rewrites 52.9%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}} \]

6. Taylor expanded in y around inf

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

8. Applied rewrites 9.8%

   \[\leadsto \frac{z}{\color{blue}{y}} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024326 
(FPCore (x y z t a b c i)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2"
  :precision binary64
  (/ (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t) (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i)))