Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x - y \cdot z\]
↓
\[x - z \cdot y\]
x - y \cdot z
↓
x - z \cdot y
double f(double x, double y, double z) {
        double r35352212 = x;
        double r35352213 = y;
        double r35352214 = z;
        double r35352215 = r35352213 * r35352214;
        double r35352216 = r35352212 - r35352215;
        return r35352216;
}
↓
double f(double x, double y, double z) {
        double r35352217 = x;
        double r35352218 = z;
        double r35352219 = y;
        double r35352220 = r35352218 * r35352219;
        double r35352221 = r35352217 - r35352220;
        return r35352221;
}

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 - z \cdot y\]

Reproduce

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

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

  (- x (* y z)))