Average Error: 0.0 → 0.0
Time: 3.4s
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 r136507 = x;
        double r136508 = y;
        double r136509 = 4.0;
        double r136510 = r136508 * r136509;
        double r136511 = z;
        double r136512 = r136510 * r136511;
        double r136513 = r136507 - r136512;
        return r136513;
}
↓
double f(double x, double y, double z) {
        double r136514 = x;
        double r136515 = y;
        double r136516 = 4.0;
        double r136517 = r136515 * r136516;
        double r136518 = z;
        double r136519 = r136517 * r136518;
        double r136520 = r136514 - r136519;
        return r136520;
}

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 2019323 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))