Average Error: 0.0 → 0.0
Time: 13.7s
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 r150067 = x;
        double r150068 = y;
        double r150069 = z;
        double r150070 = r150069 + r150067;
        double r150071 = r150068 * r150070;
        double r150072 = r150067 + r150071;
        return r150072;
}
↓
double f(double x, double y, double z) {
        double r150073 = x;
        double r150074 = y;
        double r150075 = z;
        double r150076 = r150075 + r150073;
        double r150077 = r150074 * r150076;
        double r150078 = r150073 + r150077;
        return r150078;
}

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))))