Average Error: 0.1 → 0.1
Time: 14.9s
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 r1052408 = x;
        double r1052409 = 3.0;
        double r1052410 = r1052408 * r1052409;
        double r1052411 = y;
        double r1052412 = r1052410 * r1052411;
        double r1052413 = z;
        double r1052414 = r1052412 - r1052413;
        return r1052414;
}
↓
double f(double x, double y, double z) {
        double r1052415 = x;
        double r1052416 = 3.0;
        double r1052417 = r1052415 * r1052416;
        double r1052418 = y;
        double r1052419 = r1052417 * r1052418;
        double r1052420 = z;
        double r1052421 = r1052419 - r1052420;
        return r1052421;
}

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