Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2

Percentage Accurate: 55.1% → 81.3%

Time: 14.3s

Alternatives: 18

Speedup: 2.6×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c, i)
use fmin_fmax_functions
    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: 55.1% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c, i)
use fmin_fmax_functions
    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.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \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)\\ t_2 := \mathsf{fma}\left(a + y, y, b\right)\\ t_3 := x + \frac{z}{y}\\ t_4 := \mathsf{fma}\left(t\_2, y, c\right)\\ \mathbf{if}\;y \leq -8.2 \cdot 10^{+98}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;y \leq -8.7 \cdot 10^{-16}:\\ \;\;\;\;\frac{\frac{t\_1}{y}}{t\_4}\\ \mathbf{elif}\;y \leq 1.7 \cdot 10^{-31}:\\ \;\;\;\;\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(t\_4, y, i\right)}\\ \mathbf{elif}\;y \leq 1.1 \cdot 10^{+70}:\\ \;\;\;\;\frac{t\_1}{\mathsf{fma}\left(t\_2, y \cdot y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t))
        (t_2 (fma (+ a y) y b))
        (t_3 (+ x (/ z y)))
        (t_4 (fma t_2 y c)))
   (if (<= y -8.2e+98)
     t_3
     (if (<= y -8.7e-16)
       (/ (/ t_1 y) t_4)
       (if (<= y 1.7e-31)
         (/
          (fma (fma (fma z y 27464.7644705) y 230661.510616) y t)
          (fma t_4 y i))
         (if (<= y 1.1e+70) (/ t_1 (fma t_2 (* y y) i)) t_3))))))

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(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t);
	double t_2 = fma((a + y), y, b);
	double t_3 = x + (z / y);
	double t_4 = fma(t_2, y, c);
	double tmp;
	if (y <= -8.2e+98) {
		tmp = t_3;
	} else if (y <= -8.7e-16) {
		tmp = (t_1 / y) / t_4;
	} else if (y <= 1.7e-31) {
		tmp = fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / fma(t_4, y, i);
	} else if (y <= 1.1e+70) {
		tmp = t_1 / fma(t_2, (y * y), i);
	} else {
		tmp = t_3;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t)
	t_2 = fma(Float64(a + y), y, b)
	t_3 = Float64(x + Float64(z / y))
	t_4 = fma(t_2, y, c)
	tmp = 0.0
	if (y <= -8.2e+98)
		tmp = t_3;
	elseif (y <= -8.7e-16)
		tmp = Float64(Float64(t_1 / y) / t_4);
	elseif (y <= 1.7e-31)
		tmp = Float64(fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / fma(t_4, y, i));
	elseif (y <= 1.1e+70)
		tmp = Float64(t_1 / fma(t_2, Float64(y * y), i));
	else
		tmp = t_3;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision]}, Block[{t$95$3 = N[(x + N[(z / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 * y + c), $MachinePrecision]}, If[LessEqual[y, -8.2e+98], t$95$3, If[LessEqual[y, -8.7e-16], N[(N[(t$95$1 / y), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[y, 1.7e-31], N[(N[(N[(N[(z * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(t$95$4 * y + i), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.1e+70], N[(t$95$1 / N[(t$95$2 * N[(y * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision], t$95$3]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -8.2000000000000001e98 or 1.1e70 < y

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

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

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

   8. Applied rewrites 70.8%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 77.4%

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

   if -8.2000000000000001e98 < y < -8.70000000000000036e-16

   1. Initial program 51.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 i 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)}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
   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)}{y}}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)}} \]

      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)}{y}}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)}} \]

   5. Applied rewrites 67.0%

      \[\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)}{y}}{\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right)}} \]

   if -8.70000000000000036e-16 < y < 1.7000000000000001e-31

   1. Initial program 99.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 98.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)}} \]

   if 1.7000000000000001e-31 < y < 1.1e70

   1. Initial program 75.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 c 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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\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}^{2} \cdot \left(b + y \cdot \left(a + y\right)\right) + i}} \]

   5. Applied rewrites 75.2%

      \[\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(a + y, y, b\right), y \cdot y, i\right)}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 2: 80.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_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}\\ t_2 := \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-220}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y \cdot y, x, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{t\_2}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z}{y}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = 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))
	t_2 = fma(fma(fma(Float64(a + y), y, b), y, c), y, i)
	tmp = 0.0
	if (t_1 <= -5e-220)
		tmp = Float64(fma(fma(fma(Float64(y * y), x, 27464.7644705), y, 230661.510616), y, t) / t_2);
	elseif (t_1 <= Inf)
		tmp = Float64(fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / t_2);
	else
		tmp = Float64(x + Float64(z / y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = 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]}, Block[{t$95$2 = N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-220], N[(N[(N[(N[(N[(y * y), $MachinePrecision] * x + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(N[(z * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / t$95$2), $MachinePrecision], N[(x + N[(z / y), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 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)) < -5.0000000000000002e-220

   1. Initial program 96.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 z around 0

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(\frac{28832688827}{125000} + y \cdot \left(\frac{54929528941}{2000000} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}\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} + x \cdot {y}^{2}, 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}{x \cdot {y}^{2} + \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}{{y}^{2} \cdot x} + \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({y}^{2}, x, \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. unpow2 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot y}, x, \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)} \]

      12. lower-*.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{y \cdot y}, x, \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)} \]

      13. +-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y \cdot y, x, \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}} \]

      14. *-commutative N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y \cdot y, x, \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} \]

      15. lower-fma.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y \cdot y, x, \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 92.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y \cdot y, x, 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)}} \]

   if -5.0000000000000002e-220 < (/.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.4%

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

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

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 3: 76.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_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}\\ t_2 := \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)\\ \mathbf{if}\;t\_1 \leq 10^{-12}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + 27464.7644705 \cdot y\right)}{t\_2}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(\left(y \cdot y\right) \cdot z, y, t\right)}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z}{y}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = 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))
	t_2 = fma(fma(fma(Float64(a + y), y, b), y, c), y, i)
	tmp = 0.0
	if (t_1 <= 1e-12)
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(27464.7644705 * y)))) / t_2);
	elseif (t_1 <= Inf)
		tmp = Float64(fma(Float64(Float64(y * y) * z), y, t) / t_2);
	else
		tmp = Float64(x + Float64(z / y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 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)) < 9.9999999999999998e-13

   1. Initial program 92.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 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 83.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 + 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 78.3%

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

   if 9.9999999999999998e-13 < (/.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 90.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 87.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{\mathsf{fma}\left({y}^{2} \cdot z, y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(a + y, y, b\right)}, y, c\right), y, i\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 87.6%

      \[\leadsto \frac{\mathsf{fma}\left(\left(y \cdot y\right) \cdot z, y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(a + y, y, b\right)}, y, c\right), y, i\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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 4: 84.6% 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}{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 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 / 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(z / 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[(z / 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 92.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. 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 92.7%

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

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 5: 84.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = 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]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(x + N[(z / 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 92.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

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 6: 79.0% accurate, 0.5× 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{\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(a + y, y \cdot y, c\right), y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;x + \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)
   (/
    (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t)
    (fma (fma (+ a y) (* y y) c) y i))
   (+ x (/ 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 = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma((a + y), (y * y), c), y, i);
	} else {
		tmp = x + (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(fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(Float64(a + y), Float64(y * y), c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(N[(N[(a + y), $MachinePrecision] * N[(y * y), $MachinePrecision] + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision], N[(x + N[(z / 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 92.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 b 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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\right)\right) + i}} \]

   5. Applied rewrites 86.2%

      \[\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(a + y, y \cdot y, c\right), y, i\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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 7: 79.0% accurate, 0.5× 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{\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(\left(a + y\right) \cdot y, y, c\right), y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;x + \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)
   (/
    (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t)
    (fma (fma (* (+ a y) y) y c) y i))
   (+ x (/ 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 = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(((a + y) * y), y, c), y, i);
	} else {
		tmp = x + (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(fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(Float64(Float64(a + y) * y), y, c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(N[(N[(N[(a + y), $MachinePrecision] * y), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision], N[(x + N[(z / 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 92.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 b 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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\right)\right) + i}} \]

   5. Applied rewrites 86.2%

      \[\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(a + y, y \cdot y, c\right), y, i\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.2%

      \[\leadsto \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(\left(a + y\right) \cdot y, y, c\right), y, i\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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 8: 80.7% accurate, 0.5× 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{\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)}\\ \mathbf{else}:\\ \;\;\;\;x + \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)
   (/
    (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))
   (+ x (/ 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 = 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);
	} else {
		tmp = x + (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(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));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(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], N[(x + N[(z / 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 92.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 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 84.9%

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

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 9: 80.3% accurate, 0.6× 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{\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)}\\ \mathbf{else}:\\ \;\;\;\;x + \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)
   (/
    (fma (fma (fma z y 27464.7644705) y 230661.510616) y t)
    (fma (fma (fma (+ a y) y b) y c) y i))
   (+ x (/ 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 = fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else {
		tmp = x + (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(fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(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], N[(x + N[(z / 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 92.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 84.4%

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

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 10: 75.7% accurate, 0.6× 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 + 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)}\\ \mathbf{else}:\\ \;\;\;\;x + \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 (* y (+ 230661.510616 (* 27464.7644705 y))))
    (fma (fma (fma (+ a y) y b) y c) y i))
   (+ x (/ 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 + (y * (230661.510616 + (27464.7644705 * y)))) / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else {
		tmp = x + (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(Float64(t + Float64(y * Float64(230661.510616 + Float64(27464.7644705 * y)))) / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(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], N[(x + N[(z / 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 92.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 84.4%

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

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

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 11: 74.6% accurate, 0.6× 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{\mathsf{fma}\left(230661.510616, y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;x + \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)
   (/ (fma 230661.510616 y t) (fma (fma (fma (+ a y) y b) y c) y i))
   (+ x (/ 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 = fma(230661.510616, y, t) / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else {
		tmp = x + (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(fma(230661.510616, y, t) / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(N[(230661.510616 * y + t), $MachinePrecision] / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision], N[(x + N[(z / 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 92.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 84.4%

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

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 77.1%

       \[\leadsto \frac{\mathsf{fma}\left(230661.510616, y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), \color{blue}{y}, c\right), y, i\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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 12: 71.3% accurate, 0.6× 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{\mathsf{fma}\left(230661.510616, y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(a + y, y \cdot y, c\right), y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;x + \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)
   (/ (fma 230661.510616 y t) (fma (fma (+ a y) (* y y) c) y i))
   (+ x (/ 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 = fma(230661.510616, y, t) / fma(fma((a + y), (y * y), c), y, i);
	} else {
		tmp = x + (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(fma(230661.510616, y, t) / fma(fma(Float64(a + y), Float64(y * y), c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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[(N[(230661.510616 * y + t), $MachinePrecision] / N[(N[(N[(a + y), $MachinePrecision] * N[(y * y), $MachinePrecision] + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision], N[(x + N[(z / 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 92.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 b 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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\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}^{2} \cdot \left(a + y\right)\right) + i}} \]

   5. Applied rewrites 86.2%

      \[\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(a + y, y \cdot y, c\right), y, i\right)}} \]

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 73.1%

      \[\leadsto \frac{\mathsf{fma}\left(230661.510616, y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{a + y}, y \cdot y, c\right), y, i\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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 13: 67.8% accurate, 0.7× 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}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;x + \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 (fma (fma (fma (+ a y) y b) y c) y i))
   (+ x (/ 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 / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else {
		tmp = x + (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 / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	else
		tmp = Float64(x + Float64(z / y));
	end
	return 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 / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision], N[(x + N[(z / 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 92.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 65.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 65.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)}} \]

   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.5

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

   5. Applied rewrites 3.5%

      \[\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. lower-neg.f64 N/A

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

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

         \[\leadsto x + \left(-\frac{\color{blue}{-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.1

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

   8. Applied rewrites 67.1%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 73.4%

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

Alternative 14: 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 92.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 46.0

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

   5. Applied rewrites 46.0%

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

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

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

Alternative 15: 62.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+27} \lor \neg \left(y \leq 24000000000000\right):\\ \;\;\;\;x + \frac{z}{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)}{i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -1.9e+27) (not (<= y 24000000000000.0)))
   (+ x (/ z y))
   (/ (fma (fma (fma z y 27464.7644705) y 230661.510616) 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 <= -1.9e+27) || !(y <= 24000000000000.0)) {
		tmp = x + (z / y);
	} else {
		tmp = fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / i;
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.9e+27], N[Not[LessEqual[y, 24000000000000.0]], $MachinePrecision]], N[(x + N[(z / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(z * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / i), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.90000000000000011e27 or 2.4e13 < y

   1. Initial program 8.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.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. lower-neg.f64 N/A

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

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

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

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

   8. Applied rewrites 60.5%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 65.9%

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

   if -1.90000000000000011e27 < y < 2.4e13

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

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

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

   9. Taylor expanded in i around inf

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

   11. Applied rewrites 60.0%

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

4. Final simplification 62.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+27} \lor \neg \left(y \leq 24000000000000\right):\\ \;\;\;\;x + \frac{z}{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)}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 61.1% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.7 \cdot 10^{+22} \lor \neg \left(y \leq 1700000000000\right):\\ \;\;\;\;x + \frac{z}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(230661.510616, y, t\right)}{i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -1.7e+22) (not (<= y 1700000000000.0)))
   (+ x (/ z y))
   (/ (fma 230661.510616 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 <= -1.7e+22) || !(y <= 1700000000000.0)) {
		tmp = x + (z / y);
	} else {
		tmp = fma(230661.510616, y, t) / i;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -1.7e+22) || !(y <= 1700000000000.0))
		tmp = Float64(x + Float64(z / y));
	else
		tmp = Float64(fma(230661.510616, y, t) / i);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.7e+22], N[Not[LessEqual[y, 1700000000000.0]], $MachinePrecision]], N[(x + N[(z / y), $MachinePrecision]), $MachinePrecision], N[(N[(230661.510616 * y + t), $MachinePrecision] / i), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.7e22 or 1.7e12 < y

   1. Initial program 8.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.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. lower-neg.f64 N/A

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

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

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

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

   8. Applied rewrites 60.0%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 65.3%

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

   if -1.7e22 < y < 1.7e12

   1. Initial program 97.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 y around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{28832688827}{125000} \cdot \frac{1}{i} - \frac{c \cdot t}{{i}^{2}}\right) \cdot y} + \frac{t}{i} \]

      2. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{28832688827}{125000} \cdot \frac{1}{i} - \frac{c \cdot t}{{i}^{2}}, y, \frac{t}{i}\right)} \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{28832688827}{125000} \cdot \frac{1}{i} - \frac{c \cdot t}{{i}^{2}}}, y, \frac{t}{i}\right) \]

      4. associate-*r/ N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{28832688827}{125000} \cdot 1}{i}} - \frac{c \cdot t}{{i}^{2}}, y, \frac{t}{i}\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\frac{28832688827}{125000}}}{i} - \frac{c \cdot t}{{i}^{2}}, y, \frac{t}{i}\right) \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{28832688827}{125000}}{i}} - \frac{c \cdot t}{{i}^{2}}, y, \frac{t}{i}\right) \]

      7. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\frac{28832688827}{125000}}{i} - \frac{c \cdot t}{\color{blue}{i \cdot i}}, y, \frac{t}{i}\right) \]

      8. times-frac N/A

         \[\leadsto \mathsf{fma}\left(\frac{\frac{28832688827}{125000}}{i} - \color{blue}{\frac{c}{i} \cdot \frac{t}{i}}, y, \frac{t}{i}\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\frac{28832688827}{125000}}{i} - \color{blue}{\frac{c}{i} \cdot \frac{t}{i}}, y, \frac{t}{i}\right) \]

      10. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\frac{28832688827}{125000}}{i} - \color{blue}{\frac{c}{i}} \cdot \frac{t}{i}, y, \frac{t}{i}\right) \]

      11. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\frac{28832688827}{125000}}{i} - \frac{c}{i} \cdot \color{blue}{\frac{t}{i}}, y, \frac{t}{i}\right) \]

      12. lower-/.f64 53.4

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

   5. Applied rewrites 53.4%

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

   6. Taylor expanded in c around 0

      \[\leadsto \frac{28832688827}{125000} \cdot \frac{y}{i} + \color{blue}{\frac{t}{i}} \]
   7. Step-by-step derivation

   8. Applied rewrites 57.9%

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

4. Final simplification 61.1%

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

Alternative 17: 57.9% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+27} \lor \neg \left(y \leq 4000000000000\right):\\ \;\;\;\;x + \frac{z}{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 -1.35e+27) (not (<= y 4000000000000.0))) (+ x (/ z 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 <= -1.35e+27) || !(y <= 4000000000000.0)) {
		tmp = x + (z / y);
	} else {
		tmp = t / i;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c, i)
use fmin_fmax_functions
    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 <= (-1.35d+27)) .or. (.not. (y <= 4000000000000.0d0))) then
        tmp = x + (z / 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 <= -1.35e+27) || !(y <= 4000000000000.0)) {
		tmp = x + (z / y);
	} else {
		tmp = t / i;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -1.35e+27) or not (y <= 4000000000000.0):
		tmp = x + (z / y)
	else:
		tmp = t / i
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -1.35e+27) || !(y <= 4000000000000.0))
		tmp = Float64(x + Float64(z / 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 <= -1.35e+27) || ~((y <= 4000000000000.0)))
		tmp = x + (z / y);
	else
		tmp = t / i;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.35e+27], N[Not[LessEqual[y, 4000000000000.0]], $MachinePrecision]], N[(x + N[(z / y), $MachinePrecision]), $MachinePrecision], N[(t / i), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3499999999999999e27 or 4e12 < y

   1. Initial program 8.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.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. lower-neg.f64 N/A

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

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

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

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

   8. Applied rewrites 60.5%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 65.9%

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

   if -1.3499999999999999e27 < y < 4e12

   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 51.3

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

   5. Applied rewrites 51.3%

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

4. Final simplification 57.5%

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

Alternative 18: 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c, i)
use fmin_fmax_functions
    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 59.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 54.2%

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

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

Reproduce

herbie shell --seed 2024352 
(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)))