Average Error: 2.9 → 2.9
Time: 3.1s
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 r681139 = x;
        double r681140 = y;
        double r681141 = z;
        double r681142 = t;
        double r681143 = r681141 * r681142;
        double r681144 = r681140 - r681143;
        double r681145 = r681139 / r681144;
        return r681145;
}
↓
double f(double x, double y, double z, double t) {
        double r681146 = x;
        double r681147 = y;
        double r681148 = z;
        double r681149 = t;
        double r681150 = r681148 * r681149;
        double r681151 = r681147 - r681150;
        double r681152 = r681146 / r681151;
        return r681152;
}

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.7
Herbie2.9
\[\begin{array}{l} \mathbf{if}\;x \lt -1.618195973607049 \cdot 10^{50}:\\ \;\;\;\;\frac{1}{\frac{y}{x} - \frac{z}{x} \cdot t}\\ \mathbf{elif}\;x \lt 2.13783064348764444 \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 2020046 +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))))