Main:i from

Time bar (total: 777.0ms)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 11 to 7 computations (36.4% saved)

sample522.0ms (67.3%)

Memory
8.3MiB live, 714.2MiB allocated; 163ms collecting garbage
Samples
309.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 85.0ms
ival-add!: 84.0ms (98.4% of total)
adjust: 1.0ms (1.2% of total)
Bogosity

explain83.0ms (10.7%)

Memory
-32.3MiB live, 131.0MiB allocated; 29ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
00-0-(+.f64 x x)
00-0-(+.f64 (+.f64 (+.f64 x x) x) x)
00-0-(+.f64 (+.f64 x x) x)
00-0-x
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
15.0ms512×0valid
Compiler

Compiled 63 to 19 computations (69.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 4.0ms
ival-add!: 4.0ms (97.3% of total)
adjust: 0.0ms (0% of total)

preprocess68.0ms (8.8%)

Memory
-19.8MiB live, 27.2MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 3 (0.0ms)

IterNodesCost
01130
12817
27010
31519
43229
54599
612119
737859
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
Symmetry

(negabs x)

Compiler

Compiled 18 to 10 computations (44.4% saved)

series3.0ms (0.4%)

Memory
6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Counts
5 → 5
Calls
Call 1
Inputs
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
(+.f64 (+.f64 (+.f64 x x) x) x)
(+.f64 (+.f64 x x) x)
(+.f64 x x)
x
Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx (+ (+ (+ x x) x) x) #s(hole binary64 (* 4 x)))
#s(approx (+ (+ x x) x) #s(hole binary64 (* 3 x)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@-inf
((+ (+ (+ (+ x x) x) x) x) (+ (+ (+ x x) x) x) (+ (+ x x) x) (+ x x) x)
1.0ms
x
@inf
((+ (+ (+ (+ x x) x) x) x) (+ (+ (+ x x) x) x) (+ (+ x x) x) (+ x x) x)
1.0ms
x
@0
((+ (+ (+ (+ x x) x) x) x) (+ (+ (+ x x) x) x) (+ (+ x x) x) (+ x x) x)

rewrite39.0ms (5.1%)

Memory
10.8MiB live, 60.3MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02268
02768
07762
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
10 → 29
Calls
Call 1
Inputs
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
(+.f64 (+.f64 (+.f64 x x) x) x)
(+.f64 (+.f64 x x) x)
(+.f64 x x)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx (+ (+ (+ x x) x) x) #s(hole binary64 (* 4 x)))
#s(approx (+ (+ x x) x) #s(hole binary64 (* 3 x)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
Outputs
(/.f64 (-.f64 (*.f64 (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x))) (*.f64 x x)) (-.f64 (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) x))
(/.f64 (+.f64 (pow.f64 (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) (-.f64 (*.f64 x x) (*.f64 (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) x))))
(+.f64 (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)) x)
(+.f64 (fma.f64 #s(literal 2 binary64) x x) (*.f64 #s(literal 2 binary64) x))
(+.f64 x (fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x)))
(/.f64 (-.f64 (*.f64 (fma.f64 #s(literal 2 binary64) x x) (fma.f64 #s(literal 2 binary64) x x)) (*.f64 x x)) (-.f64 (fma.f64 #s(literal 2 binary64) x x) x))
(/.f64 (+.f64 (pow.f64 (fma.f64 #s(literal 2 binary64) x x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (fma.f64 #s(literal 2 binary64) x x) (fma.f64 #s(literal 2 binary64) x x) (-.f64 (*.f64 x x) (*.f64 (fma.f64 #s(literal 2 binary64) x x) x))))
(fma.f64 #s(literal 2 binary64) x (*.f64 #s(literal 2 binary64) x))
(fma.f64 x #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x))
(+.f64 (fma.f64 #s(literal 2 binary64) x x) x)
(+.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(+.f64 x (fma.f64 #s(literal 2 binary64) x x))
(/.f64 (-.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x)) (*.f64 x x)) (-.f64 (*.f64 #s(literal 2 binary64) x) x))
(/.f64 (+.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x) (-.f64 (*.f64 x x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))))
(fma.f64 #s(literal 2 binary64) x x)
(fma.f64 x #s(literal 2 binary64) x)
(+.f64 (*.f64 #s(literal 2 binary64) x) x)
(+.f64 x (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (-.f64 (*.f64 x x) (*.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 x x) (*.f64 x x))))
(+.f64 x x)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
#s(approx (+ (+ (+ x x) x) x) (*.f64 #s(literal 4 binary64) x))
#s(approx (+ (+ x x) x) (*.f64 #s(literal 3 binary64) x))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))
#s(approx x x)

eval3.0ms (0.3%)

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

Compiled 409 to 117 computations (71.4% saved)

prune1.0ms (0.1%)

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

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New27128
Fresh000
Picked101
Done000
Total28129
Accuracy
100.0%
Counts
29 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
Compiler

Compiled 13 to 8 computations (38.5% saved)

series2.0ms (0.3%)

Memory
3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Counts
4 → 3
Calls
Call 1
Inputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(*.f64 #s(literal 5 binary64) x)
#s(literal 5 binary64)
x
Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx (* 5 x) #s(hole binary64 (* 5 x)))
#s(approx x #s(hole binary64 x))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@-inf
((+ (+ (+ (+ x x) x) x) x) (* 5 x) 5 x)
1.0ms
x
@inf
((+ (+ (+ (+ x x) x) x) x) (* 5 x) 5 x)
1.0ms
x
@0
((+ (+ (+ (+ x x) x) x) x) (* 5 x) 5 x)

rewrite40.0ms (5.1%)

Memory
-16.0MiB live, 31.5MiB allocated; 1ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
01241
01241
15929
068329
Stop Event
iter-limit
iter-limit
node-limit
iter-limit
Counts
7 → 8
Calls
Call 1
Inputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(*.f64 #s(literal 5 binary64) x)
#s(literal 5 binary64)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) #s(hole binary64 (* 5 x)))
#s(approx (* 5 x) #s(hole binary64 (* 5 x)))
#s(approx x #s(hole binary64 x))
Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(*.f64 #s(literal 5 binary64) x)
(*.f64 x #s(literal 5 binary64))
#s(literal 5 binary64)
x
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
#s(approx (* 5 x) (*.f64 #s(literal 5 binary64) x))
#s(approx x x)

eval0.0ms (0%)

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

Compiled 45 to 16 computations (64.4% saved)

prune1.0ms (0.1%)

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

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New303
Fresh000
Picked011
Done000
Total314
Accuracy
100.0%
Counts
4 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
Compiler

Compiled 35 to 20 computations (42.9% saved)

regimes3.0ms (0.3%)

Memory
5.8MiB live, 5.8MiB allocated; 0ms collecting garbage
Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
2 → 1
Calls
Call 1
Inputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
Outputs
#s(approx (+ (+ (+ (+ x x) x) x) x) (*.f64 #s(literal 5 binary64) x))
Calls

2 calls:

1.0ms
x
1.0ms
(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
Results
AccuracySegmentsBranch
100.0%1(+.f64 (+.f64 (+.f64 (+.f64 x x) x) x) x)
100.0%1x
Compiler

Compiled 10 to 6 computations (40% saved)

derivations1.0ms (0.1%)

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

Compiled 13 to 8 computations (38.5% saved)

preprocess10.0ms (1.3%)

Memory
19.3MiB live, 19.3MiB allocated; 0ms collecting garbage
Remove

(negabs x)

Compiler

Compiled 70 to 42 computations (40% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...