Average Error: 0.0 → 0.0
Time: 13.0s
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 r25169821 = x;
        double r25169822 = y;
        double r25169823 = z;
        double r25169824 = r25169822 * r25169823;
        double r25169825 = r25169821 - r25169824;
        return r25169825;
}
↓
double f(double x, double y, double z) {
        double r25169826 = x;
        double r25169827 = z;
        double r25169828 = y;
        double r25169829 = r25169827 * r25169828;
        double r25169830 = r25169826 - r25169829;
        return r25169830;
}

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 2019200 +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)))