Average Error: 2.9 → 2.9
Time: 7.0s
Precision: 64
\[\frac{x}{y - z \cdot t}\]
↓
\[\frac{x}{y - z \cdot t}\]
\frac{x}{y - z \cdot t}
↓
\frac{x}{y - z \cdot t}
double f(double x, double y, double z, double t) {
        double r453694 = x;
        double r453695 = y;
        double r453696 = z;
        double r453697 = t;
        double r453698 = r453696 * r453697;
        double r453699 = r453695 - r453698;
        double r453700 = r453694 / r453699;
        return r453700;
}
↓
double f(double x, double y, double z, double t) {
        double r453701 = x;
        double r453702 = y;
        double r453703 = z;
        double r453704 = t;
        double r453705 = r453703 * r453704;
        double r453706 = r453702 - r453705;
        double r453707 = r453701 / r453706;
        return r453707;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original2.9
Target1.6
Herbie2.9
\[\begin{array}{l} \mathbf{if}\;x \lt -1.618195973607048970493874632750554853795 \cdot 10^{50}:\\ \;\;\;\;\frac{1}{\frac{y}{x} - \frac{z}{x} \cdot t}\\ \mathbf{elif}\;x \lt 2.137830643487644440407921345820165445823 \cdot 10^{131}:\\ \;\;\;\;\frac{x}{y - z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{y}{x} - \frac{z}{x} \cdot t}\\ \end{array}\]

Derivation

  1. Initial program 2.9

    \[\frac{x}{y - z \cdot t}\]

  2. Final simplification2.9

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

Reproduce

herbie shell --seed 2019235 +o rules:numerics
(FPCore (x y z t)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (if (< x -1.618195973607049e50) (/ 1 (- (/ y x) (* (/ z x) t))) (if (< x 2.13783064348764444e131) (/ x (- y (* z t))) (/ 1 (- (/ y x) (* (/ z x) t)))))

  (/ x (- y (* z t))))