Average Error: 0.0 → 0.0
Time: 2.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 r143842 = x;
        double r143843 = y;
        double r143844 = z;
        double r143845 = r143844 + r143842;
        double r143846 = r143843 * r143845;
        double r143847 = r143842 + r143846;
        return r143847;
}
↓
double f(double x, double y, double z) {
        double r143848 = x;
        double r143849 = y;
        double r143850 = z;
        double r143851 = r143850 + r143848;
        double r143852 = r143849 * r143851;
        double r143853 = r143848 + r143852;
        return r143853;
}

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