Average Error: 0.1 → 0.1
Time: 29.3s
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 r482390 = x;
        double r482391 = 3.0;
        double r482392 = r482390 * r482391;
        double r482393 = y;
        double r482394 = r482392 * r482393;
        double r482395 = z;
        double r482396 = r482394 - r482395;
        return r482396;
}
↓
double f(double x, double y, double z) {
        double r482397 = x;
        double r482398 = 3.0;
        double r482399 = r482397 * r482398;
        double r482400 = y;
        double r482401 = r482399 * r482400;
        double r482402 = z;
        double r482403 = r482401 - r482402;
        return r482403;
}

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