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 r861228 = x;
        double r861229 = 3.0;
        double r861230 = r861228 * r861229;
        double r861231 = y;
        double r861232 = r861230 * r861231;
        double r861233 = z;
        double r861234 = r861232 - r861233;
        return r861234;
}
↓
double f(double x, double y, double z) {
        double r861235 = x;
        double r861236 = 3.0;
        double r861237 = r861235 * r861236;
        double r861238 = y;
        double r861239 = r861237 * r861238;
        double r861240 = z;
        double r861241 = r861239 - r861240;
        return r861241;
}

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