Average Error: 0.1 → 0.1
Time: 2.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 r846526 = x;
        double r846527 = 3.0;
        double r846528 = r846526 * r846527;
        double r846529 = y;
        double r846530 = r846528 * r846529;
        double r846531 = z;
        double r846532 = r846530 - r846531;
        return r846532;
}
↓
double f(double x, double y, double z) {
        double r846533 = x;
        double r846534 = 3.0;
        double r846535 = r846533 * r846534;
        double r846536 = y;
        double r846537 = r846535 * r846536;
        double r846538 = z;
        double r846539 = r846537 - r846538;
        return r846539;
}

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 2020060 
(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))