Average Error: 0.2 → 0.1
Time: 1.7s
Precision: 64
\[\left(x \cdot 3\right) \cdot y - z\]
↓
\[x \cdot \left(3 \cdot y\right) - z\]
\left(x \cdot 3\right) \cdot y - z
↓
x \cdot \left(3 \cdot y\right) - z
double f(double x, double y, double z) {
        double r694263 = x;
        double r694264 = 3.0;
        double r694265 = r694263 * r694264;
        double r694266 = y;
        double r694267 = r694265 * r694266;
        double r694268 = z;
        double r694269 = r694267 - r694268;
        return r694269;
}
↓
double f(double x, double y, double z) {
        double r694270 = x;
        double r694271 = 3.0;
        double r694272 = y;
        double r694273 = r694271 * r694272;
        double r694274 = r694270 * r694273;
        double r694275 = z;
        double r694276 = r694274 - r694275;
        return r694276;
}

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

Derivation

  1. Initial program 0.2

    \[\left(x \cdot 3\right) \cdot y - z\]
  2. Using strategy rm

  3. Applied associate-*l*0.1

    \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right)} - z\]

  4. Final simplification0.1

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

Reproduce

herbie shell --seed 2020062 
(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))