Average Error: 0.0 → 0.0
Time: 13.0s
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 r1819677 = x;
        double r1819678 = y;
        double r1819679 = r1819677 + r1819678;
        double r1819680 = 1.0;
        double r1819681 = z;
        double r1819682 = r1819680 - r1819681;
        double r1819683 = r1819679 * r1819682;
        return r1819683;
}
↓
double f(double x, double y, double z) {
        double r1819684 = y;
        double r1819685 = x;
        double r1819686 = r1819684 + r1819685;
        double r1819687 = 1.0;
        double r1819688 = z;
        double r1819689 = r1819687 - r1819688;
        double r1819690 = r1819686 * r1819689;
        return r1819690;
}

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