Average Error: 0.1 → 0.1
Time: 1.7s
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 r309539 = x;
        double r309540 = y;
        double r309541 = 4.0;
        double r309542 = r309540 * r309541;
        double r309543 = z;
        double r309544 = r309542 * r309543;
        double r309545 = r309539 - r309544;
        return r309545;
}

double f(double x, double y, double z) {
        double r309546 = x;
        double r309547 = y;
        double r309548 = 4.0;
        double r309549 = r309547 * r309548;
        double r309550 = z;
        double r309551 = r309549 * r309550;
        double r309552 = r309546 - r309551;
        return r309552;
}

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