Average Error: 0.1 → 0.1
Time: 1.7s
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 r849524 = x;
        double r849525 = 3.0;
        double r849526 = r849524 * r849525;
        double r849527 = y;
        double r849528 = r849526 * r849527;
        double r849529 = z;
        double r849530 = r849528 - r849529;
        return r849530;
}
↓
double f(double x, double y, double z) {
        double r849531 = x;
        double r849532 = 3.0;
        double r849533 = r849531 * r849532;
        double r849534 = y;
        double r849535 = r849533 * r849534;
        double r849536 = z;
        double r849537 = r849535 - r849536;
        return r849537;
}

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