TSTP Solution File: HWV006-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV006-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 0.51s 0.70s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV006-1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 01:30:00 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 n021.cluster.edu,
% 0.13/0.36 Fri Jun 17 01:30:00 2022
% 0.13/0.36 The command was "./sos". The process ID is 12255.
% 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.45/0.65
% 0.45/0.65 Stopped by limit on insertions
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Failed to model usable list: disabling FINDER
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 -------------- Softie stats --------------
% 0.45/0.65
% 0.45/0.65 UPDATE_STOP: 300
% 0.45/0.65 SFINDER_TIME_LIMIT: 2
% 0.45/0.65 SHORT_CLAUSE_CUTOFF: 4
% 0.45/0.65 number of clauses in intial UL: 52
% 0.45/0.65 number of clauses initially in problem: 58
% 0.45/0.65 percentage of clauses intially in UL: 89
% 0.45/0.65 percentage of distinct symbols occuring in initial UL: 100
% 0.45/0.65 percent of all initial clauses that are short: 100
% 0.45/0.65 absolute distinct symbol count: 26
% 0.45/0.65 distinct predicate count: 5
% 0.45/0.65 distinct function count: 8
% 0.45/0.65 distinct constant count: 13
% 0.45/0.65
% 0.45/0.65 ---------- no more Softie stats ----------
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 =========== start of search ===========
% 0.51/0.70
% 0.51/0.70 -------- PROOF --------
% 0.51/0.70 % SZS status Unsatisfiable
% 0.51/0.70 % SZS output start Refutation
% 0.51/0.70
% 0.51/0.70 ----> UNIT CONFLICT at 0.32 sec ----> 846 [binary,844.1,5.1] {-} $F.
% 0.51/0.70
% 0.51/0.70 Length of proof is 69. Level of proof is 19.
% 0.51/0.70
% 0.51/0.70 ---------------- PROOF ----------------
% 0.51/0.70 % SZS status Unsatisfiable
% 0.51/0.70 % SZS output start Refutation
% 0.51/0.70
% 0.51/0.70 1 [] {+} -connection(A,B)| -value(A,C)|value(B,C).
% 0.51/0.70 2 [] {+} -connection(A,B)| -value(B,C)|value(A,C).
% 0.51/0.70 3 [] {+} -value(A,B)| -value(A,C)|equal_value(B,C).
% 0.51/0.70 4 [] {-} -equal_value(n0,n1).
% 0.51/0.70 5 [copy,4,flip.1] {+} -equal_value(n1,n0).
% 0.51/0.70 7 [] {+} -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 0.51/0.70 8 [] {+} -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 0.51/0.70 9 [] {+} -mode(A,ok)| -type(A,and)| -value(in(n1,A),n1)| -value(in(n2,A),n1)|value(out(n1,A),n1).
% 0.51/0.70 12 [] {+} -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n2,A),n1).
% 0.51/0.70 13 [] {+} -mode(A,ok)| -type(A,or)| -value(in(B,A),n1)|value(out(n1,A),n1).
% 0.51/0.70 16 [] {+} -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n1,A),n0).
% 0.51/0.70 18 [] {+} -mode(A,ok)| -type(A,not)| -value(in(n1,A),n0)|value(out(n1,A),n1).
% 0.51/0.70 19 [] {+} -mode(A,ok)| -type(A,not)| -value(in(n1,A),n1)|value(out(n1,A),n0).
% 0.51/0.70 22 [] {+} -type(A,halfadder)|type(and1(A),and).
% 0.51/0.70 23 [] {+} -type(A,halfadder)|type(and2(A),and).
% 0.51/0.70 24 [] {+} -type(A,halfadder)|type(not1(A),not).
% 0.51/0.70 25 [] {+} -type(A,halfadder)|type(or1(A),or).
% 0.51/0.70 27 [] {+} -type(A,halfadder)|connection(in(n2,A),in(n2,or1(A))).
% 0.51/0.70 28 [] {+} -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 0.51/0.70 29 [] {+} -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 0.51/0.70 30 [] {+} -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 0.51/0.70 31 [] {+} -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 0.51/0.70 32 [] {+} -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 0.51/0.70 33 [] {+} -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 0.51/0.70 34 [] {+} -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 0.51/0.70 35 [] {+} -type(A,fulladder)|type(h1(A),halfadder).
% 0.51/0.70 36 [] {+} -type(A,fulladder)|type(h2(A),halfadder).
% 0.51/0.70 37 [] {+} -type(A,fulladder)|type(or1(A),or).
% 0.51/0.70 38 [] {+} -type(A,fulladder)|connection(out(s,h1(A)),in(n2,h2(A))).
% 0.51/0.70 40 [] {+} -type(A,fulladder)|connection(out(c,h2(A)),in(n1,or1(A))).
% 0.51/0.70 41 [] {+} -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 0.51/0.70 42 [] {+} -type(A,fulladder)|connection(in(n2,A),in(n1,h1(A))).
% 0.51/0.70 43 [] {+} -type(A,fulladder)|connection(in(c,A),in(n2,h1(A))).
% 0.51/0.70 44 [] {+} -type(A,fulladder)|connection(out(s,A),out(s,h2(A))).
% 0.51/0.70 45 [] {+} -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 0.51/0.70 46 [] {+} -mode(or1(f),abnormal)| -mode(not1(h2(f)),abnormal).
% 0.51/0.70 47 [] {+} -mode(and2(h2(f)),abnormal).
% 0.51/0.70 48 [] {+} -mode(or1(f),abnormal)| -mode(and1(h2(f)),abnormal).
% 0.51/0.70 49 [] {+} -mode(or1(h1(f)),abnormal).
% 0.51/0.70 50 [] {+} -mode(not1(h1(f)),abnormal).
% 0.51/0.70 51 [] {+} -mode(and2(h1(f)),abnormal).
% 0.51/0.70 52 [] {+} -mode(and1(h1(f)),abnormal).
% 0.51/0.70 54 [] {-} type(f,fulladder).
% 0.51/0.70 55 [] {-} value(in(n1,f),n1).
% 0.51/0.70 56 [] {-} value(in(n2,f),n0).
% 0.51/0.70 57 [] {-} value(in(c,f),n1).
% 0.51/0.70 58 [] {-} value(out(s,f),n1).
% 0.51/0.70 59 [] {-} value(out(c,f),n0).
% 0.51/0.70 60 [hyper,54,45] {-} connection(out(c,f),out(n1,or1(f))).
% 0.51/0.70 61 [hyper,54,44] {-} connection(out(s,f),out(s,h2(f))).
% 0.51/0.70 62 [hyper,54,43] {-} connection(in(c,f),in(n2,h1(f))).
% 0.51/0.70 63 [hyper,54,42] {-} connection(in(n2,f),in(n1,h1(f))).
% 0.51/0.70 64 [hyper,54,41] {-} connection(in(n1,f),in(n1,h2(f))).
% 0.51/0.70 65 [hyper,54,40] {-} connection(out(c,h2(f)),in(n1,or1(f))).
% 0.51/0.70 67 [hyper,54,38] {-} connection(out(s,h1(f)),in(n2,h2(f))).
% 0.51/0.70 68 [hyper,54,37] {-} type(or1(f),or).
% 0.51/0.70 69 [hyper,54,36] {-} type(h2(f),halfadder).
% 0.51/0.70 70 [hyper,54,35] {-} type(h1(f),halfadder).
% 0.51/0.70 74 [hyper,68,7] {-} mode(or1(f),ok)|mode(or1(f),abnormal).
% 0.51/0.70 78 [hyper,69,34] {-} connection(out(n1,not1(h2(f))),in(n2,and1(h2(f)))).
% 0.51/0.70 79 [hyper,69,33] {-} connection(out(n1,and2(h2(f))),in(n1,not1(h2(f)))).
% 0.51/0.70 81 [hyper,69,31] {-} connection(out(c,h2(f)),out(n1,and2(h2(f)))).
% 0.51/0.70 82 [hyper,69,30] {-} connection(out(s,h2(f)),out(n1,and1(h2(f)))).
% 0.51/0.70 83 [hyper,69,29] {-} connection(in(n2,h2(f)),in(n2,and2(h2(f)))).
% 0.51/0.70 84 [hyper,69,28] {-} connection(in(n1,h2(f)),in(n1,and2(h2(f)))).
% 0.51/0.70 88 [hyper,69,24] {-} type(not1(h2(f)),not).
% 0.51/0.70 89 [hyper,69,23] {-} type(and2(h2(f)),and).
% 0.51/0.70 90 [hyper,69,22] {-} type(and1(h2(f)),and).
% 0.51/0.70 95 [hyper,70,34] {-} connection(out(n1,not1(h1(f))),in(n2,and1(h1(f)))).
% 0.51/0.70 96 [hyper,70,33] {-} connection(out(n1,and2(h1(f))),in(n1,not1(h1(f)))).
% 0.51/0.70 97 [hyper,70,32] {-} connection(out(n1,or1(h1(f))),in(n1,and1(h1(f)))).
% 0.51/0.70 99 [hyper,70,30] {-} connection(out(s,h1(f)),out(n1,and1(h1(f)))).
% 0.51/0.70 101 [hyper,70,28] {-} connection(in(n1,h1(f)),in(n1,and2(h1(f)))).
% 0.51/0.70 102 [hyper,70,27] {-} connection(in(n2,h1(f)),in(n2,or1(h1(f)))).
% 0.51/0.70 104 [hyper,70,25] {-} type(or1(h1(f)),or).
% 0.51/0.70 105 [hyper,70,24] {-} type(not1(h1(f)),not).
% 0.51/0.70 106 [hyper,70,23] {-} type(and2(h1(f)),and).
% 0.51/0.70 107 [hyper,70,22] {-} type(and1(h1(f)),and).
% 0.51/0.70 139 [hyper,88,7] {-} mode(not1(h2(f)),ok)|mode(not1(h2(f)),abnormal).
% 0.51/0.70 144 [hyper,89,7,unit_del,47] {-} mode(and2(h2(f)),ok).
% 0.51/0.70 149 [hyper,90,7] {-} mode(and1(h2(f)),ok)|mode(and1(h2(f)),abnormal).
% 0.51/0.70 154 [hyper,60,1,59] {-} value(out(n1,or1(f)),n0).
% 0.51/0.70 162 [hyper,104,7,unit_del,49] {-} mode(or1(h1(f)),ok).
% 0.51/0.70 167 [hyper,105,7,unit_del,50] {-} mode(not1(h1(f)),ok).
% 0.51/0.70 172 [hyper,106,7,unit_del,51] {-} mode(and2(h1(f)),ok).
% 0.51/0.70 177 [hyper,107,7,unit_del,52] {-} mode(and1(h1(f)),ok).
% 0.51/0.70 182 [hyper,61,1,58] {-} value(out(s,h2(f)),n1).
% 0.51/0.70 206 [hyper,62,1,57] {-} value(in(n2,h1(f)),n1).
% 0.51/0.70 234 [hyper,63,1,56] {-} value(in(n1,h1(f)),n0).
% 0.51/0.70 252 [hyper,64,1,55] {-} value(in(n1,h2(f)),n1).
% 0.51/0.70 274 [hyper,74,16,68,154] {-} mode(or1(f),abnormal)|value(in(n1,or1(f)),n0).
% 0.51/0.70 371 [hyper,82,1,182] {-} value(out(n1,and1(h2(f))),n1).
% 0.51/0.70 396 [hyper,84,1,252] {-} value(in(n1,and2(h2(f))),n1).
% 0.51/0.70 517 [hyper,101,1,234] {-} value(in(n1,and2(h1(f))),n0).
% 0.51/0.70 537 [hyper,517,8,172,106] {-} value(out(n1,and2(h1(f))),n0).
% 0.51/0.70 545 [hyper,537,1,96] {-} value(in(n1,not1(h1(f))),n0).
% 0.51/0.70 573 [hyper,545,18,167,105] {-} value(out(n1,not1(h1(f))),n1).
% 0.51/0.70 580 [hyper,573,1,95] {-} value(in(n2,and1(h1(f))),n1).
% 0.51/0.70 593 [hyper,102,1,206] {-} value(in(n2,or1(h1(f))),n1).
% 0.51/0.70 613 [hyper,593,13,162,104] {-} value(out(n1,or1(h1(f))),n1).
% 0.51/0.70 626 [hyper,613,1,97] {-} value(in(n1,and1(h1(f))),n1).
% 0.51/0.70 633 [hyper,626,9,177,107,580] {-} value(out(n1,and1(h1(f))),n1).
% 0.51/0.70 649 [hyper,633,2,99] {-} value(out(s,h1(f)),n1).
% 0.51/0.70 656 [hyper,649,1,67] {-} value(in(n2,h2(f)),n1).
% 0.51/0.70 663 [hyper,656,1,83] {-} value(in(n2,and2(h2(f))),n1).
% 0.51/0.70 681 [hyper,663,9,144,89,396] {-} value(out(n1,and2(h2(f))),n1).
% 0.51/0.71 688 [hyper,681,2,81] {-} value(out(c,h2(f)),n1).
% 0.51/0.71 689 [hyper,681,1,79] {-} value(in(n1,not1(h2(f))),n1).
% 0.51/0.71 696 [hyper,688,1,65] {-} value(in(n1,or1(f)),n1).
% 0.51/0.71 789 [hyper,274,3,696,unit_del,5] {-} mode(or1(f),abnormal).
% 0.51/0.71 790 [hyper,789,48,149] {-} mode(and1(h2(f)),ok).
% 0.51/0.71 791 [hyper,789,46,139] {-} mode(not1(h2(f)),ok).
% 0.51/0.71 804 [hyper,790,12,90,371] {-} value(in(n2,and1(h2(f))),n1).
% 0.51/0.71 810 [hyper,791,19,88,689] {-} value(out(n1,not1(h2(f))),n0).
% 0.51/0.71 815 [hyper,804,2,78] {-} value(out(n1,not1(h2(f))),n1).
% 0.51/0.71 844 [hyper,815,3,810,flip.1] {-} equal_value(n1,n0).
% 0.51/0.71 846 [binary,844.1,5.1] {-} $F.
% 0.51/0.71
% 0.51/0.71 % SZS output end Refutation
% 0.51/0.71 ------------ end of proof -------------
% 0.51/0.71
% 0.51/0.71
% 0.51/0.71 Search stopped by max_proofs option.
% 0.51/0.71
% 0.51/0.71
% 0.51/0.71 Search stopped by max_proofs option.
% 0.51/0.71
% 0.51/0.71 ============ end of search ============
% 0.51/0.71
% 0.51/0.71 That finishes the proof of the theorem.
% 0.51/0.71
% 0.51/0.71 Process 12255 finished Fri Jun 17 01:30:00 2022
%------------------------------------------------------------------------------