Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2

Percentage Accurate: 55.1% → 82.0%

Time: 7.3s

Alternatives: 13

Speedup: 2.2×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = ((((((((x * y) + z) * y) + 27464.7644705d0) * y) + 230661.510616d0) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 55.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = ((((((((x * y) + z) * y) + 27464.7644705d0) * y) + 230661.510616d0) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 82.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + 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] / t$95$1), $MachinePrecision], Infinity], N[(N[(N[(y * 230661.510616 + N[(N[(N[(N[(y * x + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[(-1.0 * N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] * -1.0 + 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.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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. distribute-rgt-in N/A

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

      15. *-commutative N/A

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

      16. lower-fma.f64 N/A

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

   3. Applied rewrites 90.0%

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

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

   1. Initial program 0.0%

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

   2. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 69.3

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

   4. Applied rewrites 69.3%

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

Alternative 2: 70.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

   5. Taylor expanded in y 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)}{\mathsf{fma}\left(c, y, i\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 70.6%

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

   if 1.9999999999999998e-71 < (/.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 91.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 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 70.5

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

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

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

   1. Initial program 0.0%

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

   2. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 69.3

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

   4. Applied rewrites 69.3%

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

Alternative 3: 73.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \leq \infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(27464.7644705, 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}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1 \cdot \left(z - a \cdot x\right)}{y}, -1, x\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(27464.7644705 * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(N[(N[(N[(a + y), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 * N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] * -1.0 + 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.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 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 83.7%

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

   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)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{a + y}, y, b\right), y, c\right), y, i\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 76.0%

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

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

   1. Initial program 0.0%

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

   2. 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 69.3

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

   4. Applied rewrites 69.3%

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

Alternative 4: 78.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.55 \cdot 10^{+41}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1 \cdot \frac{27464.7644705 - b \cdot x}{y} - z}{y}, -1, x\right)\\ \mathbf{elif}\;y \leq 1.3 \cdot 10^{+55}:\\ \;\;\;\;\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}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1 \cdot \left(z - a \cdot x\right)}{y}, -1, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -1.55e+41)
   (fma (/ (- (* -1.0 (/ (- 27464.7644705 (* b x)) y)) z) y) -1.0 x)
   (if (<= y 1.3e+55)
     (/
      (fma (fma (fma z y 27464.7644705) y 230661.510616) y t)
      (fma (fma (fma (+ a y) y b) y c) y i))
     (fma (/ (* -1.0 (- z (* a x))) y) -1.0 x))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -1.55e+41) {
		tmp = fma((((-1.0 * ((27464.7644705 - (b * x)) / y)) - z) / y), -1.0, x);
	} else if (y <= 1.3e+55) {
		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 = fma(((-1.0 * (z - (a * x))) / y), -1.0, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -1.55e+41)
		tmp = fma(Float64(Float64(Float64(-1.0 * Float64(Float64(27464.7644705 - Float64(b * x)) / y)) - z) / y), -1.0, x);
	elseif (y <= 1.3e+55)
		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 = fma(Float64(Float64(-1.0 * Float64(z - Float64(a * x))) / y), -1.0, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1.55e41

   1. Initial program 4.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{\left(-1 \cdot z + -1 \cdot \frac{\frac{54929528941}{2000000} - \left(-1 \cdot \left(a \cdot \left(-1 \cdot z - -1 \cdot \left(a \cdot x\right)\right)\right) + b \cdot x\right)}{y}\right) - -1 \cdot \left(a \cdot x\right)}{y}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\left(-1 \cdot z + -1 \cdot \frac{\frac{54929528941}{2000000} - \left(-1 \cdot \left(a \cdot \left(-1 \cdot z - -1 \cdot \left(a \cdot x\right)\right)\right) + b \cdot x\right)}{y}\right) - -1 \cdot \left(a \cdot x\right)}{y}, \color{blue}{-1}, x\right) \]

   4. Applied rewrites 54.7%

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

   5. Taylor expanded in a around 0

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

      1. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      3. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      5. lift-*.f64 63.1

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{27464.7644705 - b \cdot x}{y} - z}{y}, -1, x\right) \]

   7. Applied rewrites 63.1%

      \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{27464.7644705 - b \cdot x}{y} - z}{y}, -1, x\right) \]

   if -1.55e41 < y < 1.3e55

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

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

   if 1.3e55 < y

   1. Initial program 2.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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 67.2

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

   4. Applied rewrites 67.2%

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

Alternative 5: 73.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.2 \cdot 10^{+38}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1 \cdot \frac{27464.7644705 - b \cdot x}{y} - z}{y}, -1, x\right)\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{+55}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(27464.7644705, 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}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1 \cdot \left(z - a \cdot x\right)}{y}, -1, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -7.2e+38)
   (fma (/ (- (* -1.0 (/ (- 27464.7644705 (* b x)) y)) z) y) -1.0 x)
   (if (<= y 2.6e+55)
     (/
      (fma (fma 27464.7644705 y 230661.510616) y t)
      (fma (fma (fma (+ a y) y b) y c) y i))
     (fma (/ (* -1.0 (- z (* a x))) y) -1.0 x))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -7.2e+38) {
		tmp = fma((((-1.0 * ((27464.7644705 - (b * x)) / y)) - z) / y), -1.0, x);
	} else if (y <= 2.6e+55) {
		tmp = fma(fma(27464.7644705, y, 230661.510616), y, t) / fma(fma(fma((a + y), y, b), y, c), y, i);
	} else {
		tmp = fma(((-1.0 * (z - (a * x))) / y), -1.0, x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -7.19999999999999938e38

   1. Initial program 4.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{\left(-1 \cdot z + -1 \cdot \frac{\frac{54929528941}{2000000} - \left(-1 \cdot \left(a \cdot \left(-1 \cdot z - -1 \cdot \left(a \cdot x\right)\right)\right) + b \cdot x\right)}{y}\right) - -1 \cdot \left(a \cdot x\right)}{y}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\left(-1 \cdot z + -1 \cdot \frac{\frac{54929528941}{2000000} - \left(-1 \cdot \left(a \cdot \left(-1 \cdot z - -1 \cdot \left(a \cdot x\right)\right)\right) + b \cdot x\right)}{y}\right) - -1 \cdot \left(a \cdot x\right)}{y}, \color{blue}{-1}, x\right) \]

   4. Applied rewrites 54.2%

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

   5. Taylor expanded in a around 0

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

      1. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      3. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{\frac{54929528941}{2000000} - b \cdot x}{y} - z}{y}, -1, x\right) \]

      5. lift-*.f64 62.6

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{27464.7644705 - b \cdot x}{y} - z}{y}, -1, x\right) \]

   7. Applied rewrites 62.6%

      \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{27464.7644705 - b \cdot x}{y} - z}{y}, -1, x\right) \]

   if -7.19999999999999938e38 < y < 2.6e55

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

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

   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)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{a + y}, y, b\right), y, c\right), y, i\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.9%

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

   if 2.6e55 < y

   1. Initial program 2.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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 67.2

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

   4. Applied rewrites 67.2%

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

Alternative 6: 73.7% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma (/ (* -1.0 (- z (* a x))) y) -1.0 x)))
   (if (<= y -4.8e+38)
     t_1
     (if (<= y 2.3e+27)
       (/ (fma 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 = fma(((-1.0 * (z - (a * x))) / y), -1.0, x);
	double tmp;
	if (y <= -4.8e+38) {
		tmp = t_1;
	} else if (y <= 2.3e+27) {
		tmp = fma(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 = fma(Float64(Float64(-1.0 * Float64(z - Float64(a * x))) / y), -1.0, x)
	tmp = 0.0
	if (y <= -4.8e+38)
		tmp = t_1;
	elseif (y <= 2.3e+27)
		tmp = Float64(fma(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[(-1.0 * N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] * -1.0 + x), $MachinePrecision]}, If[LessEqual[y, -4.8e+38], t$95$1, If[LessEqual[y, 2.3e+27], N[(N[(230661.510616 * 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 2 regimes

2. if y < -4.80000000000000035e38 or 2.3000000000000001e27 < y

   1. Initial program 5.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 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 63.6

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

   4. Applied rewrites 63.6%

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

   if -4.80000000000000035e38 < y < 2.3000000000000001e27

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 82.1%

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

Alternative 7: 66.6% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{-1 \cdot \left(z - a \cdot x\right)}{y}, -1, x\right)\\ \mathbf{if}\;y \leq -4.8 \cdot 10^{+38}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{+22}:\\ \;\;\;\;\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 (fma (/ (* -1.0 (- z (* a x))) y) -1.0 x)))
   (if (<= y -4.8e+38)
     t_1
     (if (<= y 2.2e+22) (/ 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 = fma(((-1.0 * (z - (a * x))) / y), -1.0, x);
	double tmp;
	if (y <= -4.8e+38) {
		tmp = t_1;
	} else if (y <= 2.2e+22) {
		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 = fma(Float64(Float64(-1.0 * Float64(z - Float64(a * x))) / y), -1.0, x)
	tmp = 0.0
	if (y <= -4.8e+38)
		tmp = t_1;
	elseif (y <= 2.2e+22)
		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[(-1.0 * N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] * -1.0 + x), $MachinePrecision]}, If[LessEqual[y, -4.8e+38], t$95$1, If[LessEqual[y, 2.2e+22], 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 < -4.80000000000000035e38 or 2.2e22 < y

   1. Initial program 5.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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 63.2

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

   4. Applied rewrites 63.2%

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

   if -4.80000000000000035e38 < y < 2.2e22

   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 69.6

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

      \[\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 8: 65.2% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma (/ (* -1.0 (- z (* a x))) y) -1.0 x)))
   (if (<= y -4.8e+38)
     t_1
     (if (<= y 2.2e+27) (/ t (+ i (* y (+ c (* b y))))) t_1))))

C

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

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(Float64(Float64(-1.0 * Float64(z - Float64(a * x))) / y), -1.0, x)
	tmp = 0.0
	if (y <= -4.8e+38)
		tmp = t_1;
	elseif (y <= 2.2e+27)
		tmp = Float64(t / Float64(i + Float64(y * Float64(c + Float64(b * y)))));
	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[(-1.0 * N[(z - N[(a * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] * -1.0 + x), $MachinePrecision]}, If[LessEqual[y, -4.8e+38], t$95$1, If[LessEqual[y, 2.2e+27], N[(t / N[(i + N[(y * N[(c + N[(b * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.80000000000000035e38 or 2.1999999999999999e27 < y

   1. Initial program 5.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 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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-*.f64 63.6

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

   4. Applied rewrites 63.6%

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

   if -4.80000000000000035e38 < y < 2.1999999999999999e27

   1. Initial program 96.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 c around inf

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

      1. lower-*.f64 25.8

         \[\leadsto \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{c \cdot \color{blue}{y}} \]

   4. Applied rewrites 25.8%

      \[\leadsto \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\color{blue}{c \cdot y}} \]

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 18.3%

      \[\leadsto \frac{\color{blue}{t}}{c \cdot y} \]

   8. Taylor expanded in y around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 66.6

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

   10. Applied rewrites 66.6%

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

Alternative 9: 60.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.4 \cdot 10^{+33}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.45 \cdot 10^{+35}:\\ \;\;\;\;\frac{t}{i + y \cdot \left(c + b \cdot y\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -6.4e+33) x (if (<= y 1.45e+35) (/ t (+ i (* y (+ c (* b y))))) x)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -6.4e+33) {
		tmp = x;
	} else if (y <= 1.45e+35) {
		tmp = t / (i + (y * (c + (b * y))));
	} 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 <= (-6.4d+33)) then
        tmp = x
    else if (y <= 1.45d+35) then
        tmp = t / (i + (y * (c + (b * y))))
    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 <= -6.4e+33) {
		tmp = x;
	} else if (y <= 1.45e+35) {
		tmp = t / (i + (y * (c + (b * y))));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if y <= -6.4e+33:
		tmp = x
	elif y <= 1.45e+35:
		tmp = t / (i + (y * (c + (b * y))))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -6.4e+33)
		tmp = x;
	elseif (y <= 1.45e+35)
		tmp = Float64(t / Float64(i + Float64(y * Float64(c + Float64(b * y)))));
	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 <= -6.4e+33)
		tmp = x;
	elseif (y <= 1.45e+35)
		tmp = t / (i + (y * (c + (b * y))));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -6.4e+33], x, If[LessEqual[y, 1.45e+35], N[(t / N[(i + N[(y * N[(c + N[(b * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -6.40000000000000034e33 or 1.44999999999999997e35 < 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} \]
   3. Step-by-step derivation

   4. Applied rewrites 54.1%

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

   if -6.40000000000000034e33 < y < 1.44999999999999997e35

   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 c around inf

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

      1. lower-*.f64 25.6

         \[\leadsto \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{c \cdot \color{blue}{y}} \]

   4. Applied rewrites 25.6%

      \[\leadsto \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\color{blue}{c \cdot y}} \]

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 18.2%

      \[\leadsto \frac{\color{blue}{t}}{c \cdot y} \]

   8. Taylor expanded in y around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 66.3

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

   10. Applied rewrites 66.3%

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

Alternative 10: 58.3% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.3 \cdot 10^{+33}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.45 \cdot 10^{+35}:\\ \;\;\;\;\frac{t}{i + c \cdot y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -3.3e+33) x (if (<= y 1.45e+35) (/ t (+ i (* c y))) 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.3e+33) {
		tmp = x;
	} else if (y <= 1.45e+35) {
		tmp = t / (i + (c * y));
	} 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.3d+33)) then
        tmp = x
    else if (y <= 1.45d+35) then
        tmp = t / (i + (c * y))
    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.3e+33) {
		tmp = x;
	} else if (y <= 1.45e+35) {
		tmp = t / (i + (c * y));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if y <= -3.3e+33:
		tmp = x
	elif y <= 1.45e+35:
		tmp = t / (i + (c * y))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -3.3e+33)
		tmp = x;
	elseif (y <= 1.45e+35)
		tmp = Float64(t / Float64(i + Float64(c * y)));
	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.3e+33)
		tmp = x;
	elseif (y <= 1.45e+35)
		tmp = t / (i + (c * y));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -3.3e+33], x, If[LessEqual[y, 1.45e+35], N[(t / N[(i + N[(c * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -3.29999999999999976e33 or 1.44999999999999997e35 < 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} \]
   3. Step-by-step derivation

   4. Applied rewrites 54.0%

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

   if -3.29999999999999976e33 < y < 1.44999999999999997e35

   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 c around inf

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

      1. lower-*.f64 25.6

         \[\leadsto \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{c \cdot \color{blue}{y}} \]

   4. Applied rewrites 25.6%

      \[\leadsto \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\color{blue}{c \cdot y}} \]

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 18.2%

      \[\leadsto \frac{\color{blue}{t}}{c \cdot y} \]

   8. Taylor expanded in y around 0

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

      1. lower-+.f64 N/A

         \[\leadsto \frac{t}{i + \color{blue}{c \cdot y}} \]

      2. lift-*.f64 61.8

         \[\leadsto \frac{t}{i + c \cdot \color{blue}{y}} \]

   10. Applied rewrites 61.8%

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

Alternative 11: 54.5% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.8 \cdot 10^{+27}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 4.8 \cdot 10^{-10}:\\ \;\;\;\;\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 -8.8e+27) x (if (<= y 4.8e-10) (/ (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 <= -8.8e+27) {
		tmp = x;
	} else if (y <= 4.8e-10) {
		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 <= -8.8e+27)
		tmp = x;
	elseif (y <= 4.8e-10)
		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, -8.8e+27], x, If[LessEqual[y, 4.8e-10], N[(N[(230661.510616 * y + t), $MachinePrecision] / i), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -8.7999999999999995e27 or 4.8e-10 < y

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

   4. Applied rewrites 50.2%

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

   if -8.7999999999999995e27 < y < 4.8e-10

   1. Initial program 98.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 c around 0

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

   4. Applied rewrites 75.3%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 67.0%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 58.6%

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

Alternative 12: 51.2% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{+27}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.48 \cdot 10^{+23}:\\ \;\;\;\;\frac{t}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

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

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if y <= -9.2e+27:
		tmp = x
	elif y <= 1.48e+23:
		tmp = t / i
	else:
		tmp = x
	return tmp

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -9.2e+27], x, If[LessEqual[y, 1.48e+23], N[(t / i), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -9.2000000000000002e27 or 1.4799999999999999e23 < y

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

   4. Applied rewrites 52.6%

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

   if -9.2000000000000002e27 < y < 1.4799999999999999e23

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

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

      1. lower-/.f64 50.0

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

   4. Applied rewrites 50.0%

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

Alternative 13: 26.7% 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.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 26.7%

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

Reproduce

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