TSTP Solution File: HWV008-1.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV008-1.002 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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 1.64s 1.82s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : HWV008-1.002 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n005.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 : Thu Jun 16 21:21:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox2 on n005.cluster.edu,
% 0.20/0.37 Thu Jun 16 21:21:08 2022
% 0.20/0.37 The command was "./sos". The process ID is 25480.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.37
% 0.20/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37 clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37 Following clause subsumed by 5 during input processing: 0 [] {-} -equal_value(n1,n0).
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.48/0.69
% 0.48/0.69 Stopped by limit on insertions
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69 Failed to model usable list: disabling FINDER
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69 -------------- Softie stats --------------
% 0.48/0.69
% 0.48/0.69 UPDATE_STOP: 300
% 0.48/0.69 SFINDER_TIME_LIMIT: 2
% 0.48/0.69 SHORT_CLAUSE_CUTOFF: 4
% 0.48/0.69 number of clauses in intial UL: 59
% 0.48/0.69 number of clauses initially in problem: 68
% 0.48/0.69 percentage of clauses intially in UL: 86
% 0.48/0.69 percentage of distinct symbols occuring in initial UL: 100
% 0.48/0.69 percent of all initial clauses that are short: 100
% 0.48/0.69 absolute distinct symbol count: 32
% 0.48/0.69 distinct predicate count: 5
% 0.48/0.69 distinct function count: 10
% 0.48/0.69 distinct constant count: 17
% 0.48/0.69
% 0.48/0.69 ---------- no more Softie stats ----------
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69 =========== start of search ===========
% 1.64/1.82
% 1.64/1.82 -------- PROOF --------
% 1.64/1.82 % SZS status Unsatisfiable
% 1.64/1.82 % SZS output start Refutation
% 1.64/1.82
% 1.64/1.82 Modelling stopped after 300 given clauses and 0.00 seconds
% 1.64/1.82
% 1.64/1.82
% 1.64/1.82 ----> UNIT CONFLICT at 1.43 sec ----> 3217 [binary,3215.1,5.1] {-} $F.
% 1.64/1.82
% 1.64/1.82 Length of proof is 38. Level of proof is 9.
% 1.64/1.82
% 1.64/1.82 ---------------- PROOF ----------------
% 1.64/1.82 % SZS status Unsatisfiable
% 1.64/1.82 % SZS output start Refutation
% 1.64/1.82
% 1.64/1.82 1 [] {+} -connection(A,B)| -value(A,C)|value(B,C).
% 1.64/1.82 2 [] {+} -connection(A,B)| -value(B,C)|value(A,C).
% 1.64/1.82 3 [] {+} -value(A,B)| -value(A,C)|equal_value(B,C).
% 1.64/1.82 4 [] {-} -equal_value(n0,n1).
% 1.64/1.82 5 [copy,4,flip.1] {+} -equal_value(n1,n0).
% 1.64/1.82 7 [] {+} -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 1.64/1.82 8 [] {+} -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 1.64/1.82 14 [] {+} -mode(A,ok)| -type(A,or)| -value(in(n1,A),n0)| -value(in(n2,A),n0)|value(out(n1,A),n0).
% 1.64/1.82 23 [] {+} -type(A,halfadder)|type(and2(A),and).
% 1.64/1.82 28 [] {+} -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 1.64/1.82 31 [] {+} -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 1.64/1.82 35 [] {+} -type(A,fulladder)|type(h1(A),halfadder).
% 1.64/1.82 36 [] {+} -type(A,fulladder)|type(h2(A),halfadder).
% 1.64/1.82 37 [] {+} -type(A,fulladder)|type(or1(A),or).
% 1.64/1.82 39 [] {+} -type(A,fulladder)|connection(out(c,h1(A)),in(n2,or1(A))).
% 1.64/1.82 40 [] {+} -type(A,fulladder)|connection(out(c,h2(A)),in(n1,or1(A))).
% 1.64/1.82 41 [] {+} -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 1.64/1.82 42 [] {+} -type(A,fulladder)|connection(in(n2,A),in(n1,h1(A))).
% 1.64/1.82 45 [] {+} -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 1.64/1.82 47 [] {+} -type(A,nbit_adder(n2))|type(f(n2,A),fulladder).
% 1.64/1.82 50 [] {+} -type(A,nbit_adder(n2))|connection(out(c,A),out(c,f(n2,A))).
% 1.64/1.82 53 [] {+} -type(A,nbit_adder(n2))|connection(in(a2,A),in(n1,f(n2,A))).
% 1.64/1.82 54 [] {+} -type(A,nbit_adder(n2))|connection(in(b2,A),in(n2,f(n2,A))).
% 1.64/1.82 57 [] {+} -mode(or1(f(n2,a)),abnormal).
% 1.64/1.82 58 [] {+} -mode(and2(h1(f(n2,a))),abnormal).
% 1.64/1.82 59 [] {+} -mode(and2(h2(f(n2,a))),abnormal).
% 1.64/1.82 61 [] {-} type(a,nbit_adder(n2)).
% 1.64/1.82 63 [] {-} value(in(a2,a),n0).
% 1.64/1.82 65 [] {-} value(in(b2,a),n0).
% 1.64/1.82 69 [] {-} value(out(c,a),n1).
% 1.64/1.82 72 [hyper,61,54] {-} connection(in(b2,a),in(n2,f(n2,a))).
% 1.64/1.82 73 [hyper,61,53] {-} connection(in(a2,a),in(n1,f(n2,a))).
% 1.64/1.82 76 [hyper,61,50] {-} connection(out(c,a),out(c,f(n2,a))).
% 1.64/1.82 79 [hyper,61,47] {-} type(f(n2,a),fulladder).
% 1.64/1.82 128 [hyper,79,45] {-} connection(out(c,f(n2,a)),out(n1,or1(f(n2,a)))).
% 1.64/1.82 131 [hyper,79,42] {-} connection(in(n2,f(n2,a)),in(n1,h1(f(n2,a)))).
% 1.64/1.82 132 [hyper,79,41] {-} connection(in(n1,f(n2,a)),in(n1,h2(f(n2,a)))).
% 1.64/1.82 133 [hyper,79,40] {-} connection(out(c,h2(f(n2,a))),in(n1,or1(f(n2,a)))).
% 1.64/1.82 134 [hyper,79,39] {-} connection(out(c,h1(f(n2,a))),in(n2,or1(f(n2,a)))).
% 1.64/1.82 136 [hyper,79,37] {-} type(or1(f(n2,a)),or).
% 1.64/1.82 137 [hyper,79,36] {-} type(h2(f(n2,a)),halfadder).
% 1.64/1.82 138 [hyper,79,35] {-} type(h1(f(n2,a)),halfadder).
% 1.64/1.82 176 [hyper,136,7,unit_del,57] {-} mode(or1(f(n2,a)),ok).
% 1.64/1.82 185 [hyper,137,31] {-} connection(out(c,h2(f(n2,a))),out(n1,and2(h2(f(n2,a))))).
% 1.64/1.82 188 [hyper,137,28] {-} connection(in(n1,h2(f(n2,a))),in(n1,and2(h2(f(n2,a))))).
% 1.64/1.82 193 [hyper,137,23] {-} type(and2(h2(f(n2,a))),and).
% 1.64/1.82 204 [hyper,138,31] {-} connection(out(c,h1(f(n2,a))),out(n1,and2(h1(f(n2,a))))).
% 1.64/1.82 207 [hyper,138,28] {-} connection(in(n1,h1(f(n2,a))),in(n1,and2(h1(f(n2,a))))).
% 1.64/1.82 212 [hyper,138,23] {-} type(and2(h1(f(n2,a))),and).
% 1.64/1.82 226 [hyper,72,1,65] {-} value(in(n2,f(n2,a)),n0).
% 1.64/1.82 284 [hyper,73,1,63] {-} value(in(n1,f(n2,a)),n0).
% 1.64/1.82 307 [hyper,193,7,unit_del,59] {-} mode(and2(h2(f(n2,a))),ok).
% 1.64/1.82 344 [hyper,212,7,unit_del,58] {-} mode(and2(h1(f(n2,a))),ok).
% 1.64/1.82 394 [hyper,76,1,69] {-} value(out(c,f(n2,a)),n1).
% 1.64/1.82 1246 [hyper,128,1,394] {-} value(out(n1,or1(f(n2,a))),n1).
% 1.64/1.82 1351 [hyper,131,1,226] {-} value(in(n1,h1(f(n2,a))),n0).
% 1.64/1.82 1370 [hyper,132,1,284] {-} value(in(n1,h2(f(n2,a))),n0).
% 1.64/1.82 2641 [hyper,188,1,1370] {-} value(in(n1,and2(h2(f(n2,a)))),n0).
% 1.64/1.82 2655 [hyper,2641,8,307,193] {-} value(out(n1,and2(h2(f(n2,a)))),n0).
% 1.64/1.82 2664 [hyper,2655,2,185] {-} value(out(c,h2(f(n2,a))),n0).
% 1.64/1.82 2674 [hyper,2664,1,133] {-} value(in(n1,or1(f(n2,a))),n0).
% 1.64/1.82 3135 [hyper,207,1,1351] {-} value(in(n1,and2(h1(f(n2,a)))),n0).
% 1.64/1.82 3149 [hyper,3135,8,344,212] {-} value(out(n1,and2(h1(f(n2,a)))),n0).
% 1.64/1.82 3158 [hyper,3149,2,204] {-} value(out(c,h1(f(n2,a))),n0).
% 1.64/1.82 3168 [hyper,3158,1,134] {-} value(in(n2,or1(f(n2,a))),n0).
% 1.64/1.82 3176 [hyper,3168,14,176,136,2674] {-} value(out(n1,or1(f(n2,a))),n0).
% 1.64/1.82 3215 [hyper,3176,3,1246] {-} equal_value(n1,n0).
% 1.64/1.82 3217 [binary,3215.1,5.1] {-} $F.
% 1.64/1.82
% 1.64/1.82 % SZS output end Refutation
% 1.64/1.82 ------------ end of proof -------------
% 1.64/1.82
% 1.64/1.82
% 1.64/1.82 Search stopped by max_proofs option.
% 1.64/1.82
% 1.64/1.82
% 1.64/1.82 Search stopped by max_proofs option.
% 1.64/1.82
% 1.64/1.82 ============ end of search ============
% 1.64/1.82
% 1.64/1.82 That finishes the proof of the theorem.
% 1.64/1.82
% 1.64/1.82 Process 25480 finished Thu Jun 16 21:21:10 2022
%------------------------------------------------------------------------------