Average Error: 0.0 → 0.0
Time: 1.6s
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 r622687 = x;
        double r622688 = y;
        double r622689 = z;
        double r622690 = r622688 * r622689;
        double r622691 = r622687 - r622690;
        return r622691;
}
↓
double f(double x, double y, double z) {
        double r622692 = x;
        double r622693 = y;
        double r622694 = z;
        double r622695 = r622693 * r622694;
        double r622696 = r622692 - r622695;
        return r622696;
}

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 2020027 
(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)))