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 r235401 = x;
        double r235402 = y;
        double r235403 = 4.0;
        double r235404 = r235402 * r235403;
        double r235405 = z;
        double r235406 = r235404 * r235405;
        double r235407 = r235401 - r235406;
        return r235407;
}

double f(double x, double y, double z) {
        double r235408 = x;
        double r235409 = y;
        double r235410 = 4.0;
        double r235411 = r235409 * r235410;
        double r235412 = z;
        double r235413 = r235411 * r235412;
        double r235414 = r235408 - r235413;
        return r235414;
}

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