Average Error: 0.0 → 0.0
Time: 14.9s
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 r73646 = x;
        double r73647 = y;
        double r73648 = z;
        double r73649 = r73648 + r73646;
        double r73650 = r73647 * r73649;
        double r73651 = r73646 + r73650;
        return r73651;
}
↓
double f(double x, double y, double z) {
        double r73652 = x;
        double r73653 = y;
        double r73654 = z;
        double r73655 = r73654 + r73652;
        double r73656 = r73653 * r73655;
        double r73657 = r73652 + r73656;
        return r73657;
}

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