Average Error: 0.0 → 0.0
Time: 2.5s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + y \cdot \left(z + x\right)\]
x + y \cdot \left(z + x\right)
↓
x + y \cdot \left(z + x\right)
double f(double x, double y, double z) {
        double r123048 = x;
        double r123049 = y;
        double r123050 = z;
        double r123051 = r123050 + r123048;
        double r123052 = r123049 * r123051;
        double r123053 = r123048 + r123052;
        return r123053;
}
↓
double f(double x, double y, double z) {
        double r123054 = x;
        double r123055 = y;
        double r123056 = z;
        double r123057 = r123056 + r123054;
        double r123058 = r123055 * r123057;
        double r123059 = r123054 + r123058;
        return r123059;
}

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

Reproduce

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