Average Error: 0.0 → 0.0
Time: 2.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 r203997 = x;
        double r203998 = y;
        double r203999 = 4.0;
        double r204000 = r203998 * r203999;
        double r204001 = z;
        double r204002 = r204000 * r204001;
        double r204003 = r203997 - r204002;
        return r204003;
}
↓
double f(double x, double y, double z) {
        double r204004 = x;
        double r204005 = y;
        double r204006 = 4.0;
        double r204007 = r204005 * r204006;
        double r204008 = z;
        double r204009 = r204007 * r204008;
        double r204010 = r204004 - r204009;
        return r204010;
}

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