Average Error: 0.1 → 0.1
Time: 3.3s
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 r240592 = x;
        double r240593 = y;
        double r240594 = 4.0;
        double r240595 = r240593 * r240594;
        double r240596 = z;
        double r240597 = r240595 * r240596;
        double r240598 = r240592 - r240597;
        return r240598;
}

double f(double x, double y, double z) {
        double r240599 = x;
        double r240600 = y;
        double r240601 = 4.0;
        double r240602 = r240600 * r240601;
        double r240603 = z;
        double r240604 = r240602 * r240603;
        double r240605 = r240599 - r240604;
        return r240605;
}

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.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.1

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

Reproduce

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