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

Percentage Accurate: 75.1% → 90.1%

Time: 13.5s

Alternatives: 13

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: 75.1% 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.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{b}{t}, y, 1 + a\right)\\ t_2 := \frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ t_3 := \mathsf{fma}\left(y, \frac{\frac{z}{t}}{t\_1}, \frac{x}{t\_1}\right)\\ \mathbf{if}\;t\_2 \leq -4 \cdot 10^{+215}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+301}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_2 \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 (fma (/ b t) y (+ 1.0 a)))
        (t_2 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))
        (t_3 (fma y (/ (/ z t) t_1) (/ x t_1))))
   (if (<= t_2 -4e+215)
     t_3
     (if (<= t_2 5e+301)
       t_2
       (if (<= t_2 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 = fma((b / t), y, (1.0 + a));
	double t_2 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double t_3 = fma(y, ((z / t) / t_1), (x / t_1));
	double tmp;
	if (t_2 <= -4e+215) {
		tmp = t_3;
	} else if (t_2 <= 5e+301) {
		tmp = t_2;
	} else if (t_2 <= ((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 = fma(Float64(b / t), y, Float64(1.0 + a))
	t_2 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_3 = fma(y, Float64(Float64(z / t) / t_1), Float64(x / t_1))
	tmp = 0.0
	if (t_2 <= -4e+215)
		tmp = t_3;
	elseif (t_2 <= 5e+301)
		tmp = t_2;
	elseif (t_2 <= 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[(b / t), $MachinePrecision] * y + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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$3 = N[(y * N[(N[(z / t), $MachinePrecision] / t$95$1), $MachinePrecision] + N[(x / t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+215], t$95$3, If[LessEqual[t$95$2, 5e+301], t$95$2, If[LessEqual[t$95$2, 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))) < -3.99999999999999963e215 or 5.0000000000000004e301 < (/.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 47.1%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 87.4%

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

   if -3.99999999999999963e215 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 5.0000000000000004e301

   1. Initial program 91.9%

      \[\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. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 22.0%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 96.0

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

   7. Applied rewrites 96.0%

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

Alternative 2: 87.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{\frac{z}{t}}{\mathsf{fma}\left(\frac{b}{t}, y, 1 + a\right)}, \frac{x}{a}\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+301}:\\ \;\;\;\;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 (- INFINITY))
     (fma y (/ (/ z t) (fma (/ b t) y (+ 1.0 a))) (/ x a))
     (if (<= t_1 5e+301) 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 <= -((double) INFINITY)) {
		tmp = fma(y, ((z / t) / fma((b / t), y, (1.0 + a))), (x / a));
	} else if (t_1 <= 5e+301) {
		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 <= Float64(-Inf))
		tmp = fma(y, Float64(Float64(z / t) / fma(Float64(b / t), y, Float64(1.0 + a))), Float64(x / a));
	elseif (t_1 <= 5e+301)
		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, (-Infinity)], N[(y * N[(N[(z / t), $MachinePrecision] / N[(N[(b / t), $MachinePrecision] * y + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+301], t$95$1, 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

   1. Initial program 31.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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 86.2%

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

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 86.2

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

   7. Applied rewrites 86.2%

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

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

   1. Initial program 92.1%

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

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

   1. Initial program 19.8%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 49.7%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 77.4

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

   7. Applied rewrites 77.4%

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

Alternative 3: 67.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;y \cdot \frac{z}{\mathsf{fma}\left(a, t, t\right)}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+301}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(\frac{y}{t}, b, 1 + a\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
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_1 (- INFINITY))
     (* y (/ z (fma a t t)))
     (if (<= t_1 5e+301)
       (/ x (fma (/ y t) b (+ 1.0 a)))
       (/ (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 <= -((double) INFINITY)) {
		tmp = y * (z / fma(a, t, t));
	} else if (t_1 <= 5e+301) {
		tmp = x / fma((y / t), b, (1.0 + a));
	} 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 <= Float64(-Inf))
		tmp = Float64(y * Float64(z / fma(a, t, t)));
	elseif (t_1 <= 5e+301)
		tmp = Float64(x / fma(Float64(y / t), b, Float64(1.0 + a)));
	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, (-Infinity)], N[(y * N[(z / N[(a * t + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+301], N[(x / N[(N[(y / t), $MachinePrecision] * b + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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

   1. Initial program 31.6%

      \[\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. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 58.6

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

   5. Applied rewrites 58.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 51.3%

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

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

   1. Initial program 92.1%

      \[\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. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 69.0

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

   5. Applied rewrites 69.0%

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

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

   1. Initial program 19.8%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 49.7%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 77.4

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

   7. Applied rewrites 77.4%

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

4. Final simplification 69.5%

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

Alternative 4: 85.4% 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 5 \cdot 10^{+301}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{y}{t}, z, x\right)}{\mathsf{fma}\left(\frac{y}{t}, b, 1 + a\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))) 5e+301)
   (/ (fma (/ y t) z x) (fma (/ y t) b (+ 1.0 a)))
   (/ (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))) <= 5e+301) {
		tmp = fma((y / t), z, x) / fma((y / t), b, (1.0 + a));
	} 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))) <= 5e+301)
		tmp = Float64(fma(Float64(y / t), z, x) / fma(Float64(y / t), b, Float64(1.0 + a)));
	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], 5e+301], N[(N[(N[(y / t), $MachinePrecision] * z + x), $MachinePrecision] / N[(N[(y / t), $MachinePrecision] * b + N[(1.0 + a), $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))) < 5.0000000000000004e301

   1. Initial program 88.1%

      \[\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 0

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

      1. associate-/r* N/A

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

      2. div-add-rev N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. associate-+r+ N/A

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

      9. +-commutative N/A

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

      10. associate-/l* N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

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

   1. Initial program 19.8%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 49.7%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 77.4

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

   7. Applied rewrites 77.4%

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

4. Final simplification 87.6%

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

Alternative 5: 58.1% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 a))))
   (if (<= t -2.3e-15)
     t_1
     (if (<= t -2.05e-106)
       (/ (fma y (/ z t) x) a)
       (if (<= t 400.0) (/ (fma t (/ x y) z) b) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -2.3e-15) {
		tmp = t_1;
	} else if (t <= -2.05e-106) {
		tmp = fma(y, (z / t), x) / a;
	} else if (t <= 400.0) {
		tmp = fma(t, (x / y), z) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(1.0 + a))
	tmp = 0.0
	if (t <= -2.3e-15)
		tmp = t_1;
	elseif (t <= -2.05e-106)
		tmp = Float64(fma(y, Float64(z / t), x) / a);
	elseif (t <= 400.0)
		tmp = Float64(fma(t, Float64(x / y), z) / 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 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.3e-15], t$95$1, If[LessEqual[t, -2.05e-106], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[t, 400.0], N[(N[(t * N[(x / y), $MachinePrecision] + z), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.2999999999999999e-15 or 400 < t

   1. Initial program 84.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 63.7

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

   5. Applied rewrites 63.7%

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

   if -2.2999999999999999e-15 < t < -2.05e-106

   1. Initial program 80.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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 88.4%

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

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 60.1

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

   7. Applied rewrites 60.1%

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

   if -2.05e-106 < t < 400

   1. Initial program 65.9%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 69.1

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

   7. Applied rewrites 69.1%

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

4. Final simplification 65.5%

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

Alternative 6: 41.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4 \cdot 10^{+125}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a \leq -7.8 \cdot 10^{-58}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;a \leq 2.7 \cdot 10^{-295}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{elif}\;a \leq 5.4 \cdot 10^{-118}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;a \leq 16200000000000:\\ \;\;\;\;\mathsf{fma}\left(a \cdot x - x, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -4e+125)
   (/ x a)
   (if (<= a -7.8e-58)
     (/ z b)
     (if (<= a 2.7e-295)
       (- x (* x a))
       (if (<= a 5.4e-118)
         (/ z b)
         (if (<= a 16200000000000.0) (fma (- (* a x) x) a x) (/ x a)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -4e+125) {
		tmp = x / a;
	} else if (a <= -7.8e-58) {
		tmp = z / b;
	} else if (a <= 2.7e-295) {
		tmp = x - (x * a);
	} else if (a <= 5.4e-118) {
		tmp = z / b;
	} else if (a <= 16200000000000.0) {
		tmp = fma(((a * x) - x), a, x);
	} else {
		tmp = x / a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -4e+125)
		tmp = Float64(x / a);
	elseif (a <= -7.8e-58)
		tmp = Float64(z / b);
	elseif (a <= 2.7e-295)
		tmp = Float64(x - Float64(x * a));
	elseif (a <= 5.4e-118)
		tmp = Float64(z / b);
	elseif (a <= 16200000000000.0)
		tmp = fma(Float64(Float64(a * x) - x), a, x);
	else
		tmp = Float64(x / a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -4e+125], N[(x / a), $MachinePrecision], If[LessEqual[a, -7.8e-58], N[(z / b), $MachinePrecision], If[LessEqual[a, 2.7e-295], N[(x - N[(x * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.4e-118], N[(z / b), $MachinePrecision], If[LessEqual[a, 16200000000000.0], N[(N[(N[(a * x), $MachinePrecision] - x), $MachinePrecision] * a + x), $MachinePrecision], N[(x / a), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -3.9999999999999997e125 or 1.62e13 < a

   1. Initial program 77.0%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 53.7%

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

   if -3.9999999999999997e125 < a < -7.79999999999999985e-58 or 2.7000000000000001e-295 < a < 5.39999999999999988e-118

   1. Initial program 68.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}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 50.7

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

   5. Applied rewrites 50.7%

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

   if -7.79999999999999985e-58 < a < 2.7000000000000001e-295

   1. Initial program 84.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 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 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 54.9%

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

   10. Applied rewrites 54.9%

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

   if 5.39999999999999988e-118 < a < 1.62e13

   1. Initial program 87.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 41.8

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

   5. Applied rewrites 41.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 42.1%

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

4. Final simplification 52.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -4 \cdot 10^{+125}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a \leq -7.8 \cdot 10^{-58}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;a \leq 2.7 \cdot 10^{-295}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{elif}\;a \leq 5.4 \cdot 10^{-118}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;a \leq 16200000000000:\\ \;\;\;\;\mathsf{fma}\left(a \cdot x - x, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 66.7% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -9.6e+95)
   (/ (fma t (/ x y) z) b)
   (if (<= b 1.8e+115)
     (/ (fma (/ y t) z x) (+ 1.0 a))
     (/ x (fma (/ y t) b (+ 1.0 a))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -9.6e+95) {
		tmp = fma(t, (x / y), z) / b;
	} else if (b <= 1.8e+115) {
		tmp = fma((y / t), z, x) / (1.0 + a);
	} else {
		tmp = x / fma((y / t), b, (1.0 + a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -9.6e+95)
		tmp = Float64(fma(t, Float64(x / y), z) / b);
	elseif (b <= 1.8e+115)
		tmp = Float64(fma(Float64(y / t), z, x) / Float64(1.0 + a));
	else
		tmp = Float64(x / fma(Float64(y / t), b, Float64(1.0 + a)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -9.6000000000000002e95

   1. Initial program 58.3%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 79.5

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

   7. Applied rewrites 79.5%

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

   if -9.6000000000000002e95 < b < 1.8e115

   1. Initial program 82.6%

      \[\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. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 75.3

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

   5. Applied rewrites 75.3%

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

   if 1.8e115 < b

   1. Initial program 68.9%

      \[\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. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 70.5

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

   5. Applied rewrites 70.5%

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

4. Final simplification 74.9%

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

Alternative 8: 58.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -3.4 \cdot 10^{-121} \lor \neg \left(t \leq 400\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \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 (or (<= t -3.4e-121) (not (<= t 400.0)))
   (/ x (+ 1.0 a))
   (/ (fma t (/ x y) z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -3.4e-121) || !(t <= 400.0)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = fma(t, (x / y), z) / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -3.4e-121) || !(t <= 400.0))
		tmp = Float64(x / Float64(1.0 + a));
	else
		tmp = Float64(fma(t, Float64(x / y), z) / b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -3.40000000000000001e-121 or 400 < t

   1. Initial program 83.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 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 60.3

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

   5. Applied rewrites 60.3%

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

   if -3.40000000000000001e-121 < t < 400

   1. Initial program 66.2%

      \[\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 \color{blue}{\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}} \]

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 56.2%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 69.5

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

   7. Applied rewrites 69.5%

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

4. Final simplification 63.8%

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

Alternative 9: 40.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -2.05 \cdot 10^{-106}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;t \leq 8200000:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;t \leq 9.5 \cdot 10^{+67}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= t -2.05e-106)
   (/ x a)
   (if (<= t 8200000.0) (/ z b) (if (<= t 9.5e+67) (- x (* x a)) (/ x a)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -2.05e-106) {
		tmp = x / a;
	} else if (t <= 8200000.0) {
		tmp = z / b;
	} else if (t <= 9.5e+67) {
		tmp = x - (x * a);
	} else {
		tmp = x / a;
	}
	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 <= (-2.05d-106)) then
        tmp = x / a
    else if (t <= 8200000.0d0) then
        tmp = z / b
    else if (t <= 9.5d+67) then
        tmp = x - (x * a)
    else
        tmp = x / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -2.05e-106) {
		tmp = x / a;
	} else if (t <= 8200000.0) {
		tmp = z / b;
	} else if (t <= 9.5e+67) {
		tmp = x - (x * a);
	} else {
		tmp = x / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if t <= -2.05e-106:
		tmp = x / a
	elif t <= 8200000.0:
		tmp = z / b
	elif t <= 9.5e+67:
		tmp = x - (x * a)
	else:
		tmp = x / a
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (t <= -2.05e-106)
		tmp = Float64(x / a);
	elseif (t <= 8200000.0)
		tmp = Float64(z / b);
	elseif (t <= 9.5e+67)
		tmp = Float64(x - Float64(x * a));
	else
		tmp = Float64(x / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (t <= -2.05e-106)
		tmp = x / a;
	elseif (t <= 8200000.0)
		tmp = z / b;
	elseif (t <= 9.5e+67)
		tmp = x - (x * a);
	else
		tmp = x / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[t, -2.05e-106], N[(x / a), $MachinePrecision], If[LessEqual[t, 8200000.0], N[(z / b), $MachinePrecision], If[LessEqual[t, 9.5e+67], N[(x - N[(x * a), $MachinePrecision]), $MachinePrecision], N[(x / a), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.05e-106 or 9.5000000000000002e67 < t

   1. Initial program 82.5%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 50.3

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

   5. Applied rewrites 50.3%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 37.6%

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

   if -2.05e-106 < t < 8.2e6

   1. Initial program 66.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}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 62.0

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

   5. Applied rewrites 62.0%

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

   if 8.2e6 < t < 9.5000000000000002e67

   1. Initial program 93.1%

      \[\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 65.5

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

   5. Applied rewrites 65.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 58.8%

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

   10. Applied rewrites 58.8%

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

4. Final simplification 48.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -2.05 \cdot 10^{-106}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;t \leq 8200000:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;t \leq 9.5 \cdot 10^{+67}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 55.5% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -3.4e-121) (not (<= t 370.0))) (/ x (+ 1.0 a)) (/ z b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -3.4e-121) || !(t <= 370.0)) {
		tmp = x / (1.0 + 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 ((t <= (-3.4d-121)) .or. (.not. (t <= 370.0d0))) then
        tmp = x / (1.0d0 + 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 ((t <= -3.4e-121) || !(t <= 370.0)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (t <= -3.4e-121) or not (t <= 370.0):
		tmp = x / (1.0 + a)
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -3.4e-121) || !(t <= 370.0))
		tmp = Float64(x / Float64(1.0 + 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 ((t <= -3.4e-121) || ~((t <= 370.0)))
		tmp = x / (1.0 + a);
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -3.4e-121], N[Not[LessEqual[t, 370.0]], $MachinePrecision]], N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -3.40000000000000001e-121 or 370 < t

   1. Initial program 83.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 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 60.3

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

   5. Applied rewrites 60.3%

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

   if -3.40000000000000001e-121 < t < 370

   1. Initial program 66.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 inf

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

      1. lower-/.f64 63.4

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

   5. Applied rewrites 63.4%

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

4. Final simplification 61.5%

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

Alternative 11: 41.3% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -3.1 \cdot 10^{-18} \lor \neg \left(a \leq 0.75\right):\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;x - x \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= a -3.1e-18) (not (<= a 0.75))) (/ x a) (- x (* x a))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a <= -3.1e-18) || !(a <= 0.75)) {
		tmp = x / a;
	} else {
		tmp = x - (x * a);
	}
	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 <= (-3.1d-18)) .or. (.not. (a <= 0.75d0))) then
        tmp = x / a
    else
        tmp = x - (x * a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a <= -3.1e-18) || !(a <= 0.75)) {
		tmp = x / a;
	} else {
		tmp = x - (x * a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (a <= -3.1e-18) or not (a <= 0.75):
		tmp = x / a
	else:
		tmp = x - (x * a)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((a <= -3.1e-18) || !(a <= 0.75))
		tmp = Float64(x / a);
	else
		tmp = Float64(x - Float64(x * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((a <= -3.1e-18) || ~((a <= 0.75)))
		tmp = x / a;
	else
		tmp = x - (x * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[a, -3.1e-18], N[Not[LessEqual[a, 0.75]], $MachinePrecision]], N[(x / a), $MachinePrecision], N[(x - N[(x * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -3.10000000000000007e-18 or 0.75 < a

   1. Initial program 73.2%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 63.0

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

   5. Applied rewrites 63.0%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 46.2%

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

   if -3.10000000000000007e-18 < a < 0.75

   1. Initial program 81.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 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 42.2

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

   5. Applied rewrites 42.2%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 42.2%

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

   10. Applied rewrites 42.2%

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

4. Final simplification 44.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -3.1 \cdot 10^{-18} \lor \neg \left(a \leq 0.75\right):\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;x - x \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 19.3% 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 76.7%

   \[\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 44.8

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

5. Applied rewrites 44.8%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 19.8%

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

10. Applied rewrites 19.8%

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

11. Final simplification 19.8%

    \[\leadsto x - x \cdot a \]
12. Add Preprocessing

Alternative 13: 4.1% accurate, 6.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 76.7%

   \[\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 44.8

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

5. Applied rewrites 44.8%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 19.8%

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

9. Taylor expanded in a around inf

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

11. Applied rewrites 3.7%

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

12. Final simplification 3.7%

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

Developer Target 1: 79.0% 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 2024342 
(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))))