Average Error: 15.9 → 12.7
Time: 55.6s
Precision: binary64
\[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}\]
↓
\[\begin{array}{l} \mathbf{if}\;t \le -1.1796582076225981 \cdot 10^{-25} \lor \neg \left(t \le 6.6590930817372726 \cdot 10^{75}\right):\\ \;\;\;\;\left(x + \frac{1}{\frac{\frac{t}{y}}{z}}\right) \cdot \frac{1}{\left(a + 1\right) + y \cdot \frac{b}{t}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{\left(a + 1\right) + \frac{y \cdot b}{t}}{x + \frac{y \cdot z}{t}}}\\ \end{array}\]
\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}}
↓
\begin{array}{l}
\mathbf{if}\;t \le -1.1796582076225981 \cdot 10^{-25} \lor \neg \left(t \le 6.6590930817372726 \cdot 10^{75}\right):\\
\;\;\;\;\left(x + \frac{1}{\frac{\frac{t}{y}}{z}}\right) \cdot \frac{1}{\left(a + 1\right) + y \cdot \frac{b}{t}}\\

\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{\left(a + 1\right) + \frac{y \cdot b}{t}}{x + \frac{y \cdot z}{t}}}\\

\end{array}
double code(double x, double y, double z, double t, double a, double b) {
	return ((double) (((double) (x + ((double) (((double) (y * z)) / t)))) / ((double) (((double) (a + 1.0)) + ((double) (((double) (y * b)) / t))))));
}
↓
double code(double x, double y, double z, double t, double a, double b) {
	double VAR;
	if (((t <= -1.179658207622598e-25) || !(t <= 6.659093081737273e+75))) {
		VAR = ((double) (((double) (x + ((double) (1.0 / ((double) (((double) (t / y)) / z)))))) * ((double) (1.0 / ((double) (((double) (a + 1.0)) + ((double) (y * ((double) (b / t))))))))));
	} else {
		VAR = ((double) (1.0 / ((double) (((double) (((double) (a + 1.0)) + ((double) (((double) (y * b)) / t)))) / ((double) (x + ((double) (((double) (y * z)) / t))))))));
	}
	return VAR;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original15.9
Target13.0
Herbie12.7
\[\begin{array}{l} \mathbf{if}\;t \lt -1.3659085366310088 \cdot 10^{-271}:\\ \;\;\;\;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{elif}\;t \lt 3.0369671037372459 \cdot 10^{-130}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot \left(\left(x + \frac{y}{t} \cdot z\right) \cdot \frac{1}{\left(a + 1\right) + \frac{y}{t} \cdot b}\right)\\ \end{array}\]

Derivation

  1. Split input into 2 regimes

  2. if t < -1.1796582076225981e-25 or 6.6590930817372726e75 < t

    1. Initial program 11.1

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

    3. Applied div-inv11.2

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

    5. Applied clear-num11.2

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

    7. Applied associate-/r*7.9

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

    9. Applied *-un-lft-identity7.9

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

    10. Applied times-frac4.1

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

    11. Simplified4.1

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

    if -1.1796582076225981e-25 < t < 6.6590930817372726e75

    1. Initial program 20.0

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

    3. Applied clear-num20.2

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

  4. Final simplification12.7

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \le -1.1796582076225981 \cdot 10^{-25} \lor \neg \left(t \le 6.6590930817372726 \cdot 10^{75}\right):\\ \;\;\;\;\left(x + \frac{1}{\frac{\frac{t}{y}}{z}}\right) \cdot \frac{1}{\left(a + 1\right) + y \cdot \frac{b}{t}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{\left(a + 1\right) + \frac{y \cdot b}{t}}{x + \frac{y \cdot z}{t}}}\\ \end{array}\]

Reproduce

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

  :herbie-target
  (if (< t -1.3659085366310088e-271) (* 1.0 (* (+ x (* (/ y t) z)) (/ 1.0 (+ (+ a 1.0) (* (/ y t) b))))) (if (< t 3.036967103737246e-130) (/ z b) (* 1.0 (* (+ x (* (/ y t) z)) (/ 1.0 (+ (+ a 1.0) (* (/ y t) b)))))))

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