Average Error: 0.0 → 0.0
Time: 7.8s
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 r68967 = x;
        double r68968 = y;
        double r68969 = z;
        double r68970 = r68969 + r68967;
        double r68971 = r68968 * r68970;
        double r68972 = r68967 + r68971;
        return r68972;
}
↓
double f(double x, double y, double z) {
        double r68973 = x;
        double r68974 = y;
        double r68975 = z;
        double r68976 = r68975 + r68973;
        double r68977 = r68974 * r68976;
        double r68978 = r68973 + r68977;
        return r68978;
}

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