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 r200002 = x;
        double r200003 = y;
        double r200004 = 4.0;
        double r200005 = r200003 * r200004;
        double r200006 = z;
        double r200007 = r200005 * r200006;
        double r200008 = r200002 - r200007;
        return r200008;
}
↓
double f(double x, double y, double z) {
        double r200009 = x;
        double r200010 = y;
        double r200011 = 4.0;
        double r200012 = r200010 * r200011;
        double r200013 = z;
        double r200014 = r200012 * r200013;
        double r200015 = r200009 - r200014;
        return r200015;
}

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