Average Error: 0.0 → 0.0
Time: 6.0s
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 r592679 = x;
        double r592680 = y;
        double r592681 = z;
        double r592682 = r592680 * r592681;
        double r592683 = r592679 - r592682;
        return r592683;
}

double f(double x, double y, double z) {
        double r592684 = x;
        double r592685 = y;
        double r592686 = z;
        double r592687 = r592685 * r592686;
        double r592688 = r592684 - r592687;
        return r592688;
}

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