Average Error: 0.1 → 0.1
Time: 13.1s
Precision: 64
\[\left(x \cdot 3.0\right) \cdot y - z\]
↓
\[\left(x \cdot 3.0\right) \cdot y - z\]
\left(x \cdot 3.0\right) \cdot y - z
↓
\left(x \cdot 3.0\right) \cdot y - z
double f(double x, double y, double z) {
        double r39536979 = x;
        double r39536980 = 3.0;
        double r39536981 = r39536979 * r39536980;
        double r39536982 = y;
        double r39536983 = r39536981 * r39536982;
        double r39536984 = z;
        double r39536985 = r39536983 - r39536984;
        return r39536985;
}
↓
double f(double x, double y, double z) {
        double r39536986 = x;
        double r39536987 = 3.0;
        double r39536988 = r39536986 * r39536987;
        double r39536989 = y;
        double r39536990 = r39536988 * r39536989;
        double r39536991 = z;
        double r39536992 = r39536990 - r39536991;
        return r39536992;
}

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.0 \cdot y\right) - z\]

Derivation

  1. Initial program 0.1

    \[\left(x \cdot 3.0\right) \cdot y - z\]

  2. Final simplification0.1

    \[\leadsto \left(x \cdot 3.0\right) \cdot y - z\]

Reproduce

herbie shell --seed 2019162 
(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))