Average Error: 0.1 → 0.1
Time: 1.0s
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 r802517 = x;
        double r802518 = 3.0;
        double r802519 = r802517 * r802518;
        double r802520 = y;
        double r802521 = r802519 * r802520;
        double r802522 = z;
        double r802523 = r802521 - r802522;
        return r802523;
}
↓
double f(double x, double y, double z) {
        double r802524 = x;
        double r802525 = 3.0;
        double r802526 = r802524 * r802525;
        double r802527 = y;
        double r802528 = r802526 * r802527;
        double r802529 = z;
        double r802530 = r802528 - r802529;
        return r802530;
}

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