Average Error: 0.1 → 0.1
Time: 21.6s
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 r501284 = x;
        double r501285 = 3.0;
        double r501286 = r501284 * r501285;
        double r501287 = y;
        double r501288 = r501286 * r501287;
        double r501289 = z;
        double r501290 = r501288 - r501289;
        return r501290;
}
↓
double f(double x, double y, double z) {
        double r501291 = x;
        double r501292 = 3.0;
        double r501293 = r501291 * r501292;
        double r501294 = y;
        double r501295 = r501293 * r501294;
        double r501296 = z;
        double r501297 = r501295 - r501296;
        return r501297;
}

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