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 r850974 = x;
        double r850975 = 3.0;
        double r850976 = r850974 * r850975;
        double r850977 = y;
        double r850978 = r850976 * r850977;
        double r850979 = z;
        double r850980 = r850978 - r850979;
        return r850980;
}
↓
double f(double x, double y, double z) {
        double r850981 = x;
        double r850982 = 3.0;
        double r850983 = r850981 * r850982;
        double r850984 = y;
        double r850985 = r850983 * r850984;
        double r850986 = z;
        double r850987 = r850985 - r850986;
        return r850987;
}

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