Average Error: 0.0 → 0.0
Time: 2.6s
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 r135718 = x;
        double r135719 = y;
        double r135720 = z;
        double r135721 = r135720 + r135718;
        double r135722 = r135719 * r135721;
        double r135723 = r135718 + r135722;
        return r135723;
}
↓
double f(double x, double y, double z) {
        double r135724 = x;
        double r135725 = y;
        double r135726 = z;
        double r135727 = r135726 + r135724;
        double r135728 = r135725 * r135727;
        double r135729 = r135724 + r135728;
        return r135729;
}

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 2019356 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))