Average Error: 0.1 → 0.1
Time: 16.1s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
double f(double x) {
        double r55802 = 1.0;
        double r55803 = x;
        double r55804 = 0.253;
        double r55805 = 0.12;
        double r55806 = r55803 * r55805;
        double r55807 = r55804 + r55806;
        double r55808 = r55803 * r55807;
        double r55809 = r55802 - r55808;
        return r55809;
}
↓
double f(double x) {
        double r55810 = 1.0;
        double r55811 = x;
        double r55812 = 0.253;
        double r55813 = 0.12;
        double r55814 = r55811 * r55813;
        double r55815 = r55812 + r55814;
        double r55816 = r55811 * r55815;
        double r55817 = r55810 - r55816;
        return r55817;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

  2. Final simplification0.1

    \[\leadsto 1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

Reproduce

herbie shell --seed 2019198 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  (- 1.0 (* x (+ 0.253 (* x 0.12)))))