Average Error: 0.0 → 0.0
Time: 9.8s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r1773925 = x;
        double r1773926 = y;
        double r1773927 = r1773925 + r1773926;
        double r1773928 = z;
        double r1773929 = 1.0;
        double r1773930 = r1773928 + r1773929;
        double r1773931 = r1773927 * r1773930;
        return r1773931;
}
↓
double f(double x, double y, double z) {
        double r1773932 = y;
        double r1773933 = x;
        double r1773934 = r1773932 + r1773933;
        double r1773935 = z;
        double r1773936 = 1.0;
        double r1773937 = r1773935 + r1773936;
        double r1773938 = r1773934 * r1773937;
        return r1773938;
}

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

    \[\left(x + y\right) \cdot \left(z + 1\right)\]

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(z + 1\right)\]

Reproduce

herbie shell --seed 2019174 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))