Average Error: 0.1 → 0.1
Time: 18.2s
Precision: 64
\[\frac{1.0}{2.0} \cdot \left(x + y \cdot \sqrt{z}\right)\]
↓
\[\frac{1.0}{2.0} \cdot \left(x + \sqrt{z} \cdot y\right)\]
\frac{1.0}{2.0} \cdot \left(x + y \cdot \sqrt{z}\right)
↓
\frac{1.0}{2.0} \cdot \left(x + \sqrt{z} \cdot y\right)
double f(double x, double y, double z) {
        double r9401623 = 1.0;
        double r9401624 = 2.0;
        double r9401625 = r9401623 / r9401624;
        double r9401626 = x;
        double r9401627 = y;
        double r9401628 = z;
        double r9401629 = sqrt(r9401628);
        double r9401630 = r9401627 * r9401629;
        double r9401631 = r9401626 + r9401630;
        double r9401632 = r9401625 * r9401631;
        return r9401632;
}
↓
double f(double x, double y, double z) {
        double r9401633 = 1.0;
        double r9401634 = 2.0;
        double r9401635 = r9401633 / r9401634;
        double r9401636 = x;
        double r9401637 = z;
        double r9401638 = sqrt(r9401637);
        double r9401639 = y;
        double r9401640 = r9401638 * r9401639;
        double r9401641 = r9401636 + r9401640;
        double r9401642 = r9401635 * r9401641;
        return r9401642;
}

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.1

    \[\frac{1.0}{2.0} \cdot \left(x + y \cdot \sqrt{z}\right)\]

  2. Final simplification0.1

    \[\leadsto \frac{1.0}{2.0} \cdot \left(x + \sqrt{z} \cdot y\right)\]

Reproduce

herbie shell --seed 2019165 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
  (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))