Average Error: 0.1 → 0.1
Time: 2.0s
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 r307212 = x;
        double r307213 = 3.0;
        double r307214 = r307212 * r307213;
        double r307215 = y;
        double r307216 = r307214 * r307215;
        double r307217 = z;
        double r307218 = r307216 - r307217;
        return r307218;
}
↓
double f(double x, double y, double z) {
        double r307219 = x;
        double r307220 = 3.0;
        double r307221 = r307219 * r307220;
        double r307222 = y;
        double r307223 = r307221 * r307222;
        double r307224 = z;
        double r307225 = r307223 - r307224;
        return r307225;
}

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