Average Error: 0.1 → 0.1
Time: 11.6s
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 r36492201 = x;
        double r36492202 = 3.0;
        double r36492203 = r36492201 * r36492202;
        double r36492204 = y;
        double r36492205 = r36492203 * r36492204;
        double r36492206 = z;
        double r36492207 = r36492205 - r36492206;
        return r36492207;
}
↓
double f(double x, double y, double z) {
        double r36492208 = x;
        double r36492209 = 3.0;
        double r36492210 = r36492208 * r36492209;
        double r36492211 = y;
        double r36492212 = r36492210 * r36492211;
        double r36492213 = z;
        double r36492214 = r36492212 - r36492213;
        return r36492214;
}

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