Average Error: 0.0 → 0.0
Time: 28.3s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(x + z\right) \cdot y\]
x + y \cdot \left(z + x\right)
↓
x + \left(x + z\right) \cdot y
double f(double x, double y, double z) {
        double r6738281 = x;
        double r6738282 = y;
        double r6738283 = z;
        double r6738284 = r6738283 + r6738281;
        double r6738285 = r6738282 * r6738284;
        double r6738286 = r6738281 + r6738285;
        return r6738286;
}
↓
double f(double x, double y, double z) {
        double r6738287 = x;
        double r6738288 = z;
        double r6738289 = r6738287 + r6738288;
        double r6738290 = y;
        double r6738291 = r6738289 * r6738290;
        double r6738292 = r6738287 + r6738291;
        return r6738292;
}

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 + y \cdot \left(z + x\right)\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019163 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  (+ x (* y (+ z x))))