Average Error: 0.0 → 0.0
Time: 13.0s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r272076 = x;
        double r272077 = y;
        double r272078 = 4.0;
        double r272079 = r272077 * r272078;
        double r272080 = z;
        double r272081 = r272079 * r272080;
        double r272082 = r272076 - r272081;
        return r272082;
}
↓
double f(double x, double y, double z) {
        double r272083 = x;
        double r272084 = y;
        double r272085 = 4.0;
        double r272086 = r272084 * r272085;
        double r272087 = z;
        double r272088 = r272086 * r272087;
        double r272089 = r272083 - r272088;
        return r272089;
}

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

Derivation

  1. Initial program 0.0

    \[x - \left(y \cdot 4\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))