Average Error: 0.1 → 0.1
Time: 1.9s
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 r786816 = x;
        double r786817 = 3.0;
        double r786818 = r786816 * r786817;
        double r786819 = y;
        double r786820 = r786818 * r786819;
        double r786821 = z;
        double r786822 = r786820 - r786821;
        return r786822;
}
↓
double f(double x, double y, double z) {
        double r786823 = x;
        double r786824 = 3.0;
        double r786825 = r786823 * r786824;
        double r786826 = y;
        double r786827 = r786825 * r786826;
        double r786828 = z;
        double r786829 = r786827 - r786828;
        return r786829;
}

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