Metrics for Rectangular parallelepiped of dimension a×b×c

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

random

Compiler

Compiled 23 to 12 computations (47.8% saved)

sample138.0ms (34.6%)

Memory

2.9MiB live, 286.1MiB allocated; 27ms collecting garbage

Samples

55.0ms

8 256×

valid

Precisions

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

adjust: 1.0ms (112.3% of total)

Bogosity

preprocess80.0ms (20.3%)

Memory

-8.1MiB live, 37.5MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	1
1	64	1
2	264	1
3	1381	1

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))

Status

Accuracy

Program

▶

100.0%

(*.f64 #s(literal 2 binary64) (+.f64 (+.f64 (*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))

Compiler

Compiled 42 to 20 computations (52.4% saved)

series4.0ms (1.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0

Stop Event

1×

saturated

Counts

10 → 0

Calls

Call 1

Inputs
(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))
#s(literal 2 binary64)
(+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
#s(literal 9 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))

Outputs

rewrite109.0ms (27.3%)

Memory

-2.7MiB live, 182.2MiB allocated; 30ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	10
0	28	10
1	32	10
2	57	10
3	155	10
4	684	10
0	4023	10

Stop Event

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

Counts

10 → 10

Calls

Call 1

Inputs
(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))
#s(literal 2 binary64)
(+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
#s(literal 9 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))

Outputs
#s(literal 38/81 binary64)
#s(literal 2 binary64)
#s(literal 19/81 binary64)
#s(literal 10/81 binary64)
#s(literal 1/9 binary64)
#s(literal 1 binary64)
#s(literal 1/9 binary64)
#s(literal 9 binary64)
#s(literal 1/81 binary64)
#s(literal 1/9 binary64)

eval1.0ms (0.2%)

Memory: 1.8MiB live, 1.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 45 to 21 computations (53.3% saved)

prune0.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accuracy

100.0%

Counts

6 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(literal 38/81 binary64)

Compiler

Compiled 1 to 1 computations (0% saved)

series1.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0

Stop Event

1×

saturated

Counts

1 → 0

Calls

Call 1

Inputs
#s(literal 38/81 binary64)

Outputs

rewrite6.0ms (1.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated
1×	saturated

Counts

1 → 1

Calls

Call 1

Inputs
#s(literal 38/81 binary64)

Outputs
#s(literal 38/81 binary64)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 0 computations (0% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(literal 38/81 binary64)

Compiler

Compiled 23 to 12 computations (47.8% saved)

derivations39.0ms (9.9%)

Memory

-26.1MiB live, 34.5MiB allocated; 28ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 1 to 1 computations (0% saved)

preprocess17.0ms (4.2%)

Memory: 6.4MiB live, 54.7MiB allocated; 5ms collecting garbage
Compiler: Compiled 47 to 23 computations (51.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample138.0ms (34.6%)

preprocess80.0ms (20.3%)

series4.0ms (1.1%)

rewrite109.0ms (27.3%)

eval1.0ms (0.2%)

prune0.0ms (0.1%)

series1.0ms (0.3%)

rewrite6.0ms (1.6%)

eval0.0ms (0%)

prune1.0ms (0.2%)

derivations39.0ms (9.9%)

preprocess17.0ms (4.2%)

end0.0ms (0%)

Profiling