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 r125767 = x;
        double r125768 = y;
        double r125769 = z;
        double r125770 = r125769 + r125767;
        double r125771 = r125768 * r125770;
        double r125772 = r125767 + r125771;
        return r125772;
}
↓
double f(double x, double y, double z) {
        double r125773 = x;
        double r125774 = y;
        double r125775 = z;
        double r125776 = r125775 + r125773;
        double r125777 = r125774 * r125776;
        double r125778 = r125773 + r125777;
        return r125778;
}

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