Average Error: 0.0 → 0.0
Time: 3.8s
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 r118695 = x;
        double r118696 = y;
        double r118697 = 4.0;
        double r118698 = r118696 * r118697;
        double r118699 = z;
        double r118700 = r118698 * r118699;
        double r118701 = r118695 - r118700;
        return r118701;
}
↓
double f(double x, double y, double z) {
        double r118702 = x;
        double r118703 = y;
        double r118704 = 4.0;
        double r118705 = r118703 * r118704;
        double r118706 = z;
        double r118707 = r118705 * r118706;
        double r118708 = r118702 - r118707;
        return r118708;
}

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