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 r669528 = x;
        double r669529 = 3.0;
        double r669530 = r669528 * r669529;
        double r669531 = y;
        double r669532 = r669530 * r669531;
        double r669533 = z;
        double r669534 = r669532 - r669533;
        return r669534;
}
↓
double f(double x, double y, double z) {
        double r669535 = x;
        double r669536 = 3.0;
        double r669537 = r669535 * r669536;
        double r669538 = y;
        double r669539 = r669537 * r669538;
        double r669540 = z;
        double r669541 = r669539 - r669540;
        return r669541;
}

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