Average Error: 0.1 → 0.1
Time: 1.2s
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 r672407 = x;
        double r672408 = 3.0;
        double r672409 = r672407 * r672408;
        double r672410 = y;
        double r672411 = r672409 * r672410;
        double r672412 = z;
        double r672413 = r672411 - r672412;
        return r672413;
}
↓
double f(double x, double y, double z) {
        double r672414 = x;
        double r672415 = 3.0;
        double r672416 = r672414 * r672415;
        double r672417 = y;
        double r672418 = r672416 * r672417;
        double r672419 = z;
        double r672420 = r672418 - r672419;
        return r672420;
}

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