Average Error: 0.1 → 0.1
Time: 2.1s
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 r938996 = x;
        double r938997 = 3.0;
        double r938998 = r938996 * r938997;
        double r938999 = y;
        double r939000 = r938998 * r938999;
        double r939001 = z;
        double r939002 = r939000 - r939001;
        return r939002;
}
↓
double f(double x, double y, double z) {
        double r939003 = x;
        double r939004 = 3.0;
        double r939005 = r939003 * r939004;
        double r939006 = y;
        double r939007 = r939005 * r939006;
        double r939008 = z;
        double r939009 = r939007 - r939008;
        return r939009;
}

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