Average Error: 0.1 → 0.1
Time: 25.9s
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 r474328 = x;
        double r474329 = 3.0;
        double r474330 = r474328 * r474329;
        double r474331 = y;
        double r474332 = r474330 * r474331;
        double r474333 = z;
        double r474334 = r474332 - r474333;
        return r474334;
}
↓
double f(double x, double y, double z) {
        double r474335 = x;
        double r474336 = y;
        double r474337 = 3.0;
        double r474338 = r474336 * r474337;
        double r474339 = r474335 * r474338;
        double r474340 = z;
        double r474341 = r474339 - r474340;
        return r474341;
}

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.1
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. 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 2019306 
(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))