Main:bigenough1 from B

Average Error: 0.0 → 0.0

Time: 979.0ms

Precision: binary64

Cost: 320

Math

\[x + x \cdot x \]

↓

\[x + x \cdot x \]

FPCore

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

↓

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

C

double code(double x) {
	return x + (x * x);
}

↓

double code(double x) {
	return x + (x * x);
}

Fortran

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

↓

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

Java

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

↓

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

Python

def code(x):
	return x + (x * x)

↓

def code(x):
	return x + (x * x)

Julia

function code(x)
	return Float64(x + Float64(x * x))
end

↓

function code(x)
	return Float64(x + Float64(x * x))
end

MATLAB

function tmp = code(x)
	tmp = x + (x * x);
end

↓

function tmp = code(x)
	tmp = x + (x * x);
end

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

   \[x + x \cdot x \]

2. Final simplification 0.0

   \[\leadsto x + x \cdot x \]

Alternatives

Alternative 1
Error	1.8
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -3640.325933075684:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 0.0029421815227809534:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 2
Error	0.0
Cost	320

\[x \cdot \left(x + 1\right) \]

Alternative 3
Error	21.2
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022325 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))