Average Error: 0.0 → 0.0
Time: 17.9s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[y \cdot \left(z + x\right) + x\]
x + y \cdot \left(z + x\right)
↓
y \cdot \left(z + x\right) + x
double f(double x, double y, double z) {
        double r96790 = x;
        double r96791 = y;
        double r96792 = z;
        double r96793 = r96792 + r96790;
        double r96794 = r96791 * r96793;
        double r96795 = r96790 + r96794;
        return r96795;
}
↓
double f(double x, double y, double z) {
        double r96796 = y;
        double r96797 = z;
        double r96798 = x;
        double r96799 = r96797 + r96798;
        double r96800 = r96796 * r96799;
        double r96801 = r96800 + r96798;
        return r96801;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

    \[\leadsto x + \color{blue}{\left(y \cdot z + y \cdot x\right)}\]

  4. Final simplification0.0

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

Reproduce

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