Average Error: 0.2 → 0.2
Time: 26.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 r474316 = x;
        double r474317 = 3.0;
        double r474318 = r474316 * r474317;
        double r474319 = y;
        double r474320 = r474318 * r474319;
        double r474321 = z;
        double r474322 = r474320 - r474321;
        return r474322;
}

double f(double x, double y, double z) {
        double r474323 = x;
        double r474324 = 3.0;
        double r474325 = r474323 * r474324;
        double r474326 = y;
        double r474327 = r474325 * r474326;
        double r474328 = z;
        double r474329 = r474327 - r474328;
        return r474329;
}

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.2
Target0.2
Herbie0.2
\[x \cdot \left(3 \cdot y\right) - z\]

Derivation

  1. Initial program 0.2

    \[\left(x \cdot 3\right) \cdot y - z\]
  2. Final simplification0.2

    \[\leadsto \left(x \cdot 3\right) \cdot y - z\]

Reproduce

herbie shell --seed 2019322 
(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))