Average Error: 0.0 → 0.0
Time: 4.7s
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 r176305 = x;
        double r176306 = y;
        double r176307 = 4.0;
        double r176308 = r176306 * r176307;
        double r176309 = z;
        double r176310 = r176308 * r176309;
        double r176311 = r176305 - r176310;
        return r176311;
}
↓
double f(double x, double y, double z) {
        double r176312 = x;
        double r176313 = y;
        double r176314 = 4.0;
        double r176315 = r176313 * r176314;
        double r176316 = z;
        double r176317 = r176315 * r176316;
        double r176318 = r176312 - r176317;
        return r176318;
}

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