Average Error: 0.1 → 0.1
Time: 2.1s
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 r804873 = x;
        double r804874 = 3.0;
        double r804875 = r804873 * r804874;
        double r804876 = y;
        double r804877 = r804875 * r804876;
        double r804878 = z;
        double r804879 = r804877 - r804878;
        return r804879;
}
↓
double f(double x, double y, double z) {
        double r804880 = x;
        double r804881 = 3.0;
        double r804882 = r804880 * r804881;
        double r804883 = y;
        double r804884 = r804882 * r804883;
        double r804885 = z;
        double r804886 = r804884 - r804885;
        return r804886;
}

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