Average Error: 0.0 → 0.0
Time: 18.7s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(1 + z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(1 + z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r2027781 = x;
        double r2027782 = y;
        double r2027783 = r2027781 + r2027782;
        double r2027784 = z;
        double r2027785 = 1.0;
        double r2027786 = r2027784 + r2027785;
        double r2027787 = r2027783 * r2027786;
        return r2027787;
}
↓
double f(double x, double y, double z) {
        double r2027788 = 1.0;
        double r2027789 = z;
        double r2027790 = r2027788 + r2027789;
        double r2027791 = x;
        double r2027792 = y;
        double r2027793 = r2027791 + r2027792;
        double r2027794 = r2027790 * r2027793;
        return r2027794;
}

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(1 + z\right) \cdot \left(x + y\right)\]

Reproduce

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