Average Error: 0.1 → 0.1
Time: 1.1s
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 r154126 = x;
        double r154127 = y;
        double r154128 = 4.0;
        double r154129 = r154127 * r154128;
        double r154130 = z;
        double r154131 = r154129 * r154130;
        double r154132 = r154126 - r154131;
        return r154132;
}

double f(double x, double y, double z) {
        double r154133 = x;
        double r154134 = y;
        double r154135 = 4.0;
        double r154136 = r154134 * r154135;
        double r154137 = z;
        double r154138 = r154136 * r154137;
        double r154139 = r154133 - r154138;
        return r154139;
}

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