Average Error: 0.0 → 0.0
Time: 12.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 r4801596 = x;
        double r4801597 = y;
        double r4801598 = z;
        double r4801599 = r4801598 + r4801596;
        double r4801600 = r4801597 * r4801599;
        double r4801601 = r4801596 + r4801600;
        return r4801601;
}
↓
double f(double x, double y, double z) {
        double r4801602 = x;
        double r4801603 = z;
        double r4801604 = r4801602 + r4801603;
        double r4801605 = y;
        double r4801606 = r4801604 * r4801605;
        double r4801607 = r4801602 + r4801606;
        return r4801607;
}

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