Metrics for FastMath test1

start0.0ms (0.0%)

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

analyze0.0ms (0.0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0.0%	0.0%	100.0%	0.0%	0.0%	0.0%	0.0%	0
100.0%	100.0%	0.0%	0.0%	0.0%	0.0%	0.0%	1

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample608.0ms (61.5%)

Memory

51.8MiB live, 1 070.7MiB allocated; 145ms collecting garbage

Samples

402.0ms

8 256×

valid

Precisions

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

ival-mult!: 99.0ms (66.2% of total)

ival-add!: 34.0ms (22.7% of total)

adjust: 17.0ms (11.4% of total)

Bogosity

preprocess29.0ms (3.0%)

Memory

-30.9MiB live, 23.7MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	11	10
1	33	10
2	86	9
3	98	9

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Symmetry

(negabs d)

Compiler

Compiled 14 to 12 computations (14.3% saved)

series13.0ms (1.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	28

Stop Event

1×	iter-limit

Counts

6 → 4

Calls

Call 1

Inputs
d
#s(literal 10 binary64)
(*.f64 d #s(literal 10 binary64))
#s(literal 20 binary64)
(*.f64 d #s(literal 20 binary64))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Outputs
#s(approx d d)
#s(approx (* d 10) (*.f64 #s(literal 10 binary64) d))
#s(approx (* d 20) (*.f64 #s(literal 20 binary64) d))
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))

Calls

3 calls:

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

rewrite273.0ms (27.6%)

Memory

25.9MiB live, 160.4MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	16
0	9	12
1	37	12
2	123	12
3	281	12
4	425	12
5	787	12
6	3463	12
0	4601	12

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

6 → 34

Calls

Call 1

Inputs
d
#s(literal 10 binary64)
(*.f64 d #s(literal 10 binary64))
#s(literal 20 binary64)
(*.f64 d #s(literal 20 binary64))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Outputs
d
#s(literal 10 binary64)
(*.f64 #s(literal -10 binary64) (neg.f64 d))
(*.f64 (neg.f64 d) #s(literal -10 binary64))
(*.f64 #s(literal 10 binary64) d)
(*.f64 d #s(literal 10 binary64))
(neg.f64 (*.f64 #s(literal -10 binary64) d))
#s(literal 20 binary64)
(*.f64 #s(literal -20 binary64) (neg.f64 d))
(*.f64 (neg.f64 d) #s(literal -20 binary64))
(*.f64 #s(literal 20 binary64) d)
(*.f64 d #s(literal 20 binary64))
(neg.f64 (*.f64 #s(literal -20 binary64) d))
(*.f64 #s(literal -30 binary64) (neg.f64 d))
(.f64 (-.f64 #s(literal 1 binary64) (/.f64 (.f64 #s(literal -10 binary64) d) (.f64 #s(literal 20 binary64) d))) (.f64 #s(literal 20 binary64) d))
(.f64 (+.f64 #s(literal 1 binary64) (/.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 20 binary64) d))) (.f64 #s(literal 20 binary64) d))
(.f64 (-.f64 #s(literal 1 binary64) (/.f64 (.f64 #s(literal -20 binary64) d) (.f64 #s(literal 10 binary64) d))) (.f64 #s(literal 10 binary64) d))
(*.f64 #s(literal 30 binary64) d)
(*.f64 (neg.f64 d) #s(literal -30 binary64))
(.f64 (+.f64 #s(literal 1 binary64) (/.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 10 binary64) d))) (.f64 #s(literal 10 binary64) d))
(*.f64 d #s(literal 30 binary64))
(/.f64 (-.f64 (.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 20 binary64) d)) (.f64 (.f64 #s(literal -10 binary64) d) (.f64 #s(literal -10 binary64) d))) (+.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal -10 binary64) d)))
(/.f64 (-.f64 (pow.f64 (.f64 #s(literal 20 binary64) d) #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal -10 binary64) d) #s(literal 3 binary64))) (+.f64 (.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 20 binary64) d)) (+.f64 (.f64 (.f64 #s(literal -10 binary64) d) (.f64 #s(literal -10 binary64) d)) (.f64 (.f64 #s(literal 20 binary64) d) (*.f64 #s(literal -10 binary64) d)))))
(/.f64 (-.f64 (.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 20 binary64) d)) (.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 10 binary64) d))) (-.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 10 binary64) d)))
(/.f64 (-.f64 (.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 10 binary64) d)) (.f64 (.f64 #s(literal -20 binary64) d) (.f64 #s(literal -20 binary64) d))) (+.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal -20 binary64) d)))
(/.f64 (+.f64 (pow.f64 (.f64 #s(literal 20 binary64) d) #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 10 binary64) d) #s(literal 3 binary64))) (+.f64 (.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 20 binary64) d)) (-.f64 (.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 10 binary64) d)) (.f64 (.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 10 binary64) d)))))
(/.f64 (-.f64 (pow.f64 (.f64 #s(literal 10 binary64) d) #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal -20 binary64) d) #s(literal 3 binary64))) (+.f64 (.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 10 binary64) d)) (+.f64 (.f64 (.f64 #s(literal -20 binary64) d) (.f64 #s(literal -20 binary64) d)) (.f64 (.f64 #s(literal 10 binary64) d) (*.f64 #s(literal -20 binary64) d)))))
(/.f64 (-.f64 (.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 10 binary64) d)) (.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 20 binary64) d))) (-.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 20 binary64) d)))
(/.f64 (+.f64 (pow.f64 (.f64 #s(literal 10 binary64) d) #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 20 binary64) d) #s(literal 3 binary64))) (+.f64 (.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 10 binary64) d)) (-.f64 (.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 20 binary64) d)) (.f64 (.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 20 binary64) d)))))
(neg.f64 (*.f64 #s(literal -30 binary64) d))
(-.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal -10 binary64) d))
(-.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal -20 binary64) d))
(+.f64 (.f64 #s(literal 20 binary64) d) (.f64 #s(literal 10 binary64) d))
(+.f64 (.f64 #s(literal 10 binary64) d) (.f64 #s(literal 20 binary64) d))

eval3.0ms (0.3%)

Memory: 5.8MiB live, 5.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 443 to 107 computations (75.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	33	1	34
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	34	1	35

Accuracy

100.0%

Counts

35 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 3 to 3 computations (0.0% saved)

series9.0ms (0.9%)

Memory

-49.7MiB live, 5.4MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10

Stop Event

1×	iter-limit

Counts

3 → 2

Calls

Call 1

Inputs
d
#s(literal 30 binary64)
(*.f64 d #s(literal 30 binary64))

Outputs
#s(approx d d)
#s(approx (* d 30) (*.f64 #s(literal 30 binary64) d))

Calls

3 calls:

Time	Variable	Point
0.0ms	d	-inf
0.0ms	d	inf
0.0ms	d	0

rewrite13.0ms (1.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	5
0	4	5
1	5	5
0	5	5

Stop Event

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

Counts

3 → 4

Calls

Call 1

Inputs
d
#s(literal 30 binary64)
(*.f64 d #s(literal 30 binary64))

Outputs
d
#s(literal 30 binary64)
(*.f64 #s(literal 30 binary64) d)
(*.f64 d #s(literal 30 binary64))

eval0.0ms (0.0%)

Memory: 0.7MiB live, 0.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 18 to 9 computations (50.0% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	4	0	4
Fresh	0	0	0
Picked	1	0	1
Done	-1	1	0
Total	4	1	5

Accuracy

100.0%

Counts

5 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 3 to 3 computations (0.0% saved)

regimes4.0ms (0.4%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 d #s(literal 30 binary64))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Outputs
(*.f64 d #s(literal 30 binary64))

Calls

2 calls:

2.0ms	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
1.0ms	d

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))`
100.0%	1	`d`

Compiler

Compiled 18 to 15 computations (16.7% saved)

derivations27.0ms (2.7%)

Memory

-27.0MiB live, 18.0MiB allocated; 7ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 3 to 3 computations (0.0% saved)

preprocess8.0ms (0.8%)

Memory: 14.3MiB live, 14.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 16 to 15 computations (6.3% saved)

end0.0ms (0.0%)

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

start0.0ms (0.0%)

analyze0.0ms (0.0%)

sample608.0ms (61.5%)

preprocess29.0ms (3.0%)

series13.0ms (1.3%)

rewrite273.0ms (27.6%)

eval3.0ms (0.3%)

prune1.0ms (0.1%)

series9.0ms (0.9%)

rewrite13.0ms (1.3%)

eval0.0ms (0.0%)

prune1.0ms (0.1%)

regimes4.0ms (0.4%)

derivations27.0ms (2.7%)

preprocess8.0ms (0.8%)

end0.0ms (0.0%)

Profiling