Average Error: 0.1 → 0.1
Time: 8.5s
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 r615773 = x;
        double r615774 = 3.0;
        double r615775 = r615773 * r615774;
        double r615776 = y;
        double r615777 = r615775 * r615776;
        double r615778 = z;
        double r615779 = r615777 - r615778;
        return r615779;
}
↓
double f(double x, double y, double z) {
        double r615780 = x;
        double r615781 = 3.0;
        double r615782 = r615780 * r615781;
        double r615783 = y;
        double r615784 = r615782 * r615783;
        double r615785 = z;
        double r615786 = r615784 - r615785;
        return r615786;
}

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.2
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 2019195 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"

  :herbie-target
  (- (* x (* 3.0 y)) z)

  (- (* (* x 3.0) y) z))