Average Error: 3.0 → 3.0
Time: 8.3s
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 r597937 = x;
        double r597938 = y;
        double r597939 = z;
        double r597940 = t;
        double r597941 = r597939 * r597940;
        double r597942 = r597938 - r597941;
        double r597943 = r597937 / r597942;
        return r597943;
}
↓
double f(double x, double y, double z, double t) {
        double r597944 = x;
        double r597945 = y;
        double r597946 = z;
        double r597947 = t;
        double r597948 = r597946 * r597947;
        double r597949 = r597945 - r597948;
        double r597950 = r597944 / r597949;
        return r597950;
}

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

Original3.0
Target1.7
Herbie3.0
\[\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 3.0

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

  2. Final simplification3.0

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

Reproduce

herbie shell --seed 2019303 
(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))))