Average Error: 0.0 → 0.0
Time: 16.2s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1.0\right)\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot \left(z + 1.0\right)
double f(double x, double y, double z) {
        double r1716523 = x;
        double r1716524 = y;
        double r1716525 = r1716523 + r1716524;
        double r1716526 = z;
        double r1716527 = 1.0;
        double r1716528 = r1716526 + r1716527;
        double r1716529 = r1716525 * r1716528;
        return r1716529;
}
↓
double f(double x, double y, double z) {
        double r1716530 = y;
        double r1716531 = x;
        double r1716532 = r1716530 + r1716531;
        double r1716533 = z;
        double r1716534 = 1.0;
        double r1716535 = r1716533 + r1716534;
        double r1716536 = r1716532 * r1716535;
        return r1716536;
}

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.0\right)\]

  2. Final simplification0.0

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

Reproduce

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