Average Error: 0.1 → 0.1
Time: 1.7s
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 r853389 = x;
        double r853390 = 3.0;
        double r853391 = r853389 * r853390;
        double r853392 = y;
        double r853393 = r853391 * r853392;
        double r853394 = z;
        double r853395 = r853393 - r853394;
        return r853395;
}
↓
double f(double x, double y, double z) {
        double r853396 = x;
        double r853397 = 3.0;
        double r853398 = r853396 * r853397;
        double r853399 = y;
        double r853400 = r853398 * r853399;
        double r853401 = z;
        double r853402 = r853400 - r853401;
        return r853402;
}

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.1
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 2020024 +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))