%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV008-1.001 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:32 EDT 2022
% Result : Unsatisfiable 1.09s 1.32s
% Output : Refutation 1.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV008-1.001 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n022.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 03:13:17 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 sandbox on n022.cluster.edu,
% 0.13/0.36 Fri Jun 17 03:13:17 2022
% 0.13/0.36 The command was "./sos". The process ID is 13128.
% 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=1, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 Following clause subsumed by 5 during input processing: 0 [] {-} -equal_value(n1,n0).
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.64/0.82
% 0.64/0.82 Stopped by limit on insertions
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82 Failed to model usable list: disabling FINDER
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82 -------------- Softie stats --------------
% 0.64/0.82
% 0.64/0.82 UPDATE_STOP: 300
% 0.64/0.82 SFINDER_TIME_LIMIT: 2
% 0.64/0.82 SHORT_CLAUSE_CUTOFF: 4
% 0.64/0.82 number of clauses in intial UL: 54
% 0.64/0.82 number of clauses initially in problem: 60
% 0.64/0.82 percentage of clauses intially in UL: 90
% 0.64/0.82 percentage of distinct symbols occuring in initial UL: 100
% 0.64/0.82 percent of all initial clauses that are short: 100
% 0.64/0.82 absolute distinct symbol count: 30
% 0.64/0.82 distinct predicate count: 5
% 0.64/0.82 distinct function count: 10
% 0.64/0.82 distinct constant count: 15
% 0.64/0.82
% 0.64/0.82 ---------- no more Softie stats ----------
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82
% 0.64/0.82 =========== start of search ===========
% 1.09/1.32
% 1.09/1.32 -------- PROOF --------
% 1.09/1.32 % SZS status Unsatisfiable
% 1.09/1.32 % SZS output start Refutation
% 1.09/1.32
% 1.09/1.32 ----> UNIT CONFLICT at 0.94 sec ----> 2187 [binary,2185.1,5.1] {-} $F.
% 1.09/1.32
% 1.09/1.32 Length of proof is 38. Level of proof is 9.
% 1.09/1.32
% 1.09/1.32 ---------------- PROOF ----------------
% 1.09/1.32 % SZS status Unsatisfiable
% 1.09/1.32 % SZS output start Refutation
% 1.09/1.32
% 1.09/1.32 1 [] {+} -connection(A,B)| -value(A,C)|value(B,C).
% 1.09/1.32 2 [] {+} -connection(A,B)| -value(B,C)|value(A,C).
% 1.09/1.32 3 [] {+} -value(A,B)| -value(A,C)|equal_value(B,C).
% 1.09/1.32 4 [] {-} -equal_value(n0,n1).
% 1.09/1.32 5 [copy,4,flip.1] {+} -equal_value(n1,n0).
% 1.09/1.32 7 [] {+} -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 1.09/1.32 8 [] {+} -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 1.09/1.32 14 [] {+} -mode(A,ok)| -type(A,or)| -value(in(n1,A),n0)| -value(in(n2,A),n0)|value(out(n1,A),n0).
% 1.09/1.32 23 [] {+} -type(A,halfadder)|type(and2(A),and).
% 1.09/1.32 28 [] {+} -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 1.09/1.32 29 [] {+} -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 1.09/1.32 31 [] {+} -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 1.09/1.32 35 [] {+} -type(A,fulladder)|type(h1(A),halfadder).
% 1.09/1.32 36 [] {+} -type(A,fulladder)|type(h2(A),halfadder).
% 1.09/1.32 37 [] {+} -type(A,fulladder)|type(or1(A),or).
% 1.09/1.32 39 [] {+} -type(A,fulladder)|connection(out(c,h1(A)),in(n2,or1(A))).
% 1.09/1.32 40 [] {+} -type(A,fulladder)|connection(out(c,h2(A)),in(n1,or1(A))).
% 1.09/1.32 41 [] {+} -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 1.09/1.32 43 [] {+} -type(A,fulladder)|connection(in(c,A),in(n2,h1(A))).
% 1.09/1.32 45 [] {+} -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 1.09/1.32 46 [] {+} -type(A,nbit_adder(n1))|type(v(n1,A),fulladder).
% 1.09/1.32 48 [] {+} -type(A,nbit_adder(n1))|connection(out(c,A),out(c,v(n1,A))).
% 1.09/1.32 49 [] {+} -type(A,nbit_adder(n1))|connection(in(a1,A),in(n1,v(n1,A))).
% 1.09/1.32 51 [] {+} -type(A,nbit_adder(n1))|connection(in(c,A),in(c,v(n1,A))).
% 1.09/1.32 52 [] {+} -mode(or1(v(n1,a)),abnormal).
% 1.09/1.32 53 [] {+} -mode(and2(h1(v(n1,a))),abnormal).
% 1.09/1.32 54 [] {+} -mode(and2(h2(v(n1,a))),abnormal).
% 1.09/1.32 56 [] {-} type(a,nbit_adder(n1)).
% 1.09/1.32 57 [] {-} value(in(a1,a),n0).
% 1.09/1.32 59 [] {-} value(in(c,a),n0).
% 1.09/1.32 61 [] {-} value(out(c,a),n1).
% 1.09/1.32 62 [hyper,56,51] {-} connection(in(c,a),in(c,v(n1,a))).
% 1.09/1.32 64 [hyper,56,49] {-} connection(in(a1,a),in(n1,v(n1,a))).
% 1.09/1.32 65 [hyper,56,48] {-} connection(out(c,a),out(c,v(n1,a))).
% 1.09/1.32 67 [hyper,56,46] {-} type(v(n1,a),fulladder).
% 1.09/1.32 94 [hyper,67,45] {-} connection(out(c,v(n1,a)),out(n1,or1(v(n1,a)))).
% 1.09/1.32 96 [hyper,67,43] {-} connection(in(c,v(n1,a)),in(n2,h1(v(n1,a)))).
% 1.09/1.32 98 [hyper,67,41] {-} connection(in(n1,v(n1,a)),in(n1,h2(v(n1,a)))).
% 1.09/1.32 99 [hyper,67,40] {-} connection(out(c,h2(v(n1,a))),in(n1,or1(v(n1,a)))).
% 1.09/1.32 100 [hyper,67,39] {-} connection(out(c,h1(v(n1,a))),in(n2,or1(v(n1,a)))).
% 1.09/1.32 102 [hyper,67,37] {-} type(or1(v(n1,a)),or).
% 1.09/1.32 103 [hyper,67,36] {-} type(h2(v(n1,a)),halfadder).
% 1.09/1.32 104 [hyper,67,35] {-} type(h1(v(n1,a)),halfadder).
% 1.09/1.32 116 [hyper,62,1,59] {-} value(in(c,v(n1,a)),n0).
% 1.09/1.32 125 [hyper,102,7,unit_del,52] {-} mode(or1(v(n1,a)),ok).
% 1.09/1.32 134 [hyper,103,31] {-} connection(out(c,h2(v(n1,a))),out(n1,and2(h2(v(n1,a))))).
% 1.09/1.32 137 [hyper,103,28] {-} connection(in(n1,h2(v(n1,a))),in(n1,and2(h2(v(n1,a))))).
% 1.09/1.32 142 [hyper,103,23] {-} type(and2(h2(v(n1,a))),and).
% 1.09/1.32 153 [hyper,104,31] {-} connection(out(c,h1(v(n1,a))),out(n1,and2(h1(v(n1,a))))).
% 1.09/1.32 155 [hyper,104,29] {-} connection(in(n2,h1(v(n1,a))),in(n2,and2(h1(v(n1,a))))).
% 1.09/1.32 161 [hyper,104,23] {-} type(and2(h1(v(n1,a))),and).
% 1.09/1.32 203 [hyper,142,7,unit_del,54] {-} mode(and2(h2(v(n1,a))),ok).
% 1.09/1.32 210 [hyper,64,1,57] {-} value(in(n1,v(n1,a)),n0).
% 1.09/1.32 240 [hyper,161,7,unit_del,53] {-} mode(and2(h1(v(n1,a))),ok).
% 1.09/1.32 247 [hyper,65,1,61] {-} value(out(c,v(n1,a)),n1).
% 1.09/1.32 531 [hyper,94,1,247] {-} value(out(n1,or1(v(n1,a))),n1).
% 1.09/1.32 628 [hyper,96,1,116] {-} value(in(n2,h1(v(n1,a))),n0).
% 1.09/1.32 720 [hyper,98,1,210] {-} value(in(n1,h2(v(n1,a))),n0).
% 1.09/1.32 1671 [hyper,137,1,720] {-} value(in(n1,and2(h2(v(n1,a)))),n0).
% 1.09/1.32 1685 [hyper,1671,8,203,142] {-} value(out(n1,and2(h2(v(n1,a)))),n0).
% 1.09/1.32 1694 [hyper,1685,2,134] {-} value(out(c,h2(v(n1,a))),n0).
% 1.09/1.32 1704 [hyper,1694,1,99] {-} value(in(n1,or1(v(n1,a))),n0).
% 1.09/1.32 2101 [hyper,155,1,628] {-} value(in(n2,and2(h1(v(n1,a)))),n0).
% 1.09/1.32 2115 [hyper,2101,8,240,161] {-} value(out(n1,and2(h1(v(n1,a)))),n0).
% 1.09/1.32 2124 [hyper,2115,2,153] {-} value(out(c,h1(v(n1,a))),n0).
% 1.09/1.32 2134 [hyper,2124,1,100] {-} value(in(n2,or1(v(n1,a))),n0).
% 1.09/1.32 2142 [hyper,2134,14,125,102,1704] {-} value(out(n1,or1(v(n1,a))),n0).
% 1.09/1.32 2185 [hyper,2142,3,531] {-} equal_value(n1,n0).
% 1.09/1.32 2187 [binary,2185.1,5.1] {-} $F.
% 1.09/1.32
% 1.09/1.32 % SZS output end Refutation
% 1.09/1.32 ------------ end of proof -------------
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 Search stopped by max_proofs option.
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 Search stopped by max_proofs option.
% 1.09/1.32
% 1.09/1.32 ============ end of search ============
% 1.09/1.32
% 1.09/1.32 That finishes the proof of the theorem.
% 1.09/1.32
% 1.09/1.32 Process 13128 finished Fri Jun 17 03:13:18 2022
%------------------------------------------------------------------------------