Average Error: 0.2 → 0.2
Time: 17.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 r501447 = x;
        double r501448 = 3.0;
        double r501449 = r501447 * r501448;
        double r501450 = y;
        double r501451 = r501449 * r501450;
        double r501452 = z;
        double r501453 = r501451 - r501452;
        return r501453;
}
↓
double f(double x, double y, double z) {
        double r501454 = x;
        double r501455 = 3.0;
        double r501456 = r501454 * r501455;
        double r501457 = y;
        double r501458 = r501456 * r501457;
        double r501459 = z;
        double r501460 = r501458 - r501459;
        return r501460;
}

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 2019326 +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))