Metrics for sqrt sqr

start0.0ms (0%)

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

analyze10.0ms (0.7%)

Memory

-41.1MiB live, 4.0MiB allocated; 10ms 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.2s (81.5%)

Memory

68.9MiB live, 2 247.4MiB allocated; 307ms collecting garbage

Samples

714.0ms	4 206×	2	valid
259.0ms	4 050×	0	valid

Precisions

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

ival-div!: 210.0ms (27.6% of total)

ival-mult!: 208.0ms (27.3% of total)

ival-sqrt: 127.0ms (16.7% of total)

adjust: 118.0ms (15.5% of total)

ival-sub!: 100.0ms (13.1% of total)

Bogosity

preprocess95.0ms (6.3%)

Memory

-40.9MiB live, 59.1MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	16	27
1	73	19
2	207	18
3	948	18
4	6118	18

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 16 computations (0% saved)

series3.0ms (0.2%)

Memory

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

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(hole binary64 0))
#s(approx (/ x x) #s(hole binary64 1))
#s(approx x #s(hole binary64 x))
#s(approx (/ 1 x) #s(hole binary64 (/ 1 x)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(hole binary64 -1))
#s(approx (sqrt (* x x)) #s(hole binary64 (* -1 x)))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))
1.0ms	x	@	0	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))
1.0ms	x	@	inf	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

Time

Variable

Point

Expression

1.0ms

-inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

1.0ms

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

1.0ms

inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

rewrite57.0ms (3.8%)

Memory

6.6MiB live, 100.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	27	103
0	36	72
1	91	45
0	530	45

Stop Event

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

Counts

16 → 49

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)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 0))
#s(approx (/ x x) #s(hole binary64 1))
#s(approx x #s(hole binary64 x))
#s(approx (/ 1 x) #s(hole binary64 (/ 1 x)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(hole binary64 -1))
#s(approx (sqrt (* x x)) #s(hole binary64 (* -1 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))
(pow.f64 x #s(literal -1 binary64))
(/.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64))
(/.f64 (neg.f64 x) (*.f64 (neg.f64 x) x))
(/.f64 #s(literal -1 binary64) (neg.f64 x))
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x))
(/.f64 #s(literal 1 binary64) (neg.f64 (neg.f64 x)))
(/.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 (neg.f64 x) #s(literal -1 binary64)) x)
(.f64 (.f64 x (sqrt.f64 x)) (sqrt.f64 x))
(.f64 (.f64 (neg.f64 x) x) #s(literal -1 binary64))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (sqrt.f64 x) (.f64 (sqrt.f64 x) x))
(.f64 #s(literal -1 binary64) (.f64 x (neg.f64 x)))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal -1 binary64) (neg.f64 x)))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(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 x (neg.f64 x)))
(neg.f64 (*.f64 (neg.f64 x) 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)))
(+.f64 (cosh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(literal 1 binary64))
#s(approx (sqrt (* x x)) x)
#s(approx (/ 1 x) (/.f64 #s(literal 1 binary64) x))
#s(approx (* x x) (*.f64 x x))
#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)) (neg.f64 x))

eval4.0ms (0.3%)

Memory: 11.1MiB live, 11.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 263 to 183 computations (30.4% saved)

prune2.0ms (0.1%)

Memory

5.1MiB live, 5.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
▶	48.5%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
▶	54.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 20 to 20 computations (0% saved)

series0.0ms (0%)

Memory

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

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(hole binary64 0))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)
0.0ms	x	@	-inf	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)
0.0ms	x	@	inf	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

Time

Variable

Point

Expression

0.0ms

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

0.0ms

-inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

0.0ms

inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

rewrite53.0ms (3.5%)

Memory

-6.5MiB live, 85.6MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	58
0	12	42
1	58	14
0	429	14

Stop Event

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

Counts

6 → 6

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)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 0))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))

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)
#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))

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

3.4MiB live, 3.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
✓	48.5%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
✓	54.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 45 to 39 computations (13.3% saved)

regimes3.0ms (0.2%)

Memory

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

Counts

3 → 2

Calls

Call 1

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

2 calls:

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

Results

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

Compiler

Compiled 9 to 9 computations (0% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

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))

Calls

2 calls:

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
54.6%	1	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
54.6%	1	`x`

Compiler

Compiled 9 to 9 computations (0% saved)

bsearch27.0ms (1.8%)

Memory

11.5MiB live, 46.3MiB allocated; 7ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
25.0ms	-3.983274847862489e-292	6.460764053447619e-294

Samples

11.0ms	96×	2	valid
7.0ms	80×	0	valid

Compiler

Compiled 235 to 254 computations (-8.1% saved)

Precisions

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

ival-sqrt: 6.0ms (42% of total)

ival-div!: 3.0ms (21% of total)

ival-mult!: 3.0ms (21% of total)

adjust: 2.0ms (14% of total)

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

derivations10.0ms (0.6%)

Memory

-36.5MiB live, 5.9MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 21 to 15 computations (28.6% saved)

preprocess13.0ms (0.8%)

Memory: 43.7MiB live, 43.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 29 to 23 computations (20.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze10.0ms (0.7%)

sample1.2s (81.5%)

preprocess95.0ms (6.3%)

series3.0ms (0.2%)

rewrite57.0ms (3.8%)

eval4.0ms (0.3%)

prune2.0ms (0.1%)

series0.0ms (0%)

rewrite53.0ms (3.5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

regimes2.0ms (0.1%)

bsearch27.0ms (1.8%)

derivations10.0ms (0.6%)

preprocess13.0ms (0.8%)

end0.0ms (0%)

Profiling