TSTP Solution File: HWV006-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV006-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 19:12:31 EDT 2022
% Result : Unsatisfiable 2.65s 2.86s
% Output : Refutation 2.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : HWV006-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 16 20:51:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n012.cluster.edu,
% 0.14/0.37 Thu Jun 16 20:51:24 2022
% 0.14/0.37 The command was "./sos". The process ID is 2916.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.14/0.37
% 0.14/0.37 This is a non-Horn set without equality. The strategy
% 0.14/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.46/0.70
% 0.46/0.70 Model 1 (0.00 seconds, 0 Inserts)
% 0.46/0.70
% 0.46/0.70 Stopped by limit on number of solutions
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70 -------------- Softie stats --------------
% 0.46/0.70
% 0.46/0.70 UPDATE_STOP: 300
% 0.46/0.70 SFINDER_TIME_LIMIT: 2
% 0.46/0.70 SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.70 number of clauses in intial UL: 58
% 0.46/0.70 number of clauses initially in problem: 64
% 0.46/0.70 percentage of clauses intially in UL: 90
% 0.46/0.70 percentage of distinct symbols occuring in initial UL: 100
% 0.46/0.70 percent of all initial clauses that are short: 100
% 0.46/0.70 absolute distinct symbol count: 25
% 0.46/0.70 distinct predicate count: 12
% 0.46/0.70 distinct function count: 12
% 0.46/0.70 distinct constant count: 1
% 0.46/0.70
% 0.46/0.70 ---------- no more Softie stats ----------
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70 Stopped by limit on insertions
% 0.46/0.70
% 0.46/0.70 =========== start of search ===========
% 2.65/2.86
% 2.65/2.86 -------- PROOF --------
% 2.65/2.86 % SZS status Unsatisfiable
% 2.65/2.86 % SZS output start Refutation
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 2 [ 1 0 739 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 3 [ 2 0 220 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 4 [ 2 0 916 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 5 [ 3 0 106 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 6 [ 1 1 39336 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 7 [ 4 0 1080 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 8 [ 4 1 7363 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 9 [ 4 0 408 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 10 [ 7 1 2487 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 11 [ 6 0 1674 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 12 [ 10 0 558 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 13 [ 7 1 623 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 14 [ 12 0 617 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 15 [ 9 1 372 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 16 [ 5 0 125 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 17 [ 10 0 376 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 18 [ 11 1 489 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 19 [ 13 0 899 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 20 [ 12 0 769 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 21 [ 14 1 17836 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 22 [ 11 3 88783 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 23 [ 7 1 1644 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 24 [ 11 0 414 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 25 [ 8 1 1333 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 26 [ 17 0 1306 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 27 [ 11 0 149 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 Stopped by limit on insertions
% 2.65/2.86
% 2.65/2.86 Model 28 [ 16 0 1307 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 -----> EMPTY CLAUSE at 2.47 sec ----> 164 [hyper,162,54,149] {-} $F.
% 2.65/2.86
% 2.65/2.86 Length of proof is 70. Level of proof is 18.
% 2.65/2.86
% 2.65/2.86 ---------------- PROOF ----------------
% 2.65/2.86 % SZS status Unsatisfiable
% 2.65/2.86 % SZS output start Refutation
% 2.65/2.86
% 2.65/2.86 1 [] {+} -connection(A,B)| -zero(A)|zero(B).
% 2.65/2.86 2 [] {+} -connection(A,B)| -one(A)|one(B).
% 2.65/2.86 3 [] {+} -connection(A,B)| -zero(B)|zero(A).
% 2.65/2.86 4 [] {+} -connection(A,B)| -one(B)|one(A).
% 2.65/2.86 5 [] {+} -zero(A)| -one(A).
% 2.65/2.86 6 [] {+} -and_ok(A)| -zero(in1(A))|zero(out1(A)).
% 2.65/2.86 7 [] {+} -and_ok(A)| -zero(in2(A))|zero(out1(A)).
% 2.65/2.86 8 [] {+} -and_ok(A)| -one(in1(A))| -one(in2(A))|one(out1(A)).
% 2.65/2.86 9 [] {+} -and_ok(A)| -zero(out1(A))|zero(in1(A))|zero(in2(A)).
% 2.65/2.86 13 [] {+} -logic_and(A)|and_ok(A)|abnormal(A).
% 2.65/2.86 15 [] {+} -or_ok(A)| -one(in2(A))|one(out1(A)).
% 2.65/2.86 18 [] {+} -or_ok(A)| -zero(out1(A))|zero(in1(A)).
% 2.65/2.86 21 [] {+} -logic_or(A)|or_ok(A)|abnormal(A).
% 2.65/2.86 22 [] {+} -not_ok(A)| -zero(in1(A))|one(out1(A)).
% 2.65/2.86 23 [] {+} -not_ok(A)| -one(in1(A))|zero(out1(A)).
% 2.65/2.86 27 [] {+} -logic_not(A)|not_ok(A)|abnormal(A).
% 2.65/2.86 28 [] {+} -halfadder(A)|logic_and(and1(A)).
% 2.65/2.86 29 [] {+} -halfadder(A)|logic_and(and2(A)).
% 2.65/2.86 30 [] {+} -halfadder(A)|logic_not(not1(A)).
% 2.65/2.86 31 [] {+} -halfadder(A)|logic_or(or1(A)).
% 2.65/2.86 33 [] {+} -halfadder(A)|connection(in2(A),in2(or1(A))).
% 2.65/2.86 34 [] {+} -halfadder(A)|connection(in1(A),in1(and2(A))).
% 2.65/2.86 35 [] {+} -halfadder(A)|connection(in2(A),in2(and2(A))).
% 2.65/2.86 36 [] {+} -halfadder(A)|connection(outs(A),out1(and1(A))).
% 2.65/2.86 37 [] {+} -halfadder(A)|connection(outc(A),out1(and2(A))).
% 2.65/2.86 38 [] {+} -halfadder(A)|connection(out1(or1(A)),in1(and1(A))).
% 2.65/2.86 39 [] {+} -halfadder(A)|connection(out1(and2(A)),in1(not1(A))).
% 2.65/2.86 40 [] {+} -halfadder(A)|connection(out1(not1(A)),in2(and1(A))).
% 2.65/2.86 41 [] {+} -fulladder(A)|halfadder(h1(A)).
% 2.65/2.86 42 [] {+} -fulladder(A)|halfadder(h2(A)).
% 2.65/2.86 43 [] {+} -fulladder(A)|logic_or(or1(A)).
% 2.65/2.86 44 [] {+} -fulladder(A)|connection(outs(h1(A)),in2(h2(A))).
% 2.65/2.86 46 [] {+} -fulladder(A)|connection(outc(h2(A)),in1(or1(A))).
% 2.65/2.86 47 [] {+} -fulladder(A)|connection(in1(A),in1(h2(A))).
% 2.65/2.86 48 [] {+} -fulladder(A)|connection(in2(A),in1(h1(A))).
% 2.65/2.86 49 [] {+} -fulladder(A)|connection(inc(A),in2(h1(A))).
% 2.65/2.86 50 [] {+} -fulladder(A)|connection(outs(A),outs(h2(A))).
% 2.65/2.86 51 [] {+} -fulladder(A)|connection(outc(A),out1(or1(A))).
% 2.65/2.86 52 [] {+} -abnormal(or1(f))| -abnormal(not1(h2(f))).
% 2.65/2.86 53 [] {+} -abnormal(and2(h2(f))).
% 2.65/2.86 54 [] {+} -abnormal(or1(f))| -abnormal(and1(h2(f))).
% 2.65/2.86 55 [] {+} -abnormal(or1(h1(f))).
% 2.65/2.86 56 [] {+} -abnormal(not1(h1(f))).
% 2.65/2.86 57 [] {+} -abnormal(and2(h1(f))).
% 2.65/2.86 58 [] {+} -abnormal(and1(h1(f))).
% 2.65/2.86 59 [] {-} fulladder(f).
% 2.65/2.86 60 [] {+} one(in1(f)).
% 2.65/2.86 61 [] {+} zero(in2(f)).
% 2.65/2.86 62 [] {+} one(inc(f)).
% 2.65/2.86 63 [] {+} one(outs(f)).
% 2.65/2.86 64 [] {+} zero(outc(f)).
% 2.65/2.86 65 [hyper,59,51] {+} connection(outc(f),out1(or1(f))).
% 2.65/2.86 66 [hyper,59,50] {-} connection(outs(f),outs(h2(f))).
% 2.65/2.86 67 [hyper,59,49] {+} connection(inc(f),in2(h1(f))).
% 2.65/2.86 68 [hyper,59,48] {+} connection(in2(f),in1(h1(f))).
% 2.65/2.86 69 [hyper,59,47] {+} connection(in1(f),in1(h2(f))).
% 2.65/2.86 70 [hyper,59,46] {-} connection(outc(h2(f)),in1(or1(f))).
% 2.65/2.86 72 [hyper,59,44] {-} connection(outs(h1(f)),in2(h2(f))).
% 2.65/2.86 73 [hyper,59,43] {+} logic_or(or1(f)).
% 2.65/2.86 74 [hyper,59,42] {+} halfadder(h2(f)).
% 2.65/2.86 75 [hyper,59,41] {+} halfadder(h1(f)).
% 2.65/2.86 76 [hyper,74,40] {-} connection(out1(not1(h2(f))),in2(and1(h2(f)))).
% 2.65/2.86 77 [hyper,74,39] {-} connection(out1(and2(h2(f))),in1(not1(h2(f)))).
% 2.65/2.86 79 [hyper,74,37] {-} connection(outc(h2(f)),out1(and2(h2(f)))).
% 2.65/2.86 80 [hyper,74,36] {-} connection(outs(h2(f)),out1(and1(h2(f)))).
% 2.65/2.86 81 [hyper,74,35] {-} connection(in2(h2(f)),in2(and2(h2(f)))).
% 2.65/2.86 82 [hyper,74,34] {-} connection(in1(h2(f)),in1(and2(h2(f)))).
% 2.65/2.86 86 [hyper,74,30] {+} logic_not(not1(h2(f))).
% 2.65/2.86 87 [hyper,74,29] {+} logic_and(and2(h2(f))).
% 2.65/2.86 88 [hyper,74,28] {+} logic_and(and1(h2(f))).
% 2.65/2.86 89 [hyper,73,21] {+} or_ok(or1(f))|abnormal(or1(f)).
% 2.65/2.86 90 [hyper,75,40] {-} connection(out1(not1(h1(f))),in2(and1(h1(f)))).
% 2.65/2.86 91 [hyper,75,39] {-} connection(out1(and2(h1(f))),in1(not1(h1(f)))).
% 2.65/2.86 92 [hyper,75,38] {-} connection(out1(or1(h1(f))),in1(and1(h1(f)))).
% 2.65/2.86 94 [hyper,75,36] {-} connection(outs(h1(f)),out1(and1(h1(f)))).
% 2.65/2.86 96 [hyper,75,34] {-} connection(in1(h1(f)),in1(and2(h1(f)))).
% 2.65/2.86 97 [hyper,75,33] {+} connection(in2(h1(f)),in2(or1(h1(f)))).
% 2.65/2.86 99 [hyper,75,31] {+} logic_or(or1(h1(f))).
% 2.65/2.86 100 [hyper,75,30] {+} logic_not(not1(h1(f))).
% 2.65/2.86 101 [hyper,75,29] {+} logic_and(and2(h1(f))).
% 2.65/2.86 102 [hyper,75,28] {+} logic_and(and1(h1(f))).
% 2.65/2.86 104 [hyper,65,1,64] {+} zero(out1(or1(f))).
% 2.65/2.86 105 [hyper,86,27] {+} not_ok(not1(h2(f)))|abnormal(not1(h2(f))).
% 2.65/2.86 106 [hyper,88,13] {+} and_ok(and1(h2(f)))|abnormal(and1(h2(f))).
% 2.65/2.86 107 [hyper,100,27,unit_del,56] {+} not_ok(not1(h1(f))).
% 2.65/2.86 108 [hyper,66,2,63] {+} one(outs(h2(f))).
% 2.65/2.86 109 [hyper,87,13,unit_del,53] {+} and_ok(and2(h2(f))).
% 2.65/2.86 110 [hyper,99,21,unit_del,55] {+} or_ok(or1(h1(f))).
% 2.65/2.86 111 [hyper,101,13,unit_del,57] {+} and_ok(and2(h1(f))).
% 2.65/2.86 112 [hyper,67,2,62] {+} one(in2(h1(f))).
% 2.65/2.86 113 [hyper,102,13,unit_del,58] {+} and_ok(and1(h1(f))).
% 2.65/2.86 114 [hyper,68,1,61] {+} zero(in1(h1(f))).
% 2.65/2.86 115 [hyper,69,2,60] {+} one(in1(h2(f))).
% 2.65/2.86 117 [hyper,89,18,104] {-} abnormal(or1(f))|zero(in1(or1(f))).
% 2.65/2.86 119 [hyper,117,3,70] {+} abnormal(or1(f))|zero(outc(h2(f))).
% 2.65/2.86 120 [hyper,80,2,108] {-} one(out1(and1(h2(f)))).
% 2.65/2.86 121 [hyper,82,2,115] {-} one(in1(and2(h2(f)))).
% 2.65/2.86 122 [hyper,119,1,79] {-} abnormal(or1(f))|zero(out1(and2(h2(f)))).
% 2.65/2.86 126 [hyper,96,1,114] {-} zero(in1(and2(h1(f)))).
% 2.65/2.86 127 [hyper,126,6,111] {-} zero(out1(and2(h1(f)))).
% 2.65/2.86 129 [hyper,91,1,127] {-} zero(in1(not1(h1(f)))).
% 2.65/2.86 130 [hyper,129,22,107] {-} one(out1(not1(h1(f)))).
% 2.65/2.86 131 [hyper,130,2,90] {-} one(in2(and1(h1(f)))).
% 2.65/2.86 133 [hyper,97,2,112] {-} one(in2(or1(h1(f)))).
% 2.65/2.86 134 [hyper,133,15,110] {-} one(out1(or1(h1(f)))).
% 2.65/2.86 135 [hyper,134,2,92] {-} one(in1(and1(h1(f)))).
% 2.65/2.86 137 [hyper,135,8,113,131] {-} one(out1(and1(h1(f)))).
% 2.65/2.86 138 [hyper,137,4,94] {+} one(outs(h1(f))).
% 2.65/2.86 139 [hyper,138,2,72] {+} one(in2(h2(f))).
% 2.65/2.86 142 [hyper,139,2,81] {+} one(in2(and2(h2(f)))).
% 2.65/2.86 143 [hyper,122,9,109] {-} abnormal(or1(f))|zero(in1(and2(h2(f))))|zero(in2(and2(h2(f)))).
% 2.65/2.86 145 [hyper,143,5,121] {-} abnormal(or1(f))|zero(in2(and2(h2(f)))).
% 2.65/2.86 148 [hyper,145,3,81] {-} abnormal(or1(f))|zero(in2(h2(f))).
% 2.65/2.86 149 [hyper,148,5,139] {+} abnormal(or1(f)).
% 2.65/2.86 152 [hyper,142,8,109,121] {+} one(out1(and2(h2(f)))).
% 2.65/2.86 154 [hyper,152,2,77] {+} one(in1(not1(h2(f)))).
% 2.65/2.86 157 [hyper,154,23,105] {-} zero(out1(not1(h2(f))))|abnormal(not1(h2(f))).
% 2.65/2.86 158 [hyper,157,1,76] {-} abnormal(not1(h2(f)))|zero(in2(and1(h2(f)))).
% 2.65/2.86 159 [hyper,158,7,106] {-} abnormal(not1(h2(f)))|zero(out1(and1(h2(f))))|abnormal(and1(h2(f))).
% 2.65/2.86 160 [hyper,159,5,120] {-} abnormal(not1(h2(f)))|abnormal(and1(h2(f))).
% 2.65/2.86 162 [hyper,160,52,149] {+} abnormal(and1(h2(f))).
% 2.65/2.86 164 [hyper,162,54,149] {-} $F.
% 2.65/2.86
% 2.65/2.86 % SZS output end Refutation
% 2.65/2.86 ------------ end of proof -------------
% 2.65/2.86
% 2.65/2.86
% 2.65/2.86 Search stopped by max_proofs option.
% 2.65/2.86
% 2.65/2.86
% 2.65/2.86 Search stopped by max_proofs option.
% 2.65/2.86
% 2.65/2.86 ============ end of search ============
% 2.65/2.86
% 2.65/2.86 ----------- soft-scott stats ----------
% 2.65/2.86
% 2.65/2.86 true clauses given 25 (25.5%)
% 2.65/2.86 false clauses given 73
% 2.65/2.86
% 2.65/2.86 FALSE TRUE
% 2.65/2.86 4 0 1
% 2.65/2.86 9 0 1
% 2.65/2.86 tot: 0 2 (100.0% true)
% 2.65/2.86
% 2.65/2.86
% 2.65/2.86 Model 28 [ 16 0 1307 ] (0.00 seconds, 250000 Inserts)
% 2.65/2.86
% 2.65/2.86 That finishes the proof of the theorem.
% 2.65/2.86
% 2.65/2.86 Process 2916 finished Thu Jun 16 20:51:26 2022
%------------------------------------------------------------------------------