Rectangular parallelepiped of dimension a×b×c

Time bar (total: 1.6s)

start0.0ms (0%)

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

analyze0.0ms (0%)

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

Compiled 23 to 12 computations (47.8% saved)

sample830.0ms (53.4%)

Memory
37.2MiB live, 930.6MiB allocated; 181ms collecting garbage
Samples
588.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 363.0ms
ival-mult: 172.0ms (47.4% of total)
ival-div: 105.0ms (29% of total)
ival-add: 67.0ms (18.5% of total)
exact: 10.0ms (2.8% of total)
ival-true: 5.0ms (1.4% of total)
ival-assert: 3.0ms (0.8% of total)
adjust: 2.0ms (0.6% of total)
Bogosity

explain185.0ms (11.9%)

Memory
-36.0MiB live, 265.1MiB allocated; 68ms 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
33.0ms512×0valid
Compiler

Compiled 177 to 34 computations (80.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 21.0ms
ival-mult: 11.0ms (51.7% of total)
ival-div: 5.0ms (23.5% of total)
ival-add: 4.0ms (18.8% of total)
exact: 1.0ms (4.7% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess158.0ms (10.2%)

Memory
-0.3MiB live, 144.4MiB allocated; 16ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
000
0101
0281
1311
2351
3461
4961
53921
637841
080991
Stop Event
iter limit
node limit
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.9MiB live, 0.9MiB 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)

simplify168.0ms (10.8%)

Memory
36.4MiB live, 212.6MiB allocated; 29ms 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
23510
34610
49610
539210
6378410
0809910
Stop Event
iter limit
node limit
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)

localize73.0ms (4.7%)

Memory
-33.0MiB live, 113.2MiB allocated; 58ms 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
56.0ms256×0valid
Compiler

Compiled 78 to 12 computations (84.6% saved)

Precisions
Click to see histograms. Total time spent on operations: 50.0ms
ival-mult: 45.0ms (89.8% of total)
ival-div: 2.0ms (4% of total)
ival-add: 2.0ms (4% 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.8MiB live, 0.8MiB 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

simplify3.0ms (0.2%)

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

rewrite28.0ms (1.8%)

Memory
-0.4MiB live, 45.0MiB allocated; 8ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0106
0286
1326
0466
Stop Event
saturated
iter limit
iter limit
unsound
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)

eval2.0ms (0.1%)

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

Compiled 45 to 21 computations (53.3% saved)

prune0.0ms (0%)

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

localize13.0ms (0.8%)

Memory
-10.3MiB live, 31.9MiB allocated; 5ms 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 (103.1% 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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

simplify2.0ms (0.2%)

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

rewrite6.0ms (0.4%)

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

simplify48.0ms (3.1%)

Memory
-1.6MiB live, 49.5MiB allocated; 44ms 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)

derivations1.0ms (0.1%)

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

Compiled 1 to 1 computations (0% saved)

preprocess33.0ms (2.1%)

Memory
13.6MiB live, 50.9MiB allocated; 22ms 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...