Average Error: 0.0 → 0.0
Time: 17.6s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(z \cdot y + y \cdot x\right)\]
x + y \cdot \left(z + x\right)
↓
x + \left(z \cdot y + y \cdot x\right)
double f(double x, double y, double z) {
        double r99428 = x;
        double r99429 = y;
        double r99430 = z;
        double r99431 = r99430 + r99428;
        double r99432 = r99429 * r99431;
        double r99433 = r99428 + r99432;
        return r99433;
}
↓
double f(double x, double y, double z) {
        double r99434 = x;
        double r99435 = z;
        double r99436 = y;
        double r99437 = r99435 * r99436;
        double r99438 = r99436 * r99434;
        double r99439 = r99437 + r99438;
        double r99440 = r99434 + r99439;
        return r99440;
}

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. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

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