Average Error: 0.1 → 0.1
Time: 3.6s
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 r156676 = x;
        double r156677 = y;
        double r156678 = 4.0;
        double r156679 = r156677 * r156678;
        double r156680 = z;
        double r156681 = r156679 * r156680;
        double r156682 = r156676 - r156681;
        return r156682;
}

double f(double x, double y, double z) {
        double r156683 = x;
        double r156684 = y;
        double r156685 = 4.0;
        double r156686 = r156684 * r156685;
        double r156687 = z;
        double r156688 = r156686 * r156687;
        double r156689 = r156683 - r156688;
        return r156689;
}

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