Average Error: 0.0 → 0.0
Time: 9.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 r526074 = x;
        double r526075 = y;
        double r526076 = z;
        double r526077 = r526075 * r526076;
        double r526078 = r526074 - r526077;
        return r526078;
}
↓
double f(double x, double y, double z) {
        double r526079 = x;
        double r526080 = y;
        double r526081 = z;
        double r526082 = r526080 * r526081;
        double r526083 = r526079 - r526082;
        return r526083;
}

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