Average Error: 0.0 → 0.0
Time: 4.8s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + y \cdot \left(z + x\right)\]
x + y \cdot \left(z + x\right)
↓
x + y \cdot \left(z + x\right)
double f(double x, double y, double z) {
        double r161422 = x;
        double r161423 = y;
        double r161424 = z;
        double r161425 = r161424 + r161422;
        double r161426 = r161423 * r161425;
        double r161427 = r161422 + r161426;
        return r161427;
}
↓
double f(double x, double y, double z) {
        double r161428 = x;
        double r161429 = y;
        double r161430 = z;
        double r161431 = r161430 + r161428;
        double r161432 = r161429 * r161431;
        double r161433 = r161428 + r161432;
        return r161433;
}

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

Reproduce

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