Average Error: 0.0 → 0.0
Time: 22.7s
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 r5356888 = x;
        double r5356889 = y;
        double r5356890 = z;
        double r5356891 = r5356890 + r5356888;
        double r5356892 = r5356889 * r5356891;
        double r5356893 = r5356888 + r5356892;
        return r5356893;
}
↓
double f(double x, double y, double z) {
        double r5356894 = x;
        double r5356895 = z;
        double r5356896 = r5356894 + r5356895;
        double r5356897 = y;
        double r5356898 = r5356896 * r5356897;
        double r5356899 = r5356894 + r5356898;
        return r5356899;
}

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