Average Error: 0.0 → 0.0
Time: 13.3s
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 r80031 = x;
        double r80032 = y;
        double r80033 = z;
        double r80034 = r80033 + r80031;
        double r80035 = r80032 * r80034;
        double r80036 = r80031 + r80035;
        return r80036;
}
↓
double f(double x, double y, double z) {
        double r80037 = x;
        double r80038 = y;
        double r80039 = z;
        double r80040 = r80039 + r80037;
        double r80041 = r80038 * r80040;
        double r80042 = r80037 + r80041;
        return r80042;
}

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