Average Error: 0.0 → 0.0
Time: 12.9s
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 r2437840 = x;
        double r2437841 = y;
        double r2437842 = r2437840 + r2437841;
        double r2437843 = z;
        double r2437844 = 1.0;
        double r2437845 = r2437843 + r2437844;
        double r2437846 = r2437842 * r2437845;
        return r2437846;
}
↓
double f(double x, double y, double z) {
        double r2437847 = y;
        double r2437848 = x;
        double r2437849 = r2437847 + r2437848;
        double r2437850 = z;
        double r2437851 = 1.0;
        double r2437852 = r2437850 + r2437851;
        double r2437853 = r2437849 * r2437852;
        return r2437853;
}

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)))