Average Error: 0.1 → 0.1
Time: 743.0ms
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 r269286 = x;
        double r269287 = y;
        double r269288 = 4.0;
        double r269289 = r269287 * r269288;
        double r269290 = z;
        double r269291 = r269289 * r269290;
        double r269292 = r269286 - r269291;
        return r269292;
}

double f(double x, double y, double z) {
        double r269293 = x;
        double r269294 = y;
        double r269295 = 4.0;
        double r269296 = r269294 * r269295;
        double r269297 = z;
        double r269298 = r269296 * r269297;
        double r269299 = r269293 - r269298;
        return r269299;
}

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.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.1

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

Reproduce

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