Average Error: 0.0 → 0.0
Time: 16.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 r97939 = x;
        double r97940 = y;
        double r97941 = z;
        double r97942 = r97941 + r97939;
        double r97943 = r97940 * r97942;
        double r97944 = r97939 + r97943;
        return r97944;
}
↓
double f(double x, double y, double z) {
        double r97945 = x;
        double r97946 = y;
        double r97947 = z;
        double r97948 = r97947 + r97945;
        double r97949 = r97946 * r97948;
        double r97950 = r97945 + r97949;
        return r97950;
}

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