Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2

Percentage Accurate: 55.6% → 82.7%

Time: 9.6s

Alternatives: 18

Speedup: 1.7×

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.6% 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: 82.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -2.35 \cdot 10^{+48}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 7 \cdot 10^{+61}:\\ \;\;\;\;\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{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -2.35e+48)
     t_1
     (if (<= y 7e+61)
       (/
        (+
         (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y)
         t)
        (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -2.35e+48) {
		tmp = t_1;
	} else if (y <= 7e+61) {
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = -((-z - (-a * x)) / y) + x
    if (y <= (-2.35d+48)) then
        tmp = t_1
    else if (y <= 7d+61) then
        tmp = ((((((((x * y) + z) * y) + 27464.7644705d0) * y) + 230661.510616d0) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -2.35e+48) {
		tmp = t_1;
	} else if (y <= 7e+61) {
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = -((-z - (-a * x)) / y) + x
	tmp = 0
	if y <= -2.35e+48:
		tmp = t_1
	elif y <= 7e+61:
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -2.35e+48)
		tmp = t_1;
	elseif (y <= 7e+61)
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = -((-z - (-a * x)) / y) + x;
	tmp = 0.0;
	if (y <= -2.35e+48)
		tmp = t_1;
	elseif (y <= 7e+61)
		tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.35000000000000006e48 or 7.00000000000000036e61 < y

   1. Initial program 2.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 67.2

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

   4. Applied rewrites 67.2%

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

   if -2.35000000000000006e48 < y < 7.00000000000000036e61

   1. Initial program 93.3%

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

Alternative 2: 82.4% 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(y, \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right)}{t\_1}, \frac{t}{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \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
      y
      (/ (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) t_1)
      (/ t t_1))
     (+ (- (/ (- (- z) (* (- a) x)) y)) x))))

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(y, (fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616) / t_1), (t / t_1));
	} else {
		tmp = -((-z - (-a * x)) / y) + x;
	}
	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(y, Float64(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616) / t_1), Float64(t / t_1));
	else
		tmp = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x);
	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[(y * N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] / t$95$1), $MachinePrecision] + N[(t / t$95$1), $MachinePrecision]), $MachinePrecision], N[((-N[(N[((-z) - N[((-a) * x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]) + x), $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 90.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} \]

   3. Applied rewrites 91.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y, x, z\right), y, 27464.7644705\right), y, 230661.510616\right)}{\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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 69.1

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

   4. Applied rewrites 69.1%

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

Alternative 3: 79.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -2.35 \cdot 10^{+48}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 7 \cdot 10^{+61}:\\ \;\;\;\;\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}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -2.35e+48)
     t_1
     (if (<= y 7e+61)
       (/
        (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))
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -2.35e+48) {
		tmp = t_1;
	} else if (y <= 7e+61) {
		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 = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.35000000000000006e48 or 7.00000000000000036e61 < y

   1. Initial program 2.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 67.2

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

   4. Applied rewrites 67.2%

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

   if -2.35000000000000006e48 < y < 7.00000000000000036e61

   1. Initial program 93.3%

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

   2. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

   4. Applied rewrites 87.7%

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

Alternative 4: 77.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	t_2 = fma(fma(fma(Float64(a + y), y, b), y, c), y, i)
	tmp = 0.0
	if (y <= -6e+31)
		tmp = t_1;
	elseif (y <= -4.6e-12)
		tmp = Float64(Float64(Float64(Float64(y * y) * Float64(y * y)) * x) / t_2);
	elseif (y <= 4.5e+44)
		tmp = Float64(fma(fma(fma(z, y, 27464.7644705), y, 230661.510616), y, t) / t_2);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -5.99999999999999978e31 or 4.5e44 < y

   1. Initial program 4.9%

      \[\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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 64.3

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

   4. Applied rewrites 64.3%

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

   if -5.99999999999999978e31 < y < -4.59999999999999979e-12

   1. Initial program 78.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. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. sqr-pow N/A

         \[\leadsto \frac{\left({y}^{\left(\frac{4}{2}\right)} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. unpow2 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 24.3%

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

   if -4.59999999999999979e-12 < y < 4.5e44

   1. Initial program 97.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. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

   4. Applied rewrites 92.1%

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

Alternative 5: 77.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -6.5 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -4.6 \cdot 10^{-12}:\\ \;\;\;\;\frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)}\\ \mathbf{elif}\;y \leq 4.5 \cdot 10^{+44}:\\ \;\;\;\;\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}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -6.5e+31)
     t_1
     (if (<= y -4.6e-12)
       (/ (* x (* (* y y) y)) (+ c (* y (+ b (* y (+ a y))))))
       (if (<= y 4.5e+44)
         (/
          (fma (fma (fma z y 27464.7644705) y 230661.510616) y t)
          (fma (fma (fma (+ a y) y b) y c) y i))
         t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -6.5e+31) {
		tmp = t_1;
	} else if (y <= -4.6e-12) {
		tmp = (x * ((y * y) * y)) / (c + (y * (b + (y * (a + y)))));
	} else if (y <= 4.5e+44) {
		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 = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -6.5e+31)
		tmp = t_1;
	elseif (y <= -4.6e-12)
		tmp = Float64(Float64(x * Float64(Float64(y * y) * y)) / Float64(c + Float64(y * Float64(b + Float64(y * Float64(a + y))))));
	elseif (y <= 4.5e+44)
		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 = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -6.5000000000000004e31 or 4.5e44 < y

   1. Initial program 4.9%

      \[\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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 64.3

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

   4. Applied rewrites 64.3%

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

   if -6.5000000000000004e31 < y < -4.59999999999999979e-12

   1. Initial program 78.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. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. sqr-pow N/A

         \[\leadsto \frac{\left({y}^{\left(\frac{4}{2}\right)} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. unpow2 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 24.3%

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

   5. Taylor expanded in i around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot {y}^{3}}{c + \color{blue}{y \cdot \left(b + y \cdot \left(a + y\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x \cdot {y}^{3}}{c + \color{blue}{y} \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      3. unpow3 N/A

         \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \frac{x \cdot \left({y}^{2} \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \frac{x \cdot \left({y}^{2} \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      6. pow2 N/A

         \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      7. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-+.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lift-+.f64 23.7

          \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

   7. Applied rewrites 23.7%

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

   if -4.59999999999999979e-12 < y < 4.5e44

   1. Initial program 97.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. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

   4. Applied rewrites 92.1%

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

Alternative 6: 73.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)}\\ t_2 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -6.5 \cdot 10^{+31}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -2.85 \cdot 10^{-12}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 78000:\\ \;\;\;\;\frac{\mathsf{fma}\left(230661.510616, y, t\right)}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\\ \mathbf{elif}\;y \leq 9 \cdot 10^{+66}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (/ (* x (* (* y y) y)) (+ c (* y (+ b (* y (+ a y)))))))
        (t_2 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -6.5e+31)
     t_2
     (if (<= y -2.85e-12)
       t_1
       (if (<= y 78000.0)
         (/
          (fma 230661.510616 y t)
          (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))
         (if (<= y 9e+66) t_1 t_2))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (x * ((y * y) * y)) / (c + (y * (b + (y * (a + y)))));
	double t_2 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -6.5e+31) {
		tmp = t_2;
	} else if (y <= -2.85e-12) {
		tmp = t_1;
	} else if (y <= 78000.0) {
		tmp = fma(230661.510616, y, t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	} else if (y <= 9e+66) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(x * Float64(Float64(y * y) * y)) / Float64(c + Float64(y * Float64(b + Float64(y * Float64(a + y))))))
	t_2 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -6.5e+31)
		tmp = t_2;
	elseif (y <= -2.85e-12)
		tmp = t_1;
	elseif (y <= 78000.0)
		tmp = Float64(fma(230661.510616, y, t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i));
	elseif (y <= 9e+66)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -6.5000000000000004e31 or 8.9999999999999997e66 < y

   1. Initial program 3.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 66.2

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

   4. Applied rewrites 66.2%

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

   if -6.5000000000000004e31 < y < -2.8500000000000002e-12 or 78000 < y < 8.9999999999999997e66

   1. Initial program 60.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. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. sqr-pow N/A

         \[\leadsto \frac{\left({y}^{\left(\frac{4}{2}\right)} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. unpow2 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 20.6%

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

   5. Taylor expanded in i around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot {y}^{3}}{c + \color{blue}{y \cdot \left(b + y \cdot \left(a + y\right)\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x \cdot {y}^{3}}{c + \color{blue}{y} \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      3. unpow3 N/A

         \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      4. pow2 N/A

         \[\leadsto \frac{x \cdot \left({y}^{2} \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \frac{x \cdot \left({y}^{2} \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      6. pow2 N/A

         \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      7. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-+.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lift-+.f64 21.4

          \[\leadsto \frac{x \cdot \left(\left(y \cdot y\right) \cdot y\right)}{c + y \cdot \left(b + y \cdot \left(a + y\right)\right)} \]

   7. Applied rewrites 21.4%

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

   if -2.8500000000000002e-12 < y < 78000

   1. Initial program 99.6%

      \[\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. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 89.5

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

   4. Applied rewrites 89.5%

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

Alternative 7: 73.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -5.8 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -2.8 \cdot 10^{-12}:\\ \;\;\;\;\frac{\left(\left(y \cdot y\right) \cdot \left(y \cdot y\right)\right) \cdot x}{\mathsf{fma}\left(\mathsf{fma}\left(b, y, c\right), y, i\right)}\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{+38}:\\ \;\;\;\;\frac{\mathsf{fma}\left(230661.510616, y, t\right)}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -5.8e+31)
     t_1
     (if (<= y -2.8e-12)
       (/ (* (* (* y y) (* y y)) x) (fma (fma b y c) y i))
       (if (<= y 3.5e+38)
         (/
          (fma 230661.510616 y t)
          (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i))
         t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -5.8e+31) {
		tmp = t_1;
	} else if (y <= -2.8e-12) {
		tmp = (((y * y) * (y * y)) * x) / fma(fma(b, y, c), y, i);
	} else if (y <= 3.5e+38) {
		tmp = fma(230661.510616, y, t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -5.8e+31)
		tmp = t_1;
	elseif (y <= -2.8e-12)
		tmp = Float64(Float64(Float64(Float64(y * y) * Float64(y * y)) * x) / fma(fma(b, y, c), y, i));
	elseif (y <= 3.5e+38)
		tmp = Float64(fma(230661.510616, y, t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -5.8000000000000001e31 or 3.50000000000000002e38 < y

   1. Initial program 5.3%

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

   2. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 63.8

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

   4. Applied rewrites 63.8%

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

   if -5.8000000000000001e31 < y < -2.8000000000000002e-12

   1. Initial program 78.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. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. sqr-pow N/A

         \[\leadsto \frac{\left({y}^{\left(\frac{4}{2}\right)} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. unpow2 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 24.1%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot \left(y \cdot y\right)\right) \cdot x}{\mathsf{fma}\left(\mathsf{fma}\left(b, y, c\right), y, i\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.1%

      \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot \left(y \cdot y\right)\right) \cdot x}{\mathsf{fma}\left(\mathsf{fma}\left(b, y, c\right), y, i\right)} \]

   if -2.8000000000000002e-12 < y < 3.50000000000000002e38

   1. Initial program 97.6%

      \[\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. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 85.5

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

   4. Applied rewrites 85.5%

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

Alternative 8: 66.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -5.8 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -4 \cdot 10^{-12}:\\ \;\;\;\;\frac{\left(\left(y \cdot y\right) \cdot \left(y \cdot y\right)\right) \cdot x}{\mathsf{fma}\left(\mathsf{fma}\left(b, y, c\right), y, i\right)}\\ \mathbf{elif}\;y \leq 4.9 \cdot 10^{-29}:\\ \;\;\;\;\frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+38}:\\ \;\;\;\;\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)}{i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -5.8e+31)
     t_1
     (if (<= y -4e-12)
       (/ (* (* (* y y) (* y y)) x) (fma (fma b y c) y i))
       (if (<= y 4.9e-29)
         (/ t (fma (fma (fma (+ a y) y b) y c) y i))
         (if (<= y 2.9e+38)
           (/
            (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t)
            i)
           t_1))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -5.8e+31) {
		tmp = t_1;
	} else if (y <= -4e-12) {
		tmp = (((y * y) * (y * y)) * x) / fma(fma(b, y, c), y, i);
	} else if (y <= 4.9e-29) {
		tmp = t / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else if (y <= 2.9e+38) {
		tmp = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / i;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -5.8e+31)
		tmp = t_1;
	elseif (y <= -4e-12)
		tmp = Float64(Float64(Float64(Float64(y * y) * Float64(y * y)) * x) / fma(fma(b, y, c), y, i));
	elseif (y <= 4.9e-29)
		tmp = Float64(t / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	elseif (y <= 2.9e+38)
		tmp = Float64(fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / i);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if y < -5.8000000000000001e31 or 2.90000000000000007e38 < y

   1. Initial program 5.3%

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

   2. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 63.8

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

   4. Applied rewrites 63.8%

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

   if -5.8000000000000001e31 < y < -3.99999999999999992e-12

   1. Initial program 78.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. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. sqr-pow N/A

         \[\leadsto \frac{\left({y}^{\left(\frac{4}{2}\right)} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{\left(\frac{4}{2}\right)}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\left({y}^{2} \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      8. unpow2 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot {y}^{2}\right) \cdot x}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 24.3%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot \left(y \cdot y\right)\right) \cdot x}{\mathsf{fma}\left(\mathsf{fma}\left(b, y, c\right), y, i\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.2%

      \[\leadsto \frac{\left(\left(y \cdot y\right) \cdot \left(y \cdot y\right)\right) \cdot x}{\mathsf{fma}\left(\mathsf{fma}\left(b, y, c\right), y, i\right)} \]

   if -3.99999999999999992e-12 < y < 4.8999999999999998e-29

   1. Initial program 99.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. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      5. +-commutative N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 77.8

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

   4. Applied rewrites 77.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 4.8999999999999998e-29 < y < 2.90000000000000007e38

   1. Initial program 81.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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 21.8%

      \[\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)}{i}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 9: 66.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -5.8 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -2.8 \cdot 10^{-12}:\\ \;\;\;\;\left(y \cdot y\right) \cdot \left(\frac{x}{b} + \frac{z}{b \cdot y}\right)\\ \mathbf{elif}\;y \leq 4.9 \cdot 10^{-29}:\\ \;\;\;\;\frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+38}:\\ \;\;\;\;\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)}{i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -5.8e+31)
     t_1
     (if (<= y -2.8e-12)
       (* (* y y) (+ (/ x b) (/ z (* b y))))
       (if (<= y 4.9e-29)
         (/ t (fma (fma (fma (+ a y) y b) y c) y i))
         (if (<= y 2.9e+38)
           (/
            (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t)
            i)
           t_1))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -5.8e+31) {
		tmp = t_1;
	} else if (y <= -2.8e-12) {
		tmp = (y * y) * ((x / b) + (z / (b * y)));
	} else if (y <= 4.9e-29) {
		tmp = t / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else if (y <= 2.9e+38) {
		tmp = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / i;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -5.8e+31)
		tmp = t_1;
	elseif (y <= -2.8e-12)
		tmp = Float64(Float64(y * y) * Float64(Float64(x / b) + Float64(z / Float64(b * y))));
	elseif (y <= 4.9e-29)
		tmp = Float64(t / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	elseif (y <= 2.9e+38)
		tmp = Float64(fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / i);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if y < -5.8000000000000001e31 or 2.90000000000000007e38 < y

   1. Initial program 5.3%

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

   2. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 63.8

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

   4. Applied rewrites 63.8%

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

   if -5.8000000000000001e31 < y < -2.8000000000000002e-12

   1. Initial program 78.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. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 20.1%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

         \[\leadsto {y}^{2} \cdot \left(\frac{x}{b} + \color{blue}{\frac{z}{b \cdot y}}\right) \]

      2. pow2 N/A

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

      3. lift-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 14.8

         \[\leadsto \left(y \cdot y\right) \cdot \left(\frac{x}{b} + \frac{z}{b \cdot y}\right) \]

   7. Applied rewrites 14.8%

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

   if -2.8000000000000002e-12 < y < 4.8999999999999998e-29

   1. Initial program 99.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. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      5. +-commutative N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 77.8

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

   4. Applied rewrites 77.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 4.8999999999999998e-29 < y < 2.90000000000000007e38

   1. Initial program 81.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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 21.8%

      \[\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)}{i}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 10: 66.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -7.5 \cdot 10^{+46}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 4.9 \cdot 10^{-29}:\\ \;\;\;\;\frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+38}:\\ \;\;\;\;\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)}{i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -7.5e+46)
     t_1
     (if (<= y 4.9e-29)
       (/ t (fma (fma (fma (+ a y) y b) y c) y i))
       (if (<= y 2.9e+38)
         (/
          (fma (fma (fma (fma y x z) y 27464.7644705) y 230661.510616) y t)
          i)
         t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -7.5e+46) {
		tmp = t_1;
	} else if (y <= 4.9e-29) {
		tmp = t / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else if (y <= 2.9e+38) {
		tmp = fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / i;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -7.5e+46)
		tmp = t_1;
	elseif (y <= 4.9e-29)
		tmp = Float64(t / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	elseif (y <= 2.9e+38)
		tmp = Float64(fma(fma(fma(fma(y, x, z), y, 27464.7644705), y, 230661.510616), y, t) / i);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -7.5000000000000003e46 or 2.90000000000000007e38 < y

   1. Initial program 4.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 65.1

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

   4. Applied rewrites 65.1%

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

   if -7.5000000000000003e46 < y < 4.8999999999999998e-29

   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. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      5. +-commutative N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 72.7

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

   4. Applied rewrites 72.7%

      \[\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 4.8999999999999998e-29 < y < 2.90000000000000007e38

   1. Initial program 81.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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 21.8%

      \[\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)}{i}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 66.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -7.5 \cdot 10^{+46}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{+38}:\\ \;\;\;\;\frac{t}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a + y, y, b\right), y, c\right), y, i\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -7.5e+46)
     t_1
     (if (<= y 3.5e+38) (/ t (fma (fma (fma (+ a y) y b) y c) y i)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -((-z - (-a * x)) / y) + x;
	double tmp;
	if (y <= -7.5e+46) {
		tmp = t_1;
	} else if (y <= 3.5e+38) {
		tmp = t / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -7.5e+46)
		tmp = t_1;
	elseif (y <= 3.5e+38)
		tmp = Float64(t / fma(fma(fma(Float64(a + y), y, b), y, c), y, i));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -7.5000000000000003e46 or 3.50000000000000002e38 < y

   1. Initial program 4.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 65.1

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

   4. Applied rewrites 65.1%

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

   if -7.5000000000000003e46 < y < 3.50000000000000002e38

   1. Initial program 95.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. 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)}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      5. +-commutative N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 68.1

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

   4. Applied rewrites 68.1%

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

Alternative 12: 60.1% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -2.7 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.75 \cdot 10^{+38}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(z, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.69999999999999986e31 or 2.7500000000000002e38 < y

   1. Initial program 5.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 63.7

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

   4. Applied rewrites 63.7%

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

   if -2.69999999999999986e31 < y < 2.7500000000000002e38

   1. Initial program 96.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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 58.8%

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

   5. Taylor expanded in x around 0

      \[\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)}{i} \]
   6. Step-by-step derivation

   7. Applied rewrites 57.1%

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

Alternative 13: 60.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -2.7 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.75 \cdot 10^{+38}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(y \cdot z, y, 230661.510616\right), y, t\right)}{i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (- (/ (- (- z) (* (- a) x)) y)) x)))
   (if (<= y -2.7e+31)
     t_1
     (if (<= y 2.75e+38) (/ (fma (fma (* y z) y 230661.510616) y t) i) t_1))))

C

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

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(-Float64(Float64(Float64(-z) - Float64(Float64(-a) * x)) / y)) + x)
	tmp = 0.0
	if (y <= -2.7e+31)
		tmp = t_1;
	elseif (y <= 2.75e+38)
		tmp = Float64(fma(fma(Float64(y * z), y, 230661.510616), y, t) / i);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.69999999999999986e31 or 2.7500000000000002e38 < y

   1. Initial program 5.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 63.7

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

   4. Applied rewrites 63.7%

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

   if -2.69999999999999986e31 < y < 2.7500000000000002e38

   1. Initial program 96.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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 58.8%

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

   5. Taylor expanded in z around inf

      \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(y \cdot z, y, \frac{28832688827}{125000}\right), y, t\right)}{i} \]
   6. Step-by-step derivation

      1. lift-*.f64 57.0

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(y \cdot z, y, 230661.510616\right), y, t\right)}{i} \]

   7. Applied rewrites 57.0%

      \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(y \cdot z, y, 230661.510616\right), y, t\right)}{i} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 58.7% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-\frac{\left(-z\right) - \left(-a\right) \cdot x}{y}\right) + x\\ \mathbf{if}\;y \leq -2.55 \cdot 10^{+33}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.75 \cdot 10^{+38}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(27464.7644705, y, 230661.510616\right), y, t\right)}{i}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.5499999999999999e33 or 2.7500000000000002e38 < y

   1. Initial program 5.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. Taylor expanded in y around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 63.8

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

   4. Applied rewrites 63.8%

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

   if -2.5499999999999999e33 < y < 2.7500000000000002e38

   1. Initial program 96.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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 58.7%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\frac{54929528941}{2000000}, y, \frac{28832688827}{125000}\right), y, t\right)}{i} \]
   6. Step-by-step derivation

   7. Applied rewrites 54.5%

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

Alternative 15: 54.1% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -26000000:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+38}:\\ \;\;\;\;\frac{\mathsf{fma}\left(230661.510616, y, t\right)}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -26000000.0) x (if (<= y 2.9e+38) (/ (fma 230661.510616 y t) i) x)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -26000000.0) {
		tmp = x;
	} else if (y <= 2.9e+38) {
		tmp = fma(230661.510616, y, t) / i;
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -26000000.0)
		tmp = x;
	elseif (y <= 2.9e+38)
		tmp = Float64(fma(230661.510616, y, t) / i);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -26000000.0], x, If[LessEqual[y, 2.9e+38], N[(N[(230661.510616 * y + t), $MachinePrecision] / i), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -2.6e7 or 2.90000000000000007e38 < y

   1. Initial program 7.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. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 51.7%

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

   if -2.6e7 < y < 2.90000000000000007e38

   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. Taylor expanded in i around inf

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

      1. lower-/.f64 N/A

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

   4. Applied rewrites 60.4%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\mathsf{fma}\left(\frac{28832688827}{125000}, y, t\right)}{i} \]
   6. Step-by-step derivation

   7. Applied rewrites 56.2%

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

Alternative 16: 50.8% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.6 \cdot 10^{-22}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+38}:\\ \;\;\;\;\frac{t}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -3.6e-22) x (if (<= y 2.9e+38) (/ t i) x)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -3.6e-22) {
		tmp = x;
	} else if (y <= 2.9e+38) {
		tmp = t / i;
	} else {
		tmp = x;
	}
	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 <= (-3.6d-22)) then
        tmp = x
    else if (y <= 2.9d+38) then
        tmp = t / i
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -3.6e-22) {
		tmp = x;
	} else if (y <= 2.9e+38) {
		tmp = t / i;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if y <= -3.6e-22:
		tmp = x
	elif y <= 2.9e+38:
		tmp = t / i
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -3.6e-22)
		tmp = x;
	elseif (y <= 2.9e+38)
		tmp = Float64(t / i);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (y <= -3.6e-22)
		tmp = x;
	elseif (y <= 2.9e+38)
		tmp = t / i;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -3.6e-22], x, If[LessEqual[y, 2.9e+38], N[(t / i), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -3.5999999999999998e-22 or 2.90000000000000007e38 < y

   1. Initial program 12.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. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 49.4%

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

   if -3.5999999999999998e-22 < y < 2.90000000000000007e38

   1. Initial program 97.6%

      \[\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. Taylor expanded in y around 0

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

      1. lower-/.f64 52.1

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

   4. Applied rewrites 52.1%

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

Alternative 17: 26.6% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 3.5 \cdot 10^{+197}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i) :precision binary64 (if (<= z 3.5e+197) 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 (z <= 3.5e+197) {
		tmp = x;
	} else {
		tmp = z / y;
	}
	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 (z <= 3.5d+197) then
        tmp = x
    else
        tmp = z / y
    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 (z <= 3.5e+197) {
		tmp = x;
	} else {
		tmp = z / y;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 3.49999999999999999e197

   1. Initial program 56.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. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 27.2%

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

   if 3.49999999999999999e197 < z

   1. Initial program 51.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. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. unpow3 N/A

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

      4. unpow2 N/A

         \[\leadsto \left({y}^{2} \cdot y\right) \cdot \frac{z}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} \]

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 20.3%

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

   5. Taylor expanded in y around inf

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

      1. lower-/.f64 21.5

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

   7. Applied rewrites 21.5%

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

Alternative 18: 26.2% accurate, 71.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

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

C

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

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
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;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := x

Derivation

1. Initial program 55.6%

   \[\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. Taylor expanded in y around inf

   \[\leadsto \color{blue}{x} \]
3. Step-by-step derivation

4. Applied rewrites 26.2%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

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