Average Error: 0.0 → 0.0
Time: 2.5s
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 r169966 = x;
        double r169967 = y;
        double r169968 = z;
        double r169969 = r169968 + r169966;
        double r169970 = r169967 * r169969;
        double r169971 = r169966 + r169970;
        return r169971;
}
↓
double f(double x, double y, double z) {
        double r169972 = x;
        double r169973 = y;
        double r169974 = z;
        double r169975 = r169974 + r169972;
        double r169976 = r169973 * r169975;
        double r169977 = r169972 + r169976;
        return r169977;
}

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