Average Error: 0.0 → 0.0
Time: 15.8s
Precision: 64
\[\left(x + y\right) \cdot \left(1.0 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1.0 - z\right)\]
\left(x + y\right) \cdot \left(1.0 - z\right)
↓
\left(y + x\right) \cdot \left(1.0 - z\right)
double f(double x, double y, double z) {
        double r2155749 = x;
        double r2155750 = y;
        double r2155751 = r2155749 + r2155750;
        double r2155752 = 1.0;
        double r2155753 = z;
        double r2155754 = r2155752 - r2155753;
        double r2155755 = r2155751 * r2155754;
        return r2155755;
}
↓
double f(double x, double y, double z) {
        double r2155756 = y;
        double r2155757 = x;
        double r2155758 = r2155756 + r2155757;
        double r2155759 = 1.0;
        double r2155760 = z;
        double r2155761 = r2155759 - r2155760;
        double r2155762 = r2155758 * r2155761;
        return r2155762;
}

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(1.0 - z\right)\]

  2. Final simplification0.0

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

Reproduce

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