Rectangular parallelepiped of dimension a×b×c

Time bar (total: 568.0ms)

start0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Algorithm
random
Compiler

Compiled 23 to 12 computations (47.8% saved)

sample229.0ms (40.3%)

Memory
12.5MiB live, 347.2MiB allocated; 74ms collecting garbage
Samples
147.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 1.0ms
adjust: 1.0ms (106.1% of total)
Bogosity

explain90.0ms (15.8%)

Memory
-21.5MiB live, 169.5MiB allocated; 13ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
00-0-#s(literal 1 binary64)
00-0-(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
00-0-#s(literal 9 binary64)
00-0-(+.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)))
00-0-(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
00-0-#s(literal 2 binary64)
00-0-(+.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))))
00-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))))
00-0-(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
10.0ms512×0valid
Compiler

Compiled 177 to 34 computations (80.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
adjust: 0.0ms (0% of total)

preprocess136.0ms (24%)

Memory
-10.3MiB live, 36.4MiB allocated; 2ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0151
1501
21521
34581
418791
557801
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
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)

series0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
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

rewrite26.0ms (4.5%)

Memory
41.7MiB live, 41.7MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01010
02810
13210
04610
Stop Event
saturated
iter-limit
iter-limit
unsound
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.1%)

Memory
1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Compiler

Compiled 45 to 21 computations (53.3% saved)

prune0.0ms (0.1%)

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

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New415
Fresh000
Picked101
Done000
Total516
Accuracy
100.0%
Counts
6 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(literal 38/81 binary64)
Compiler

Compiled 1 to 1 computations (0% saved)

series0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Counts
1 → 0
Calls
Call 1
Inputs
#s(literal 38/81 binary64)
Outputs

rewrite68.0ms (11.9%)

Memory
-41.3MiB live, 4.2MiB allocated; 80ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
011
011
011
Stop Event
saturated
saturated
saturated
Counts
1 → 1
Calls
Call 1
Inputs
#s(literal 38/81 binary64)
Outputs
#s(literal 38/81 binary64)

eval0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler

Compiled 0 to 0 computations (0% saved)

prune8.0ms (1.5%)

Memory
11.7MiB live, 11.7MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(literal 38/81 binary64)
Compiler

Compiled 23 to 12 computations (47.8% saved)

derivations1.0ms (0.2%)

Memory
2.6MiB live, 2.6MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 1 to 1 computations (0% saved)

preprocess8.0ms (1.5%)

Memory
20.2MiB live, 20.2MiB allocated; 0ms collecting garbage
Compiler

Compiled 44 to 22 computations (50% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...