Average Error: 0.0 → 0.0
Time: 8.6s
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 r2723086 = x;
        double r2723087 = y;
        double r2723088 = r2723086 + r2723087;
        double r2723089 = z;
        double r2723090 = 1.0;
        double r2723091 = r2723089 + r2723090;
        double r2723092 = r2723088 * r2723091;
        return r2723092;
}
↓
double f(double x, double y, double z) {
        double r2723093 = y;
        double r2723094 = x;
        double r2723095 = r2723093 + r2723094;
        double r2723096 = z;
        double r2723097 = 1.0;
        double r2723098 = r2723096 + r2723097;
        double r2723099 = r2723095 * r2723098;
        return r2723099;
}

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