%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV275-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 : Wed Jul 20 21:37:39 EDT 2022
% Result : Unsatisfiable 4.21s 4.45s
% Output : Refutation 4.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV275-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 00:48:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.37 Wed Jun 15 00:48:52 2022
% 0.13/0.37 The command was "./sos". The process ID is 20128.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.41
% 0.13/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 -------------- Softie stats --------------
% 0.13/0.41
% 0.13/0.41 UPDATE_STOP: 300
% 0.13/0.41 SFINDER_TIME_LIMIT: 2
% 0.13/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.41 number of clauses in intial UL: 7
% 0.13/0.41 number of clauses initially in problem: 10
% 0.13/0.41 percentage of clauses intially in UL: 70
% 0.13/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.41 percent of all initial clauses that are short: 100
% 0.13/0.41 absolute distinct symbol count: 10
% 0.13/0.41 distinct predicate count: 3
% 0.13/0.41 distinct function count: 4
% 0.13/0.41 distinct constant count: 3
% 0.13/0.41
% 0.13/0.41 ---------- no more Softie stats ----------
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41 =========== start of search ===========
% 2.14/2.39
% 2.14/2.39
% 2.14/2.39 Changing weight limit from 60 to 59.
% 2.14/2.39
% 2.14/2.39 Stopped by limit on insertions
% 2.14/2.39
% 2.14/2.39 Resetting weight limit to 59 after 200 givens.
% 2.14/2.39
% 4.21/4.45
% 4.21/4.45 -------- PROOF --------
% 4.21/4.45 % SZS status Unsatisfiable
% 4.21/4.45 % SZS output start Refutation
% 4.21/4.45
% 4.21/4.45 ----> UNIT CONFLICT at 4.04 sec ----> 6543 [binary,6542.1,7.1] {-} $F.
% 4.21/4.45
% 4.21/4.45 Length of proof is 12. Level of proof is 10.
% 4.21/4.45
% 4.21/4.45 ---------------- PROOF ----------------
% 4.21/4.45 % SZS status Unsatisfiable
% 4.21/4.45 % SZS output start Refutation
% 4.21/4.45
% 4.21/4.45 1 [] {+} -c_in(A,B,tc_Message_Omsg)|c_in(A,c_Message_Osynth(B),tc_Message_Omsg).
% 4.21/4.45 2 [] {+} -c_lessequals(A,B,tc_set(tc_Message_Omsg))|c_lessequals(c_Message_Osynth(A),c_Message_Osynth(B),tc_set(tc_Message_Omsg)).
% 4.21/4.45 3 [] {+} -c_in(A,B,C)|c_in(A,c_insert(D,B,C),C).
% 4.21/4.45 4 [] {+} -c_in(A,c_insert(B,C,D),D)|c_in(A,C,D)|A=B.
% 4.21/4.45 5 [] {+} -c_in(A,B,C)| -c_lessequals(B,D,tc_set(C))|c_in(A,D,C).
% 4.21/4.45 6 [] {+} -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lessequals(A,B,tc_set(C)).
% 4.21/4.45 7 [] {+} -c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 4.21/4.45 8 [] {+} c_in(A,c_insert(A,B,C),C).
% 4.21/4.45 9 [] {-} c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lessequals(A,B,tc_set(C)).
% 4.21/4.45 12 [hyper,8,1] {+} c_in(A,c_Message_Osynth(c_insert(A,B,tc_Message_Omsg)),tc_Message_Omsg).
% 4.21/4.45 14 [hyper,9,7] {-} c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg).
% 4.21/4.45 16 [hyper,9,2] {-} c_in(c_Main_OsubsetI__1(A,B,tc_Message_Omsg),A,tc_Message_Omsg)|c_lessequals(c_Message_Osynth(A),c_Message_Osynth(B),tc_set(tc_Message_Omsg)).
% 4.21/4.45 55 [hyper,14,4] {-} c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg)|c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg)=v_X.
% 4.21/4.45 4115 [para_from,55.2.1,6.1.1,unit_del,12,7] {-} c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg).
% 4.21/4.45 4116 [hyper,4115,5,16] {-} c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(A),tc_Message_Omsg)|c_in(c_Main_OsubsetI__1(v_H,A,tc_Message_Omsg),v_H,tc_Message_Omsg).
% 4.21/4.45 4869 [hyper,4116,6,unit_del,7] {-} c_in(c_Main_OsubsetI__1(v_H,c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg).
% 4.21/4.45 4904 [hyper,4869,3] {-} c_in(c_Main_OsubsetI__1(v_H,c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg),c_insert(A,v_H,tc_Message_Omsg),tc_Message_Omsg).
% 4.21/4.45 4961 [hyper,4904,6] {-} c_lessequals(v_H,c_insert(v_X,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)).
% 4.21/4.45 4976 [hyper,4961,2] {-} c_lessequals(c_Message_Osynth(v_H),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 4.21/4.45 4985 [hyper,4976,5,4115] {-} c_in(c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 4.21/4.45 6542 [hyper,4985,6] {-} c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 4.21/4.45 6543 [binary,6542.1,7.1] {-} $F.
% 4.21/4.45
% 4.21/4.45 % SZS output end Refutation
% 4.21/4.45 ------------ end of proof -------------
% 4.21/4.45
% 4.21/4.45
% 4.21/4.45 Search stopped by max_proofs option.
% 4.21/4.45
% 4.21/4.45
% 4.21/4.45 Search stopped by max_proofs option.
% 4.21/4.45
% 4.21/4.45 ============ end of search ============
% 4.21/4.45
% 4.21/4.45 ----------- soft-scott stats ----------
% 4.21/4.45
% 4.21/4.45 true clauses given 83 (28.2%)
% 4.21/4.45 false clauses given 211
% 4.21/4.45
% 4.21/4.45 FALSE TRUE
% 4.21/4.45 16 0 5
% 4.21/4.45 17 0 23
% 4.21/4.45 18 0 14
% 4.21/4.45 19 22 20
% 4.21/4.45 20 17 8
% 4.21/4.45 21 29 15
% 4.21/4.45 22 15 18
% 4.21/4.45 23 23 26
% 4.21/4.45 24 26 35
% 4.21/4.45 25 40 69
% 4.21/4.45 26 45 95
% 4.21/4.45 27 60 118
% 4.21/4.45 28 84 87
% 4.21/4.45 29 114 141
% 4.21/4.45 30 132 137
% 4.21/4.45 31 118 98
% 4.21/4.45 32 127 69
% 4.21/4.45 33 113 139
% 4.21/4.45 34 105 90
% 4.21/4.45 35 105 128
% 4.21/4.45 36 112 95
% 4.21/4.45 37 136 118
% 4.21/4.45 38 157 154
% 4.21/4.45 39 207 198
% 4.21/4.45 40 307 259
% 4.21/4.45 41 185 67
% 4.21/4.45 42 153 49
% 4.21/4.45 43 81 45
% 4.21/4.45 44 0 31
% 4.21/4.45 45 0 27
% 4.21/4.45 46 0 23
% 4.21/4.45 47 0 8
% 4.21/4.45 48 0 7
% 4.21/4.45 49 0 7
% 4.21/4.45 50 0 6
% 4.21/4.45 51 0 3
% 4.21/4.45 52 0 3
% 4.21/4.45 53 0 2
% 4.21/4.45 54 0 3
% 4.21/4.45 55 0 3
% 4.21/4.45 56 0 4
% 4.21/4.45 57 0 2
% 4.21/4.45 58 0 3
% 4.21/4.45 59 0 2
% 4.21/4.45 tot: 2513 2454 (49.4% true)
% 4.21/4.45
% 4.21/4.45
% 4.21/4.45 Model 2 (0.00 seconds, 0 Inserts)
% 4.21/4.45
% 4.21/4.45 That finishes the proof of the theorem.
% 4.21/4.45
% 4.21/4.45 Process 20128 finished Wed Jun 15 00:48:56 2022
%------------------------------------------------------------------------------