Average Error: 0.0 → 0.0
Time: 2.5s
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 r100932 = x;
        double r100933 = y;
        double r100934 = z;
        double r100935 = r100934 + r100932;
        double r100936 = r100933 * r100935;
        double r100937 = r100932 + r100936;
        return r100937;
}
↓
double f(double x, double y, double z) {
        double r100938 = x;
        double r100939 = y;
        double r100940 = z;
        double r100941 = r100940 + r100938;
        double r100942 = r100939 * r100941;
        double r100943 = r100938 + r100942;
        return r100943;
}

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