Average Error: 0.1 → 0.1
Time: 20.1s
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 r509350 = x;
        double r509351 = 3.0;
        double r509352 = r509350 * r509351;
        double r509353 = y;
        double r509354 = r509352 * r509353;
        double r509355 = z;
        double r509356 = r509354 - r509355;
        return r509356;
}
↓
double f(double x, double y, double z) {
        double r509357 = x;
        double r509358 = 3.0;
        double r509359 = r509357 * r509358;
        double r509360 = y;
        double r509361 = r509359 * r509360;
        double r509362 = z;
        double r509363 = r509361 - r509362;
        return r509363;
}

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.2
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. Final simplification0.1

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

Reproduce

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