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

Percentage Accurate: 76.0% → 90.7%

Time: 12.2s

Alternatives: 12

Speedup: 0.5×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 76.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 90.7% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 43.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. *-rgt-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. associate-/l* N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. +-commutative N/A

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

   5. Applied rewrites 87.6%

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

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

   1. Initial program 93.3%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. associate-+l+ N/A

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

      3. sub-neg N/A

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

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

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

   5. Applied rewrites 76.4%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 100.0%

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

Alternative 2: 85.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 90.0%

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

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

   1. Initial program 11.5%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. associate-+l+ N/A

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

      3. sub-neg N/A

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

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

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

   5. Applied rewrites 59.4%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 81.0%

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

Alternative 3: 83.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 86.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 82.6

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 80.3

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

   4. Applied rewrites 80.3%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. associate-+l+ N/A

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

      3. sub-neg N/A

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

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

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

   5. Applied rewrites 76.4%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 100.0%

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

Alternative 4: 69.5% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (fma t (/ x y) z) b)))
   (if (<= y -3e+46)
     t_1
     (if (<= y 1.08e+102) (/ (fma z (/ y t) x) (+ a 1.0)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(t, (x / y), z) / b;
	double tmp;
	if (y <= -3e+46) {
		tmp = t_1;
	} else if (y <= 1.08e+102) {
		tmp = fma(z, (y / t), x) / (a + 1.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(t, Float64(x / y), z) / b)
	tmp = 0.0
	if (y <= -3e+46)
		tmp = t_1;
	elseif (y <= 1.08e+102)
		tmp = Float64(fma(z, Float64(y / t), x) / Float64(a + 1.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -3.00000000000000023e46 or 1.08000000000000002e102 < y

   1. Initial program 49.6%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. associate-+l+ N/A

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

      3. sub-neg N/A

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

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

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

   5. Applied rewrites 59.3%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 74.3%

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

   if -3.00000000000000023e46 < y < 1.08000000000000002e102

   1. Initial program 95.0%

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

   3. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 79.9

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

   5. Applied rewrites 79.9%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{+46}:\\ \;\;\;\;\frac{\mathsf{fma}\left(t, \frac{x}{y}, z\right)}{b}\\ \mathbf{elif}\;y \leq 1.08 \cdot 10^{+102}:\\ \;\;\;\;\frac{\mathsf{fma}\left(z, \frac{y}{t}, x\right)}{a + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(t, \frac{x}{y}, z\right)}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 64.8% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 (fma y (/ b t) a)))))
   (if (<= t -3e-39) t_1 (if (<= t 1.35e+38) (/ (+ z (/ (* x t) y)) b) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -3.00000000000000028e-39 or 1.34999999999999998e38 < t

   1. Initial program 88.7%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 73.4

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

   5. Applied rewrites 73.4%

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

   if -3.00000000000000028e-39 < t < 1.34999999999999998e38

   1. Initial program 68.3%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. associate-+l+ N/A

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

      3. sub-neg N/A

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

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

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

   5. Applied rewrites 49.8%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 58.5%

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

   10. Applied rewrites 60.3%

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

4. Final simplification 66.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3 \cdot 10^{-39}:\\ \;\;\;\;\frac{x}{1 + \mathsf{fma}\left(y, \frac{b}{t}, a\right)}\\ \mathbf{elif}\;t \leq 1.35 \cdot 10^{+38}:\\ \;\;\;\;\frac{z + \frac{x \cdot t}{y}}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + \mathsf{fma}\left(y, \frac{b}{t}, a\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 59.8% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (fma t (/ x y) z) b)))
   (if (<= y -7.6e-29) t_1 (if (<= y 4.2e+56) (/ x (+ a 1.0)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(t, (x / y), z) / b;
	double tmp;
	if (y <= -7.6e-29) {
		tmp = t_1;
	} else if (y <= 4.2e+56) {
		tmp = x / (a + 1.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(t, Float64(x / y), z) / b)
	tmp = 0.0
	if (y <= -7.6e-29)
		tmp = t_1;
	elseif (y <= 4.2e+56)
		tmp = Float64(x / Float64(a + 1.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -7.59999999999999951e-29 or 4.20000000000000034e56 < y

   1. Initial program 55.9%

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

   3. Taylor expanded in y around inf

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

      1. sub-neg N/A

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

      2. associate-+l+ N/A

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

      3. sub-neg N/A

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

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

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

      7. +-commutative N/A

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

      8. lower-fma.f64 N/A

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

   5. Applied rewrites 55.4%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 69.3%

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

   if -7.59999999999999951e-29 < y < 4.20000000000000034e56

   1. Initial program 95.2%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 61.3

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

   5. Applied rewrites 61.3%

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

4. Final simplification 64.8%

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

Alternative 7: 41.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{-38}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;y \leq -2.5 \cdot 10^{-133}:\\ \;\;\;\;\frac{x}{1}\\ \mathbf{elif}\;y \leq 1.8 \cdot 10^{-55}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1.45e-38)
   (/ z b)
   (if (<= y -2.5e-133) (/ x 1.0) (if (<= y 1.8e-55) (/ x a) (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.45e-38) {
		tmp = z / b;
	} else if (y <= -2.5e-133) {
		tmp = x / 1.0;
	} else if (y <= 1.8e-55) {
		tmp = x / a;
	} 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 (y <= (-1.45d-38)) then
        tmp = z / b
    else if (y <= (-2.5d-133)) then
        tmp = x / 1.0d0
    else if (y <= 1.8d-55) then
        tmp = x / a
    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 (y <= -1.45e-38) {
		tmp = z / b;
	} else if (y <= -2.5e-133) {
		tmp = x / 1.0;
	} else if (y <= 1.8e-55) {
		tmp = x / a;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1.45e-38:
		tmp = z / b
	elif y <= -2.5e-133:
		tmp = x / 1.0
	elif y <= 1.8e-55:
		tmp = x / a
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1.45e-38)
		tmp = Float64(z / b);
	elseif (y <= -2.5e-133)
		tmp = Float64(x / 1.0);
	elseif (y <= 1.8e-55)
		tmp = Float64(x / a);
	else
		tmp = Float64(z / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -1.45e-38)
		tmp = z / b;
	elseif (y <= -2.5e-133)
		tmp = x / 1.0;
	elseif (y <= 1.8e-55)
		tmp = x / a;
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -1.45e-38], N[(z / b), $MachinePrecision], If[LessEqual[y, -2.5e-133], N[(x / 1.0), $MachinePrecision], If[LessEqual[y, 1.8e-55], N[(x / a), $MachinePrecision], N[(z / b), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.44999999999999997e-38 or 1.8e-55 < y

   1. Initial program 63.4%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 56.3

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

   5. Applied rewrites 56.3%

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

   if -1.44999999999999997e-38 < y < -2.5e-133

   1. Initial program 96.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 95.9

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 84.5

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

   4. Applied rewrites 84.5%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 54.7

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

   7. Applied rewrites 54.7%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 39.1%

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

   if -2.5e-133 < y < 1.8e-55

   1. Initial program 96.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 84.8

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 79.7

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

   4. Applied rewrites 79.7%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 69.4

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

   7. Applied rewrites 69.4%

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

   8. Taylor expanded in a around inf

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

   10. Applied rewrites 42.9%

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

Alternative 8: 41.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{-38}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;y \leq -3.1 \cdot 10^{-152}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{elif}\;y \leq 1.8 \cdot 10^{-55}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1.45e-38)
   (/ z b)
   (if (<= y -3.1e-152) (- x (* x a)) (if (<= y 1.8e-55) (/ x a) (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.45e-38) {
		tmp = z / b;
	} else if (y <= -3.1e-152) {
		tmp = x - (x * a);
	} else if (y <= 1.8e-55) {
		tmp = x / a;
	} 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 (y <= (-1.45d-38)) then
        tmp = z / b
    else if (y <= (-3.1d-152)) then
        tmp = x - (x * a)
    else if (y <= 1.8d-55) then
        tmp = x / a
    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 (y <= -1.45e-38) {
		tmp = z / b;
	} else if (y <= -3.1e-152) {
		tmp = x - (x * a);
	} else if (y <= 1.8e-55) {
		tmp = x / a;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1.45e-38:
		tmp = z / b
	elif y <= -3.1e-152:
		tmp = x - (x * a)
	elif y <= 1.8e-55:
		tmp = x / a
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1.45e-38)
		tmp = Float64(z / b);
	elseif (y <= -3.1e-152)
		tmp = Float64(x - Float64(x * a));
	elseif (y <= 1.8e-55)
		tmp = Float64(x / a);
	else
		tmp = Float64(z / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -1.45e-38)
		tmp = z / b;
	elseif (y <= -3.1e-152)
		tmp = x - (x * a);
	elseif (y <= 1.8e-55)
		tmp = x / a;
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -1.45e-38], N[(z / b), $MachinePrecision], If[LessEqual[y, -3.1e-152], N[(x - N[(x * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.8e-55], N[(x / a), $MachinePrecision], N[(z / b), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.44999999999999997e-38 or 1.8e-55 < y

   1. Initial program 63.4%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 56.3

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

   5. Applied rewrites 56.3%

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

   if -1.44999999999999997e-38 < y < -3.0999999999999998e-152

   1. Initial program 93.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 93.5

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 83.8

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

   4. Applied rewrites 83.8%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 59.1

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

   7. Applied rewrites 59.1%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 39.0%

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

   12. Applied rewrites 39.0%

       \[\leadsto x - \color{blue}{x \cdot a} \]

   if -3.0999999999999998e-152 < y < 1.8e-55

   1. Initial program 97.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 85.1

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 79.7

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

   4. Applied rewrites 79.7%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 68.7

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

   7. Applied rewrites 68.7%

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

   8. Taylor expanded in a around inf

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

   10. Applied rewrites 43.0%

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

Alternative 9: 55.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{-29}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;y \leq 9.2 \cdot 10^{+56}:\\ \;\;\;\;\frac{x}{a + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -8e-29) (/ z b) (if (<= y 9.2e+56) (/ x (+ a 1.0)) (/ z b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -8e-29) {
		tmp = z / b;
	} else if (y <= 9.2e+56) {
		tmp = x / (a + 1.0);
	} 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 (y <= (-8d-29)) then
        tmp = z / b
    else if (y <= 9.2d+56) then
        tmp = x / (a + 1.0d0)
    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 (y <= -8e-29) {
		tmp = z / b;
	} else if (y <= 9.2e+56) {
		tmp = x / (a + 1.0);
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -8e-29:
		tmp = z / b
	elif y <= 9.2e+56:
		tmp = x / (a + 1.0)
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -8e-29)
		tmp = Float64(z / b);
	elseif (y <= 9.2e+56)
		tmp = Float64(x / Float64(a + 1.0));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -8e-29)
		tmp = z / b;
	elseif (y <= 9.2e+56)
		tmp = x / (a + 1.0);
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -8e-29], N[(z / b), $MachinePrecision], If[LessEqual[y, 9.2e+56], N[(x / N[(a + 1.0), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.99999999999999955e-29 or 9.20000000000000058e56 < y

   1. Initial program 55.9%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 64.2

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

   5. Applied rewrites 64.2%

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

   if -7.99999999999999955e-29 < y < 9.20000000000000058e56

   1. Initial program 95.2%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 61.3

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

   5. Applied rewrites 61.3%

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

4. Final simplification 62.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{-29}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;y \leq 9.2 \cdot 10^{+56}:\\ \;\;\;\;\frac{x}{a + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 40.1% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{-38}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{-79}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1.45e-38) (/ z b) (if (<= y 5.2e-79) (- x (* x a)) (/ z b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.45e-38) {
		tmp = z / b;
	} else if (y <= 5.2e-79) {
		tmp = x - (x * a);
	} 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 (y <= (-1.45d-38)) then
        tmp = z / b
    else if (y <= 5.2d-79) then
        tmp = x - (x * a)
    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 (y <= -1.45e-38) {
		tmp = z / b;
	} else if (y <= 5.2e-79) {
		tmp = x - (x * a);
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1.45e-38:
		tmp = z / b
	elif y <= 5.2e-79:
		tmp = x - (x * a)
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1.45e-38)
		tmp = Float64(z / b);
	elseif (y <= 5.2e-79)
		tmp = Float64(x - Float64(x * a));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -1.45e-38)
		tmp = z / b;
	elseif (y <= 5.2e-79)
		tmp = x - (x * a);
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.44999999999999997e-38 or 5.19999999999999987e-79 < y

   1. Initial program 64.6%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 55.2

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

   5. Applied rewrites 55.2%

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

   if -1.44999999999999997e-38 < y < 5.19999999999999987e-79

   1. Initial program 96.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 87.6

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 80.8

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

   4. Applied rewrites 80.8%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 67.3

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

   7. Applied rewrites 67.3%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 31.6%

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

   12. Applied rewrites 31.6%

       \[\leadsto x - \color{blue}{x \cdot a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 19.7% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ x - x \cdot a \end{array} \]

FPCore

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

C

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

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 - (x * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 78.0%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 74.6

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lift-/.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. associate-/l* N/A

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

   13. lower-fma.f64 N/A

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

   14. lower-/.f64 73.6

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

4. Applied rewrites 73.6%

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

5. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 41.5

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

7. Applied rewrites 41.5%

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

8. Taylor expanded in a around 0

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

10. Applied rewrites 18.2%

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

12. Applied rewrites 18.2%

    \[\leadsto x - \color{blue}{x \cdot a} \]
13. Add Preprocessing

Alternative 12: 4.3% accurate, 6.6× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(-a\right) \end{array} \]

FPCore

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

C

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

Fortran

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 * -a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 78.0%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 74.6

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lift-/.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. associate-/l* N/A

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

   13. lower-fma.f64 N/A

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

   14. lower-/.f64 73.6

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

4. Applied rewrites 73.6%

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

5. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 41.5

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

7. Applied rewrites 41.5%

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

8. Taylor expanded in a around 0

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

10. Applied rewrites 18.2%

    \[\leadsto \mathsf{fma}\left(-a, \color{blue}{x}, x\right) \]

11. Taylor expanded in a around inf

    \[\leadsto -1 \cdot \left(a \cdot \color{blue}{x}\right) \]
12. Step-by-step derivation

13. Applied rewrites 3.6%

    \[\leadsto a \cdot \left(-x\right) \]

14. Final simplification 3.6%

    \[\leadsto x \cdot \left(-a\right) \]
15. Add Preprocessing

Developer Target 1: 79.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 1 \cdot \left(\left(x + \frac{y}{t} \cdot z\right) \cdot \frac{1}{\left(a + 1\right) + \frac{y}{t} \cdot b}\right)\\ \mathbf{if}\;t < -1.3659085366310088 \cdot 10^{-271}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t < 3.036967103737246 \cdot 10^{-130}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (* 1.0 (* (+ x (* (/ y t) z)) (/ 1.0 (+ (+ a 1.0) (* (/ y t) b)))))))
   (if (< t -1.3659085366310088e-271)
     t_1
     (if (< t 3.036967103737246e-130) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	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) :: tmp
    t_1 = 1.0d0 * ((x + ((y / t) * z)) * (1.0d0 / ((a + 1.0d0) + ((y / t) * b))))
    if (t < (-1.3659085366310088d-271)) then
        tmp = t_1
    else if (t < 3.036967103737246d-130) then
        tmp = z / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))))
	tmp = 0
	if t < -1.3659085366310088e-271:
		tmp = t_1
	elif t < 3.036967103737246e-130:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(1.0 * Float64(Float64(x + Float64(Float64(y / t) * z)) * Float64(1.0 / Float64(Float64(a + 1.0) + Float64(Float64(y / t) * b)))))
	tmp = 0.0
	if (t < -1.3659085366310088e-271)
		tmp = t_1;
	elseif (t < 3.036967103737246e-130)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	tmp = 0.0;
	if (t < -1.3659085366310088e-271)
		tmp = t_1;
	elseif (t < 3.036967103737246e-130)
		tmp = z / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (if (< t -1707385670788761/12500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 1 (* (+ x (* (/ y t) z)) (/ 1 (+ (+ a 1) (* (/ y t) b))))) (if (< t 1518483551868623/5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ z b) (* 1 (* (+ x (* (/ y t) z)) (/ 1 (+ (+ a 1) (* (/ y t) b))))))))

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