Average Error: 0.2 → 0.2
Time: 32.0s
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 r469521 = x;
        double r469522 = 3.0;
        double r469523 = r469521 * r469522;
        double r469524 = y;
        double r469525 = r469523 * r469524;
        double r469526 = z;
        double r469527 = r469525 - r469526;
        return r469527;
}
↓
double f(double x, double y, double z) {
        double r469528 = x;
        double r469529 = 3.0;
        double r469530 = r469528 * r469529;
        double r469531 = y;
        double r469532 = r469530 * r469531;
        double r469533 = z;
        double r469534 = r469532 - r469533;
        return r469534;
}

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.2
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 2019322 +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))