Average Error: 0.1 → 0.1
Time: 12.9s
Precision: 64
\[\left(x \cdot 3.0\right) \cdot y - z\]
↓
\[\left(x \cdot 3.0\right) \cdot y - z\]
\left(x \cdot 3.0\right) \cdot y - z
↓
\left(x \cdot 3.0\right) \cdot y - z
double f(double x, double y, double z) {
        double r36631426 = x;
        double r36631427 = 3.0;
        double r36631428 = r36631426 * r36631427;
        double r36631429 = y;
        double r36631430 = r36631428 * r36631429;
        double r36631431 = z;
        double r36631432 = r36631430 - r36631431;
        return r36631432;
}
↓
double f(double x, double y, double z) {
        double r36631433 = x;
        double r36631434 = 3.0;
        double r36631435 = r36631433 * r36631434;
        double r36631436 = y;
        double r36631437 = r36631435 * r36631436;
        double r36631438 = z;
        double r36631439 = r36631437 - r36631438;
        return r36631439;
}

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.0 \cdot y\right) - z\]

Derivation

  1. Initial program 0.1

    \[\left(x \cdot 3.0\right) \cdot y - z\]

  2. Final simplification0.1

    \[\leadsto \left(x \cdot 3.0\right) \cdot y - z\]

Reproduce

herbie shell --seed 2019162 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"

  :herbie-target
  (- (* x (* 3.0 y)) z)

  (- (* (* x 3.0) y) z))