Rectangular parallelepiped of dimension a×b×c

Time bar (total: 1.7s)

start0.0ms (0%)

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

analyze0.0ms (0%)

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

Compiled 23 to 12 computations (47.8% saved)

sample1.3s (77.8%)

Memory
-5.3MiB live, 1 570.9MiB allocated; 408ms collecting garbage
Samples
844.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 662.0ms
ival-mult: 335.0ms (50.6% of total)
ival-add: 182.0ms (27.5% of total)
ival-div: 124.0ms (18.7% of total)
exact: 11.0ms (1.7% of total)
ival-true: 5.0ms (0.8% of total)
ival-assert: 3.0ms (0.5% of total)
adjust: 2.0ms (0.3% of total)
Bogosity

explain174.0ms (10.5%)

Memory
21.8MiB live, 164.9MiB allocated; 11ms 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
68.0ms512×0valid
Compiler

Compiled 177 to 34 computations (80.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 56.0ms
ival-mult: 46.0ms (81.5% of total)
ival-div: 5.0ms (8.9% of total)
ival-add: 4.0ms (7.1% of total)
exact: 1.0ms (1.8% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess55.0ms (3.3%)

Memory
-35.3MiB live, 15.2MiB allocated; 5ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
000
0101
0281
1311
0311
Stop Event
saturated
saturated
iter limit
saturated
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))))
Outputs
(*.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 38/81 binary64)
Compiler

Compiled 21 to 10 computations (52.4% saved)

eval0.0ms (0%)

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

Compiled 0 to 0 computations (0% saved)

prune0.0ms (0%)

Memory
0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
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 21 to 10 computations (52.4% saved)

simplify4.0ms (0.2%)

Memory
4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Localize:

Found 4 expressions of interest:

NewMetricScoreProgram
cost-diff2
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
cost-diff2
(+.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))))
cost-diff2
(+.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)))
cost-diff2
(*.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))))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01010
02810
13110
03110
Stop Event
saturated
saturated
iter limit
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
(*.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 38/81 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)))
#s(literal 19/81 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))))
#s(literal 10/81 binary64)
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
#s(literal 1/9 binary64)
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
#s(literal 1/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)))
#s(literal 1/81 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
#s(literal 1/9 binary64)

localize36.0ms (2.2%)

Memory
-9.4MiB live, 33.5MiB allocated; 8ms collecting garbage
Localize:

Found 4 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
accuracy0.0
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
accuracy0.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))))
accuracy0.0
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
Samples
16.0ms256×0valid
Compiler

Compiled 78 to 12 computations (84.6% saved)

Precisions
Click to see histograms. Total time spent on operations: 11.0ms
ival-mult: 6.0ms (55% of total)
ival-div: 2.0ms (18.3% of total)
ival-add: 2.0ms (18.3% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Counts
6 → 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))))
(+.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)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
Outputs

simplify2.0ms (0.1%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
000
000
Stop Event
saturated
saturated
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

rewrite13.0ms (0.8%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
0106
0286
1326
2336
0336
Stop Event
saturated
saturated
iter limit
Counts
6 → 6
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))))
(+.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)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
Outputs
#s(literal 38/81 binary64)
#s(literal 19/81 binary64)
#s(literal 10/81 binary64)
#s(literal 1/9 binary64)
#s(literal 1/9 binary64)
#s(literal 1/81 binary64)

eval1.0ms (0%)

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

Compiled 45 to 21 computations (53.3% saved)

prune0.0ms (0%)

Memory
0.6MiB live, 0.6MiB 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)

simplify3.0ms (0.2%)

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

Useful iterations: 0 (0.0ms)

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

localize9.0ms (0.6%)

Memory
12.4MiB live, 12.4MiB allocated; 0ms collecting garbage
Samples
6.0ms256×0valid
Compiler

Compiled 3 to 3 computations (0% saved)

Precisions
Click to see histograms. Total time spent on operations: 4.0ms
const: 4.0ms (105.2% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

simplify2.0ms (0.1%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
000
000
Stop Event
saturated
saturated
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

rewrite5.0ms (0.3%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
000
000
000
Stop Event
saturated
saturated
saturated
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

eval0.0ms (0%)

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

Compiled 0 to 0 computations (0% saved)

prune1.0ms (0%)

Memory
1.5MiB live, 1.5MiB 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)

simplify15.0ms (0.9%)

Memory
-22.2MiB live, 21.2MiB allocated; 6ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

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

derivations6.0ms (0.4%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
0106
0286
1326
2336
0336
Stop Event
done
saturated
saturated
iter limit
Compiler

Compiled 1 to 1 computations (0% saved)

preprocess42.0ms (2.5%)

Memory
-22.7MiB live, 23.2MiB allocated; 4ms collecting garbage
Compiler

Compiled 94 to 46 computations (51.1% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...