Average Error: 0.0 → 0.0
Time: 1.2s
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 r30750948 = x;
        double r30750949 = y;
        double r30750950 = z;
        double r30750951 = r30750949 * r30750950;
        double r30750952 = r30750948 - r30750951;
        return r30750952;
}
↓
double f(double x, double y, double z) {
        double r30750953 = x;
        double r30750954 = z;
        double r30750955 = y;
        double r30750956 = r30750954 * r30750955;
        double r30750957 = r30750953 - r30750956;
        return r30750957;
}

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 +o rules:numerics
(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)))