Average Error: 0.1 → 0.1
Time: 8.2s
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 r528091 = x;
        double r528092 = 3.0;
        double r528093 = r528091 * r528092;
        double r528094 = y;
        double r528095 = r528093 * r528094;
        double r528096 = z;
        double r528097 = r528095 - r528096;
        return r528097;
}
↓
double f(double x, double y, double z) {
        double r528098 = x;
        double r528099 = 3.0;
        double r528100 = r528098 * r528099;
        double r528101 = y;
        double r528102 = r528100 * r528101;
        double r528103 = z;
        double r528104 = r528102 - r528103;
        return r528104;
}

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.2
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 2019212 
(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))