Average Error: 0.1 → 0.1
Time: 1.6s
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 r680560 = x;
        double r680561 = 3.0;
        double r680562 = r680560 * r680561;
        double r680563 = y;
        double r680564 = r680562 * r680563;
        double r680565 = z;
        double r680566 = r680564 - r680565;
        return r680566;
}
↓
double f(double x, double y, double z) {
        double r680567 = x;
        double r680568 = 3.0;
        double r680569 = r680567 * r680568;
        double r680570 = y;
        double r680571 = r680569 * r680570;
        double r680572 = z;
        double r680573 = r680571 - r680572;
        return r680573;
}

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