%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV008-2.001 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:33 EDT 2022
% Result : Unsatisfiable 0.84s 1.06s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV008-2.001 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 04:57:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.12/0.36 Fri Jun 17 04:57:04 2022
% 0.12/0.36 The command was "./sos". The process ID is 17087.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 60
% 0.12/0.40 number of clauses initially in problem: 66
% 0.12/0.40 percentage of clauses intially in UL: 90
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 29
% 0.12/0.40 distinct predicate count: 13
% 0.12/0.40 distinct function count: 15
% 0.12/0.40 distinct constant count: 1
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 0.84/1.06
% 0.84/1.06 -------- PROOF --------
% 0.84/1.06 % SZS status Unsatisfiable
% 0.84/1.06 % SZS output start Refutation
% 0.84/1.06
% 0.84/1.06 Model 3 (0.00 seconds, 0 Inserts)
% 0.84/1.06
% 0.84/1.06 Stopped by limit on number of solutions
% 0.84/1.06
% 0.84/1.06 Stopped by limit on insertions
% 0.84/1.06
% 0.84/1.06 Model 4 [ 2 2 4027 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.06
% 0.84/1.06 Stopped by limit on insertions
% 0.84/1.06
% 0.84/1.06 Model 5 [ 2 0 125 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.06
% 0.84/1.06 Stopped by limit on insertions
% 0.84/1.06
% 0.84/1.06 Model 6 [ 1 0 1154 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.06
% 0.84/1.06 Stopped by limit on insertions
% 0.84/1.06
% 0.84/1.06 Model 7 [ 4 0 1068 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.06
% 0.84/1.06 Stopped by limit on insertions
% 0.84/1.06
% 0.84/1.06 Model 8 [ 4 1 1221 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.06
% 0.84/1.06 -----> EMPTY CLAUSE at 0.67 sec ----> 176 [hyper,173,5,133] {-} $F.
% 0.84/1.06
% 0.84/1.06 Length of proof is 37. Level of proof is 11.
% 0.84/1.06
% 0.84/1.06 ---------------- PROOF ----------------
% 0.84/1.06 % SZS status Unsatisfiable
% 0.84/1.06 % SZS output start Refutation
% 0.84/1.06
% 0.84/1.06 1 [] {+} -connection(A,B)| -zero(A)|zero(B).
% 0.84/1.06 2 [] {+} -connection(A,B)| -one(A)|one(B).
% 0.84/1.06 4 [] {+} -connection(A,B)| -one(B)|one(A).
% 0.84/1.06 5 [] {+} -zero(A)| -one(A).
% 0.84/1.06 10 [] {+} -and_ok(A)| -one(out1(A))|one(in1(A)).
% 0.84/1.06 11 [] {+} -and_ok(A)| -one(out1(A))|one(in2(A)).
% 0.84/1.06 13 [] {+} -logic_and(A)|and_ok(A)|abnormal(A).
% 0.84/1.06 17 [] {+} -or_ok(A)| -one(out1(A))|one(in1(A))|one(in2(A)).
% 0.84/1.06 21 [] {+} -logic_or(A)|or_ok(A)|abnormal(A).
% 0.84/1.06 29 [] {+} -halfadder(A)|logic_and(and2(A)).
% 0.84/1.06 34 [] {+} -halfadder(A)|connection(in1(A),in1(and2(A))).
% 0.84/1.06 35 [] {+} -halfadder(A)|connection(in2(A),in2(and2(A))).
% 0.84/1.06 37 [] {+} -halfadder(A)|connection(outc(A),out1(and2(A))).
% 0.84/1.06 41 [] {+} -fulladder(A)|halfadder(h1(A)).
% 0.84/1.06 42 [] {+} -fulladder(A)|halfadder(h2(A)).
% 0.84/1.06 43 [] {+} -fulladder(A)|logic_or(or1(A)).
% 0.84/1.06 45 [] {+} -fulladder(A)|connection(outc(h1(A)),in2(or1(A))).
% 0.84/1.06 46 [] {+} -fulladder(A)|connection(outc(h2(A)),in1(or1(A))).
% 0.84/1.06 47 [] {+} -fulladder(A)|connection(in1(A),in1(h2(A))).
% 0.84/1.06 49 [] {+} -fulladder(A)|connection(inc(A),in2(h1(A))).
% 0.84/1.06 51 [] {+} -fulladder(A)|connection(outc(A),out1(or1(A))).
% 0.84/1.06 52 [] {+} -nbit_adder1(A)|fulladder(f1(A)).
% 0.84/1.06 54 [] {+} -nbit_adder1(A)|connection(outc(A),outc(f1(A))).
% 0.84/1.06 55 [] {+} -nbit_adder1(A)|connection(ina1(A),in1(f1(A))).
% 0.84/1.06 57 [] {+} -nbit_adder1(A)|connection(inc(A),inc(f1(A))).
% 0.84/1.06 58 [] {+} -abnormal(or1(f1(a))).
% 0.84/1.06 59 [] {+} -abnormal(and2(h1(f1(a)))).
% 0.84/1.06 60 [] {+} -abnormal(and2(h2(f1(a)))).
% 0.84/1.06 61 [] {+} nbit_adder1(a).
% 0.84/1.06 62 [] {+} zero(ina1(a)).
% 0.84/1.06 64 [] {+} zero(inc(a)).
% 0.84/1.06 66 [] {+} one(outc(a)).
% 0.84/1.06 67 [hyper,61,57] {+} connection(inc(a),inc(f1(a))).
% 0.84/1.06 69 [hyper,61,55] {+} connection(ina1(a),in1(f1(a))).
% 0.84/1.06 70 [hyper,61,54] {+} connection(outc(a),outc(f1(a))).
% 0.84/1.06 72 [hyper,61,52] {+} fulladder(f1(a)).
% 0.84/1.06 73 [hyper,72,51] {-} connection(outc(f1(a)),out1(or1(f1(a)))).
% 0.84/1.06 75 [hyper,72,49] {-} connection(inc(f1(a)),in2(h1(f1(a)))).
% 0.84/1.06 77 [hyper,72,47] {-} connection(in1(f1(a)),in1(h2(f1(a)))).
% 0.84/1.06 78 [hyper,72,46] {-} connection(outc(h2(f1(a))),in1(or1(f1(a)))).
% 0.84/1.06 79 [hyper,72,45] {-} connection(outc(h1(f1(a))),in2(or1(f1(a)))).
% 0.84/1.06 81 [hyper,72,43] {+} logic_or(or1(f1(a))).
% 0.84/1.06 82 [hyper,72,42] {+} halfadder(h2(f1(a))).
% 0.84/1.06 83 [hyper,72,41] {+} halfadder(h1(f1(a))).
% 0.84/1.06 84 [hyper,81,21,unit_del,58] {+} or_ok(or1(f1(a))).
% 0.84/1.06 88 [hyper,82,37] {-} connection(outc(h2(f1(a))),out1(and2(h2(f1(a))))).
% 0.84/1.06 91 [hyper,82,34] {-} connection(in1(h2(f1(a))),in1(and2(h2(f1(a))))).
% 0.84/1.06 96 [hyper,82,29] {+} logic_and(and2(h2(f1(a)))).
% 0.84/1.06 101 [hyper,83,37] {-} connection(outc(h1(f1(a))),out1(and2(h1(f1(a))))).
% 0.84/1.06 103 [hyper,83,35] {-} connection(in2(h1(f1(a))),in2(and2(h1(f1(a))))).
% 0.84/1.06 109 [hyper,83,29] {+} logic_and(and2(h1(f1(a)))).
% 0.84/1.06 111 [hyper,67,1,64] {+} zero(inc(f1(a))).
% 0.84/1.06 115 [hyper,96,13,unit_del,60] {+} and_ok(and2(h2(f1(a)))).
% 0.84/1.06 118 [hyper,69,1,62] {+} zero(in1(f1(a))).
% 0.84/1.06 120 [hyper,109,13,unit_del,59] {-} and_ok(and2(h1(f1(a)))).
% 0.84/1.06 122 [hyper,70,2,66] {+} one(outc(f1(a))).
% 0.84/1.06 125 [hyper,73,2,122] {-} one(out1(or1(f1(a)))).
% 0.84/1.06 126 [hyper,125,17,84] {-} one(in1(or1(f1(a))))|one(in2(or1(f1(a)))).
% 0.84/1.06 127 [hyper,75,1,111] {+} zero(in2(h1(f1(a)))).
% 0.84/1.06 129 [hyper,77,1,118] {+} zero(in1(h2(f1(a)))).
% 0.84/1.06 132 [hyper,129,1,91] {+} zero(in1(and2(h2(f1(a))))).
% 0.84/1.06 133 [hyper,103,1,127] {+} zero(in2(and2(h1(f1(a))))).
% 0.84/1.06 137 [hyper,126,4,78] {-} one(in2(or1(f1(a))))|one(outc(h2(f1(a)))).
% 0.84/1.06 140 [hyper,137,2,88] {-} one(in2(or1(f1(a))))|one(out1(and2(h2(f1(a))))).
% 0.84/1.06 146 [hyper,140,10,115] {-} one(in2(or1(f1(a))))|one(in1(and2(h2(f1(a))))).
% 0.84/1.06 170 [hyper,146,5,132] {-} one(in2(or1(f1(a)))).
% 0.84/1.06 171 [hyper,170,4,79] {-} one(outc(h1(f1(a)))).
% 0.84/1.06 172 [hyper,171,2,101] {-} one(out1(and2(h1(f1(a))))).
% 0.84/1.06 173 [hyper,172,11,120] {-} one(in2(and2(h1(f1(a))))).
% 0.84/1.06 176 [hyper,173,5,133] {-} $F.
% 0.84/1.06
% 0.84/1.06 % SZS output end Refutation
% 0.84/1.06 ------------ end of proof -------------
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 Search stopped by max_proofs option.
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 Search stopped by max_proofs option.
% 0.84/1.06
% 0.84/1.06 ============ end of search ============
% 0.84/1.06
% 0.84/1.06 ----------- soft-scott stats ----------
% 0.84/1.06
% 0.84/1.06 true clauses given 36 (40.4%)
% 0.84/1.06 false clauses given 53
% 0.84/1.06
% 0.84/1.06 FALSE TRUE
% 0.84/1.06 6 2 4
% 0.84/1.06 10 0 2
% 0.84/1.06 17 0 1
% 0.84/1.06 tot: 2 7 (77.8% true)
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 Model 8 [ 4 1 1221 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.06
% 0.84/1.06 That finishes the proof of the theorem.
% 0.84/1.06
% 0.84/1.06 Process 17087 finished Fri Jun 17 04:57:05 2022
%------------------------------------------------------------------------------