Average Error: 0.1 → 0.1
Time: 17.1s
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 r539089 = x;
        double r539090 = 3.0;
        double r539091 = r539089 * r539090;
        double r539092 = y;
        double r539093 = r539091 * r539092;
        double r539094 = z;
        double r539095 = r539093 - r539094;
        return r539095;
}
↓
double f(double x, double y, double z) {
        double r539096 = x;
        double r539097 = 3.0;
        double r539098 = r539096 * r539097;
        double r539099 = y;
        double r539100 = r539098 * r539099;
        double r539101 = z;
        double r539102 = r539100 - r539101;
        return r539102;
}

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

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019325 +o rules:numerics
(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))