Average Error: 0.0 → 0.0
Time: 11.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(y + x\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r1738799 = x;
        double r1738800 = y;
        double r1738801 = r1738799 + r1738800;
        double r1738802 = 1.0;
        double r1738803 = z;
        double r1738804 = r1738802 - r1738803;
        double r1738805 = r1738801 * r1738804;
        return r1738805;
}
↓
double f(double x, double y, double z) {
        double r1738806 = y;
        double r1738807 = x;
        double r1738808 = r1738806 + r1738807;
        double r1738809 = 1.0;
        double r1738810 = z;
        double r1738811 = r1738809 - r1738810;
        double r1738812 = r1738808 * r1738811;
        return r1738812;
}

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

  2. Final simplification0.0

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

Reproduce

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