Average Error: 3.2 → 3.2
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 r900808 = x;
        double r900809 = y;
        double r900810 = z;
        double r900811 = t;
        double r900812 = r900810 * r900811;
        double r900813 = r900809 - r900812;
        double r900814 = r900808 / r900813;
        return r900814;
}
↓
double f(double x, double y, double z, double t) {
        double r900815 = x;
        double r900816 = y;
        double r900817 = z;
        double r900818 = t;
        double r900819 = r900817 * r900818;
        double r900820 = r900816 - r900819;
        double r900821 = r900815 / r900820;
        return r900821;
}

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

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

  2. Final simplification3.2

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

Reproduce

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