Average Error: 0.2 → 0.1
Time: 24.2s
Precision: 64
\[\left(x \cdot 3\right) \cdot y - z\]
\[x \cdot \left(y \cdot 3\right) - z\]
\left(x \cdot 3\right) \cdot y - z
x \cdot \left(y \cdot 3\right) - z
double f(double x, double y, double z) {
        double r516300 = x;
        double r516301 = 3.0;
        double r516302 = r516300 * r516301;
        double r516303 = y;
        double r516304 = r516302 * r516303;
        double r516305 = z;
        double r516306 = r516304 - r516305;
        return r516306;
}

double f(double x, double y, double z) {
        double r516307 = x;
        double r516308 = y;
        double r516309 = 3.0;
        double r516310 = r516308 * r516309;
        double r516311 = r516307 * r516310;
        double r516312 = z;
        double r516313 = r516311 - r516312;
        return r516313;
}

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. Simplified0.1

    \[\leadsto x \cdot \color{blue}{\left(y \cdot 3\right)} - z\]
  5. Final simplification0.1

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

Reproduce

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