Average Error: 0.2 → 0.2
Time: 19.8s
Precision: 64
\[\left(x \cdot 3\right) \cdot y - z\]
↓
\[\left(x \cdot 3\right) \cdot y - z\]
\left(x \cdot 3\right) \cdot y - z
↓
\left(x \cdot 3\right) \cdot y - z
double f(double x, double y, double z) {
        double r629074 = x;
        double r629075 = 3.0;
        double r629076 = r629074 * r629075;
        double r629077 = y;
        double r629078 = r629076 * r629077;
        double r629079 = z;
        double r629080 = r629078 - r629079;
        return r629080;
}
↓
double f(double x, double y, double z) {
        double r629081 = x;
        double r629082 = 3.0;
        double r629083 = r629081 * r629082;
        double r629084 = y;
        double r629085 = r629083 * r629084;
        double r629086 = z;
        double r629087 = r629085 - r629086;
        return r629087;
}

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.2
Target0.2
Herbie0.2
\[x \cdot \left(3 \cdot y\right) - z\]

Derivation

  1. Initial program 0.2

    \[\left(x \cdot 3\right) \cdot y - z\]

  2. Final simplification0.2

    \[\leadsto \left(x \cdot 3\right) \cdot y - z\]

Reproduce

herbie shell --seed 2019326 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (- (* x (* 3 y)) z)

  (- (* (* x 3) y) z))