Average Error: 0.1 → 0.1
Time: 1.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 r861107 = x;
        double r861108 = 3.0;
        double r861109 = r861107 * r861108;
        double r861110 = y;
        double r861111 = r861109 * r861110;
        double r861112 = z;
        double r861113 = r861111 - r861112;
        return r861113;
}
↓
double f(double x, double y, double z) {
        double r861114 = x;
        double r861115 = 3.0;
        double r861116 = r861114 * r861115;
        double r861117 = y;
        double r861118 = r861116 * r861117;
        double r861119 = z;
        double r861120 = r861118 - r861119;
        return r861120;
}

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 2020083 +o rules:numerics
(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))