Average Error: 0.1 → 0.1
Time: 3.5s
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 r253683 = x;
        double r253684 = y;
        double r253685 = 4.0;
        double r253686 = r253684 * r253685;
        double r253687 = z;
        double r253688 = r253686 * r253687;
        double r253689 = r253683 - r253688;
        return r253689;
}

double f(double x, double y, double z) {
        double r253690 = x;
        double r253691 = y;
        double r253692 = 4.0;
        double r253693 = r253691 * r253692;
        double r253694 = z;
        double r253695 = r253693 * r253694;
        double r253696 = r253690 - r253695;
        return r253696;
}

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)))