Average Error: 2.7 → 2.7
Time: 2.5s
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 r657447 = x;
        double r657448 = y;
        double r657449 = z;
        double r657450 = t;
        double r657451 = r657449 * r657450;
        double r657452 = r657448 - r657451;
        double r657453 = r657447 / r657452;
        return r657453;
}
↓
double f(double x, double y, double z, double t) {
        double r657454 = x;
        double r657455 = y;
        double r657456 = z;
        double r657457 = t;
        double r657458 = r657456 * r657457;
        double r657459 = r657455 - r657458;
        double r657460 = r657454 / r657459;
        return r657460;
}

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.7
Target1.8
Herbie2.7
\[\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.7

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

  2. Final simplification2.7

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

Reproduce

herbie shell --seed 2020001 +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.618195973607049e+50) (/ 1 (- (/ y x) (* (/ z x) t))) (if (< x 2.1378306434876444e+131) (/ x (- y (* z t))) (/ 1 (- (/ y x) (* (/ z x) t)))))

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