?

Average Error: 5.2 → 0.1
Time: 7.0s
Precision: binary64
Cost: 713

?

\[x \cdot \left(1 + y \cdot y\right) \]
\[\begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{+53} \lor \neg \left(y \leq 200000000\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x + x \cdot \left(y \cdot y\right)\\ \end{array} \]
(FPCore (x y) :precision binary64 (* x (+ 1.0 (* y y))))
(FPCore (x y)
 :precision binary64
 (if (or (<= y -1e+53) (not (<= y 200000000.0)))
   (* y (* y x))
   (+ x (* x (* y y)))))
double code(double x, double y) {
	return x * (1.0 + (y * y));
}
double code(double x, double y) {
	double tmp;
	if ((y <= -1e+53) || !(y <= 200000000.0)) {
		tmp = y * (y * x);
	} else {
		tmp = x + (x * (y * y));
	}
	return tmp;
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (1.0d0 + (y * y))
end function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1d+53)) .or. (.not. (y <= 200000000.0d0))) then
        tmp = y * (y * x)
    else
        tmp = x + (x * (y * y))
    end if
    code = tmp
end function
public static double code(double x, double y) {
	return x * (1.0 + (y * y));
}
public static double code(double x, double y) {
	double tmp;
	if ((y <= -1e+53) || !(y <= 200000000.0)) {
		tmp = y * (y * x);
	} else {
		tmp = x + (x * (y * y));
	}
	return tmp;
}
def code(x, y):
	return x * (1.0 + (y * y))
def code(x, y):
	tmp = 0
	if (y <= -1e+53) or not (y <= 200000000.0):
		tmp = y * (y * x)
	else:
		tmp = x + (x * (y * y))
	return tmp
function code(x, y)
	return Float64(x * Float64(1.0 + Float64(y * y)))
end
function code(x, y)
	tmp = 0.0
	if ((y <= -1e+53) || !(y <= 200000000.0))
		tmp = Float64(y * Float64(y * x));
	else
		tmp = Float64(x + Float64(x * Float64(y * y)));
	end
	return tmp
end
function tmp = code(x, y)
	tmp = x * (1.0 + (y * y));
end
function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1e+53) || ~((y <= 200000000.0)))
		tmp = y * (y * x);
	else
		tmp = x + (x * (y * y));
	end
	tmp_2 = tmp;
end
code[x_, y_] := N[(x * N[(1.0 + N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
code[x_, y_] := If[Or[LessEqual[y, -1e+53], N[Not[LessEqual[y, 200000000.0]], $MachinePrecision]], N[(y * N[(y * x), $MachinePrecision]), $MachinePrecision], N[(x + N[(x * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
x \cdot \left(1 + y \cdot y\right)
\begin{array}{l}
\mathbf{if}\;y \leq -1 \cdot 10^{+53} \lor \neg \left(y \leq 200000000\right):\\
\;\;\;\;y \cdot \left(y \cdot x\right)\\

\mathbf{else}:\\
\;\;\;\;x + x \cdot \left(y \cdot y\right)\\


\end{array}

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original5.2
Target0.1
Herbie0.1
\[x + \left(x \cdot y\right) \cdot y \]

Derivation?

  1. Split input into 2 regimes
  2. if y < -9.9999999999999999e52 or 2e8 < y

    1. Initial program 19.1

      \[x \cdot \left(1 + y \cdot y\right) \]
    2. Taylor expanded in y around inf 19.1

      \[\leadsto \color{blue}{{y}^{2} \cdot x} \]
    3. Simplified0.3

      \[\leadsto \color{blue}{y \cdot \left(y \cdot x\right)} \]
      Proof

      [Start]19.1

      \[ {y}^{2} \cdot x \]

      unpow2 [=>]19.1

      \[ \color{blue}{\left(y \cdot y\right)} \cdot x \]

      associate-*l* [=>]0.3

      \[ \color{blue}{y \cdot \left(y \cdot x\right)} \]

    if -9.9999999999999999e52 < y < 2e8

    1. Initial program 0.0

      \[x \cdot \left(1 + y \cdot y\right) \]
    2. Applied egg-rr0.0

      \[\leadsto \color{blue}{x \cdot \left(y \cdot y\right) + x} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{+53} \lor \neg \left(y \leq 200000000\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x + x \cdot \left(y \cdot y\right)\\ \end{array} \]

Alternatives

Alternative 1
Error0.1
Cost713
\[\begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+55} \lor \neg \left(y \leq 1200000000\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot y + 1\right)\\ \end{array} \]
Alternative 2
Error0.9
Cost585
\[\begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
Alternative 3
Error6.0
Cost580
\[\begin{array}{l} \mathbf{if}\;y \cdot y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot y\right)\\ \end{array} \]
Alternative 4
Error0.1
Cost448
\[x + y \cdot \left(y \cdot x\right) \]
Alternative 5
Error20.6
Cost64
\[x \]

Error

Reproduce?

herbie shell --seed 2023073 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:everywhere from integration-0.2.1"
  :precision binary64

  :herbie-target
  (+ x (* (* x y) y))

  (* x (+ 1.0 (* y y))))