Average Error: 0.1 → 0.1
Time: 28.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 r664214 = x;
        double r664215 = 3.0;
        double r664216 = r664214 * r664215;
        double r664217 = y;
        double r664218 = r664216 * r664217;
        double r664219 = z;
        double r664220 = r664218 - r664219;
        return r664220;
}
↓
double f(double x, double y, double z) {
        double r664221 = x;
        double r664222 = 3.0;
        double r664223 = r664221 * r664222;
        double r664224 = y;
        double r664225 = r664223 * r664224;
        double r664226 = z;
        double r664227 = r664225 - r664226;
        return r664227;
}

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