Average Error: 0.0 → 0.0
Time: 2.9s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(z + 1\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(z + 1\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r39807 = x;
        double r39808 = y;
        double r39809 = r39807 + r39808;
        double r39810 = z;
        double r39811 = 1.0;
        double r39812 = r39810 + r39811;
        double r39813 = r39809 * r39812;
        return r39813;
}
↓
double f(double x, double y, double z) {
        double r39814 = z;
        double r39815 = 1.0;
        double r39816 = r39814 + r39815;
        double r39817 = x;
        double r39818 = y;
        double r39819 = r39817 + r39818;
        double r39820 = r39816 * r39819;
        return r39820;
}

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. Using strategy rm

  3. Applied *-commutative0.0

    \[\leadsto \color{blue}{\left(z + 1\right) \cdot \left(x + y\right)}\]

  4. Final simplification0.0

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

Reproduce

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