Numeric.Log:$clog1p from log-domain-0.10.2.1, A

Percentage Accurate: 100.0% → 100.0%

Time: 3.0s

Precision: binary64

Cost: 576

• 44.0% of points produce a very large (infinite) output. You may want to add a precondition.

Math

\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]

↓

\[x \cdot \left(x + 2\right) + y \cdot y \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x 2.0) (* x x)) (* y y)))

↓

(FPCore (x y) :precision binary64 (+ (* x (+ x 2.0)) (* y y)))

C

double code(double x, double y) {
	return ((x * 2.0) + (x * x)) + (y * y);
}

↓

double code(double x, double y) {
	return (x * (x + 2.0)) + (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * 2.0d0) + (x * x)) + (y * y)
end function

↓

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * (x + 2.0d0)) + (y * y)
end function

Java

public static double code(double x, double y) {
	return ((x * 2.0) + (x * x)) + (y * y);
}

↓

public static double code(double x, double y) {
	return (x * (x + 2.0)) + (y * y);
}

Python

def code(x, y):
	return ((x * 2.0) + (x * x)) + (y * y)

↓

def code(x, y):
	return (x * (x + 2.0)) + (y * y)

Julia

function code(x, y)
	return Float64(Float64(Float64(x * 2.0) + Float64(x * x)) + Float64(y * y))
end

↓

function code(x, y)
	return Float64(Float64(x * Float64(x + 2.0)) + Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * 2.0) + (x * x)) + (y * y);
end

↓

function tmp = code(x, y)
	tmp = (x * (x + 2.0)) + (y * y);
end

Wolfram

code[x_, y_] := N[(N[(N[(x * 2.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_] := N[(N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]

Target

Original	100.0%
Target	100.0%
Herbie	100.0%

\[y \cdot y + \left(2 \cdot x + x \cdot x\right) \]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]

2. Simplified 100.0%

   \[\leadsto \color{blue}{x \cdot \left(2 + x\right) + y \cdot y} \]
   Step-by-step derivation

   [Start] 100.0%	\[ \left(x \cdot 2 + x \cdot x\right) + y \cdot y \]
   distribute-lft-out [=>] 100.0%	\[ \color{blue}{x \cdot \left(2 + x\right)} + y \cdot y \]

3. Final simplification 100.0%

   \[\leadsto x \cdot \left(x + 2\right) + y \cdot y \]

Alternatives

Alternative 1
Accuracy	100.0%
Cost	576

\[x \cdot \left(x + 2\right) + y \cdot y \]

Alternative 2
Accuracy	98.9%
Cost	713

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

Alternative 3
Accuracy	90.2%
Cost	712

\[\begin{array}{l} \mathbf{if}\;x \leq -125:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 1.6 \cdot 10^{+59}:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 4
Accuracy	72.8%
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -125:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+38}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 5
Accuracy	43.1%
Cost	192

\[x \cdot x \]

Reproduce

herbie shell --seed 2023244 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

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

  (+ (+ (* x 2.0) (* x x)) (* y y)))