Average Error: 0.0 → 0.0
Time: 1.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 r148695 = x;
        double r148696 = y;
        double r148697 = 4.0;
        double r148698 = r148696 * r148697;
        double r148699 = z;
        double r148700 = r148698 * r148699;
        double r148701 = r148695 - r148700;
        return r148701;
}
↓
double f(double x, double y, double z) {
        double r148702 = x;
        double r148703 = y;
        double r148704 = 4.0;
        double r148705 = r148703 * r148704;
        double r148706 = z;
        double r148707 = r148705 * r148706;
        double r148708 = r148702 - r148707;
        return r148708;
}

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