Average Error: 0.0 → 0.0
Time: 17.1s
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 r6444980 = x;
        double r6444981 = y;
        double r6444982 = z;
        double r6444983 = r6444982 + r6444980;
        double r6444984 = r6444981 * r6444983;
        double r6444985 = r6444980 + r6444984;
        return r6444985;
}
↓
double f(double x, double y, double z) {
        double r6444986 = x;
        double r6444987 = z;
        double r6444988 = r6444986 + r6444987;
        double r6444989 = y;
        double r6444990 = r6444988 * r6444989;
        double r6444991 = r6444986 + r6444990;
        return r6444991;
}

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 2019162 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  (+ x (* y (+ z x))))