Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, B

Percentage Accurate: 74.8% → 87.1%

Time: 5.1s

Alternatives: 14

Speedup: 0.4×

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))

C

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

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)
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
    code = (x + ((y * z) / t)) / ((a + 1.0d0) + ((y * b) / t))
end function

Java

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

Python

def code(x, y, z, t, a, b):
	return (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 74.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))

C

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

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)
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
    code = (x + ((y * z) / t)) / ((a + 1.0d0) + ((y * b) / t))
end function

Java

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

Python

def code(x, y, z, t, a, b):
	return (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 87.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_1 1e+275)
     t_1
     (if (<= t_1 INFINITY)
       (fma (/ y t) (/ z (+ 1.0 a)) (/ x (+ 1.0 a)))
       (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double tmp;
	if (t_1 <= 1e+275) {
		tmp = t_1;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = fma((y / t), (z / (1.0 + a)), (x / (1.0 + a)));
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	tmp = 0.0
	if (t_1 <= 1e+275)
		tmp = t_1;
	elseif (t_1 <= Inf)
		tmp = fma(Float64(y / t), Float64(z / Float64(1.0 + a)), Float64(x / Float64(1.0 + a)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1e+275], t$95$1, If[LessEqual[t$95$1, Infinity], N[(N[(y / t), $MachinePrecision] * N[(z / N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 9.9999999999999996e274

   1. Initial program 74.8%

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

   if 9.9999999999999996e274 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   4. Taylor expanded in y around 0

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

      1. lift-+.f64 64.9

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

   6. Applied rewrites 64.9%

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

   7. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{y}{t}, \frac{z}{1 + a}, \frac{x}{\color{blue}{1 + a}}\right) \]
   8. Step-by-step derivation

      1. lift-+.f64 58.8

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

   9. Applied rewrites 58.8%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 2: 86.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{y \cdot z}{t}\\ t_2 := \frac{t\_1}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ \mathbf{if}\;t\_2 \leq 10^{+275}:\\ \;\;\;\;\frac{t\_1}{\mathsf{fma}\left(b, \frac{y}{t}, 1 + a\right)}\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{t}, \frac{z}{1 + a}, \frac{x}{1 + a}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y z) t))) (t_2 (/ t_1 (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_2 1e+275)
     (/ t_1 (fma b (/ y t) (+ 1.0 a)))
     (if (<= t_2 INFINITY)
       (fma (/ y t) (/ z (+ 1.0 a)) (/ x (+ 1.0 a)))
       (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + ((y * z) / t);
	double t_2 = t_1 / ((a + 1.0) + ((y * b) / t));
	double tmp;
	if (t_2 <= 1e+275) {
		tmp = t_1 / fma(b, (y / t), (1.0 + a));
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = fma((y / t), (z / (1.0 + a)), (x / (1.0 + a)));
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(Float64(y * z) / t))
	t_2 = Float64(t_1 / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	tmp = 0.0
	if (t_2 <= 1e+275)
		tmp = Float64(t_1 / fma(b, Float64(y / t), Float64(1.0 + a)));
	elseif (t_2 <= Inf)
		tmp = fma(Float64(y / t), Float64(z / Float64(1.0 + a)), Float64(x / Float64(1.0 + a)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 9.9999999999999996e274

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-+.f64 74.4

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

   3. Applied rewrites 74.4%

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

   if 9.9999999999999996e274 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   4. Taylor expanded in y around 0

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

      1. lift-+.f64 64.9

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

   6. Applied rewrites 64.9%

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

   7. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{y}{t}, \frac{z}{1 + a}, \frac{x}{\color{blue}{1 + a}}\right) \]
   8. Step-by-step derivation

      1. lift-+.f64 58.8

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

   9. Applied rewrites 58.8%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 3: 86.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 4: 72.5% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ t_2 := \mathsf{fma}\left(\frac{y}{t}, \frac{z}{1 + a}, \frac{x}{1 + a}\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-284}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-310}:\\ \;\;\;\;\frac{z \cdot y}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))
        (t_2 (fma (/ y t) (/ z (+ 1.0 a)) (/ x (+ 1.0 a)))))
   (if (<= t_1 -5e-284)
     t_2
     (if (<= t_1 1e-310)
       (/ (* z y) (fma b y (* t (+ 1.0 a))))
       (if (<= t_1 INFINITY) t_2 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double t_2 = fma((y / t), (z / (1.0 + a)), (x / (1.0 + a)));
	double tmp;
	if (t_1 <= -5e-284) {
		tmp = t_2;
	} else if (t_1 <= 1e-310) {
		tmp = (z * y) / fma(b, y, (t * (1.0 + a)));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_2 = fma(Float64(y / t), Float64(z / Float64(1.0 + a)), Float64(x / Float64(1.0 + a)))
	tmp = 0.0
	if (t_1 <= -5e-284)
		tmp = t_2;
	elseif (t_1 <= 1e-310)
		tmp = Float64(Float64(z * y) / fma(b, y, Float64(t * Float64(1.0 + a))));
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y / t), $MachinePrecision] * N[(z / N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-284], t$95$2, If[LessEqual[t$95$1, 1e-310], N[(N[(z * y), $MachinePrecision] / N[(b * y + N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(z / b), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -4.99999999999999973e-284 or 9.999999999999969e-311 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   4. Taylor expanded in y around 0

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

      1. lift-+.f64 64.9

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

   6. Applied rewrites 64.9%

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

   7. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{y}{t}, \frac{z}{1 + a}, \frac{x}{\color{blue}{1 + a}}\right) \]
   8. Step-by-step derivation

      1. lift-+.f64 58.8

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

   9. Applied rewrites 58.8%

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

   if -4.99999999999999973e-284 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 9.999999999999969e-311

   1. Initial program 74.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. associate-/l* N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower-+.f64 33.3

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

   4. Applied rewrites 33.3%

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

   5. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 41.6

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

   7. Applied rewrites 41.6%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 5: 72.5% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{y \cdot z}{t}\\ t_2 := \frac{t\_1}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ t_3 := \frac{t\_1}{1 + a}\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{-284}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 10^{-310}:\\ \;\;\;\;\frac{z \cdot y}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+207}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{t}, \frac{z}{a}, \frac{x}{1 + a}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y z) t)))
        (t_2 (/ t_1 (+ (+ a 1.0) (/ (* y b) t))))
        (t_3 (/ t_1 (+ 1.0 a))))
   (if (<= t_2 -5e-284)
     t_3
     (if (<= t_2 1e-310)
       (/ (* z y) (fma b y (* t (+ 1.0 a))))
       (if (<= t_2 5e+207)
         t_3
         (if (<= t_2 INFINITY)
           (fma (/ y t) (/ z a) (/ x (+ 1.0 a)))
           (/ z b)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + ((y * z) / t);
	double t_2 = t_1 / ((a + 1.0) + ((y * b) / t));
	double t_3 = t_1 / (1.0 + a);
	double tmp;
	if (t_2 <= -5e-284) {
		tmp = t_3;
	} else if (t_2 <= 1e-310) {
		tmp = (z * y) / fma(b, y, (t * (1.0 + a)));
	} else if (t_2 <= 5e+207) {
		tmp = t_3;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = fma((y / t), (z / a), (x / (1.0 + a)));
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(Float64(y * z) / t))
	t_2 = Float64(t_1 / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_3 = Float64(t_1 / Float64(1.0 + a))
	tmp = 0.0
	if (t_2 <= -5e-284)
		tmp = t_3;
	elseif (t_2 <= 1e-310)
		tmp = Float64(Float64(z * y) / fma(b, y, Float64(t * Float64(1.0 + a))));
	elseif (t_2 <= 5e+207)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = fma(Float64(y / t), Float64(z / a), Float64(x / Float64(1.0 + a)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-284], t$95$3, If[LessEqual[t$95$2, 1e-310], N[(N[(z * y), $MachinePrecision] / N[(b * y + N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+207], t$95$3, If[LessEqual[t$95$2, Infinity], N[(N[(y / t), $MachinePrecision] * N[(z / a), $MachinePrecision] + N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -4.99999999999999973e-284 or 9.999999999999969e-311 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 4.9999999999999999e207

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-+.f64 56.3

         \[\leadsto \frac{x + \frac{y \cdot z}{t}}{1 + \color{blue}{a}} \]

   4. Applied rewrites 56.3%

      \[\leadsto \frac{x + \frac{y \cdot z}{t}}{\color{blue}{1 + a}} \]

   if -4.99999999999999973e-284 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 9.999999999999969e-311

   1. Initial program 74.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. associate-/l* N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower-+.f64 33.3

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

   4. Applied rewrites 33.3%

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

   5. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 41.6

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

   7. Applied rewrites 41.6%

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

   if 4.9999999999999999e207 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   4. Taylor expanded in y around 0

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

      1. lift-+.f64 64.9

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

   6. Applied rewrites 64.9%

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

   7. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{y}{t}, \frac{z}{1 + a}, \frac{x}{\color{blue}{1 + a}}\right) \]
   8. Step-by-step derivation

      1. lift-+.f64 58.8

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

   9. Applied rewrites 58.8%

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

   10. Taylor expanded in a around inf

       \[\leadsto \mathsf{fma}\left(\frac{y}{t}, \color{blue}{\frac{z}{a}}, \frac{x}{1 + a}\right) \]
   11. Step-by-step derivation

       1. lower-/.f64 47.1

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

   12. Applied rewrites 47.1%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 6: 71.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{y \cdot z}{t}\\ t_2 := \frac{t\_1}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ t_3 := \frac{t\_1}{1 + a}\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{-284}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 10^{-310}:\\ \;\;\;\;\frac{z \cdot y}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}\\ \mathbf{elif}\;t\_2 \leq 10^{+300}:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y z) t)))
        (t_2 (/ t_1 (+ (+ a 1.0) (/ (* y b) t))))
        (t_3 (/ t_1 (+ 1.0 a))))
   (if (<= t_2 -5e-284)
     t_3
     (if (<= t_2 1e-310)
       (/ (* z y) (fma b y (* t (+ 1.0 a))))
       (if (<= t_2 1e+300) t_3 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + ((y * z) / t);
	double t_2 = t_1 / ((a + 1.0) + ((y * b) / t));
	double t_3 = t_1 / (1.0 + a);
	double tmp;
	if (t_2 <= -5e-284) {
		tmp = t_3;
	} else if (t_2 <= 1e-310) {
		tmp = (z * y) / fma(b, y, (t * (1.0 + a)));
	} else if (t_2 <= 1e+300) {
		tmp = t_3;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(Float64(y * z) / t))
	t_2 = Float64(t_1 / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_3 = Float64(t_1 / Float64(1.0 + a))
	tmp = 0.0
	if (t_2 <= -5e-284)
		tmp = t_3;
	elseif (t_2 <= 1e-310)
		tmp = Float64(Float64(z * y) / fma(b, y, Float64(t * Float64(1.0 + a))));
	elseif (t_2 <= 1e+300)
		tmp = t_3;
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-284], t$95$3, If[LessEqual[t$95$2, 1e-310], N[(N[(z * y), $MachinePrecision] / N[(b * y + N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+300], t$95$3, N[(z / b), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -4.99999999999999973e-284 or 9.999999999999969e-311 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.0000000000000001e300

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-+.f64 56.3

         \[\leadsto \frac{x + \frac{y \cdot z}{t}}{1 + \color{blue}{a}} \]

   4. Applied rewrites 56.3%

      \[\leadsto \frac{x + \frac{y \cdot z}{t}}{\color{blue}{1 + a}} \]

   if -4.99999999999999973e-284 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 9.999999999999969e-311

   1. Initial program 74.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. associate-/l* N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower-+.f64 33.3

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

   4. Applied rewrites 33.3%

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

   5. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 41.6

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

   7. Applied rewrites 41.6%

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

   if 1.0000000000000001e300 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 7: 70.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{y \cdot z}{t}\\ t_2 := \frac{t\_1}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ t_3 := \frac{t\_1}{1 + a}\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{-313}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 0:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(t, x, y \cdot z\right)}{b}}{y}\\ \mathbf{elif}\;t\_2 \leq 10^{+300}:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y z) t)))
        (t_2 (/ t_1 (+ (+ a 1.0) (/ (* y b) t))))
        (t_3 (/ t_1 (+ 1.0 a))))
   (if (<= t_2 -1e-313)
     t_3
     (if (<= t_2 0.0)
       (/ (/ (fma t x (* y z)) b) y)
       (if (<= t_2 1e+300) t_3 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + ((y * z) / t);
	double t_2 = t_1 / ((a + 1.0) + ((y * b) / t));
	double t_3 = t_1 / (1.0 + a);
	double tmp;
	if (t_2 <= -1e-313) {
		tmp = t_3;
	} else if (t_2 <= 0.0) {
		tmp = (fma(t, x, (y * z)) / b) / y;
	} else if (t_2 <= 1e+300) {
		tmp = t_3;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(Float64(y * z) / t))
	t_2 = Float64(t_1 / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_3 = Float64(t_1 / Float64(1.0 + a))
	tmp = 0.0
	if (t_2 <= -1e-313)
		tmp = t_3;
	elseif (t_2 <= 0.0)
		tmp = Float64(Float64(fma(t, x, Float64(y * z)) / b) / y);
	elseif (t_2 <= 1e+300)
		tmp = t_3;
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e-313], t$95$3, If[LessEqual[t$95$2, 0.0], N[(N[(N[(t * x + N[(y * z), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision] / y), $MachinePrecision], If[LessEqual[t$95$2, 1e+300], t$95$3, N[(z / b), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -1.00000000001e-313 or 0.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.0000000000000001e300

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-+.f64 56.3

         \[\leadsto \frac{x + \frac{y \cdot z}{t}}{1 + \color{blue}{a}} \]

   4. Applied rewrites 56.3%

      \[\leadsto \frac{x + \frac{y \cdot z}{t}}{\color{blue}{1 + a}} \]

   if -1.00000000001e-313 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 0.0

   1. Initial program 74.8%

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

   2. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 24.2

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

   4. Applied rewrites 24.2%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\frac{t \cdot x}{b} + \frac{y \cdot z}{b}}{\color{blue}{y}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\frac{t \cdot x}{b} + \frac{y \cdot z}{b}}{y} \]

      2. div-add-rev N/A

         \[\leadsto \frac{\frac{t \cdot x + y \cdot z}{b}}{y} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\frac{t \cdot x + y \cdot z}{b}}{y} \]

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 33.0

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

   7. Applied rewrites 33.0%

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

   if 1.0000000000000001e300 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 8: 69.0% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (fma y (/ z t) x) (+ 1.0 a))))
   (if (<= t -8.8e-18)
     t_1
     (if (<= t 2.2e-117) (/ (+ z (/ (* t x) y)) b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(y, (z / t), x) / (1.0 + a);
	double tmp;
	if (t <= -8.8e-18) {
		tmp = t_1;
	} else if (t <= 2.2e-117) {
		tmp = (z + ((t * x) / y)) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(y, Float64(z / t), x) / Float64(1.0 + a))
	tmp = 0.0
	if (t <= -8.8e-18)
		tmp = t_1;
	elseif (t <= 2.2e-117)
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / b);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8.8e-18], t$95$1, If[LessEqual[t, 2.2e-117], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -8.7999999999999994e-18 or 2.2000000000000001e-117 < t

   1. Initial program 74.8%

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

   2. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x + \frac{y \cdot z}{t}}{\color{blue}{1 + a}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{y \cdot z}{t} + x}{\color{blue}{1} + a} \]

      3. associate-/l* N/A

         \[\leadsto \frac{y \cdot \frac{z}{t} + x}{1 + a} \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 56.2

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

   4. Applied rewrites 56.2%

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

   if -8.7999999999999994e-18 < t < 2.2000000000000001e-117

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   4. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{z + \frac{t \cdot x}{y}}{b}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      4. lower-*.f64 40.7

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

   6. Applied rewrites 40.7%

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

Alternative 9: 67.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_1 (- INFINITY))
     (/ z b)
     (if (<= t_1 1e+300) (/ x (fma b (/ y t) (+ 1.0 a))) (/ z b)))))

C

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

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(z / b);
	elseif (t_1 <= 1e+300)
		tmp = Float64(x / fma(b, Float64(y / t), Float64(1.0 + a)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0 or 1.0000000000000001e300 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.0000000000000001e300

   1. Initial program 74.8%

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

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-+.f64 53.6

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

   4. Applied rewrites 53.6%

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

Alternative 10: 60.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 + a}\\ \mathbf{if}\;t \leq -9 \cdot 10^{-18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 3.5 \cdot 10^{-48}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 a))))
   (if (<= t -9e-18) t_1 (if (<= t 3.5e-48) (/ (+ z (/ (* t x) y)) b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -9e-18) {
		tmp = t_1;
	} else if (t <= 3.5e-48) {
		tmp = (z + ((t * x) / y)) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
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) :: t_1
    real(8) :: tmp
    t_1 = x / (1.0d0 + a)
    if (t <= (-9d-18)) then
        tmp = t_1
    else if (t <= 3.5d-48) then
        tmp = (z + ((t * x) / y)) / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -9e-18) {
		tmp = t_1;
	} else if (t <= 3.5e-48) {
		tmp = (z + ((t * x) / y)) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x / (1.0 + a)
	tmp = 0
	if t <= -9e-18:
		tmp = t_1
	elif t <= 3.5e-48:
		tmp = (z + ((t * x) / y)) / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(1.0 + a))
	tmp = 0.0
	if (t <= -9e-18)
		tmp = t_1;
	elseif (t <= 3.5e-48)
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x / (1.0 + a);
	tmp = 0.0;
	if (t <= -9e-18)
		tmp = t_1;
	elseif (t <= 3.5e-48)
		tmp = (z + ((t * x) / y)) / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -9e-18], t$95$1, If[LessEqual[t, 3.5e-48], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -8.99999999999999987e-18 or 3.49999999999999991e-48 < t

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 42.2

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   4. Applied rewrites 42.2%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   if -8.99999999999999987e-18 < t < 3.49999999999999991e-48

   1. Initial program 74.8%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

      16. associate-/r* N/A

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

   3. Applied rewrites 78.8%

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

   4. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{z + \frac{t \cdot x}{y}}{b}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      4. lower-*.f64 40.7

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

   6. Applied rewrites 40.7%

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

Alternative 11: 56.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 + a}\\ \mathbf{if}\;t \leq -9 \cdot 10^{-18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 2.25 \cdot 10^{-48}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 a))))
   (if (<= t -9e-18) t_1 (if (<= t 2.25e-48) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -9e-18) {
		tmp = t_1;
	} else if (t <= 2.25e-48) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
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) :: t_1
    real(8) :: tmp
    t_1 = x / (1.0d0 + a)
    if (t <= (-9d-18)) then
        tmp = t_1
    else if (t <= 2.25d-48) then
        tmp = z / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -9e-18) {
		tmp = t_1;
	} else if (t <= 2.25e-48) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x / (1.0 + a)
	tmp = 0
	if t <= -9e-18:
		tmp = t_1
	elif t <= 2.25e-48:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(1.0 + a))
	tmp = 0.0
	if (t <= -9e-18)
		tmp = t_1;
	elseif (t <= 2.25e-48)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x / (1.0 + a);
	tmp = 0.0;
	if (t <= -9e-18)
		tmp = t_1;
	elseif (t <= 2.25e-48)
		tmp = z / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -9e-18], t$95$1, If[LessEqual[t, 2.25e-48], N[(z / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -8.99999999999999987e-18 or 2.24999999999999994e-48 < t

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 42.2

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   4. Applied rewrites 42.2%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   if -8.99999999999999987e-18 < t < 2.24999999999999994e-48

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 12: 43.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a + 1 \leq -1 \cdot 10^{+31}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a + 1 \leq 2 \cdot 10^{+24}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (+ a 1.0) -1e+31) (/ x a) (if (<= (+ a 1.0) 2e+24) (/ z b) (/ x a))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a + 1.0) <= -1e+31) {
		tmp = x / a;
	} else if ((a + 1.0) <= 2e+24) {
		tmp = z / b;
	} else {
		tmp = x / a;
	}
	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)
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) :: tmp
    if ((a + 1.0d0) <= (-1d+31)) then
        tmp = x / a
    else if ((a + 1.0d0) <= 2d+24) then
        tmp = z / b
    else
        tmp = x / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a + 1.0) <= -1e+31) {
		tmp = x / a;
	} else if ((a + 1.0) <= 2e+24) {
		tmp = z / b;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (a + 1.0) <= -1e+31:
		tmp = x / a
	elif (a + 1.0) <= 2e+24:
		tmp = z / b
	else:
		tmp = x / a
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(a + 1.0) <= -1e+31)
		tmp = Float64(x / a);
	elseif (Float64(a + 1.0) <= 2e+24)
		tmp = Float64(z / b);
	else
		tmp = Float64(x / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((a + 1.0) <= -1e+31)
		tmp = x / a;
	elseif ((a + 1.0) <= 2e+24)
		tmp = z / b;
	else
		tmp = x / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(a + 1.0), $MachinePrecision], -1e+31], N[(x / a), $MachinePrecision], If[LessEqual[N[(a + 1.0), $MachinePrecision], 2e+24], N[(z / b), $MachinePrecision], N[(x / a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 a #s(literal 1 binary64)) < -9.9999999999999996e30 or 2e24 < (+.f64 a #s(literal 1 binary64))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 42.2

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   4. Applied rewrites 42.2%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 25.4

         \[\leadsto \frac{x}{a} \]

   7. Applied rewrites 25.4%

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

   if -9.9999999999999996e30 < (+.f64 a #s(literal 1 binary64)) < 2e24

   1. Initial program 74.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 34.3

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

   4. Applied rewrites 34.3%

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

Alternative 13: 41.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a + 1 \leq -50000:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a + 1 \leq 2:\\ \;\;\;\;\frac{x}{1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (+ a 1.0) -50000.0)
   (/ x a)
   (if (<= (+ a 1.0) 2.0) (/ x 1.0) (/ x a))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a + 1.0) <= -50000.0) {
		tmp = x / a;
	} else if ((a + 1.0) <= 2.0) {
		tmp = x / 1.0;
	} else {
		tmp = x / a;
	}
	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)
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) :: tmp
    if ((a + 1.0d0) <= (-50000.0d0)) then
        tmp = x / a
    else if ((a + 1.0d0) <= 2.0d0) then
        tmp = x / 1.0d0
    else
        tmp = x / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a + 1.0) <= -50000.0) {
		tmp = x / a;
	} else if ((a + 1.0) <= 2.0) {
		tmp = x / 1.0;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (a + 1.0) <= -50000.0:
		tmp = x / a
	elif (a + 1.0) <= 2.0:
		tmp = x / 1.0
	else:
		tmp = x / a
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(a + 1.0) <= -50000.0)
		tmp = Float64(x / a);
	elseif (Float64(a + 1.0) <= 2.0)
		tmp = Float64(x / 1.0);
	else
		tmp = Float64(x / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((a + 1.0) <= -50000.0)
		tmp = x / a;
	elseif ((a + 1.0) <= 2.0)
		tmp = x / 1.0;
	else
		tmp = x / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(a + 1.0), $MachinePrecision], -50000.0], N[(x / a), $MachinePrecision], If[LessEqual[N[(a + 1.0), $MachinePrecision], 2.0], N[(x / 1.0), $MachinePrecision], N[(x / a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 a #s(literal 1 binary64)) < -5e4 or 2 < (+.f64 a #s(literal 1 binary64))

   1. Initial program 74.8%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 42.2

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   4. Applied rewrites 42.2%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 25.4

         \[\leadsto \frac{x}{a} \]

   7. Applied rewrites 25.4%

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

   if -5e4 < (+.f64 a #s(literal 1 binary64)) < 2

   1. Initial program 74.8%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{x + \frac{y \cdot z}{t}}{1 + \frac{b \cdot y}{t}}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{x + \frac{y \cdot z}{t}}{\color{blue}{1 + \frac{b \cdot y}{t}}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{y \cdot z}{t} + x}{\color{blue}{1} + \frac{b \cdot y}{t}} \]

      3. associate-/l* N/A

         \[\leadsto \frac{y \cdot \frac{z}{t} + x}{1 + \frac{b \cdot y}{t}} \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 44.8

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

   4. Applied rewrites 44.8%

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

   5. Taylor expanded in x around inf

      \[\leadsto \frac{x}{\color{blue}{1 + \frac{b \cdot y}{t}}} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{1 + \color{blue}{\frac{b \cdot y}{t}}} \]

      2. +-commutative N/A

         \[\leadsto \frac{x}{\frac{b \cdot y}{t} + 1} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x}{b \cdot \frac{y}{t} + 1} \]

      4. *-commutative N/A

         \[\leadsto \frac{x}{\frac{y}{t} \cdot b + 1} \]

      5. lower-fma.f64 N/A

         \[\leadsto \frac{x}{\mathsf{fma}\left(\frac{y}{t}, b, 1\right)} \]

      6. lift-/.f64 32.2

         \[\leadsto \frac{x}{\mathsf{fma}\left(\frac{y}{t}, b, 1\right)} \]

   7. Applied rewrites 32.2%

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

   8. Taylor expanded in y around 0

      \[\leadsto \frac{x}{1} \]
   9. Step-by-step derivation

   10. Applied rewrites 20.0%

       \[\leadsto \frac{x}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 25.4% accurate, 5.8× speedup

Math

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

FPCore

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

C

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

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)
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
    code = x / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x / a), $MachinePrecision]

Derivation

1. Initial program 74.8%

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

2. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

      \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

   2. lower-+.f64 42.2

      \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

4. Applied rewrites 42.2%

   \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

5. Taylor expanded in a around inf

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

   1. lower-/.f64 25.4

      \[\leadsto \frac{x}{a} \]

7. Applied rewrites 25.4%

   \[\leadsto \frac{x}{\color{blue}{a}} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025140 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, B"
  :precision binary64
  (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))