%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV259-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:34 EDT 2022
% Result : Unsatisfiable 0.91s 1.15s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV259-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Wed Jun 15 10:57:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n009.cluster.edu,
% 0.13/0.35 Wed Jun 15 10:57:08 2022
% 0.13/0.35 The command was "./sos". The process ID is 31370.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.54/0.75
% 0.54/0.75 Model 1 (0.00 seconds, 0 Inserts)
% 0.54/0.75
% 0.54/0.75 Stopped by limit on number of solutions
% 0.54/0.75
% 0.54/0.75
% 0.54/0.75 -------------- Softie stats --------------
% 0.54/0.75
% 0.54/0.75 UPDATE_STOP: 300
% 0.54/0.75 SFINDER_TIME_LIMIT: 2
% 0.54/0.75 SHORT_CLAUSE_CUTOFF: 4
% 0.54/0.75 number of clauses in intial UL: 4
% 0.54/0.75 number of clauses initially in problem: 5
% 0.54/0.75 percentage of clauses intially in UL: 80
% 0.54/0.75 percentage of distinct symbols occuring in initial UL: 100
% 0.54/0.75 percent of all initial clauses that are short: 100
% 0.54/0.75 absolute distinct symbol count: 7
% 0.54/0.75 distinct predicate count: 1
% 0.54/0.75 distinct function count: 3
% 0.54/0.75 distinct constant count: 3
% 0.54/0.75
% 0.54/0.75 ---------- no more Softie stats ----------
% 0.54/0.75
% 0.54/0.75
% 0.54/0.75
% 0.54/0.75 Stopped by limit on insertions
% 0.54/0.75
% 0.54/0.75 =========== start of search ===========
% 0.91/1.15
% 0.91/1.15 -------- PROOF --------
% 0.91/1.15 % SZS status Unsatisfiable
% 0.91/1.15 % SZS output start Refutation
% 0.91/1.15
% 0.91/1.15 Stopped by limit on insertions
% 0.91/1.15
% 0.91/1.15 Stopped by limit on insertions
% 0.91/1.15
% 0.91/1.15 Model 2 [ 4 2 20417 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.15
% 0.91/1.15 ----> UNIT CONFLICT at 0.78 sec ----> 17 [binary,16.1,1.1] {-} $F.
% 0.91/1.15
% 0.91/1.15 Length of proof is 3. Level of proof is 3.
% 0.91/1.15
% 0.91/1.15 ---------------- PROOF ----------------
% 0.91/1.15 % SZS status Unsatisfiable
% 0.91/1.15 % SZS output start Refutation
% 0.91/1.15
% 0.91/1.15 1 [] {+} -c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 0.91/1.15 2 [] {+} -c_lessequals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg))|c_lessequals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg)).
% 0.91/1.15 3 [] {+} -c_lessequals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg))|c_lessequals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)).
% 0.91/1.15 4 [] {+} -c_lessequals(c_insert(A,B,C),D,tc_set(C))|c_lessequals(B,D,tc_set(C)).
% 0.91/1.15 5 [] {-} c_lessequals(A,A,tc_set(B)).
% 0.91/1.15 8 [hyper,5,2] {-} c_lessequals(A,c_Message_Oparts(A),tc_set(tc_Message_Omsg)).
% 0.91/1.15 9 [hyper,8,4] {-} c_lessequals(A,c_Message_Oparts(c_insert(B,A,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 0.91/1.15 16 [hyper,9,3] {-} c_lessequals(c_Message_Oparts(A),c_Message_Oparts(c_insert(B,A,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 0.91/1.15 17 [binary,16.1,1.1] {-} $F.
% 0.91/1.15
% 0.91/1.15 % SZS output end Refutation
% 0.91/1.15 ------------ end of proof -------------
% 0.91/1.15
% 0.91/1.15
% 0.91/1.15 Search stopped by max_proofs option.
% 0.91/1.15
% 0.91/1.15
% 0.91/1.15 Search stopped by max_proofs option.
% 0.91/1.15
% 0.91/1.15 ============ end of search ============
% 0.91/1.15
% 0.91/1.15 ----------- soft-scott stats ----------
% 0.91/1.15
% 0.91/1.15 true clauses given 0 (0.0%)
% 0.91/1.15 false clauses given 6
% 0.91/1.15
% 0.91/1.15 FALSE TRUE
% 0.91/1.15 8 1 0
% 0.91/1.15 9 1 0
% 0.91/1.15 10 0 1
% 0.91/1.15 11 0 1
% 0.91/1.15 tot: 2 2 (50.0% true)
% 0.91/1.15
% 0.91/1.15
% 0.91/1.15 Model 2 [ 4 2 20417 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.15
% 0.91/1.15 That finishes the proof of the theorem.
% 0.91/1.15
% 0.91/1.15 Process 31370 finished Wed Jun 15 10:57:08 2022
%------------------------------------------------------------------------------