%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV008-2.002 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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.58s 0.79s
% Output : Refutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV008-2.002 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 01:43:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.13/0.36 Fri Jun 17 01:43:04 2022
% 0.13/0.36 The command was "./sos". The process ID is 30189.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 65
% 0.13/0.40 number of clauses initially in problem: 74
% 0.13/0.40 percentage of clauses intially in UL: 87
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 33
% 0.13/0.40 distinct predicate count: 13
% 0.13/0.40 distinct function count: 19
% 0.13/0.40 distinct constant count: 1
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.58/0.79
% 0.58/0.79 -------- PROOF --------
% 0.58/0.79 % SZS status Unsatisfiable
% 0.58/0.79 % SZS output start Refutation
% 0.58/0.79
% 0.58/0.79 Model 3 (0.00 seconds, 0 Inserts)
% 0.58/0.79
% 0.58/0.79 Stopped by limit on number of solutions
% 0.58/0.79
% 0.58/0.79 Stopped by limit on insertions
% 0.58/0.79
% 0.58/0.79 Model 4 [ 2 1 650 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.79
% 0.58/0.79 Stopped by limit on insertions
% 0.58/0.79
% 0.58/0.79 Model 5 [ 1 1 5131 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.79
% 0.58/0.79 Stopped by limit on insertions
% 0.58/0.79
% 0.58/0.79 Model 6 [ 3 0 3292 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.79
% 0.58/0.79 Stopped by limit on insertions
% 0.58/0.79
% 0.58/0.79 Model 7 [ 4 1 1162 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.79
% 0.58/0.79 -----> EMPTY CLAUSE at 0.41 sec ----> 221 [hyper,215,5,194] {-} $F.
% 0.58/0.79
% 0.58/0.79 Length of proof is 37. Level of proof is 10.
% 0.58/0.79
% 0.58/0.79 ---------------- PROOF ----------------
% 0.58/0.79 % SZS status Unsatisfiable
% 0.58/0.79 % SZS output start Refutation
% 0.58/0.79
% 0.58/0.79 1 [] {+} -connection(A,B)| -zero(A)|zero(B).
% 0.58/0.79 2 [] {+} -connection(A,B)| -one(A)|one(B).
% 0.58/0.79 3 [] {+} -connection(A,B)| -zero(B)|zero(A).
% 0.58/0.79 4 [] {+} -connection(A,B)| -one(B)|one(A).
% 0.58/0.79 5 [] {+} -zero(A)| -one(A).
% 0.58/0.79 6 [] {+} -and_ok(A)| -zero(in1(A))|zero(out1(A)).
% 0.58/0.79 10 [] {+} -and_ok(A)| -one(out1(A))|one(in1(A)).
% 0.58/0.79 13 [] {+} -logic_and(A)|and_ok(A)|abnormal(A).
% 0.58/0.79 17 [] {+} -or_ok(A)| -one(out1(A))|one(in1(A))|one(in2(A)).
% 0.58/0.79 21 [] {+} -logic_or(A)|or_ok(A)|abnormal(A).
% 0.58/0.79 29 [] {+} -halfadder(A)|logic_and(and2(A)).
% 0.58/0.79 34 [] {+} -halfadder(A)|connection(in1(A),in1(and2(A))).
% 0.58/0.79 37 [] {+} -halfadder(A)|connection(outc(A),out1(and2(A))).
% 0.58/0.79 41 [] {+} -fulladder(A)|halfadder(h1(A)).
% 0.58/0.79 42 [] {+} -fulladder(A)|halfadder(h2(A)).
% 0.58/0.79 43 [] {+} -fulladder(A)|logic_or(or1(A)).
% 0.58/0.79 45 [] {+} -fulladder(A)|connection(outc(h1(A)),in2(or1(A))).
% 0.58/0.79 46 [] {+} -fulladder(A)|connection(outc(h2(A)),in1(or1(A))).
% 0.58/0.79 47 [] {+} -fulladder(A)|connection(in1(A),in1(h2(A))).
% 0.58/0.79 48 [] {+} -fulladder(A)|connection(in2(A),in1(h1(A))).
% 0.58/0.79 51 [] {+} -fulladder(A)|connection(outc(A),out1(or1(A))).
% 0.58/0.79 53 [] {+} -nbit_adder2(A)|fulladder(f2(A)).
% 0.58/0.79 56 [] {+} -nbit_adder2(A)|connection(outc(A),outc(f2(A))).
% 0.58/0.79 59 [] {+} -nbit_adder2(A)|connection(ina2(A),in1(f2(A))).
% 0.58/0.79 60 [] {+} -nbit_adder2(A)|connection(inb2(A),in2(f2(A))).
% 0.58/0.79 63 [] {+} -abnormal(or1(f2(a))).
% 0.58/0.79 64 [] {+} -abnormal(and2(h1(f2(a)))).
% 0.58/0.79 65 [] {+} -abnormal(and2(h2(f2(a)))).
% 0.58/0.79 66 [] {+} nbit_adder2(a).
% 0.58/0.79 68 [] {+} zero(ina2(a)).
% 0.58/0.79 70 [] {+} zero(inb2(a)).
% 0.58/0.79 74 [] {+} one(outc(a)).
% 0.58/0.79 77 [hyper,66,60] {+} connection(inb2(a),in2(f2(a))).
% 0.58/0.79 78 [hyper,66,59] {+} connection(ina2(a),in1(f2(a))).
% 0.58/0.79 81 [hyper,66,56] {+} connection(outc(a),outc(f2(a))).
% 0.58/0.79 84 [hyper,66,53] {+} fulladder(f2(a)).
% 0.58/0.79 86 [hyper,84,51] {-} connection(outc(f2(a)),out1(or1(f2(a)))).
% 0.58/0.79 89 [hyper,84,48] {+} connection(in2(f2(a)),in1(h1(f2(a)))).
% 0.58/0.79 90 [hyper,84,47] {+} connection(in1(f2(a)),in1(h2(f2(a)))).
% 0.58/0.79 91 [hyper,84,46] {-} connection(outc(h2(f2(a))),in1(or1(f2(a)))).
% 0.58/0.79 92 [hyper,84,45] {-} connection(outc(h1(f2(a))),in2(or1(f2(a)))).
% 0.58/0.79 94 [hyper,84,43] {+} logic_or(or1(f2(a))).
% 0.58/0.79 95 [hyper,84,42] {+} halfadder(h2(f2(a))).
% 0.58/0.79 96 [hyper,84,41] {+} halfadder(h1(f2(a))).
% 0.58/0.79 109 [hyper,94,21,unit_del,63] {+} or_ok(or1(f2(a))).
% 0.58/0.79 113 [hyper,95,37] {-} connection(outc(h2(f2(a))),out1(and2(h2(f2(a))))).
% 0.58/0.79 116 [hyper,95,34] {-} connection(in1(h2(f2(a))),in1(and2(h2(f2(a))))).
% 0.58/0.79 121 [hyper,95,29] {+} logic_and(and2(h2(f2(a)))).
% 0.58/0.79 126 [hyper,96,37] {-} connection(outc(h1(f2(a))),out1(and2(h1(f2(a))))).
% 0.58/0.79 129 [hyper,96,34] {-} connection(in1(h1(f2(a))),in1(and2(h1(f2(a))))).
% 0.58/0.79 134 [hyper,96,29] {+} logic_and(and2(h1(f2(a)))).
% 0.58/0.79 163 [hyper,77,1,70] {+} zero(in2(f2(a))).
% 0.58/0.79 166 [hyper,78,1,68] {+} zero(in1(f2(a))).
% 0.58/0.79 167 [hyper,121,13,unit_del,65] {+} and_ok(and2(h2(f2(a)))).
% 0.58/0.79 172 [hyper,134,13,unit_del,64] {+} and_ok(and2(h1(f2(a)))).
% 0.58/0.79 178 [hyper,81,2,74] {+} one(outc(f2(a))).
% 0.58/0.79 185 [hyper,86,2,178] {-} one(out1(or1(f2(a)))).
% 0.58/0.79 186 [hyper,185,17,109] {-} one(in1(or1(f2(a))))|one(in2(or1(f2(a)))).
% 0.58/0.79 190 [hyper,89,1,163] {+} zero(in1(h1(f2(a)))).
% 0.58/0.79 191 [hyper,90,1,166] {+} zero(in1(h2(f2(a)))).
% 0.58/0.79 193 [hyper,129,1,190] {+} zero(in1(and2(h1(f2(a))))).
% 0.58/0.79 194 [hyper,191,1,116] {+} zero(in1(and2(h2(f2(a))))).
% 0.58/0.79 197 [hyper,193,6,172] {+} zero(out1(and2(h1(f2(a))))).
% 0.58/0.79 204 [hyper,197,3,126] {+} zero(outc(h1(f2(a)))).
% 0.58/0.79 207 [hyper,186,4,92] {-} one(in1(or1(f2(a))))|one(outc(h1(f2(a)))).
% 0.58/0.79 211 [hyper,207,5,204] {-} one(in1(or1(f2(a)))).
% 0.58/0.79 212 [hyper,211,4,91] {-} one(outc(h2(f2(a)))).
% 0.58/0.79 213 [hyper,212,2,113] {-} one(out1(and2(h2(f2(a))))).
% 0.58/0.79 215 [hyper,213,10,167] {-} one(in1(and2(h2(f2(a))))).
% 0.58/0.79 221 [hyper,215,5,194] {-} $F.
% 0.58/0.79
% 0.58/0.79 % SZS output end Refutation
% 0.58/0.79 ------------ end of proof -------------
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 Search stopped by max_proofs option.
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 Search stopped by max_proofs option.
% 0.58/0.79
% 0.58/0.79 ============ end of search ============
% 0.58/0.79
% 0.58/0.79 ----------- soft-scott stats ----------
% 0.58/0.79
% 0.58/0.79 true clauses given 68 (53.5%)
% 0.58/0.79 false clauses given 59
% 0.58/0.79
% 0.58/0.79 FALSE TRUE
% 0.58/0.79 5 0 1
% 0.58/0.79 6 3 6
% 0.58/0.79 10 0 11
% 0.58/0.79 11 1 4
% 0.58/0.79 tot: 4 22 (84.6% true)
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 Model 7 [ 4 1 1162 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.79
% 0.58/0.79 That finishes the proof of the theorem.
% 0.58/0.79
% 0.58/0.79 Process 30189 finished Fri Jun 17 01:43:04 2022
%------------------------------------------------------------------------------