AI.Clustering.Hierarchical.Internal:ward from clustering-0.2.1

Percentage Accurate: 61.6% → 88.6%

Time: 8.4s

Alternatives: 17

Speedup: 1.4×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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 + y) * a)) - (y * b)) / ((x + t) + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 61.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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 + y) * a)) - (y * b)) / ((x + t) + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 88.6% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (pow (+ t y) 2.0))
        (t_2 (/ z (+ t y)))
        (t_3 (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) (+ (+ x t) y))))
   (if (<= t_3 (- INFINITY))
     (fma
      (- b)
      (/ y (+ t y))
      (fma
       (fma (/ y t_1) b (- t_2 (fma (/ z t_1) y (/ a (+ t y)))))
       x
       (fma t_2 y a)))
     (if (<= t_3 4e+303) t_3 (- (+ a z) b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = pow((t + y), 2.0);
	double t_2 = z / (t + y);
	double t_3 = ((((x + y) * z) + ((t + y) * a)) - (y * b)) / ((x + t) + y);
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = fma(-b, (y / (t + y)), fma(fma((y / t_1), b, (t_2 - fma((z / t_1), y, (a / (t + y))))), x, fma(t_2, y, a)));
	} else if (t_3 <= 4e+303) {
		tmp = t_3;
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(t + y) ^ 2.0
	t_2 = Float64(z / Float64(t + y))
	t_3 = Float64(Float64(Float64(Float64(Float64(x + y) * z) + Float64(Float64(t + y) * a)) - Float64(y * b)) / Float64(Float64(x + t) + y))
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = fma(Float64(-b), Float64(y / Float64(t + y)), fma(fma(Float64(y / t_1), b, Float64(t_2 - fma(Float64(z / t_1), y, Float64(a / Float64(t + y))))), x, fma(t_2, y, a)));
	elseif (t_3 <= 4e+303)
		tmp = t_3;
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < -inf.0

   1. Initial program 6.3%

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

   3. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. distribute-lft-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. lower-fma.f64 N/A

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

   5. Applied rewrites 71.8%

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

   if -inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 4e303

   1. Initial program 99.7%

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

   if 4e303 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y))

   1. Initial program 6.4%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 78.4

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 78.4%

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

Alternative 2: 67.0% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* y (- z b)))
        (t_2 (+ (+ x t) y))
        (t_3 (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) t_2))
        (t_4 (/ (fma z x t_1) t_2)))
   (if (<= t_3 -1e+130)
     (fma y (/ (- z b) (+ t y)) a)
     (if (<= t_3 -1000000000000.0)
       t_4
       (if (<= t_3 2e-64)
         (/ (fma a t (* z x)) (+ t x))
         (if (<= t_3 2e+182)
           t_4
           (if (<= t_3 5e+267)
             (/ (fma (+ t y) a t_1) (+ t y))
             (- (+ a z) b))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y * (z - b);
	double t_2 = (x + t) + y;
	double t_3 = ((((x + y) * z) + ((t + y) * a)) - (y * b)) / t_2;
	double t_4 = fma(z, x, t_1) / t_2;
	double tmp;
	if (t_3 <= -1e+130) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else if (t_3 <= -1000000000000.0) {
		tmp = t_4;
	} else if (t_3 <= 2e-64) {
		tmp = fma(a, t, (z * x)) / (t + x);
	} else if (t_3 <= 2e+182) {
		tmp = t_4;
	} else if (t_3 <= 5e+267) {
		tmp = fma((t + y), a, t_1) / (t + y);
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y * Float64(z - b))
	t_2 = Float64(Float64(x + t) + y)
	t_3 = Float64(Float64(Float64(Float64(Float64(x + y) * z) + Float64(Float64(t + y) * a)) - Float64(y * b)) / t_2)
	t_4 = Float64(fma(z, x, t_1) / t_2)
	tmp = 0.0
	if (t_3 <= -1e+130)
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	elseif (t_3 <= -1000000000000.0)
		tmp = t_4;
	elseif (t_3 <= 2e-64)
		tmp = Float64(fma(a, t, Float64(z * x)) / Float64(t + x));
	elseif (t_3 <= 2e+182)
		tmp = t_4;
	elseif (t_3 <= 5e+267)
		tmp = Float64(fma(Float64(t + y), a, t_1) / Float64(t + y));
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y * N[(z - b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x + t), $MachinePrecision] + y), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(N[(t + y), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] - N[(y * b), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(z * x + t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+130], N[(y * N[(N[(z - b), $MachinePrecision] / N[(t + y), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], If[LessEqual[t$95$3, -1000000000000.0], t$95$4, If[LessEqual[t$95$3, 2e-64], N[(N[(a * t + N[(z * x), $MachinePrecision]), $MachinePrecision] / N[(t + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+182], t$95$4, If[LessEqual[t$95$3, 5e+267], N[(N[(N[(t + y), $MachinePrecision] * a + t$95$1), $MachinePrecision] / N[(t + y), $MachinePrecision]), $MachinePrecision], N[(N[(a + z), $MachinePrecision] - b), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < -1.0000000000000001e130

   1. Initial program 37.9%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 31.4

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

   5. Applied rewrites 31.4%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 69.6%

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

   if -1.0000000000000001e130 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < -1e12 or 1.99999999999999993e-64 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 2.0000000000000001e182

   1. Initial program 99.6%

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

   3. Taylor expanded in a around 0

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

      1. distribute-rgt-in N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

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

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

      7. lower-*.f64 N/A

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

      8. lower--.f64 80.9

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

   5. Applied rewrites 80.9%

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

   if -1e12 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 1.99999999999999993e-64

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 81.5

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

   5. Applied rewrites 81.5%

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

   if 2.0000000000000001e182 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 4.9999999999999999e267

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 87.0

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

   5. Applied rewrites 87.0%

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

   if 4.9999999999999999e267 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y))

   1. Initial program 14.4%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 78.6

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 78.6%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
3. Recombined 5 regimes into one program.
4. Add Preprocessing

Alternative 3: 67.3% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) (+ (+ x t) y))))
   (if (<= t_1 -2e+33)
     (fma y (/ (- z b) (+ t y)) a)
     (if (<= t_1 1e-128)
       (/ (fma a t (* z x)) (+ t x))
       (if (<= t_1 5e+267)
         (/ (fma (+ t y) a (* y (- z b))) (+ t y))
         (- (+ 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 + y) * a)) - (y * b)) / ((x + t) + y);
	double tmp;
	if (t_1 <= -2e+33) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else if (t_1 <= 1e-128) {
		tmp = fma(a, t, (z * x)) / (t + x);
	} else if (t_1 <= 5e+267) {
		tmp = fma((t + y), a, (y * (z - b))) / (t + y);
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(Float64(Float64(x + y) * z) + Float64(Float64(t + y) * a)) - Float64(y * b)) / Float64(Float64(x + t) + y))
	tmp = 0.0
	if (t_1 <= -2e+33)
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	elseif (t_1 <= 1e-128)
		tmp = Float64(fma(a, t, Float64(z * x)) / Float64(t + x));
	elseif (t_1 <= 5e+267)
		tmp = Float64(fma(Float64(t + y), a, Float64(y * Float64(z - b))) / Float64(t + y));
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < -1.9999999999999999e33

   1. Initial program 50.7%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 39.8

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

   5. Applied rewrites 39.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 70.0%

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

   if -1.9999999999999999e33 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 1.00000000000000005e-128

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 80.4

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

   5. Applied rewrites 80.4%

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

   if 1.00000000000000005e-128 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 4.9999999999999999e267

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 70.1

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

   5. Applied rewrites 70.1%

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

   if 4.9999999999999999e267 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y))

   1. Initial program 14.4%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 78.6

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 78.6%

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

Alternative 4: 65.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ x t) y))
        (t_2 (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) t_1))
        (t_3 (- (+ a z) b)))
   (if (<= t_2 -2e+33)
     (fma y (/ (- z b) (+ t y)) a)
     (if (<= t_2 5e-47)
       (/ (fma a t (* z x)) (+ t x))
       (if (<= t_2 5e+267) (/ (* t_3 y) t_1) t_3)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + t) + y;
	double t_2 = ((((x + y) * z) + ((t + y) * a)) - (y * b)) / t_1;
	double t_3 = (a + z) - b;
	double tmp;
	if (t_2 <= -2e+33) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else if (t_2 <= 5e-47) {
		tmp = fma(a, t, (z * x)) / (t + x);
	} else if (t_2 <= 5e+267) {
		tmp = (t_3 * y) / t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + t) + y)
	t_2 = Float64(Float64(Float64(Float64(Float64(x + y) * z) + Float64(Float64(t + y) * a)) - Float64(y * b)) / t_1)
	t_3 = Float64(Float64(a + z) - b)
	tmp = 0.0
	if (t_2 <= -2e+33)
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	elseif (t_2 <= 5e-47)
		tmp = Float64(fma(a, t, Float64(z * x)) / Float64(t + x));
	elseif (t_2 <= 5e+267)
		tmp = Float64(Float64(t_3 * y) / t_1);
	else
		tmp = t_3;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < -1.9999999999999999e33

   1. Initial program 50.7%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 39.8

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

   5. Applied rewrites 39.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 70.0%

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

   if -1.9999999999999999e33 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 5.00000000000000011e-47

   1. Initial program 99.7%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 78.6

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

   5. Applied rewrites 78.6%

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

   if 5.00000000000000011e-47 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 4.9999999999999999e267

   1. Initial program 99.7%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-+.f64 66.1

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

   5. Applied rewrites 66.1%

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

   if 4.9999999999999999e267 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y))

   1. Initial program 14.4%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 78.6

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 78.6%

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

Alternative 5: 88.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) (+ (+ x t) y))))
   (if (<= t_1 (- INFINITY))
     (fma y (/ (- z b) (+ t y)) a)
     (if (<= t_1 4e+303) t_1 (- (+ 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 + y) * a)) - (y * b)) / ((x + t) + y);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else if (t_1 <= 4e+303) {
		tmp = t_1;
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < -inf.0

   1. Initial program 6.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 7.7

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

   5. Applied rewrites 7.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 69.7%

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

   if -inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y)) < 4e303

   1. Initial program 99.7%

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

   if 4e303 < (/.f64 (-.f64 (+.f64 (*.f64 (+.f64 x y) z) (*.f64 (+.f64 t y) a)) (*.f64 y b)) (+.f64 (+.f64 x t) y))

   1. Initial program 6.4%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 78.4

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 78.4%

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

Alternative 6: 65.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ y x) t)))
   (if (<= x -1.2e+257)
     (* y (/ z y))
     (if (<= x -5.5e+73)
       (* (+ y x) (/ z t_1))
       (if (<= x 1.3e+98)
         (fma y (/ (- z b) (+ t y)) a)
         (* (+ t y) (/ a t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (y + x) + t;
	double tmp;
	if (x <= -1.2e+257) {
		tmp = y * (z / y);
	} else if (x <= -5.5e+73) {
		tmp = (y + x) * (z / t_1);
	} else if (x <= 1.3e+98) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else {
		tmp = (t + y) * (a / t_1);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(y + x) + t)
	tmp = 0.0
	if (x <= -1.2e+257)
		tmp = Float64(y * Float64(z / y));
	elseif (x <= -5.5e+73)
		tmp = Float64(Float64(y + x) * Float64(z / t_1));
	elseif (x <= 1.3e+98)
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	else
		tmp = Float64(Float64(t + y) * Float64(a / t_1));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(y + x), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[x, -1.2e+257], N[(y * N[(z / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.5e+73], N[(N[(y + x), $MachinePrecision] * N[(z / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.3e+98], N[(y * N[(N[(z - b), $MachinePrecision] / N[(t + y), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], N[(N[(t + y), $MachinePrecision] * N[(a / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if x < -1.2e257

   1. Initial program 70.1%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 18.2

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

   5. Applied rewrites 18.2%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 41.4%

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

   9. Taylor expanded in y around inf

      \[\leadsto y \cdot \frac{z}{y} \]
   10. Step-by-step derivation

   11. Applied rewrites 69.7%

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

   if -1.2e257 < x < -5.5000000000000003e73

   1. Initial program 64.3%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 58.4

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

   5. Applied rewrites 58.4%

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

   if -5.5000000000000003e73 < x < 1.3e98

   1. Initial program 69.5%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 59.1

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

   5. Applied rewrites 59.1%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 78.0%

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

   if 1.3e98 < x

   1. Initial program 42.0%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 53.8

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

   5. Applied rewrites 53.8%

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

Alternative 7: 71.6% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -7.6e-117) (not (<= y 1e-146)))
   (fma y (/ (- z b) (+ t y)) a)
   (/ (fma a t (* z x)) (+ t x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -7.6e-117) || !(y <= 1e-146)) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else {
		tmp = fma(a, t, (z * x)) / (t + x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -7.6e-117) || !(y <= 1e-146))
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	else
		tmp = Float64(fma(a, t, Float64(z * x)) / Float64(t + x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -7.6e-117], N[Not[LessEqual[y, 1e-146]], $MachinePrecision]], N[(y * N[(N[(z - b), $MachinePrecision] / N[(t + y), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], N[(N[(a * t + N[(z * x), $MachinePrecision]), $MachinePrecision] / N[(t + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.59999999999999945e-117 or 1.00000000000000003e-146 < y

   1. Initial program 58.2%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 45.6

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

   5. Applied rewrites 45.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 73.7%

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

   if -7.59999999999999945e-117 < y < 1.00000000000000003e-146

   1. Initial program 80.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 63.9

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

   5. Applied rewrites 63.9%

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

4. Final simplification 70.9%

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

Alternative 8: 65.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{+210}:\\ \;\;\;\;y \cdot \frac{z}{y}\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+98}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - b}{t + y}, a\right)\\ \mathbf{else}:\\ \;\;\;\;\left(t + y\right) \cdot \frac{a}{\left(y + x\right) + t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= x -3e+210)
   (* y (/ z y))
   (if (<= x 1.3e+98)
     (fma y (/ (- z b) (+ t y)) a)
     (* (+ t y) (/ a (+ (+ y x) t))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (x <= -3e+210) {
		tmp = y * (z / y);
	} else if (x <= 1.3e+98) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else {
		tmp = (t + y) * (a / ((y + x) + t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (x <= -3e+210)
		tmp = Float64(y * Float64(z / y));
	elseif (x <= 1.3e+98)
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	else
		tmp = Float64(Float64(t + y) * Float64(a / Float64(Float64(y + x) + t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[x, -3e+210], N[(y * N[(z / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.3e+98], N[(y * N[(N[(z - b), $MachinePrecision] / N[(t + y), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], N[(N[(t + y), $MachinePrecision] * N[(a / N[(N[(y + x), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.00000000000000022e210

   1. Initial program 65.6%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 14.9

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

   5. Applied rewrites 14.9%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 38.5%

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

   9. Taylor expanded in y around inf

      \[\leadsto y \cdot \frac{z}{y} \]
   10. Step-by-step derivation

   11. Applied rewrites 61.4%

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

   if -3.00000000000000022e210 < x < 1.3e98

   1. Initial program 69.1%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 55.6

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

   5. Applied rewrites 55.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 73.5%

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

   if 1.3e98 < x

   1. Initial program 42.0%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 53.8

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

   5. Applied rewrites 53.8%

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

Alternative 9: 67.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{+210}:\\ \;\;\;\;y \cdot \frac{z}{y}\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{+42}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - b}{t + y}, a\right)\\ \mathbf{else}:\\ \;\;\;\;a + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= x -3e+210)
   (* y (/ z y))
   (if (<= x 5.2e+42) (fma y (/ (- z b) (+ t y)) a) (+ a z))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (x <= -3e+210) {
		tmp = y * (z / y);
	} else if (x <= 5.2e+42) {
		tmp = fma(y, ((z - b) / (t + y)), a);
	} else {
		tmp = a + z;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (x <= -3e+210)
		tmp = Float64(y * Float64(z / y));
	elseif (x <= 5.2e+42)
		tmp = fma(y, Float64(Float64(z - b) / Float64(t + y)), a);
	else
		tmp = Float64(a + z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[x, -3e+210], N[(y * N[(z / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.2e+42], N[(y * N[(N[(z - b), $MachinePrecision] / N[(t + y), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], N[(a + z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.00000000000000022e210

   1. Initial program 65.6%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 14.9

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

   5. Applied rewrites 14.9%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 38.5%

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

   9. Taylor expanded in y around inf

      \[\leadsto y \cdot \frac{z}{y} \]
   10. Step-by-step derivation

   11. Applied rewrites 61.4%

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

   if -3.00000000000000022e210 < x < 5.1999999999999998e42

   1. Initial program 69.4%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 56.0

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

   5. Applied rewrites 56.0%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 74.5%

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

   if 5.1999999999999998e42 < x

   1. Initial program 44.7%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 46.9

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 46.9%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in b around inf

      \[\leadsto -1 \cdot \color{blue}{b} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.0%

      \[\leadsto -b \]

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 52.4%

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

Alternative 10: 61.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -9 \cdot 10^{+74} \lor \neg \left(t \leq 3.5 \cdot 10^{+122}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{z - b}{t}, y, a\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a + z\right) - b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -9e+74) (not (<= t 3.5e+122)))
   (fma (/ (- z b) t) y a)
   (- (+ a z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -9e+74) || !(t <= 3.5e+122)) {
		tmp = fma(((z - b) / t), y, a);
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -9e+74) || !(t <= 3.5e+122))
		tmp = fma(Float64(Float64(z - b) / t), y, a);
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -9e+74], N[Not[LessEqual[t, 3.5e+122]], $MachinePrecision]], N[(N[(N[(z - b), $MachinePrecision] / t), $MachinePrecision] * y + a), $MachinePrecision], N[(N[(a + z), $MachinePrecision] - b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -8.9999999999999999e74 or 3.50000000000000014e122 < t

   1. Initial program 49.7%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 35.5

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

   5. Applied rewrites 35.5%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 61.4%

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

   if -8.9999999999999999e74 < t < 3.50000000000000014e122

   1. Initial program 71.3%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 65.4

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 65.4%

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

4. Final simplification 64.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -9 \cdot 10^{+74} \lor \neg \left(t \leq 3.5 \cdot 10^{+122}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{z - b}{t}, y, a\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a + z\right) - b\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 59.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -9.2 \cdot 10^{+74} \lor \neg \left(t \leq 4 \cdot 10^{+116}\right):\\ \;\;\;\;a \cdot \frac{t}{x + t}\\ \mathbf{else}:\\ \;\;\;\;\left(a + z\right) - b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -9.2e+74) (not (<= t 4e+116)))
   (* a (/ t (+ x t)))
   (- (+ a z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -9.2e+74) || !(t <= 4e+116)) {
		tmp = a * (t / (x + t));
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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 ((t <= (-9.2d+74)) .or. (.not. (t <= 4d+116))) then
        tmp = a * (t / (x + t))
    else
        tmp = (a + z) - b
    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 ((t <= -9.2e+74) || !(t <= 4e+116)) {
		tmp = a * (t / (x + t));
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (t <= -9.2e+74) or not (t <= 4e+116):
		tmp = a * (t / (x + t))
	else:
		tmp = (a + z) - b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -9.2e+74) || !(t <= 4e+116))
		tmp = Float64(a * Float64(t / Float64(x + t)));
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((t <= -9.2e+74) || ~((t <= 4e+116)))
		tmp = a * (t / (x + t));
	else
		tmp = (a + z) - b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -9.2e+74], N[Not[LessEqual[t, 4e+116]], $MachinePrecision]], N[(a * N[(t / N[(x + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a + z), $MachinePrecision] - b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -9.1999999999999994e74 or 4.00000000000000006e116 < t

   1. Initial program 50.5%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 49.9

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

   5. Applied rewrites 49.9%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 57.1%

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

   if -9.1999999999999994e74 < t < 4.00000000000000006e116

   1. Initial program 71.3%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 65.5

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 65.5%

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

4. Final simplification 62.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -9.2 \cdot 10^{+74} \lor \neg \left(t \leq 4 \cdot 10^{+116}\right):\\ \;\;\;\;a \cdot \frac{t}{x + t}\\ \mathbf{else}:\\ \;\;\;\;\left(a + z\right) - b\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 55.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+180}:\\ \;\;\;\;y \cdot \frac{z}{y}\\ \mathbf{else}:\\ \;\;\;\;\left(a + z\right) - b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= x -2.6e+180) (* y (/ z y)) (- (+ a z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (x <= -2.6e+180) {
		tmp = y * (z / y);
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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 (x <= (-2.6d+180)) then
        tmp = y * (z / y)
    else
        tmp = (a + z) - b
    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 (x <= -2.6e+180) {
		tmp = y * (z / y);
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if x <= -2.6e+180:
		tmp = y * (z / y)
	else:
		tmp = (a + z) - b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (x <= -2.6e+180)
		tmp = Float64(y * Float64(z / y));
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (x <= -2.6e+180)
		tmp = y * (z / y);
	else
		tmp = (a + z) - b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[x, -2.6e+180], N[(y * N[(z / y), $MachinePrecision]), $MachinePrecision], N[(N[(a + z), $MachinePrecision] - b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.60000000000000021e180

   1. Initial program 66.2%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. *-commutative N/A

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

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

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

      8. lower-*.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-+.f64 16.3

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

   5. Applied rewrites 16.3%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 35.0%

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

   9. Taylor expanded in y around inf

      \[\leadsto y \cdot \frac{z}{y} \]
   10. Step-by-step derivation

   11. Applied rewrites 56.8%

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

   if -2.60000000000000021e180 < x

   1. Initial program 64.5%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 59.3

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 59.3%

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

Alternative 13: 52.9% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -6.5 \cdot 10^{-18} \lor \neg \left(a \leq 3.05 \cdot 10^{-123}\right):\\ \;\;\;\;a + z\\ \mathbf{else}:\\ \;\;\;\;z - b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= a -6.5e-18) (not (<= a 3.05e-123))) (+ a z) (- z b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a <= -6.5e-18) || !(a <= 3.05e-123)) {
		tmp = a + z;
	} else {
		tmp = z - b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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 <= (-6.5d-18)) .or. (.not. (a <= 3.05d-123))) then
        tmp = a + z
    else
        tmp = z - b
    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 <= -6.5e-18) || !(a <= 3.05e-123)) {
		tmp = a + z;
	} else {
		tmp = z - b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (a <= -6.5e-18) or not (a <= 3.05e-123):
		tmp = a + z
	else:
		tmp = z - b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((a <= -6.5e-18) || !(a <= 3.05e-123))
		tmp = Float64(a + z);
	else
		tmp = Float64(z - b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((a <= -6.5e-18) || ~((a <= 3.05e-123)))
		tmp = a + z;
	else
		tmp = z - b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[a, -6.5e-18], N[Not[LessEqual[a, 3.05e-123]], $MachinePrecision]], N[(a + z), $MachinePrecision], N[(z - b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -6.50000000000000008e-18 or 3.05000000000000008e-123 < a

   1. Initial program 54.5%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 55.9

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 55.9%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in b around inf

      \[\leadsto -1 \cdot \color{blue}{b} \]
   7. Step-by-step derivation

   8. Applied rewrites 9.5%

      \[\leadsto -b \]

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 56.1%

       \[\leadsto a + \color{blue}{z} \]

   if -6.50000000000000008e-18 < a < 3.05000000000000008e-123

   1. Initial program 79.6%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 55.8

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 55.8%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 55.1%

      \[\leadsto z - \color{blue}{b} \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -6.5 \cdot 10^{-18} \lor \neg \left(a \leq 3.05 \cdot 10^{-123}\right):\\ \;\;\;\;a + z\\ \mathbf{else}:\\ \;\;\;\;z - b\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 51.9% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.2 \cdot 10^{+154} \lor \neg \left(b \leq 9.4 \cdot 10^{+156}\right):\\ \;\;\;\;a - b\\ \mathbf{else}:\\ \;\;\;\;a + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -2.2e+154) (not (<= b 9.4e+156))) (- a b) (+ a z)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.2e+154) || !(b <= 9.4e+156)) {
		tmp = a - b;
	} else {
		tmp = a + z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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 ((b <= (-2.2d+154)) .or. (.not. (b <= 9.4d+156))) then
        tmp = a - b
    else
        tmp = a + z
    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 ((b <= -2.2e+154) || !(b <= 9.4e+156)) {
		tmp = a - b;
	} else {
		tmp = a + z;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -2.2e+154) or not (b <= 9.4e+156):
		tmp = a - b
	else:
		tmp = a + z
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -2.2e+154) || !(b <= 9.4e+156))
		tmp = Float64(a - b);
	else
		tmp = Float64(a + z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -2.2e+154) || ~((b <= 9.4e+156)))
		tmp = a - b;
	else
		tmp = a + z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -2.2e+154], N[Not[LessEqual[b, 9.4e+156]], $MachinePrecision]], N[(a - b), $MachinePrecision], N[(a + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.2000000000000001e154 or 9.4e156 < b

   1. Initial program 53.2%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 50.4

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 50.4%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 47.7%

      \[\leadsto a - \color{blue}{b} \]

   if -2.2000000000000001e154 < b < 9.4e156

   1. Initial program 69.1%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 57.9

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 57.9%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in b around inf

      \[\leadsto -1 \cdot \color{blue}{b} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.4%

      \[\leadsto -b \]

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 57.8%

       \[\leadsto a + \color{blue}{z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.2 \cdot 10^{+154} \lor \neg \left(b \leq 9.4 \cdot 10^{+156}\right):\\ \;\;\;\;a - b\\ \mathbf{else}:\\ \;\;\;\;a + z\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 49.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.3 \cdot 10^{+157} \lor \neg \left(b \leq 9.4 \cdot 10^{+156}\right):\\ \;\;\;\;-b\\ \mathbf{else}:\\ \;\;\;\;a + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -1.3e+157) (not (<= b 9.4e+156))) (- b) (+ a z)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -1.3e+157) || !(b <= 9.4e+156)) {
		tmp = -b;
	} else {
		tmp = a + z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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 ((b <= (-1.3d+157)) .or. (.not. (b <= 9.4d+156))) then
        tmp = -b
    else
        tmp = a + z
    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 ((b <= -1.3e+157) || !(b <= 9.4e+156)) {
		tmp = -b;
	} else {
		tmp = a + z;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -1.3e+157) or not (b <= 9.4e+156):
		tmp = -b
	else:
		tmp = a + z
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -1.3e+157) || !(b <= 9.4e+156))
		tmp = Float64(-b);
	else
		tmp = Float64(a + z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -1.3e+157) || ~((b <= 9.4e+156)))
		tmp = -b;
	else
		tmp = a + z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -1.3e+157], N[Not[LessEqual[b, 9.4e+156]], $MachinePrecision]], (-b), N[(a + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.30000000000000005e157 or 9.4e156 < b

   1. Initial program 53.2%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 50.4

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 50.4%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in b around inf

      \[\leadsto -1 \cdot \color{blue}{b} \]
   7. Step-by-step derivation

   8. Applied rewrites 40.9%

      \[\leadsto -b \]

   if -1.30000000000000005e157 < b < 9.4e156

   1. Initial program 69.1%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 57.9

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 57.9%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in b around inf

      \[\leadsto -1 \cdot \color{blue}{b} \]
   7. Step-by-step derivation

   8. Applied rewrites 7.4%

      \[\leadsto -b \]

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 57.8%

       \[\leadsto a + \color{blue}{z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.3 \cdot 10^{+157} \lor \neg \left(b \leq 9.4 \cdot 10^{+156}\right):\\ \;\;\;\;-b\\ \mathbf{else}:\\ \;\;\;\;a + z\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 54.4% accurate, 3.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.6 \cdot 10^{+65}:\\ \;\;\;\;z - b\\ \mathbf{else}:\\ \;\;\;\;\left(a + z\right) - b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= x -3.6e+65) (- z b) (- (+ a z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (x <= -3.6e+65) {
		tmp = z - b;
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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 (x <= (-3.6d+65)) then
        tmp = z - b
    else
        tmp = (a + z) - b
    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 (x <= -3.6e+65) {
		tmp = z - b;
	} else {
		tmp = (a + z) - b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if x <= -3.6e+65:
		tmp = z - b
	else:
		tmp = (a + z) - b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (x <= -3.6e+65)
		tmp = Float64(z - b);
	else
		tmp = Float64(Float64(a + z) - b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (x <= -3.6e+65)
		tmp = z - b;
	else
		tmp = (a + z) - b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[x, -3.6e+65], N[(z - b), $MachinePrecision], N[(N[(a + z), $MachinePrecision] - b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.59999999999999978e65

   1. Initial program 64.3%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 36.1

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 36.1%

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 46.5%

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

   if -3.59999999999999978e65 < x

   1. Initial program 64.8%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(a + z\right) - b} \]

      2. lower-+.f64 61.0

         \[\leadsto \color{blue}{\left(a + z\right)} - b \]

   5. Applied rewrites 61.0%

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

Alternative 17: 13.7% accurate, 15.0× speedup

Math

\[\begin{array}{l} \\ -b \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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 = -b
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := (-b)

Derivation

1. Initial program 64.7%

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

3. Taylor expanded in y around inf

   \[\leadsto \color{blue}{\left(a + z\right) - b} \]
4. Step-by-step derivation

   1. lower--.f64 N/A

      \[\leadsto \color{blue}{\left(a + z\right) - b} \]

   2. lower-+.f64 55.8

      \[\leadsto \color{blue}{\left(a + z\right)} - b \]

5. Applied rewrites 55.8%

   \[\leadsto \color{blue}{\left(a + z\right) - b} \]

6. Taylor expanded in b around inf

   \[\leadsto -1 \cdot \color{blue}{b} \]
7. Step-by-step derivation

8. Applied rewrites 16.7%

   \[\leadsto -b \]
9. Add Preprocessing

Developer Target 1: 82.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x + t\right) + y\\ t_2 := \left(\left(x + y\right) \cdot z + \left(t + y\right) \cdot a\right) - y \cdot b\\ t_3 := \frac{t\_2}{t\_1}\\ t_4 := \left(z + a\right) - b\\ \mathbf{if}\;t\_3 < -3.5813117084150564 \cdot 10^{+153}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 < 1.2285964308315609 \cdot 10^{+82}:\\ \;\;\;\;\frac{1}{\frac{t\_1}{t\_2}}\\ \mathbf{else}:\\ \;\;\;\;t\_4\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ x t) y))
        (t_2 (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)))
        (t_3 (/ t_2 t_1))
        (t_4 (- (+ z a) b)))
   (if (< t_3 -3.5813117084150564e+153)
     t_4
     (if (< t_3 1.2285964308315609e+82) (/ 1.0 (/ t_1 t_2)) t_4))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + t) + y;
	double t_2 = (((x + y) * z) + ((t + y) * a)) - (y * b);
	double t_3 = t_2 / t_1;
	double t_4 = (z + a) - b;
	double tmp;
	if (t_3 < -3.5813117084150564e+153) {
		tmp = t_4;
	} else if (t_3 < 1.2285964308315609e+82) {
		tmp = 1.0 / (t_1 / t_2);
	} else {
		tmp = t_4;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = (x + t) + y
    t_2 = (((x + y) * z) + ((t + y) * a)) - (y * b)
    t_3 = t_2 / t_1
    t_4 = (z + a) - b
    if (t_3 < (-3.5813117084150564d+153)) then
        tmp = t_4
    else if (t_3 < 1.2285964308315609d+82) then
        tmp = 1.0d0 / (t_1 / t_2)
    else
        tmp = t_4
    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 + t) + y;
	double t_2 = (((x + y) * z) + ((t + y) * a)) - (y * b);
	double t_3 = t_2 / t_1;
	double t_4 = (z + a) - b;
	double tmp;
	if (t_3 < -3.5813117084150564e+153) {
		tmp = t_4;
	} else if (t_3 < 1.2285964308315609e+82) {
		tmp = 1.0 / (t_1 / t_2);
	} else {
		tmp = t_4;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (x + t) + y
	t_2 = (((x + y) * z) + ((t + y) * a)) - (y * b)
	t_3 = t_2 / t_1
	t_4 = (z + a) - b
	tmp = 0
	if t_3 < -3.5813117084150564e+153:
		tmp = t_4
	elif t_3 < 1.2285964308315609e+82:
		tmp = 1.0 / (t_1 / t_2)
	else:
		tmp = t_4
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + t) + y)
	t_2 = Float64(Float64(Float64(Float64(x + y) * z) + Float64(Float64(t + y) * a)) - Float64(y * b))
	t_3 = Float64(t_2 / t_1)
	t_4 = Float64(Float64(z + a) - b)
	tmp = 0.0
	if (t_3 < -3.5813117084150564e+153)
		tmp = t_4;
	elseif (t_3 < 1.2285964308315609e+82)
		tmp = Float64(1.0 / Float64(t_1 / t_2));
	else
		tmp = t_4;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (x + t) + y;
	t_2 = (((x + y) * z) + ((t + y) * a)) - (y * b);
	t_3 = t_2 / t_1;
	t_4 = (z + a) - b;
	tmp = 0.0;
	if (t_3 < -3.5813117084150564e+153)
		tmp = t_4;
	elseif (t_3 < 1.2285964308315609e+82)
		tmp = 1.0 / (t_1 / t_2);
	else
		tmp = t_4;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + t), $MachinePrecision] + y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(N[(t + y), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] - N[(y * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 / t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(N[(z + a), $MachinePrecision] - b), $MachinePrecision]}, If[Less[t$95$3, -3.5813117084150564e+153], t$95$4, If[Less[t$95$3, 1.2285964308315609e+82], N[(1.0 / N[(t$95$1 / t$95$2), $MachinePrecision]), $MachinePrecision], t$95$4]]]]]]

Reproduce

herbie shell --seed 2024324 
(FPCore (x y z t a b)
  :name "AI.Clustering.Hierarchical.Internal:ward from clustering-0.2.1"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) (+ (+ x t) y)) -3581311708415056400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ z a) b) (if (< (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) (+ (+ x t) y)) 12285964308315609000000000000000000000000000000000000000000000000000000000000000000) (/ 1 (/ (+ (+ x t) y) (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)))) (- (+ z a) b))))

  (/ (- (+ (* (+ x y) z) (* (+ t y) a)) (* y b)) (+ (+ x t) y)))