TSTP Solution File: HWV005-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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.76s 0.97s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n015.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 23:36:42 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 n015.cluster.edu,
% 0.13/0.36 Thu Jun 16 23:36:42 2022
% 0.13/0.36 The command was "./sos". The process ID is 25026.
% 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.38/0.62
% 0.38/0.62 Model 1 (0.00 seconds, 0 Inserts)
% 0.38/0.62
% 0.38/0.62 Stopped by limit on number of solutions
% 0.38/0.62
% 0.38/0.62
% 0.38/0.62 -------------- Softie stats --------------
% 0.38/0.62
% 0.38/0.62 UPDATE_STOP: 300
% 0.38/0.62 SFINDER_TIME_LIMIT: 2
% 0.38/0.62 SHORT_CLAUSE_CUTOFF: 4
% 0.38/0.62 number of clauses in intial UL: 37
% 0.38/0.62 number of clauses initially in problem: 42
% 0.38/0.62 percentage of clauses intially in UL: 88
% 0.38/0.62 percentage of distinct symbols occuring in initial UL: 100
% 0.38/0.62 percent of all initial clauses that are short: 100
% 0.38/0.62 absolute distinct symbol count: 23
% 0.38/0.62 distinct predicate count: 5
% 0.38/0.62 distinct function count: 6
% 0.38/0.62 distinct constant count: 12
% 0.38/0.62
% 0.38/0.62 ---------- no more Softie stats ----------
% 0.38/0.62
% 0.38/0.62
% 0.38/0.62
% 0.38/0.62 Stopped by limit on insertions
% 0.38/0.62
% 0.38/0.62 =========== start of search ===========
% 0.76/0.97
% 0.76/0.97 -------- PROOF --------
% 0.76/0.97 % SZS status Unsatisfiable
% 0.76/0.97 % SZS output start Refutation
% 0.76/0.97
% 0.76/0.97 Stopped by limit on insertions
% 0.76/0.97
% 0.76/0.97 Model 2 [ 1 0 238 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.97
% 0.76/0.97 Stopped by limit on insertions
% 0.76/0.97
% 0.76/0.97 ----> UNIT CONFLICT at 0.59 sec ----> 508 [binary,506.1,5.1] {-} $F.
% 0.76/0.97
% 0.76/0.97 Length of proof is 23. Level of proof is 7.
% 0.76/0.97
% 0.76/0.97 ---------------- PROOF ----------------
% 0.76/0.97 % SZS status Unsatisfiable
% 0.76/0.97 % SZS output start Refutation
% 0.76/0.97
% 0.76/0.97 1 [] {+} -connection(A,B)| -value(A,C)|value(B,C).
% 0.76/0.97 3 [] {+} -value(A,B)| -value(A,C)|equal_value(B,C).
% 0.76/0.97 4 [] {-} -equal_value(n0,n1).
% 0.76/0.97 5 [copy,4,flip.1] {+} -equal_value(n1,n0).
% 0.76/0.97 7 [] {+} -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 0.76/0.97 9 [] {+} -mode(A,ok)| -type(A,and)| -value(in(n1,A),n1)| -value(in(n2,A),n1)|value(out(n1,A),n1).
% 0.76/0.97 13 [] {+} -mode(A,ok)| -type(A,or)| -value(in(B,A),n1)|value(out(n1,A),n1).
% 0.76/0.97 18 [] {+} -mode(A,ok)| -type(A,not)| -value(in(n1,A),n0)|value(out(n1,A),n1).
% 0.76/0.97 22 [] {+} -type(A,halfadder)|type(and1(A),and).
% 0.76/0.97 24 [] {+} -type(A,halfadder)|type(not1(A),not).
% 0.76/0.97 25 [] {+} -type(A,halfadder)|type(or1(A),or).
% 0.76/0.97 26 [] {+} -type(A,halfadder)|connection(in(n1,A),in(n1,or1(A))).
% 0.76/0.97 30 [] {+} -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 0.76/0.97 31 [] {+} -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 0.76/0.97 32 [] {+} -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 0.76/0.97 33 [] {+} -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 0.76/0.97 34 [] {+} -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 0.76/0.97 35 [] {+} -mode(and1(h),abnormal).
% 0.76/0.97 36 [] {+} -mode(not1(h),abnormal).
% 0.76/0.97 37 [] {+} -mode(or1(h),abnormal).
% 0.76/0.97 39 [] {-} type(h,halfadder).
% 0.76/0.97 40 [] {+} value(in(n1,h),n1).
% 0.76/0.97 42 [] {-} value(out(s,h),n0).
% 0.76/0.97 43 [] {-} value(out(c,h),n0).
% 0.76/0.97 44 [hyper,39,34] {-} connection(out(n1,not1(h)),in(n2,and1(h))).
% 0.76/0.97 45 [hyper,39,33] {-} connection(out(n1,and2(h)),in(n1,not1(h))).
% 0.76/0.97 46 [hyper,39,32] {-} connection(out(n1,or1(h)),in(n1,and1(h))).
% 0.76/0.97 47 [hyper,39,31] {+} connection(out(c,h),out(n1,and2(h))).
% 0.76/0.97 48 [hyper,39,30] {+} connection(out(s,h),out(n1,and1(h))).
% 0.76/0.97 52 [hyper,39,26] {-} connection(in(n1,h),in(n1,or1(h))).
% 0.76/0.97 53 [hyper,39,25] {+} type(or1(h),or).
% 0.76/0.97 54 [hyper,39,24] {-} type(not1(h),not).
% 0.76/0.97 56 [hyper,39,22] {+} type(and1(h),and).
% 0.76/0.97 60 [hyper,53,7,unit_del,37] {+} mode(or1(h),ok).
% 0.76/0.97 64 [hyper,54,7,unit_del,36] {+} mode(not1(h),ok).
% 0.76/0.97 119 [hyper,52,1,40] {+} value(in(n1,or1(h)),n1).
% 0.76/0.97 135 [hyper,56,7,unit_del,35] {+} mode(and1(h),ok).
% 0.76/0.97 154 [hyper,47,1,43] {-} value(out(n1,and2(h)),n0).
% 0.76/0.97 162 [hyper,154,1,45] {-} value(in(n1,not1(h)),n0).
% 0.76/0.97 187 [hyper,48,1,42] {-} value(out(n1,and1(h)),n0).
% 0.76/0.97 209 [hyper,64,18,54,162] {+} value(out(n1,not1(h)),n1).
% 0.76/0.97 308 [hyper,119,13,60,53] {+} value(out(n1,or1(h)),n1).
% 0.76/0.97 330 [hyper,209,1,44] {+} value(in(n2,and1(h)),n1).
% 0.76/0.97 365 [hyper,308,1,46] {+} value(in(n1,and1(h)),n1).
% 0.76/0.97 465 [hyper,365,9,135,56,330] {+} value(out(n1,and1(h)),n1).
% 0.76/0.97 506 [hyper,465,3,187,flip.1] {-} equal_value(n1,n0).
% 0.76/0.97 508 [binary,506.1,5.1] {-} $F.
% 0.76/0.97
% 0.76/0.97 % SZS output end Refutation
% 0.76/0.97 ------------ end of proof -------------
% 0.76/0.97
% 0.76/0.97
% 0.76/0.97 Search stopped by max_proofs option.
% 0.76/0.97
% 0.76/0.97
% 0.76/0.97 Search stopped by max_proofs option.
% 0.76/0.97
% 0.76/0.97 ============ end of search ============
% 0.76/0.97
% 0.76/0.97 ----------- soft-scott stats ----------
% 0.76/0.97
% 0.76/0.97 true clauses given 25 (36.2%)
% 0.76/0.97 false clauses given 44
% 0.76/0.97
% 0.76/0.97 FALSE TRUE
% 0.76/0.97 8 0 1
% 0.76/0.97 9 0 3
% 0.76/0.97 10 0 12
% 0.76/0.97 11 0 19
% 0.76/0.97 12 20 44
% 0.76/0.97 13 26 23
% 0.76/0.97 14 45 67
% 0.76/0.97 15 26 12
% 0.76/0.97 16 27 13
% 0.76/0.97 17 31 22
% 0.76/0.97 18 3 2
% 0.76/0.97 tot: 178 218 (55.1% true)
% 0.76/0.97
% 0.76/0.97
% 0.76/0.97 Model 2 [ 1 -8 238 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.97
% 0.76/0.97 That finishes the proof of the theorem.
% 0.76/0.97
% 0.76/0.97 Process 25026 finished Thu Jun 16 23:36:42 2022
%------------------------------------------------------------------------------