Average Error: 0.0 → 0.0
Time: 10.1s
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 r160575 = x;
        double r160576 = y;
        double r160577 = z;
        double r160578 = r160577 + r160575;
        double r160579 = r160576 * r160578;
        double r160580 = r160575 + r160579;
        return r160580;
}
↓
double f(double x, double y, double z) {
        double r160581 = x;
        double r160582 = z;
        double r160583 = r160581 + r160582;
        double r160584 = y;
        double r160585 = r160583 * r160584;
        double r160586 = r160581 + r160585;
        return r160586;
}

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

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

  3. Final simplification0.0

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

Reproduce

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