Average Error: 0.2 → 0.2
Time: 1.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 r891471 = x;
        double r891472 = 3.0;
        double r891473 = r891471 * r891472;
        double r891474 = y;
        double r891475 = r891473 * r891474;
        double r891476 = z;
        double r891477 = r891475 - r891476;
        return r891477;
}
↓
double f(double x, double y, double z) {
        double r891478 = x;
        double r891479 = 3.0;
        double r891480 = r891478 * r891479;
        double r891481 = y;
        double r891482 = r891480 * r891481;
        double r891483 = z;
        double r891484 = r891482 - r891483;
        return r891484;
}

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.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 2020100 
(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))