Average Error: 0.0 → 0.0
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 r201710 = x;
        double r201711 = y;
        double r201712 = 4.0;
        double r201713 = r201711 * r201712;
        double r201714 = z;
        double r201715 = r201713 * r201714;
        double r201716 = r201710 - r201715;
        return r201716;
}
↓
double f(double x, double y, double z) {
        double r201717 = x;
        double r201718 = y;
        double r201719 = 4.0;
        double r201720 = r201718 * r201719;
        double r201721 = z;
        double r201722 = r201720 * r201721;
        double r201723 = r201717 - r201722;
        return r201723;
}

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. Simplified0.0

    \[\leadsto \color{blue}{x - \left(4 \cdot y\right) \cdot z}\]

  3. Final simplification0.0

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

Reproduce

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