Average Error: 0.1 → 0.1
Time: 9.4s
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 r653660 = x;
        double r653661 = 3.0;
        double r653662 = r653660 * r653661;
        double r653663 = y;
        double r653664 = r653662 * r653663;
        double r653665 = z;
        double r653666 = r653664 - r653665;
        return r653666;
}

double f(double x, double y, double z) {
        double r653667 = x;
        double r653668 = 3.0;
        double r653669 = r653667 * r653668;
        double r653670 = y;
        double r653671 = r653669 * r653670;
        double r653672 = z;
        double r653673 = r653671 - r653672;
        return r653673;
}

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 2019351 +o rules:numerics
(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))