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 r37648204 = x;
        double r37648205 = 3.0;
        double r37648206 = r37648204 * r37648205;
        double r37648207 = y;
        double r37648208 = r37648206 * r37648207;
        double r37648209 = z;
        double r37648210 = r37648208 - r37648209;
        return r37648210;
}
↓
double f(double x, double y, double z) {
        double r37648211 = x;
        double r37648212 = 3.0;
        double r37648213 = r37648211 * r37648212;
        double r37648214 = y;
        double r37648215 = r37648213 * r37648214;
        double r37648216 = z;
        double r37648217 = r37648215 - r37648216;
        return r37648217;
}

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