Average Error: 0.1 → 0.1
Time: 15.5s
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 r816226 = x;
        double r816227 = 3.0;
        double r816228 = r816226 * r816227;
        double r816229 = y;
        double r816230 = r816228 * r816229;
        double r816231 = z;
        double r816232 = r816230 - r816231;
        return r816232;
}
↓
double f(double x, double y, double z) {
        double r816233 = x;
        double r816234 = 3.0;
        double r816235 = r816233 * r816234;
        double r816236 = y;
        double r816237 = r816235 * r816236;
        double r816238 = z;
        double r816239 = r816237 - r816238;
        return r816239;
}

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