Average Error: 0.1 → 0.1
Time: 8.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 r616094 = x;
        double r616095 = 3.0;
        double r616096 = r616094 * r616095;
        double r616097 = y;
        double r616098 = r616096 * r616097;
        double r616099 = z;
        double r616100 = r616098 - r616099;
        return r616100;
}
↓
double f(double x, double y, double z) {
        double r616101 = x;
        double r616102 = 3.0;
        double r616103 = r616101 * r616102;
        double r616104 = y;
        double r616105 = r616103 * r616104;
        double r616106 = z;
        double r616107 = r616105 - r616106;
        return r616107;
}

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