Average Error: 0.1 → 0.1
Time: 2.1s
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 r840672 = x;
        double r840673 = 3.0;
        double r840674 = r840672 * r840673;
        double r840675 = y;
        double r840676 = r840674 * r840675;
        double r840677 = z;
        double r840678 = r840676 - r840677;
        return r840678;
}
↓
double f(double x, double y, double z) {
        double r840679 = x;
        double r840680 = 3.0;
        double r840681 = r840679 * r840680;
        double r840682 = y;
        double r840683 = r840681 * r840682;
        double r840684 = z;
        double r840685 = r840683 - r840684;
        return r840685;
}

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