Average Error: 0.0 → 0.0
Time: 575.0ms
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 r730385 = x;
        double r730386 = y;
        double r730387 = z;
        double r730388 = r730386 * r730387;
        double r730389 = r730385 - r730388;
        return r730389;
}
↓
double f(double x, double y, double z) {
        double r730390 = x;
        double r730391 = y;
        double r730392 = z;
        double r730393 = r730391 * r730392;
        double r730394 = r730390 - r730393;
        return r730394;
}

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