Average Error: 0.0 → 0.0
Time: 4.1s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(4 \cdot y\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(4 \cdot y\right) \cdot z
double f(double x, double y, double z) {
        double r7976445 = x;
        double r7976446 = y;
        double r7976447 = 4.0;
        double r7976448 = r7976446 * r7976447;
        double r7976449 = z;
        double r7976450 = r7976448 * r7976449;
        double r7976451 = r7976445 - r7976450;
        return r7976451;
}
↓
double f(double x, double y, double z) {
        double r7976452 = x;
        double r7976453 = 4.0;
        double r7976454 = y;
        double r7976455 = r7976453 * r7976454;
        double r7976456 = z;
        double r7976457 = r7976455 * r7976456;
        double r7976458 = r7976452 - r7976457;
        return r7976458;
}

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

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019172 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  (- x (* (* y 4.0) z)))