-
Notifications
You must be signed in to change notification settings - Fork 0
/
OUT
2426 lines (2426 loc) · 279 KB
/
OUT
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
scala -cp classes DPLL tests/integration/sat/aim-50-1_6-yes1-1.cnf
NOT TRIMMING UNIQUE VARS!!! CHANGE THIS!!!
Vars:List(-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Clauses: x4 x27 x40 AND x4 not(x27) x40 AND x9 x29 not(x40) AND x4 not(x9) not(x40) AND not(x4) x24 x29 AND not(x4) not(x24) x29 AND x10 not(x29) not(x32) AND not(x10) not(x29) not(x32) AND x6 not(x29) x32 AND not(x6) x13 x32 AND not(x3) not(x6) not(x13) AND x3 not(x13) not(x28) AND not(x0) not(x13) x31 AND not(x0) x3 not(x31) AND x0 x23 x28 AND x0 not(x23) not(x33) AND not(x5) not(x23) x33 AND x5 not(x23) x37 AND x5 not(x31) not(x37) AND x31 x43 x47 AND not(x37) not(x43) x47 AND x21 x28 not(x47) AND x21 not(x28) x31 AND not(x21) not(x24) not(x47) AND not(x21) x24 x39 AND x17 not(x21) not(x39) AND not(x17) x19 not(x39) AND not(x17) x27 not(x39) AND not(x17) not(x27) x38 AND not(x27) x34 not(x38) AND not(x34) not(x38) x42 AND not(x34) not(x42) not(x49) AND not(x42) not(x44) x49 AND x30 x44 x49 AND not(x30) not(x43) x44 AND not(x14) x43 x48 AND not(x14) not(x30) not(x48) AND x14 not(x30) x35 AND x14 x22 not(x35) AND not(x22) not(x35) x45 AND x19 x26 not(x45) AND not(x19) not(x22) x26 AND not(x15) not(x26) not(x45) AND x15 x25 not(x26) AND x15 x16 not(x25) AND x1 x12 not(x16) AND x1 not(x12) not(x25) AND not(x4) not(x16) not(x25) AND not(x1) not(x16) x41 AND not(x1) x11 not(x12) AND not(x1) not(x11) not(x41) AND x7 x12 not(x41) AND not(x7) not(x9) x12 AND x2 not(x7) x9 AND not(x2) x9 not(x36) AND not(x2) x9 not(x46) AND x9 x18 x46 AND not(x11) not(x18) x46 AND x11 not(x18) x20 AND x8 not(x18) not(x20) AND not(x8) not(x10) not(x20) AND not(x8) x10 not(x48) AND x10 x40 x48 AND x18 not(x31) x36 AND not(x0) x38 not(x49) AND x7 x16 x39 AND x37 x42 x48 AND x22 x41 not(x46) AND not(x12) not(x28) x36 AND not(x33) x36 not(x46) AND not(x32) not(x36) x49 AND not(x5) x13 x33 AND x8 not(x19) not(x49) AND x34 x35 x37 AND x2 x30 x45 AND x6 not(x15) x20 AND not(x5) x16 x25 AND x22 x23 x45 AND x17 x23 not(x44) AND not(x3) not(x5) x6
Trying: (0,true)
Propogating:List(1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true))
Trying: (1,true)
Propogating:List(1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true))
Trying: (2,true)
Propogating:List(1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true))
Trying: (3,true)
Propogating:List(1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true))
Trying: (4,true)
Propogating:List(1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true))
Trying: (5,true)
Propogating:List(1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:not(x6) x13 x32 ; Literal: x32
Found unit clause:not(x5) x13 x33 ; Literal: x33
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true))
Trying: (7,true)
Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true))
Trying: (8,true)
Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(8,true) (7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,true))
Trying: (9,true)
Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x7) not(x9) x12 ; Literal: x12
Found unit clause:not(x1) x11 not(x12) ; Literal: x11
Found unit clause:not(x1) not(x11) not(x41) ; Literal: not(x41)
Found unit clause:not(x1) not(x16) x41 ; Literal: not(x16)
Found unit clause:not(x5) x16 x25 ; Literal: x25
Found unit clause:x15 x16 not(x25) ; Literal: x15
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(9,true) (8,true) (7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (16,false) (15,true) (32,true) (41,false) (33,true) (12,true) (3,true) (1,true) (7,true) (25,true) (11,true) (13,false) (9,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (13,false)->(33,true) (7,true)->(12,true) (1,true)->(16,false) (9,true)->(12,true) (25,true)->(15,true) (16,false)->(25,true) (16,false)->(15,true) (13,false)->(32,true) (5,true)->(25,true) (1,true)->(11,true) (3,true)->(6,true) (41,false)->(16,false) (3,true)->(13,false) (11,true)->(41,false) (12,true)->(11,true) (6,true)->(13,false) (1,true)->(41,false) }
VarVals=List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,true), (9,true))
Trying: (10,true)
Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x29)
Found unit clause:not(x8) not(x10) not(x20) ; Literal: not(x20)
Found unit clause:not(x4) x24 x29 ; Literal: x24
Found unit clause:not(x4) not(x24) x29 ; Literal: not(x24)
Bad clause:not(x4) x24 x29
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, -1, 1, 0, -1, -1, -1, 0, -1, -1, -1, 0, 1, -1, -1, -1, 0, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (4,true) (5,true) (6,true) (16,false) (15,true) (32,true) (24,false) (41,false) (33,true) (12,true) (3,true) (1,true) (29,false) (20,false) (24,true) (7,true) (25,true) (10,true) (11,true) (13,false) (8,true) (9,true) } Edges: { (32,true)->(29,false) (5,true)->(6,true) (13,false)->(33,true) (25,true)->(15,true) (4,true)->(24,true) (16,false)->(25,true) (10,true)->(29,false) (1,true)->(11,true) (3,true)->(13,false) (29,false)->(24,false) (12,true)->(11,true) (1,true)->(41,false) (6,true)->(32,true) (10,true)->(20,false) (5,true)->(33,true) (29,false)->(24,true) (7,true)->(12,true) (1,true)->(16,false) (9,true)->(12,true) (16,false)->(15,true) (13,false)->(32,true) (5,true)->(25,true) (41,false)->(16,false) (3,true)->(6,true) (11,true)->(41,false) (8,true)->(20,false) (4,true)->(24,false) (6,true)->(13,false) }
Found resolution clause: not(x4) x29
Added clause: not(x4) x29
DEDUCING
Stack=(9,true) (8,true) (7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (16,false) (15,true) (32,true) (41,false) (33,true) (12,true) (3,true) (1,true) (7,true) (25,true) (11,true) (13,false) (9,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (13,false)->(33,true) (7,true)->(12,true) (1,true)->(16,false) (9,true)->(12,true) (25,true)->(15,true) (16,false)->(25,true) (16,false)->(15,true) (13,false)->(32,true) (5,true)->(25,true) (1,true)->(11,true) (3,true)->(6,true) (41,false)->(16,false) (3,true)->(13,false) (11,true)->(41,false) (12,true)->(11,true) (6,true)->(13,false) (1,true)->(41,false) }
VarVals=List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,true), (9,true))
Trying: (10,false)
Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x10 not(x29) not(x32) ; Literal: not(x29)
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Found unit clause:not(x4) x29 ; Literal: x29
Bad clause:x10 not(x29) not(x32)
Found unit clause:x10 x40 x48 ; Literal: x40
Bad clause:x10 not(x29) not(x32)
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, 1, 0, -1, -1, -1, -1, -1, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (4,true) (5,true) (6,true) (16,false) (48,false) (15,true) (32,true) (41,false) (33,true) (12,true) (40,true) (3,true) (1,true) (29,false) (7,true) (10,false) (25,true) (11,true) (13,false) (8,true) (29,true) (9,true) } Edges: { (32,true)->(29,false) (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (13,false)->(33,true) (7,true)->(12,true) (1,true)->(16,false) (48,false)->(40,true) (9,true)->(12,true) (25,true)->(15,true) (8,true)->(48,false) (16,false)->(25,true) (10,false)->(48,false) (16,false)->(15,true) (10,false)->(40,true) (13,false)->(32,true) (5,true)->(25,true) (1,true)->(11,true) (3,true)->(6,true) (41,false)->(16,false) (10,false)->(29,false) (3,true)->(13,false) (11,true)->(41,false) (4,true)->(29,true) (12,true)->(11,true) (6,true)->(13,false) (1,true)->(41,false) }
Found resolution clause: not(x4) not(x32) x10
Added clause: not(x4) not(x32) x10
Running conflict analysis on implication graph: Nodes: { (4,true) (5,true) (6,true) (16,false) (48,false) (15,true) (32,true) (41,false) (33,true) (12,true) (40,true) (3,true) (1,true) (29,false) (7,true) (10,false) (25,true) (11,true) (13,false) (8,true) (29,true) (9,true) } Edges: { (32,true)->(29,false) (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (13,false)->(33,true) (7,true)->(12,true) (1,true)->(16,false) (48,false)->(40,true) (9,true)->(12,true) (25,true)->(15,true) (8,true)->(48,false) (16,false)->(25,true) (10,false)->(48,false) (16,false)->(15,true) (10,false)->(40,true) (13,false)->(32,true) (5,true)->(25,true) (1,true)->(11,true) (3,true)->(6,true) (41,false)->(16,false) (10,false)->(29,false) (3,true)->(13,false) (11,true)->(41,false) (4,true)->(29,true) (12,true)->(11,true) (6,true)->(13,false) (1,true)->(41,false) }
Found resolution clause: not(x4) not(x32) x10
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,true), (9,false))
DEDUCING
Stack=(8,true) (7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,true))
DEDUCING
Stack=(8,true) (7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,true))
Trying: (9,false)
Propogating:List(1, 1, 1, 1, 1, 1, -1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:x9 x18 x46 ; Literal: x18
Found unit clause:not(x6) x13 x32 ; Literal: x32
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Found unit clause:not(x5) x13 x33 ; Literal: x33
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x1) x11 not(x12) ; Literal: not(x12)
Found unit clause:x11 not(x18) x20 ; Literal: x20
Found unit clause:not(x4) not(x32) x10 ; Literal: x10
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:not(x4) not(x32) x10
Bad clause:x10 not(x29) not(x32)
Found unit clause:x10 x40 x48 ; Literal: x40
Bad clause:not(x4) not(x32) x10
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x4) not(x32) x10
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, -1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 1, 1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (4,true) (36,false) (5,true) (6,true) (48,false) (32,true) (33,true) (12,false) (40,true) (3,true) (1,true) (46,false) (2,true) (18,true) (10,false) (20,true) (11,false) (10,true) (13,false) (29,true) (8,true) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (13,false)->(33,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (29,true)->(10,false) (11,false)->(12,false) (4,true)->(10,true) (3,true)->(13,false) (9,false)->(36,false) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (48,false)->(40,true) (32,true)->(10,true) (10,false)->(48,false) (46,false)->(11,false) (10,false)->(40,true) (13,false)->(32,true) (1,true)->(12,false) (3,true)->(6,true) (32,true)->(10,false) (4,true)->(29,true) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x4) not(x32)
Added clause: not(x29) not(x4) not(x32)
Running conflict analysis on implication graph: Nodes: { (9,false) (4,true) (36,false) (5,true) (6,true) (48,false) (32,true) (33,true) (12,false) (40,true) (3,true) (1,true) (46,false) (2,true) (18,true) (10,false) (20,true) (11,false) (10,true) (13,false) (29,true) (8,true) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (13,false)->(33,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (29,true)->(10,false) (11,false)->(12,false) (4,true)->(10,true) (3,true)->(13,false) (9,false)->(36,false) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (48,false)->(40,true) (32,true)->(10,true) (10,false)->(48,false) (46,false)->(11,false) (10,false)->(40,true) (13,false)->(32,true) (1,true)->(12,false) (3,true)->(6,true) (32,true)->(10,false) (4,true)->(29,true) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x4) not(x32)
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true), (8,false))
DEDUCING
Stack=(7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true))
DEDUCING
Stack=(7,true) (5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,true))
Trying: (8,false)
Propogating:List(1, 1, 1, 1, 1, 1, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Bad clause:not(x6) x13 x32
Found unit clause:not(x5) x13 x33 ; Literal: x33
Bad clause:not(x6) x13 x32
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 1, 0, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (4,true) (5,true) (6,true) (32,true) (32,false) (33,true) (13,false) (29,true) (3,true) } Edges: { (4,true)->(32,false) (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (4,true)->(29,true) (29,true)->(32,false) (6,true)->(13,false) }
Found resolution clause: not(x6) x13 not(x4) not(x29)
Added clause: not(x6) x13 not(x4) not(x29)
Running conflict analysis on implication graph: Nodes: { (4,true) (5,true) (6,true) (32,true) (32,false) (33,true) (13,false) (29,true) (3,true) } Edges: { (4,true)->(32,false) (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (4,true)->(29,true) (29,true)->(32,false) (6,true)->(13,false) }
Found resolution clause: not(x6) x13 not(x4) not(x29)
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true), (7,false))
DEDUCING
Stack=(5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true))
DEDUCING
Stack=(5,true) (4,true) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,true), (5,true))
Trying: (7,false)
Propogating:List(1, 1, 1, 1, 1, 1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Found unit clause:not(x6) x13 not(x4) not(x29) ; Literal: x13
Bad clause:not(x3) not(x6) not(x13)
Found unit clause:not(x0) not(x13) x31 ; Literal: x31
Bad clause:not(x3) not(x6) not(x13)
Done Propogating:List(1, 1, 1, 1, 1, 1, 1, 0, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (4,true) (0,true) (5,true) (31,true) (6,true) (32,true) (32,false) (13,true) (33,true) (13,false) (29,true) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (4,true)->(13,true) (0,true)->(31,true) (13,false)->(33,true) (6,true)->(13,true) (29,true)->(32,false) (29,true)->(13,true) (4,true)->(32,false) (13,false)->(32,true) (3,true)->(6,true) (3,true)->(13,false) (4,true)->(29,true) (13,true)->(31,true) (6,true)->(13,false) }
Found resolution clause: not(x3) not(x29) not(x4) x13 not(x6)
Added clause: not(x3) not(x29) not(x4) x13 not(x6)
Running conflict analysis on implication graph: Nodes: { (4,true) (0,true) (5,true) (31,true) (6,true) (32,true) (32,false) (13,true) (33,true) (13,false) (29,true) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (4,true)->(13,true) (0,true)->(31,true) (13,false)->(33,true) (6,true)->(13,true) (29,true)->(32,false) (29,true)->(13,true) (4,true)->(32,false) (13,false)->(32,true) (3,true)->(6,true) (3,true)->(13,false) (4,true)->(29,true) (13,true)->(31,true) (6,true)->(13,false) }
Found resolution clause: not(x3) not(x29) not(x4) x13 not(x6)
Backjumping
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,false))
DEDUCING
Stack=(3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true))
DEDUCING
Stack=(3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true))
Trying: (4,false)
Propogating:List(1, 1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false))
Trying: (5,true)
Propogating:List(1, 1, 1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:not(x6) x13 x32 ; Literal: x32
Found unit clause:not(x5) x13 x33 ; Literal: x33
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, 1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true))
Trying: (7,true)
Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(7,true) (5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, 1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,true))
Trying: (8,true)
Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(8,true) (7,true) (5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,true), (8,true))
Trying: (9,true)
Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 1, 1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x40)
Found unit clause:not(x7) not(x9) x12 ; Literal: x12
Found unit clause:x4 x27 x40 ; Literal: x27
Found unit clause:x4 not(x27) x40 ; Literal: not(x27)
Found unit clause:not(x1) x11 not(x12) ; Literal: x11
Bad clause:x4 x27 x40
Found unit clause:not(x1) not(x11) not(x41) ; Literal: not(x41)
Bad clause:x4 x27 x40
Found unit clause:not(x1) not(x16) x41 ; Literal: not(x16)
Bad clause:x4 x27 x40
Found unit clause:not(x5) x16 x25 ; Literal: x25
Bad clause:x4 x27 x40
Found unit clause:x15 x16 not(x25) ; Literal: x15
Bad clause:x4 x27 x40
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 1, 1, -1, 1, 1, 0, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (5,true) (27,true) (6,true) (16,false) (4,false) (32,true) (15,true) (41,false) (33,true) (12,true) (3,true) (1,true) (7,true) (25,true) (11,true) (13,false) (9,true) (27,false) (40,false) } Edges: { (40,false)->(27,false) (6,true)->(32,true) (5,true)->(6,true) (5,true)->(33,true) (4,false)->(27,true) (13,false)->(33,true) (7,true)->(12,true) (4,false)->(40,false) (1,true)->(16,false) (9,true)->(12,true) (25,true)->(15,true) (16,false)->(25,true) (9,true)->(40,false) (16,false)->(15,true) (13,false)->(32,true) (5,true)->(25,true) (1,true)->(11,true) (3,true)->(6,true) (4,false)->(27,false) (41,false)->(16,false) (3,true)->(13,false) (40,false)->(27,true) (11,true)->(41,false) (12,true)->(11,true) (6,true)->(13,false) (1,true)->(41,false) }
Found resolution clause: x4 x40
Added clause: x4 x40
DEDUCING
Stack=(8,true) (7,true) (5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,true), (8,true))
Trying: (9,false)
Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 1, 0, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:x9 x18 x46 ; Literal: x18
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x1) x11 not(x12) ; Literal: not(x12)
Found unit clause:x11 not(x18) x20 ; Literal: x20
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:x10 not(x29) not(x32)
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, -1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 1, 1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (36,false) (5,true) (6,true) (48,false) (4,false) (32,true) (33,true) (12,false) (40,true) (3,true) (1,true) (46,false) (2,true) (18,true) (10,false) (20,true) (10,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (13,false)->(33,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (29,true)->(10,false) (11,false)->(12,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (4,false)->(40,true) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (9,false)->(29,true) (32,true)->(10,true) (10,false)->(48,false) (46,false)->(11,false) (13,false)->(32,true) (1,true)->(12,false) (3,true)->(6,true) (32,true)->(10,false) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x32)
Added clause: not(x29) not(x32)
Running conflict analysis on implication graph: Nodes: { (9,false) (36,false) (5,true) (6,true) (48,false) (4,false) (32,true) (33,true) (12,false) (40,true) (3,true) (1,true) (46,false) (2,true) (18,true) (10,false) (20,true) (10,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (13,false)->(33,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (29,true)->(10,false) (11,false)->(12,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (4,false)->(40,true) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (9,false)->(29,true) (32,true)->(10,true) (10,false)->(48,false) (46,false)->(11,false) (13,false)->(32,true) (1,true)->(12,false) (3,true)->(6,true) (32,true)->(10,false) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x32)
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,true), (8,false))
DEDUCING
Stack=(7,true) (5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,true))
DEDUCING
Stack=(7,true) (5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,true))
Trying: (8,false)
Propogating:List(1, 1, 1, 1, 0, 1, -1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:not(x6) x13 x32 ; Literal: x32
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:not(x5) x13 x33 ; Literal: x33
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:x9 x18 x46 ; Literal: x18
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Found unit clause:x8 not(x18) not(x20) ; Literal: not(x20)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x1) x11 not(x12) ; Literal: not(x12)
Bad clause:x11 not(x18) x20
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:x11 not(x18) x20
Bad clause:not(x29) not(x32)
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, -1, -1, -1, -1, 1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 1, 1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, 0, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (36,false) (5,true) (6,true) (4,false) (32,true) (33,true) (12,false) (40,true) (3,true) (1,true) (20,false) (46,false) (2,true) (10,false) (18,true) (10,true) (11,false) (8,false) (13,false) (29,true) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (8,false)->(20,false) (13,false)->(33,true) (2,true)->(36,false) (9,false)->(18,true) (29,true)->(10,false) (4,false)->(9,false) (40,true)->(9,false) (11,false)->(12,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (4,false)->(40,true) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (9,false)->(29,true) (32,true)->(10,true) (46,false)->(11,false) (13,false)->(32,true) (1,true)->(12,false) (3,true)->(6,true) (32,true)->(10,false) (9,false)->(46,false) (18,true)->(11,false) (18,true)->(20,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x32)
Added clause: not(x29) not(x32)
Running conflict analysis on implication graph: Nodes: { (9,false) (36,false) (5,true) (6,true) (4,false) (32,true) (33,true) (12,false) (40,true) (3,true) (1,true) (20,false) (46,false) (2,true) (10,false) (18,true) (10,true) (11,false) (8,false) (13,false) (29,true) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (8,false)->(20,false) (13,false)->(33,true) (2,true)->(36,false) (9,false)->(18,true) (29,true)->(10,false) (4,false)->(9,false) (40,true)->(9,false) (11,false)->(12,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (4,false)->(40,true) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (9,false)->(29,true) (32,true)->(10,true) (46,false)->(11,false) (13,false)->(32,true) (1,true)->(12,false) (3,true)->(6,true) (32,true)->(10,false) (9,false)->(46,false) (18,true)->(11,false) (18,true)->(20,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x32)
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true), (7,false))
DEDUCING
Stack=(5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true))
DEDUCING
Stack=(5,true) (4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { (5,true) (6,true) (32,true) (33,true) (13,false) (3,true) } Edges: { (6,true)->(32,true) (5,true)->(6,true) (13,false)->(32,true) (5,true)->(33,true) (3,true)->(6,true) (13,false)->(33,true) (3,true)->(13,false) (6,true)->(13,false) }
VarVals=List(1, 1, 1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false), (5,true))
Trying: (7,false)
Propogating:List(1, 1, 1, 1, 0, 1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x3) not(x5) x6 ; Literal: x6
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:not(x6) x13 x32 ; Literal: x32
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:not(x5) x13 x33 ; Literal: x33
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:x9 x18 x46 ; Literal: x18
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x1) x11 not(x12) ; Literal: not(x12)
Found unit clause:x11 not(x18) x20 ; Literal: x20
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x7 x12 not(x41) ; Literal: not(x41)
Found unit clause:x8 not(x18) not(x20) ; Literal: x8
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x1) not(x16) x41 ; Literal: not(x16)
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x7 x16 x39 ; Literal: x39
Found unit clause:not(x5) x16 x25 ; Literal: x25
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x15 x16 not(x25) ; Literal: x15
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Done Propogating:List(1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, -1, 1, 0, -1, 1, -1, 1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, 1, 1, -1, -1, 0, -1, -1, 1, 1, 0, -1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (6,true) (32,true) (40,true) (10,false) (18,true) (10,true) (8,true) (29,true) (9,false) (36,false) (5,true) (48,false) (16,false) (4,false) (15,true) (41,false) (39,true) (33,true) (12,false) (3,true) (1,true) (46,false) (2,true) (25,true) (20,true) (11,false) (13,false) (7,false) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (13,false)->(33,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (29,true)->(10,false) (25,true)->(15,true) (4,false)->(9,false) (16,false)->(25,true) (40,true)->(9,false) (12,false)->(41,false) (7,false)->(39,true) (11,false)->(12,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (4,false)->(40,true) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (16,false)->(39,true) (9,false)->(29,true) (1,true)->(16,false) (32,true)->(10,true) (20,true)->(8,true) (10,false)->(48,false) (46,false)->(11,false) (16,false)->(15,true) (13,false)->(32,true) (1,true)->(12,false) (41,false)->(16,false) (3,true)->(6,true) (5,true)->(25,true) (32,true)->(10,false) (7,false)->(41,false) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x32)
Added clause: not(x29) not(x32)
Running conflict analysis on implication graph: Nodes: { (6,true) (32,true) (40,true) (10,false) (18,true) (10,true) (8,true) (29,true) (9,false) (36,false) (5,true) (48,false) (16,false) (4,false) (15,true) (41,false) (39,true) (33,true) (12,false) (3,true) (1,true) (46,false) (2,true) (25,true) (20,true) (11,false) (13,false) (7,false) } Edges: { (5,true)->(6,true) (29,true)->(10,true) (13,false)->(33,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (29,true)->(10,false) (25,true)->(15,true) (4,false)->(9,false) (16,false)->(25,true) (40,true)->(9,false) (12,false)->(41,false) (7,false)->(39,true) (11,false)->(12,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (4,false)->(40,true) (6,true)->(32,true) (5,true)->(33,true) (46,false)->(18,true) (16,false)->(39,true) (9,false)->(29,true) (1,true)->(16,false) (32,true)->(10,true) (20,true)->(8,true) (10,false)->(48,false) (46,false)->(11,false) (16,false)->(15,true) (13,false)->(32,true) (1,true)->(12,false) (41,false)->(16,false) (3,true)->(6,true) (5,true)->(25,true) (32,true)->(10,false) (7,false)->(41,false) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: not(x29) not(x32)
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,false), (5,false))
DEDUCING
Stack=(4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false))
DEDUCING
Stack=(4,false) (3,true) (2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,true), (4,false))
Trying: (5,false)
Propogating:List(1, 1, 1, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:x9 x18 x46 ; Literal: x18
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x6 not(x29) x32 ; Literal: x6
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Found unit clause:not(x6) x13 x32 ; Literal: x13
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x13)
Found unit clause:not(x1) x11 not(x12) ; Literal: not(x12)
Found unit clause:x11 not(x18) x20 ; Literal: x20
Bad clause:not(x6) x13 x32
Found unit clause:x8 not(x18) not(x20) ; Literal: x8
Bad clause:not(x6) x13 x32
Found unit clause:not(x8) not(x10) not(x20) ; Literal: not(x10)
Bad clause:not(x6) x13 x32
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:not(x6) x13 x32
Done Propogating:List(1, 1, 1, 1, 0, 0, 1, -1, 1, 0, 0, 0, 0, 0, -1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 0, -1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (36,false) (6,true) (48,false) (4,false) (32,false) (13,true) (12,false) (40,true) (3,true) (1,true) (46,false) (2,true) (18,true) (10,false) (20,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (32,false)->(13,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (4,false)->(9,false) (40,true)->(9,false) (11,false)->(12,false) (8,true)->(10,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (4,false)->(40,true) (46,false)->(18,true) (32,false)->(6,true) (9,false)->(29,true) (6,true)->(13,true) (29,true)->(32,false) (20,true)->(8,true) (10,false)->(48,false) (20,true)->(10,false) (46,false)->(11,false) (1,true)->(12,false) (29,true)->(6,true) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: x32 not(x6) not(x3)
Added clause: x32 not(x6) not(x3)
Running conflict analysis on implication graph: Nodes: { (9,false) (36,false) (6,true) (48,false) (4,false) (32,false) (13,true) (12,false) (40,true) (3,true) (1,true) (46,false) (2,true) (18,true) (10,false) (20,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (32,false)->(13,true) (18,true)->(20,true) (11,false)->(20,true) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (4,false)->(9,false) (40,true)->(9,false) (11,false)->(12,false) (8,true)->(10,false) (3,true)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (4,false)->(40,true) (46,false)->(18,true) (32,false)->(6,true) (9,false)->(29,true) (6,true)->(13,true) (29,true)->(32,false) (20,true)->(8,true) (10,false)->(48,false) (20,true)->(10,false) (46,false)->(11,false) (1,true)->(12,false) (29,true)->(6,true) (9,false)->(46,false) (18,true)->(11,false) (6,true)->(13,false) (2,true)->(46,false) }
Found resolution clause: x32 not(x6) not(x3)
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true), (4,true))
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,false))
DEDUCING
Stack=(2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true))
DEDUCING
Stack=(2,true) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true))
Trying: (3,false)
Propogating:List(1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x0) x3 not(x31) ; Literal: not(x31)
Found unit clause:not(x0) not(x13) x31 ; Literal: not(x13)
Done Propogating:List(1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,false) (2,true) (1,true) (0,true)
Impl=Nodes: { (0,true) (3,false) (31,false) (13,false) } Edges: { (0,true)->(13,false) (31,false)->(13,false) (3,false)->(31,false) (0,true)->(31,false) }
VarVals=List(1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,false))
Trying: (4,true)
Propogating:List(1, 1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Found unit clause:not(x6) x13 not(x4) not(x29) ; Literal: not(x6)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Bad clause:x6 not(x29) x32
Done Propogating:List(1, 1, 1, 0, 1, -1, 0, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (4,true) (0,true) (3,false) (32,false) (31,false) (13,false) (29,true) } Edges: { (4,true)->(32,false) (0,true)->(13,false) (29,true)->(6,false) (4,true)->(6,false) (13,false)->(6,false) (31,false)->(13,false) (4,true)->(29,true) (3,false)->(31,false) (0,true)->(31,false) (29,true)->(32,false) }
No conflict
DEDUCING
Stack=(3,false) (2,true) (1,true) (0,true)
Impl=Nodes: { (0,true) (3,false) (31,false) (13,false) } Edges: { (0,true)->(13,false) (31,false)->(13,false) (3,false)->(31,false) (0,true)->(31,false) }
VarVals=List(1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,true), (3,false))
Trying: (4,false)
Propogating:List(1, 1, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:x9 x18 x46 ; Literal: x18
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x6 not(x29) x32 ; Literal: x6
Found unit clause:not(x6) x13 x32 ; Literal: not(x6)
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Bad clause:x6 not(x29) x32
Found unit clause:not(x1) x11 not(x12) ; Literal: not(x12)
Found unit clause:x11 not(x18) x20 ; Literal: x20
Bad clause:x6 not(x29) x32
Found unit clause:x8 not(x18) not(x20) ; Literal: x8
Bad clause:x6 not(x29) x32
Found unit clause:not(x8) not(x10) not(x20) ; Literal: not(x10)
Bad clause:x6 not(x29) x32
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:x6 not(x29) x32
Done Propogating:List(1, 1, 1, 0, 0, -1, 0, -1, 1, 0, 0, 0, 0, 0, -1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, 0, -1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (9,false) (0,true) (36,false) (6,true) (48,false) (4,false) (32,false) (31,false) (12,false) (40,true) (1,true) (46,false) (2,true) (18,true) (3,false) (10,false) (20,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (0,true)->(13,false) (18,true)->(20,true) (11,false)->(20,true) (3,false)->(31,false) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (4,false)->(9,false) (40,true)->(9,false) (32,false)->(6,false) (13,false)->(6,false) (11,false)->(12,false) (31,false)->(13,false) (8,true)->(10,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (4,false)->(40,true) (46,false)->(18,true) (32,false)->(6,true) (9,false)->(29,true) (29,true)->(32,false) (20,true)->(8,true) (10,false)->(48,false) (20,true)->(10,false) (46,false)->(11,false) (1,true)->(12,false) (29,true)->(6,true) (9,false)->(46,false) (18,true)->(11,false) (0,true)->(31,false) (2,true)->(46,false) }
Found resolution clause: x32 not(x29) x13
Added clause: x32 not(x29) x13
Running conflict analysis on implication graph: Nodes: { (6,false) (9,false) (0,true) (36,false) (6,true) (48,false) (4,false) (32,false) (31,false) (12,false) (40,true) (1,true) (46,false) (2,true) (18,true) (3,false) (10,false) (20,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (0,true)->(13,false) (18,true)->(20,true) (11,false)->(20,true) (3,false)->(31,false) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (4,false)->(9,false) (40,true)->(9,false) (32,false)->(6,false) (13,false)->(6,false) (11,false)->(12,false) (31,false)->(13,false) (8,true)->(10,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (4,false)->(40,true) (46,false)->(18,true) (32,false)->(6,true) (9,false)->(29,true) (29,true)->(32,false) (20,true)->(8,true) (10,false)->(48,false) (20,true)->(10,false) (46,false)->(11,false) (1,true)->(12,false) (29,true)->(6,true) (9,false)->(46,false) (18,true)->(11,false) (0,true)->(31,false) (2,true)->(46,false) }
Found resolution clause: x32 not(x29) x13
Backjumping
PRUNING List((0,true), (1,true), (2,true), (3,true))
Backjumping
PRUNING List((0,true), (1,true), (2,false))
DEDUCING
Stack=(1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true))
DEDUCING
Stack=(1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true))
Trying: (2,false)
Propogating:List(1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(2,false) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false))
Trying: (3,true)
Propogating:List(1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,true) (2,false) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false), (3,true))
Trying: (4,true)
Propogating:List(1, 1, 0, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x6 not(x29) x32 ; Literal: x6
Found unit clause:x32 not(x6) not(x3) ; Literal: not(x6)
Found unit clause:x32 not(x29) x13 ; Literal: x13
Bad clause:x6 not(x29) x32
Found unit clause:not(x0) not(x13) x31 ; Literal: x31
Found unit clause:not(x3) not(x5) x6 ; Literal: not(x5)
Bad clause:x6 not(x29) x32
Found unit clause:x5 not(x31) not(x37) ; Literal: not(x37)
Bad clause:x6 not(x29) x32
Found unit clause:x5 not(x23) x37 ; Literal: not(x23)
Bad clause:x6 not(x29) x32
Done Propogating:List(1, 1, 0, 1, 1, 0, 0, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, 1, -1, 1, 0, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (4,true) (0,true) (31,true) (6,true) (5,false) (23,false) (32,false) (13,true) (29,true) (37,false) (3,true) } Edges: { (6,false)->(5,false) (32,false)->(13,true) (5,false)->(37,false) (0,true)->(31,true) (32,false)->(6,true) (29,true)->(32,false) (31,true)->(37,false) (29,true)->(13,true) (3,true)->(6,false) (4,true)->(32,false) (37,false)->(23,false) (5,false)->(23,false) (32,false)->(6,false) (29,true)->(6,true) (4,true)->(29,true) (13,true)->(31,true) (3,true)->(5,false) }
Found resolution clause: x32 not(x29) not(x3)
Added clause: x32 not(x29) not(x3)
DEDUCING
Stack=(3,true) (2,false) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false), (3,true))
Trying: (4,false)
Propogating:List(1, 1, 0, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:x2 not(x7) x9 ; Literal: not(x7)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) not(x3) ; Literal: x32
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Done Propogating:List(1, 1, 0, 1, 0, -1, -1, 0, -1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (10,false) (2,false) (4,false) (32,true) (32,false) (10,true) (29,true) (7,false) (40,true) (3,true) } Edges: { (4,false)->(40,true) (29,true)->(10,true) (9,false)->(29,true) (9,false)->(7,false) (29,true)->(32,false) (3,true)->(32,true) (29,true)->(10,false) (4,false)->(9,false) (32,true)->(10,true) (40,true)->(9,false) (2,false)->(7,false) (32,true)->(10,false) (40,true)->(29,true) (29,true)->(32,true) }
Found resolution clause: not(x29) not(x32) not(x3)
Added clause: not(x29) not(x32) not(x3)
Running conflict analysis on implication graph: Nodes: { (9,false) (10,false) (2,false) (4,false) (32,true) (32,false) (10,true) (29,true) (7,false) (40,true) (3,true) } Edges: { (4,false)->(40,true) (29,true)->(10,true) (9,false)->(29,true) (9,false)->(7,false) (29,true)->(32,false) (3,true)->(32,true) (29,true)->(10,false) (4,false)->(9,false) (32,true)->(10,true) (40,true)->(9,false) (2,false)->(7,false) (32,true)->(10,false) (40,true)->(29,true) (29,true)->(32,true) }
Found resolution clause: not(x29) not(x32) not(x3)
Backjumping
PRUNING List((0,true), (1,true), (2,false), (3,false))
DEDUCING
Stack=(2,false) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false))
DEDUCING
Stack=(2,false) (1,true) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false))
Trying: (3,false)
Propogating:List(1, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x0) x3 not(x31) ; Literal: not(x31)
Found unit clause:not(x0) not(x13) x31 ; Literal: not(x13)
Done Propogating:List(1, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,false) (2,false) (1,true) (0,true)
Impl=Nodes: { (0,true) (3,false) (31,false) (13,false) } Edges: { (0,true)->(13,false) (31,false)->(13,false) (3,false)->(31,false) (0,true)->(31,false) }
VarVals=List(1, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false), (3,false))
Trying: (4,true)
Propogating:List(1, 1, 0, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Found unit clause:not(x6) x13 not(x4) not(x29) ; Literal: not(x6)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) x13 ; Literal: x32
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x4) not(x32) x10 ; Literal: x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Done Propogating:List(1, 1, 0, 0, 1, -1, 0, -1, -1, -1, 0, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (4,true) (0,true) (10,false) (3,false) (32,true) (32,false) (31,false) (10,true) (13,false) (29,true) } Edges: { (0,true)->(13,false) (29,true)->(6,false) (4,true)->(6,false) (29,true)->(10,true) (3,false)->(31,false) (29,true)->(32,false) (29,true)->(10,false) (4,true)->(32,false) (32,true)->(10,true) (13,false)->(32,true) (13,false)->(6,false) (32,true)->(10,false) (31,false)->(13,false) (4,true)->(10,true) (4,true)->(29,true) (0,true)->(31,false) (29,true)->(32,true) }
Found resolution clause: not(x29) not(x32) not(x4) x13
Added clause: not(x29) not(x32) not(x4) x13
DEDUCING
Stack=(3,false) (2,false) (1,true) (0,true)
Impl=Nodes: { (0,true) (3,false) (31,false) (13,false) } Edges: { (0,true)->(13,false) (31,false)->(13,false) (3,false)->(31,false) (0,true)->(31,false) }
VarVals=List(1, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,true), (2,false), (3,false))
Trying: (4,false)
Propogating:List(1, 1, 0, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:x2 not(x7) x9 ; Literal: not(x7)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) x13 ; Literal: x32
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Done Propogating:List(1, 1, 0, 0, 0, -1, -1, 0, -1, 0, 0, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, 1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (0,true) (2,false) (4,false) (32,true) (32,false) (31,false) (40,true) (10,false) (3,false) (10,true) (13,false) (29,true) (7,false) } Edges: { (4,false)->(40,true) (0,true)->(13,false) (29,true)->(10,true) (9,false)->(29,true) (9,false)->(7,false) (3,false)->(31,false) (29,true)->(32,false) (29,true)->(10,false) (4,false)->(9,false) (32,true)->(10,true) (40,true)->(9,false) (2,false)->(7,false) (13,false)->(32,true) (32,true)->(10,false) (31,false)->(13,false) (40,true)->(29,true) (0,true)->(31,false) (29,true)->(32,true) }
Found resolution clause: x13 not(x29) not(x32)
Added clause: x13 not(x29) not(x32)
Running conflict analysis on implication graph: Nodes: { (9,false) (0,true) (2,false) (4,false) (32,true) (32,false) (31,false) (40,true) (10,false) (3,false) (10,true) (13,false) (29,true) (7,false) } Edges: { (4,false)->(40,true) (0,true)->(13,false) (29,true)->(10,true) (9,false)->(29,true) (9,false)->(7,false) (3,false)->(31,false) (29,true)->(32,false) (29,true)->(10,false) (4,false)->(9,false) (32,true)->(10,true) (40,true)->(9,false) (2,false)->(7,false) (13,false)->(32,true) (32,true)->(10,false) (31,false)->(13,false) (40,true)->(29,true) (0,true)->(31,false) (29,true)->(32,true) }
Found resolution clause: x13 not(x29) not(x32)
Backjumping
PRUNING List((0,true), (1,true), (2,false), (3,true))
Backjumping
PRUNING List((0,true), (1,true), (2,true))
Backjumping
PRUNING List((0,true), (1,false))
DEDUCING
Stack=(0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true))
DEDUCING
Stack=(0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true))
Trying: (1,false)
Propogating:List(1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false))
Trying: (2,true)
Propogating:List(1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(2,true) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true))
Trying: (3,true)
Propogating:List(1, 0, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 0, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,true) (2,true) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true), (3,true))
Trying: (4,true)
Propogating:List(1, 0, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) not(x3) ; Literal: x32
Found unit clause:not(x29) not(x32) not(x3) ; Literal: not(x32)
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x4) not(x32) x10 ; Literal: x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Found unit clause:not(x29) not(x32) not(x4) x13 ; Literal: x13
Found unit clause:x13 not(x29) not(x32) ; Literal: x13
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x6)
Found unit clause:not(x0) not(x13) x31 ; Literal: x31
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x3) not(x5) x6 ; Literal: not(x5)
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x5 not(x31) not(x37) ; Literal: not(x37)
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x5 not(x23) x37 ; Literal: not(x23)
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Done Propogating:List(1, 0, 1, 1, 1, 0, 0, -1, -1, -1, 0, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, 1, -1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (4,true) (0,true) (23,false) (32,true) (32,false) (13,true) (37,false) (3,true) (31,true) (10,false) (5,false) (10,true) (29,true) } Edges: { (6,false)->(5,false) (29,true)->(10,true) (4,true)->(13,true) (5,false)->(37,false) (13,true)->(6,false) (0,true)->(31,true) (29,true)->(32,false) (31,true)->(37,false) (29,true)->(13,true) (3,true)->(32,true) (29,true)->(10,false) (3,true)->(6,false) (4,true)->(32,false) (32,true)->(10,true) (37,false)->(23,false) (3,true)->(32,false) (5,false)->(23,false) (32,true)->(10,false) (4,true)->(10,true) (4,true)->(29,true) (13,true)->(31,true) (32,true)->(13,true) (3,true)->(5,false) (29,true)->(32,true) }
Found resolution clause: not(x3) not(x29) not(x4) not(x32)
Added clause: not(x3) not(x29) not(x4) not(x32)
DEDUCING
Stack=(3,true) (2,true) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true), (3,true))
Trying: (4,false)
Propogating:List(1, 0, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:x9 x18 x46 ; Literal: x18
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) not(x3) ; Literal: x32
Found unit clause:not(x29) not(x32) not(x3) ; Literal: not(x32)
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Found unit clause:x13 not(x29) not(x32) ; Literal: x13
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x3) not(x6) not(x13) ; Literal: not(x6)
Found unit clause:not(x0) not(x13) x31 ; Literal: x31
Found unit clause:x11 not(x18) x20 ; Literal: x20
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x8 not(x18) not(x20) ; Literal: x8
Found unit clause:not(x3) not(x5) x6 ; Literal: not(x5)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x5 not(x31) not(x37) ; Literal: not(x37)
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x5 not(x23) x37 ; Literal: not(x23)
Found unit clause:x37 x42 x48 ; Literal: x42
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x3)
Done Propogating:List(1, 0, 1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, -1, -1, -1, -1, 1, -1, 1, -1, -1, 0, -1, -1, -1, -1, -1, 1, -1, 1, 1, -1, -1, -1, 0, 0, -1, -1, 1, -1, 1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (9,false) (36,false) (0,true) (48,false) (42,true) (23,false) (4,false) (32,true) (32,false) (13,true) (37,false) (40,true) (3,true) (46,false) (31,true) (2,true) (18,true) (10,false) (5,false) (20,true) (10,true) (11,false) (8,true) (29,true) } Edges: { (29,true)->(10,true) (0,true)->(31,true) (18,true)->(20,true) (11,false)->(20,true) (31,true)->(37,false) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (3,true)->(32,true) (29,true)->(10,false) (4,false)->(9,false) (40,true)->(9,false) (37,false)->(23,false) (5,false)->(23,false) (48,false)->(42,true) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (3,true)->(5,false) (29,true)->(32,true) (4,false)->(40,true) (6,false)->(5,false) (5,false)->(37,false) (46,false)->(18,true) (13,true)->(6,false) (9,false)->(29,true) (29,true)->(32,false) (29,true)->(13,true) (3,true)->(6,false) (32,true)->(10,true) (20,true)->(8,true) (10,false)->(48,false) (3,true)->(32,false) (46,false)->(11,false) (32,true)->(10,false) (13,true)->(31,true) (9,false)->(46,false) (18,true)->(11,false) (32,true)->(13,true) (37,false)->(42,true) (2,true)->(46,false) }
Found resolution clause: not(x3) not(x29) not(x32)
Added clause: not(x3) not(x29) not(x32)
Running conflict analysis on implication graph: Nodes: { (6,false) (9,false) (36,false) (0,true) (48,false) (42,true) (23,false) (4,false) (32,true) (32,false) (13,true) (37,false) (40,true) (3,true) (46,false) (31,true) (2,true) (18,true) (10,false) (5,false) (20,true) (10,true) (11,false) (8,true) (29,true) } Edges: { (29,true)->(10,true) (0,true)->(31,true) (18,true)->(20,true) (11,false)->(20,true) (31,true)->(37,false) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (3,true)->(32,true) (29,true)->(10,false) (4,false)->(9,false) (40,true)->(9,false) (37,false)->(23,false) (5,false)->(23,false) (48,false)->(42,true) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (3,true)->(5,false) (29,true)->(32,true) (4,false)->(40,true) (6,false)->(5,false) (5,false)->(37,false) (46,false)->(18,true) (13,true)->(6,false) (9,false)->(29,true) (29,true)->(32,false) (29,true)->(13,true) (3,true)->(6,false) (32,true)->(10,true) (20,true)->(8,true) (10,false)->(48,false) (3,true)->(32,false) (46,false)->(11,false) (32,true)->(10,false) (13,true)->(31,true) (9,false)->(46,false) (18,true)->(11,false) (32,true)->(13,true) (37,false)->(42,true) (2,true)->(46,false) }
Found resolution clause: not(x3) not(x29) not(x32)
Backjumping
PRUNING List((0,true), (1,false), (2,true), (3,false))
DEDUCING
Stack=(2,true) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true))
DEDUCING
Stack=(2,true) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true))
Trying: (3,false)
Propogating:List(1, 0, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x0) x3 not(x31) ; Literal: not(x31)
Found unit clause:not(x0) not(x13) x31 ; Literal: not(x13)
Done Propogating:List(1, 0, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,false) (2,true) (1,false) (0,true)
Impl=Nodes: { (0,true) (3,false) (31,false) (13,false) } Edges: { (0,true)->(13,false) (31,false)->(13,false) (3,false)->(31,false) (0,true)->(31,false) }
VarVals=List(1, 0, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true), (3,false))
Trying: (4,true)
Propogating:List(1, 0, 1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x4) x29 ; Literal: x29
Found unit clause:not(x29) not(x4) not(x32) ; Literal: not(x32)
Found unit clause:not(x6) x13 not(x4) not(x29) ; Literal: not(x6)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) x13 ; Literal: x32
Found unit clause:not(x29) not(x32) not(x4) x13 ; Literal: not(x32)
Found unit clause:x13 not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x4) not(x32) x10 ; Literal: x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x4) x13
Bad clause:x13 not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x4) not(x32) x10
Bad clause:not(x29) not(x4) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32) not(x4) x13
Bad clause:x13 not(x29) not(x32)
Done Propogating:List(1, 0, 1, 0, 1, -1, 0, -1, -1, -1, 0, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Running conflict analysis on implication graph: Nodes: { (6,false) (4,true) (0,true) (10,false) (3,false) (32,true) (32,false) (31,false) (10,true) (13,false) (29,true) } Edges: { (0,true)->(13,false) (29,true)->(6,false) (4,true)->(6,false) (29,true)->(10,true) (3,false)->(31,false) (29,true)->(32,false) (13,false)->(32,false) (29,true)->(10,false) (4,true)->(32,false) (32,true)->(10,true) (13,false)->(32,true) (13,false)->(6,false) (32,true)->(10,false) (31,false)->(13,false) (4,true)->(10,true) (4,true)->(29,true) (0,true)->(31,false) (29,true)->(32,true) }
Found resolution clause: not(x29) not(x32) not(x4) x13
Added clause: not(x29) not(x32) not(x4) x13
DEDUCING
Stack=(3,false) (2,true) (1,false) (0,true)
Impl=Nodes: { (0,true) (3,false) (31,false) (13,false) } Edges: { (0,true)->(13,false) (31,false)->(13,false) (3,false)->(31,false) (0,true)->(31,false) }
VarVals=List(1, 0, 1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,true), (3,false))
Trying: (4,false)
Propogating:List(1, 0, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:x4 x40 ; Literal: x40
Found unit clause:x4 not(x9) not(x40) ; Literal: not(x9)
Found unit clause:x9 x29 not(x40) ; Literal: x29
Found unit clause:not(x2) x9 not(x36) ; Literal: not(x36)
Found unit clause:not(x2) x9 not(x46) ; Literal: not(x46)
Found unit clause:x9 x18 x46 ; Literal: x18
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x32 not(x29) x13 ; Literal: x32
Found unit clause:x13 not(x29) not(x32) ; Literal: not(x32)
Found unit clause:x10 not(x29) not(x32) ; Literal: x10
Found unit clause:not(x10) not(x29) not(x32) ; Literal: not(x10)
Found unit clause:not(x11) not(x18) x46 ; Literal: not(x11)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x13 not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x11 not(x18) x20 ; Literal: x20
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x13 not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:x8 not(x18) not(x20) ; Literal: x8
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x13 not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Found unit clause:not(x8) x10 not(x48) ; Literal: not(x48)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x13 not(x29) not(x32)
Bad clause:x10 not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:not(x29) not(x32)
Bad clause:x13 not(x29) not(x32)
Done Propogating:List(1, 0, 1, 0, 0, -1, -1, -1, 1, 0, 0, 0, -1, 0, -1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 0, 1, -1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, 0, -1, 0, -1)
Running conflict analysis on implication graph: Nodes: { (9,false) (0,true) (36,false) (48,false) (4,false) (32,true) (32,false) (31,false) (40,true) (46,false) (2,true) (18,true) (3,false) (10,false) (20,true) (10,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (0,true)->(13,false) (29,true)->(10,true) (18,true)->(20,true) (11,false)->(20,true) (3,false)->(31,false) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (13,false)->(32,false) (29,true)->(10,false) (4,false)->(9,false) (40,true)->(9,false) (31,false)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (29,true)->(32,true) (4,false)->(40,true) (46,false)->(18,true) (9,false)->(29,true) (29,true)->(32,false) (32,true)->(10,true) (20,true)->(8,true) (10,false)->(48,false) (46,false)->(11,false) (13,false)->(32,true) (32,true)->(10,false) (9,false)->(46,false) (18,true)->(11,false) (0,true)->(31,false) (2,true)->(46,false) }
Found resolution clause: not(x29) x13 not(x32)
Added clause: not(x29) x13 not(x32)
Running conflict analysis on implication graph: Nodes: { (9,false) (0,true) (36,false) (48,false) (4,false) (32,true) (32,false) (31,false) (40,true) (46,false) (2,true) (18,true) (3,false) (10,false) (20,true) (10,true) (11,false) (13,false) (29,true) (8,true) } Edges: { (0,true)->(13,false) (29,true)->(10,true) (18,true)->(20,true) (11,false)->(20,true) (3,false)->(31,false) (2,true)->(36,false) (8,true)->(48,false) (9,false)->(18,true) (13,false)->(32,false) (29,true)->(10,false) (4,false)->(9,false) (40,true)->(9,false) (31,false)->(13,false) (40,true)->(29,true) (9,false)->(36,false) (18,true)->(8,true) (29,true)->(32,true) (4,false)->(40,true) (46,false)->(18,true) (9,false)->(29,true) (29,true)->(32,false) (32,true)->(10,true) (20,true)->(8,true) (10,false)->(48,false) (46,false)->(11,false) (13,false)->(32,true) (32,true)->(10,false) (9,false)->(46,false) (18,true)->(11,false) (0,true)->(31,false) (2,true)->(46,false) }
Found resolution clause: not(x29) x13 not(x32)
Backjumping
PRUNING List((0,true), (1,false), (2,true), (3,true))
Backjumping
PRUNING List((0,true), (1,false), (2,false))
DEDUCING
Stack=(1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false))
DEDUCING
Stack=(1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false))
Trying: (2,false)
Propogating:List(1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(2,false) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,false))
Trying: (3,true)
Propogating:List(1, 0, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Done Propogating:List(1, 0, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
DEDUCING
Stack=(3,true) (2,false) (1,false) (0,true)
Impl=Nodes: { } Edges: { }
VarVals=List(1, 0, 0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Assignments=List((0,true), (1,false), (2,false), (3,true))
Trying: (4,true)
Propogating:List(1, 0, 0, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1)
Found unit clause:not(x4) x29 ; Literal: x29