Average Error: 0.1 → 0.1
Time: 3.8s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (((double) (((double) (x * ((double) log(y)))) - y)) - z)) + ((double) log(t))));
}

↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (((double) (((double) (((double) (x * ((double) (((double) log(((double) cbrt(y)))) * 2.0)))) + ((double) (x * ((double) log(((double) pow(y, 0.3333333333333333)))))))) - y)) - z)) + ((double) log(t))));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.1
    \[\]
  2. Using strategy rm
  3. Applied add-cube-cbrt0.1
    \[\leadsto \]
  4. Applied log-prod0.1
    \[\leadsto \]
  5. Applied distribute-lft-in0.1
    \[\leadsto \]
  6. Simplified0.1
    \[\leadsto \]
  7. Using strategy rm
  8. Applied pow1/30.1
    \[\leadsto \]
  9. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020180 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (+ (- (- (* x (log y)) y) z) (log t)))