Average Error: 0.0 → 0.0
Time: 7.0s
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 r133839 = x;
        double r133840 = y;
        double r133841 = z;
        double r133842 = r133841 + r133839;
        double r133843 = r133840 * r133842;
        double r133844 = r133839 + r133843;
        return r133844;
}
↓
double f(double x, double y, double z) {
        double r133845 = x;
        double r133846 = y;
        double r133847 = z;
        double r133848 = r133847 + r133845;
        double r133849 = r133846 * r133848;
        double r133850 = r133845 + r133849;
        return r133850;
}

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