Metrics for sqrt sqr

start0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated; 0ms collecting garbage

analyze2.0ms (0.1%)

Memory

5.6MiB live, 5.6MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 14 to 10 computations (28.6% saved)

sample1.3s (84.1%)

Memory

-30.4MiB live, 2 030.0MiB allocated; 462ms collecting garbage

Samples

661.0ms	4 138×	2	valid
336.0ms	4 118×	0	valid

Precisions

Click to see histograms. Total time spent on operations: 776.0ms

ival-div!: 292.0ms (37.6% of total)

ival-mult!: 144.0ms (18.6% of total)

adjust: 119.0ms (15.3% of total)

ival-sqrt: 117.0ms (15.1% of total)

ival-sub!: 103.0ms (13.3% of total)

Bogosity

preprocess43.0ms (2.8%)

Memory

-0.3MiB live, 45.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	16	26
1	87	19
2	386	15
3	3509	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	48.1%	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Compiler

Compiled 24 to 16 computations (33.3% saved)

series7.0ms (0.5%)

Memory

17.2MiB live, 17.2MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	68

Stop Event

1×	iter-limit

Counts

8 → 8

Calls

Call 1

Inputs
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(/.f64 x x)
x
(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
(/.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
(sqrt.f64 (*.f64 x x))
(*.f64 x x)

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (/ x x) #s(literal 1 binary64))
#s(approx x x)
#s(approx (/ 1 x) (/.f64 #s(literal 1 binary64) x))
#s(approx (* x x) (pow.f64 x #s(literal 2 binary64)))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(literal -1 binary64))
#s(approx (sqrt (* x x)) (*.f64 #s(literal -1 binary64) x))

Calls

3 calls:

Time	Variable	Point
2.0ms	x	-inf
1.0ms	x	0
1.0ms	x	inf

rewrite55.0ms (3.6%)

Memory

32.5MiB live, 77.2MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	35
0	14	19
1	77	12
0	679	12

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

8 → 41

Calls

Call 1

Inputs
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(/.f64 x x)
x
(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
(/.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
(sqrt.f64 (*.f64 x x))
(*.f64 x x)

Outputs
#s(literal 0 binary64)
#s(literal 1 binary64)
x
#s(literal 1 binary64)
(*.f64 (pow.f64 x #s(literal -1/2 binary64)) (pow.f64 x #s(literal -1/2 binary64)))
(*.f64 #s(literal -1 binary64) (/.f64 #s(literal -1 binary64) x))
(*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))
(.f64 x (.f64 (/.f64 #s(literal 1 binary64) x) (/.f64 #s(literal 1 binary64) x)))
(*.f64 x (/.f64 (/.f64 #s(literal 1 binary64) x) x))
(pow.f64 x #s(literal -1 binary64))
(/.f64 (.f64 (neg.f64 x) #s(literal -1 binary64)) (.f64 x x))
(/.f64 (.f64 x #s(literal -1 binary64)) (.f64 x (neg.f64 x)))
(/.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) x))
(/.f64 (neg.f64 x) (*.f64 (neg.f64 x) x))
(/.f64 #s(literal -1 binary64) (*.f64 #s(literal 1 binary64) (neg.f64 x)))
(/.f64 #s(literal -1 binary64) (neg.f64 x))
(/.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64))
(/.f64 #s(literal 1 binary64) (neg.f64 (neg.f64 x)))
(/.f64 #s(literal 1 binary64) (pow.f64 x #s(literal 1 binary64)))
(/.f64 #s(literal 1 binary64) x)
(/.f64 x (*.f64 x x))
(neg.f64 (/.f64 #s(literal -1 binary64) x))
(exp.f64 (*.f64 (log.f64 x) #s(literal -1 binary64)))
#s(literal 1 binary64)
x
(.f64 (.f64 x (sqrt.f64 x)) (sqrt.f64 x))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (sqrt.f64 x) (.f64 (sqrt.f64 x) x))
(*.f64 x x)
(pow.f64 (.f64 (.f64 x x) (*.f64 x x)) #s(literal 1/2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(sqrt.f64 (.f64 (.f64 x x) (*.f64 x x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))

eval10.0ms (0.7%)

Memory: -32.4MiB live, 12.4MiB allocated; 6ms collecting garbage
Compiler: Compiled 627 to 177 computations (71.8% saved)

prune2.0ms (0.1%)

Memory

4.1MiB live, 4.1MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	41	2	43
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	42	2	44

Accuracy

100.0%

Counts

44 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
▶	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 28 to 20 computations (28.6% saved)

series3.0ms (0.2%)

Memory

7.1MiB live, 7.1MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	28

Stop Event

1×	iter-limit

Counts

4 → 2

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

Calls

3 calls:

Time	Variable	Point
1.0ms	x	inf
1.0ms	x	-inf
1.0ms	x	0

rewrite78.0ms (5.1%)

Memory

-16.4MiB live, 76.8MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	30
0	12	22
1	75	8
0	713	8

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	saturated

Counts

4 → 4

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune1.0ms (0%)

Memory

1.4MiB live, 1.4MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	2	2
Done	0	0
Total	2	2

Accuracy

100.0%

Counts

2 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
✓	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 28 to 20 computations (28.6% saved)

regimes5.0ms (0.3%)

Memory

13.1MiB live, 13.1MiB allocated; 0ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

3 → 2

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Call 2

Inputs

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

(-.f64 (/.f64 x x) (*.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (*.f64 x x))))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Calls

4 calls:

1.0ms	x
1.0ms	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
1.0ms	x
1.0ms	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Results

Accuracy	Segments	Branch
51.6%	1	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
51.6%	1	`x`
89.4%	2	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
100.0%	2	`x`

Compiler

Compiled 66 to 37 computations (43.9% saved)

bsearch25.0ms (1.6%)

Memory

-13.9MiB live, 31.2MiB allocated; 7ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
16.0ms	-6.479982857435719e-306	1.1265029774190083e-305

Samples

7.0ms	64×	2	valid
4.0ms	80×	0	valid

Compiler

Compiled 267 to 210 computations (21.3% saved)

Precisions

Click to see histograms. Total time spent on operations: 8.0ms

ival-div!: 2.0ms (25.3% of total)

ival-sqrt: 2.0ms (25.3% of total)

ival-mult!: 2.0ms (25.3% of total)

adjust: 1.0ms (12.7% of total)

ival-sub!: 1.0ms (12.7% of total)

derivations1.0ms (0.1%)

Memory

1.5MiB live, 1.5MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 46 to 15 computations (67.4% saved)

preprocess13.0ms (0.8%)

Memory: 27.0MiB live, 27.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 58 to 23 computations (60.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze2.0ms (0.1%)

sample1.3s (84.1%)

preprocess43.0ms (2.8%)

series7.0ms (0.5%)

rewrite55.0ms (3.6%)

eval10.0ms (0.7%)

prune2.0ms (0.1%)

series3.0ms (0.2%)

rewrite78.0ms (5.1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes5.0ms (0.3%)

bsearch25.0ms (1.6%)

derivations1.0ms (0.1%)

preprocess13.0ms (0.8%)

end0.0ms (0%)

Profiling