Average Error: 0.1 → 0.1
Time: 1.3s
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 r216006 = x;
        double r216007 = y;
        double r216008 = 4.0;
        double r216009 = r216007 * r216008;
        double r216010 = z;
        double r216011 = r216009 * r216010;
        double r216012 = r216006 - r216011;
        return r216012;
}

double f(double x, double y, double z) {
        double r216013 = x;
        double r216014 = y;
        double r216015 = 4.0;
        double r216016 = r216014 * r216015;
        double r216017 = z;
        double r216018 = r216016 * r216017;
        double r216019 = r216013 - r216018;
        return r216019;
}

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