Average Error: 0.0 → 0.0
Time: 3.3s
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 r75637 = x;
        double r75638 = y;
        double r75639 = z;
        double r75640 = r75639 + r75637;
        double r75641 = r75638 * r75640;
        double r75642 = r75637 + r75641;
        return r75642;
}
↓
double f(double x, double y, double z) {
        double r75643 = x;
        double r75644 = y;
        double r75645 = z;
        double r75646 = r75645 + r75643;
        double r75647 = r75644 * r75646;
        double r75648 = r75643 + r75647;
        return r75648;
}

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