TSTP Solution File: HWV007-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n032.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 0.16s 0.60s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% 0.00/0.11  % Command  : sos-script %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Thu Jun 16 22:53:30 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.16/0.32  ----- Otter 3.2, August 2001 -----
% 0.16/0.32  The process was started by sandbox2 on n032.cluster.edu,
% 0.16/0.32  Thu Jun 16 22:53:30 2022
% 0.16/0.32  The command was "./sos".  The process ID is 19404.
% 0.16/0.32  
% 0.16/0.32  set(prolog_style_variables).
% 0.16/0.32  set(auto).
% 0.16/0.32     dependent: set(auto1).
% 0.16/0.32     dependent: set(process_input).
% 0.16/0.32     dependent: clear(print_kept).
% 0.16/0.32     dependent: clear(print_new_demod).
% 0.16/0.32     dependent: clear(print_back_demod).
% 0.16/0.32     dependent: clear(print_back_sub).
% 0.16/0.32     dependent: set(control_memory).
% 0.16/0.32     dependent: assign(max_mem, 12000).
% 0.16/0.32     dependent: assign(pick_given_ratio, 4).
% 0.16/0.32     dependent: assign(stats_level, 1).
% 0.16/0.32     dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.32     dependent: assign(sos_limit, 5000).
% 0.16/0.32     dependent: assign(max_weight, 60).
% 0.16/0.32  clear(print_given).
% 0.16/0.32  
% 0.16/0.32  list(usable).
% 0.16/0.32  
% 0.16/0.32  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.16/0.32  
% 0.16/0.32  This ia a non-Horn set with equality.  The strategy will be
% 0.16/0.32  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.32  unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.32  clauses in usable.
% 0.16/0.32  
% 0.16/0.32     dependent: set(knuth_bendix).
% 0.16/0.32     dependent: set(para_from).
% 0.16/0.32     dependent: set(para_into).
% 0.16/0.32     dependent: clear(para_from_right).
% 0.16/0.32     dependent: clear(para_into_right).
% 0.16/0.32     dependent: set(para_from_vars).
% 0.16/0.32     dependent: set(eq_units_both_ways).
% 0.16/0.32     dependent: set(dynamic_demod_all).
% 0.16/0.32     dependent: set(dynamic_demod).
% 0.16/0.32     dependent: set(order_eq).
% 0.16/0.32     dependent: set(back_demod).
% 0.16/0.32     dependent: set(lrpo).
% 0.16/0.32     dependent: set(hyper_res).
% 0.16/0.32     dependent: set(unit_deletion).
% 0.16/0.32     dependent: set(factor).
% 0.16/0.32  
% 0.16/0.32  ------------> process usable:
% 0.16/0.32    Following clause subsumed by 5 during input processing: 0 [] {-} -equal_value(n1,n0).
% 0.16/0.32  
% 0.16/0.32  ------------> process sos:
% 0.16/0.32  
% 0.16/0.32  ======= end of input processing =======
% 0.16/0.53  
% 0.16/0.53  Stopped by limit on insertions
% 0.16/0.53  
% 0.16/0.53  
% 0.16/0.53  Failed to model usable list: disabling FINDER
% 0.16/0.53  
% 0.16/0.53  
% 0.16/0.53  
% 0.16/0.53  -------------- Softie stats --------------
% 0.16/0.53  
% 0.16/0.53  UPDATE_STOP: 300
% 0.16/0.53  SFINDER_TIME_LIMIT: 2
% 0.16/0.53  SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.53  number of clauses in intial UL: 50
% 0.16/0.53  number of clauses initially in problem: 56
% 0.16/0.53  percentage of clauses intially in UL: 89
% 0.16/0.53  percentage of distinct symbols occuring in initial UL: 100
% 0.16/0.53  percent of all initial clauses that are short: 100
% 0.16/0.53  absolute distinct symbol count: 26
% 0.16/0.53     distinct predicate count: 5
% 0.16/0.53     distinct function count: 8
% 0.16/0.53     distinct constant count: 13
% 0.16/0.53  
% 0.16/0.53  ---------- no more Softie stats ----------
% 0.16/0.53  
% 0.16/0.53  
% 0.16/0.53  
% 0.16/0.53  =========== start of search ===========
% 0.16/0.60  
% 0.16/0.60  -------- PROOF -------- 
% 0.16/0.60  % SZS status Unsatisfiable
% 0.16/0.60  % SZS output start Refutation
% 0.16/0.60  
% 0.16/0.60  ----> UNIT CONFLICT at   0.25 sec ----> 910 [binary,908.1,5.1] {-} $F.
% 0.16/0.60  
% 0.16/0.60  Length of proof is 61.  Level of proof is 16.
% 0.16/0.60  
% 0.16/0.60  ---------------- PROOF ----------------
% 0.16/0.60  % SZS status Unsatisfiable
% 0.16/0.60  % SZS output start Refutation
% 0.16/0.60  
% 0.16/0.60  1 [] {+} -connection(A,B)| -value(A,C)|value(B,C).
% 0.16/0.60  2 [] {+} -connection(A,B)| -value(B,C)|value(A,C).
% 0.16/0.60  3 [] {+} -value(A,B)| -value(A,C)|equal_value(B,C).
% 0.16/0.60  4 [] {-} -equal_value(n0,n1).
% 0.16/0.60  5 [copy,4,flip.1] {+} -equal_value(n1,n0).
% 0.16/0.60  7 [] {+} -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 0.16/0.60  8 [] {+} -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 0.16/0.60  9 [] {+} -mode(A,ok)| -type(A,and)| -value(in(n1,A),n1)| -value(in(n2,A),n1)|value(out(n1,A),n1).
% 0.16/0.60  11 [] {+} -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n1,A),n1).
% 0.16/0.60  14 [] {+} -mode(A,ok)| -type(A,or)| -value(in(n1,A),n0)| -value(in(n2,A),n0)|value(out(n1,A),n0).
% 0.16/0.60  17 [] {+} -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n2,A),n0).
% 0.16/0.60  19 [] {+} -mode(A,ok)| -type(A,not)| -value(in(n1,A),n1)|value(out(n1,A),n0).
% 0.16/0.60  22 [] {+} -type(A,halfadder)|type(and1(A),and).
% 0.16/0.60  23 [] {+} -type(A,halfadder)|type(and2(A),and).
% 0.16/0.60  24 [] {+} -type(A,halfadder)|type(not1(A),not).
% 0.16/0.60  25 [] {+} -type(A,halfadder)|type(or1(A),or).
% 0.16/0.60  26 [] {+} -type(A,halfadder)|connection(in(n1,A),in(n1,or1(A))).
% 0.16/0.60  27 [] {+} -type(A,halfadder)|connection(in(n2,A),in(n2,or1(A))).
% 0.16/0.60  28 [] {+} -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 0.16/0.60  29 [] {+} -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 0.16/0.60  30 [] {+} -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 0.16/0.60  31 [] {+} -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 0.16/0.60  32 [] {+} -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 0.16/0.60  33 [] {+} -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 0.16/0.60  34 [] {+} -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 0.16/0.60  35 [] {+} -type(A,fulladder)|type(h1(A),halfadder).
% 0.16/0.60  36 [] {+} -type(A,fulladder)|type(h2(A),halfadder).
% 0.16/0.60  37 [] {+} -type(A,fulladder)|type(or1(A),or).
% 0.16/0.60  38 [] {+} -type(A,fulladder)|connection(out(s,h1(A)),in(n2,h2(A))).
% 0.16/0.60  39 [] {+} -type(A,fulladder)|connection(out(c,h1(A)),in(n2,or1(A))).
% 0.16/0.60  41 [] {+} -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 0.16/0.60  42 [] {+} -type(A,fulladder)|connection(in(n2,A),in(n1,h1(A))).
% 0.16/0.60  43 [] {+} -type(A,fulladder)|connection(in(c,A),in(n2,h1(A))).
% 0.16/0.60  44 [] {+} -type(A,fulladder)|connection(out(s,A),out(s,h2(A))).
% 0.16/0.60  45 [] {+} -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 0.16/0.60  46 [] {+} -mode(and2(h1(f)),abnormal).
% 0.16/0.60  47 [] {+} -mode(or1(f),abnormal)| -mode(and1(h1(f)),abnormal).
% 0.16/0.60  48 [] {+} -mode(or1(f),abnormal)| -mode(not1(h1(f)),abnormal).
% 0.16/0.60  49 [] {+} -mode(or1(f),abnormal)| -mode(and1(h2(f)),abnormal).
% 0.16/0.60  50 [] {+} -mode(or1(f),abnormal)| -mode(or1(h2(f)),abnormal).
% 0.16/0.60  52 [] {-} type(f,fulladder).
% 0.16/0.60  53 [] {-} value(in(n1,f),n0).
% 0.16/0.60  54 [] {-} value(in(n2,f),n1).
% 0.16/0.60  55 [] {-} value(in(c,f),n1).
% 0.16/0.60  56 [] {-} value(out(s,f),n1).
% 0.16/0.60  57 [] {-} value(out(c,f),n0).
% 0.16/0.60  58 [hyper,52,45] {-} connection(out(c,f),out(n1,or1(f))).
% 0.16/0.60  59 [hyper,52,44] {-} connection(out(s,f),out(s,h2(f))).
% 0.16/0.60  60 [hyper,52,43] {-} connection(in(c,f),in(n2,h1(f))).
% 0.16/0.60  61 [hyper,52,42] {-} connection(in(n2,f),in(n1,h1(f))).
% 0.16/0.60  62 [hyper,52,41] {-} connection(in(n1,f),in(n1,h2(f))).
% 0.16/0.60  64 [hyper,52,39] {-} connection(out(c,h1(f)),in(n2,or1(f))).
% 0.16/0.60  65 [hyper,52,38] {-} connection(out(s,h1(f)),in(n2,h2(f))).
% 0.16/0.60  66 [hyper,52,37] {-} type(or1(f),or).
% 0.16/0.60  67 [hyper,52,36] {-} type(h2(f),halfadder).
% 0.16/0.60  68 [hyper,52,35] {-} type(h1(f),halfadder).
% 0.16/0.60  72 [hyper,66,7] {-} mode(or1(f),ok)|mode(or1(f),abnormal).
% 0.16/0.60  78 [hyper,67,32] {-} connection(out(n1,or1(h2(f))),in(n1,and1(h2(f)))).
% 0.43/0.60  80 [hyper,67,30] {-} connection(out(s,h2(f)),out(n1,and1(h2(f)))).
% 0.43/0.60  83 [hyper,67,27] {-} connection(in(n2,h2(f)),in(n2,or1(h2(f)))).
% 0.43/0.60  84 [hyper,67,26] {-} connection(in(n1,h2(f)),in(n1,or1(h2(f)))).
% 0.43/0.60  85 [hyper,67,25] {-} type(or1(h2(f)),or).
% 0.43/0.60  88 [hyper,67,22] {-} type(and1(h2(f)),and).
% 0.43/0.60  93 [hyper,68,34] {-} connection(out(n1,not1(h1(f))),in(n2,and1(h1(f)))).
% 0.43/0.60  94 [hyper,68,33] {-} connection(out(n1,and2(h1(f))),in(n1,not1(h1(f)))).
% 0.43/0.60  96 [hyper,68,31] {-} connection(out(c,h1(f)),out(n1,and2(h1(f)))).
% 0.43/0.60  97 [hyper,68,30] {-} connection(out(s,h1(f)),out(n1,and1(h1(f)))).
% 0.43/0.60  98 [hyper,68,29] {-} connection(in(n2,h1(f)),in(n2,and2(h1(f)))).
% 0.43/0.60  99 [hyper,68,28] {-} connection(in(n1,h1(f)),in(n1,and2(h1(f)))).
% 0.43/0.60  103 [hyper,68,24] {-} type(not1(h1(f)),not).
% 0.43/0.60  104 [hyper,68,23] {-} type(and2(h1(f)),and).
% 0.43/0.60  105 [hyper,68,22] {-} type(and1(h1(f)),and).
% 0.43/0.60  132 [hyper,85,7] {-} mode(or1(h2(f)),ok)|mode(or1(h2(f)),abnormal).
% 0.43/0.60  147 [hyper,88,7] {-} mode(and1(h2(f)),ok)|mode(and1(h2(f)),abnormal).
% 0.43/0.60  152 [hyper,58,1,57] {-} value(out(n1,or1(f)),n0).
% 0.43/0.60  165 [hyper,103,7] {-} mode(not1(h1(f)),ok)|mode(not1(h1(f)),abnormal).
% 0.43/0.60  170 [hyper,104,7,unit_del,46] {-} mode(and2(h1(f)),ok).
% 0.43/0.60  175 [hyper,105,7] {-} mode(and1(h1(f)),ok)|mode(and1(h1(f)),abnormal).
% 0.43/0.60  180 [hyper,59,1,56] {-} value(out(s,h2(f)),n1).
% 0.43/0.60  208 [hyper,60,1,55] {-} value(in(n2,h1(f)),n1).
% 0.43/0.60  221 [hyper,61,1,54] {-} value(in(n1,h1(f)),n1).
% 0.43/0.60  234 [hyper,62,1,53] {-} value(in(n1,h2(f)),n0).
% 0.43/0.60  255 [hyper,72,17,66,152] {-} mode(or1(f),abnormal)|value(in(n2,or1(f)),n0).
% 0.43/0.60  353 [hyper,80,1,180] {-} value(out(n1,and1(h2(f))),n1).
% 0.43/0.60  413 [hyper,84,1,234] {-} value(in(n1,or1(h2(f))),n0).
% 0.43/0.60  483 [hyper,98,1,208] {-} value(in(n2,and2(h1(f))),n1).
% 0.43/0.60  509 [hyper,99,1,221] {-} value(in(n1,and2(h1(f))),n1).
% 0.43/0.60  519 [hyper,509,9,170,104,483] {-} value(out(n1,and2(h1(f))),n1).
% 0.43/0.60  526 [hyper,519,2,96] {-} value(out(c,h1(f)),n1).
% 0.43/0.60  527 [hyper,519,1,94] {-} value(in(n1,not1(h1(f))),n1).
% 0.43/0.60  534 [hyper,526,1,64] {-} value(in(n2,or1(f)),n1).
% 0.43/0.60  772 [hyper,255,3,534,unit_del,5] {-} mode(or1(f),abnormal).
% 0.43/0.60  774 [hyper,772,50,132] {-} mode(or1(h2(f)),ok).
% 0.43/0.60  775 [hyper,772,49,147] {-} mode(and1(h2(f)),ok).
% 0.43/0.60  776 [hyper,772,48,165] {-} mode(not1(h1(f)),ok).
% 0.43/0.60  777 [hyper,772,47,175] {-} mode(and1(h1(f)),ok).
% 0.43/0.60  786 [hyper,775,11,88,353] {-} value(in(n1,and1(h2(f))),n1).
% 0.43/0.60  791 [hyper,776,19,103,527] {-} value(out(n1,not1(h1(f))),n0).
% 0.43/0.60  821 [hyper,786,2,78] {-} value(out(n1,or1(h2(f))),n1).
% 0.43/0.60  828 [hyper,791,1,93] {-} value(in(n2,and1(h1(f))),n0).
% 0.43/0.60  858 [hyper,828,8,777,105] {-} value(out(n1,and1(h1(f))),n0).
% 0.43/0.60  865 [hyper,858,2,97] {-} value(out(s,h1(f)),n0).
% 0.43/0.60  878 [hyper,865,1,65] {-} value(in(n2,h2(f)),n0).
% 0.43/0.60  884 [hyper,878,1,83] {-} value(in(n2,or1(h2(f))),n0).
% 0.43/0.60  891 [hyper,884,14,774,85,413] {-} value(out(n1,or1(h2(f))),n0).
% 0.43/0.60  908 [hyper,891,3,821] {-} equal_value(n1,n0).
% 0.43/0.60  910 [binary,908.1,5.1] {-} $F.
% 0.43/0.60  
% 0.43/0.60  % SZS output end Refutation
% 0.43/0.60  ------------ end of proof -------------
% 0.43/0.60  
% 0.43/0.60  
% 0.43/0.60  Search stopped by max_proofs option.
% 0.43/0.60  
% 0.43/0.60  
% 0.43/0.60  Search stopped by max_proofs option.
% 0.43/0.60  
% 0.43/0.60  ============ end of search ============
% 0.43/0.60  
% 0.43/0.60  That finishes the proof of the theorem.
% 0.43/0.60  
% 0.43/0.60  Process 19404 finished Thu Jun 16 22:53:30 2022
%------------------------------------------------------------------------------