TSTP Solution File: SWV239-2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV239-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n011.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:26 EDT 2022

% Result   : Unsatisfiable 0.49s 0.69s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWV239-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 15 13:34:05 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n011.cluster.edu,
% 0.12/0.35  Wed Jun 15 13:34:05 2022
% 0.12/0.35  The command was "./sos".  The process ID is 10632.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This is a non-Horn set without equality.  The strategy
% 0.12/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.36/0.55  
% 0.36/0.55  Model 1 (0.00 seconds, 0 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  
% 0.36/0.55  -------------- Softie stats --------------
% 0.36/0.55  
% 0.36/0.55  UPDATE_STOP: 300
% 0.36/0.55  SFINDER_TIME_LIMIT: 2
% 0.36/0.55  SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.55  number of clauses in intial UL: 5
% 0.36/0.55  number of clauses initially in problem: 7
% 0.36/0.55  percentage of clauses intially in UL: 71
% 0.36/0.55  percentage of distinct symbols occuring in initial UL: 100
% 0.36/0.55  percent of all initial clauses that are short: 100
% 0.36/0.55  absolute distinct symbol count: 9
% 0.36/0.55     distinct predicate count: 2
% 0.36/0.55     distinct function count: 4
% 0.36/0.55     distinct constant count: 3
% 0.36/0.55  
% 0.36/0.55  ---------- no more Softie stats ----------
% 0.36/0.55  
% 0.36/0.55  
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on insertions
% 0.36/0.55  
% 0.36/0.55  =========== start of search ===========
% 0.49/0.69  
% 0.49/0.69  -------- PROOF -------- 
% 0.49/0.69  % SZS status Unsatisfiable
% 0.49/0.69  % SZS output start Refutation
% 0.49/0.69  
% 0.49/0.69  Stopped by limit on insertions
% 0.49/0.69  
% 0.49/0.69  ----> UNIT CONFLICT at   0.31 sec ----> 103 [binary,102.1,1.1] {+} $F.
% 0.49/0.69  
% 0.49/0.69  Length of proof is 5.  Level of proof is 5.
% 0.49/0.69  
% 0.49/0.69  ---------------- PROOF ----------------
% 0.49/0.69  % SZS status Unsatisfiable
% 0.49/0.69  % SZS output start Refutation
% 0.49/0.69  
% 0.49/0.69  1 [] {+} -c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 0.49/0.69  2 [] {+} -c_in(A,c_Message_Oanalz(c_Message_Oanalz(B)),tc_Message_Omsg)|c_in(A,c_Message_Oanalz(B),tc_Message_Omsg).
% 0.49/0.69  3 [] {+} -c_lessequals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg))| -c_lessequals(c_Message_Oanalz(C),c_Message_Oanalz(D),tc_set(tc_Message_Omsg))|c_lessequals(c_Message_Oanalz(c_union(C,A,tc_Message_Omsg)),c_Message_Oanalz(c_union(D,B,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 0.49/0.69  4 [] {+} -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lessequals(A,B,tc_set(C)).
% 0.49/0.69  6 [] {-} c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lessequals(A,B,tc_set(C)).
% 0.49/0.69  7 [] {-} c_lessequals(A,A,tc_set(B)).
% 0.49/0.69  12 [hyper,7,3,6] {-} c_lessequals(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Oanalz(c_union(C,B,tc_Message_Omsg)),tc_set(tc_Message_Omsg))|c_in(c_Main_OsubsetI__1(c_Message_Oanalz(A),c_Message_Oanalz(C),tc_Message_Omsg),c_Message_Oanalz(A),tc_Message_Omsg).
% 0.49/0.69  83 [hyper,12,1] {-} c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg).
% 0.49/0.69  95 [hyper,83,2] {-} c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(v_G),tc_Message_Omsg).
% 0.49/0.69  96 [hyper,95,4] {-} c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg)).
% 0.49/0.69  102 [hyper,96,3,7] {-} c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),A,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 0.49/0.69  103 [binary,102.1,1.1] {+} $F.
% 0.49/0.69  
% 0.49/0.69  % SZS output end Refutation
% 0.49/0.69  ------------ end of proof -------------
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Search stopped by max_proofs option.
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Search stopped by max_proofs option.
% 0.49/0.69  
% 0.49/0.69  ============ end of search ============
% 0.49/0.69  
% 0.49/0.69  ----------- soft-scott stats ----------
% 0.49/0.69  
% 0.49/0.69  true clauses given           0      (0.0%)
% 0.49/0.69  false clauses given         14
% 0.49/0.69  
% 0.49/0.69        FALSE     TRUE
% 0.49/0.69    29  12        0
% 0.49/0.69    35  9         0
% 0.49/0.69    39  12        0
% 0.49/0.69    45  22        0
% 0.49/0.69    49  2         0
% 0.49/0.69    55  6         0
% 0.49/0.69  tot:  63        0      (0.0% true)
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Model 1 (0.00 seconds, 0 Inserts)
% 0.49/0.69  
% 0.49/0.69  That finishes the proof of the theorem.
% 0.49/0.69  
% 0.49/0.69  Process 10632 finished Wed Jun 15 13:34:05 2022
%------------------------------------------------------------------------------