Average Error: 0.0 → 0.0
Time: 9.2s
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 r106156 = x;
        double r106157 = y;
        double r106158 = z;
        double r106159 = r106158 + r106156;
        double r106160 = r106157 * r106159;
        double r106161 = r106156 + r106160;
        return r106161;
}
↓
double f(double x, double y, double z) {
        double r106162 = x;
        double r106163 = y;
        double r106164 = z;
        double r106165 = r106164 + r106162;
        double r106166 = r106163 * r106165;
        double r106167 = r106162 + r106166;
        return r106167;
}

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