Average Error: 0.0 → 0.0
Time: 9.9s
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 r193475 = x;
        double r193476 = y;
        double r193477 = 4.0;
        double r193478 = r193476 * r193477;
        double r193479 = z;
        double r193480 = r193478 * r193479;
        double r193481 = r193475 - r193480;
        return r193481;
}
↓
double f(double x, double y, double z) {
        double r193482 = x;
        double r193483 = y;
        double r193484 = 4.0;
        double r193485 = r193483 * r193484;
        double r193486 = z;
        double r193487 = r193485 * r193486;
        double r193488 = r193482 - r193487;
        return r193488;
}

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