Average Error: 0.0 → 0.0
Time: 3.1s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(y \cdot z + y \cdot x\right)\]
x + y \cdot \left(z + x\right)
↓
x + \left(y \cdot z + y \cdot x\right)
double f(double x, double y, double z) {
        double r112593 = x;
        double r112594 = y;
        double r112595 = z;
        double r112596 = r112595 + r112593;
        double r112597 = r112594 * r112596;
        double r112598 = r112593 + r112597;
        return r112598;
}
↓
double f(double x, double y, double z) {
        double r112599 = x;
        double r112600 = y;
        double r112601 = z;
        double r112602 = r112600 * r112601;
        double r112603 = r112600 * r112599;
        double r112604 = r112602 + r112603;
        double r112605 = r112599 + r112604;
        return r112605;
}

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

Reproduce

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