Average Error: 0.0 → 0.0
Time: 1.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 r125665 = x;
        double r125666 = y;
        double r125667 = z;
        double r125668 = r125667 + r125665;
        double r125669 = r125666 * r125668;
        double r125670 = r125665 + r125669;
        return r125670;
}
↓
double f(double x, double y, double z) {
        double r125671 = x;
        double r125672 = y;
        double r125673 = z;
        double r125674 = r125673 + r125671;
        double r125675 = r125672 * r125674;
        double r125676 = r125671 + r125675;
        return r125676;
}

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