Average Error: 0.0 → 0.0
Time: 2.4s
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 r103734 = x;
        double r103735 = y;
        double r103736 = z;
        double r103737 = r103736 + r103734;
        double r103738 = r103735 * r103737;
        double r103739 = r103734 + r103738;
        return r103739;
}
↓
double f(double x, double y, double z) {
        double r103740 = x;
        double r103741 = y;
        double r103742 = z;
        double r103743 = r103742 + r103740;
        double r103744 = r103741 * r103743;
        double r103745 = r103740 + r103744;
        return r103745;
}

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