Average Error: 2.6 → 2.6
Time: 8.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 r600700 = x;
        double r600701 = y;
        double r600702 = z;
        double r600703 = t;
        double r600704 = r600702 * r600703;
        double r600705 = r600701 - r600704;
        double r600706 = r600700 / r600705;
        return r600706;
}
↓
double f(double x, double y, double z, double t) {
        double r600707 = x;
        double r600708 = y;
        double r600709 = z;
        double r600710 = t;
        double r600711 = r600709 * r600710;
        double r600712 = r600708 - r600711;
        double r600713 = r600707 / r600712;
        return r600713;
}

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

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

  2. Final simplification2.6

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

Reproduce

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