Average Error: 0.1 → 0.1
Time: 1.7s
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 r737686 = x;
        double r737687 = 3.0;
        double r737688 = r737686 * r737687;
        double r737689 = y;
        double r737690 = r737688 * r737689;
        double r737691 = z;
        double r737692 = r737690 - r737691;
        return r737692;
}
↓
double f(double x, double y, double z) {
        double r737693 = x;
        double r737694 = 3.0;
        double r737695 = r737693 * r737694;
        double r737696 = y;
        double r737697 = r737695 * r737696;
        double r737698 = z;
        double r737699 = r737697 - r737698;
        return r737699;
}

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