Average Error: 0.0 → 0.0
Time: 11.1s
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 r41520 = x;
        double r41521 = y;
        double r41522 = r41520 + r41521;
        double r41523 = z;
        double r41524 = 1.0;
        double r41525 = r41523 + r41524;
        double r41526 = r41522 * r41525;
        return r41526;
}
↓
double f(double x, double y, double z) {
        double r41527 = y;
        double r41528 = x;
        double r41529 = r41527 + r41528;
        double r41530 = z;
        double r41531 = 1.0;
        double r41532 = r41530 + r41531;
        double r41533 = r41529 * r41532;
        return r41533;
}

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 2019179 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))