Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x - y \cdot z\]
↓
\[x - y \cdot z\]
x - y \cdot z
↓
x - y \cdot z
double f(double x, double y, double z) {
        double r496832 = x;
        double r496833 = y;
        double r496834 = z;
        double r496835 = r496833 * r496834;
        double r496836 = r496832 - r496835;
        return r496836;
}
↓
double f(double x, double y, double z) {
        double r496837 = x;
        double r496838 = y;
        double r496839 = z;
        double r496840 = r496838 * r496839;
        double r496841 = r496837 - r496840;
        return r496841;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\frac{x + y \cdot z}{\frac{x + y \cdot z}{x - y \cdot z}}\]

Derivation

  1. Initial program 0.0

    \[x - y \cdot z\]

  2. Final simplification0.0

    \[\leadsto x - y \cdot z\]

Reproduce

herbie shell --seed 2019208 
(FPCore (x y z)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, C"
  :precision binary64

  :herbie-target
  (/ (+ x (* y z)) (/ (+ x (* y z)) (- x (* y z))))

  (- x (* y z)))