TSTP Solution File: SWV222+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV222+1 : TPTP v8.1.0. Bugfixed v3.3.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 : Wed Jul 20 21:37:23 EDT 2022

% Result   : Theorem 0.83s 1.00s
% Output   : Refutation 0.83s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV222+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n015.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 05:42:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.83/1.00  
% 0.83/1.00  -------- PROOF -------- 
% 0.83/1.00  % SZS status Unsatisfiable
% 0.83/1.00  % SZS output start Refutation
% 0.83/1.00  ----- Otter 3.2, August 2001 -----
% 0.83/1.00  The process was started by sandbox on n015.cluster.edu,
% 0.83/1.00  Wed Jun 15 05:42:54 2022
% 0.83/1.00  The command was "./sos".  The process ID is 12605.
% 0.83/1.00  
% 0.83/1.00  set(prolog_style_variables).
% 0.83/1.00  set(auto).
% 0.83/1.00     dependent: set(auto1).
% 0.83/1.00     dependent: set(process_input).
% 0.83/1.00     dependent: clear(print_kept).
% 0.83/1.00     dependent: clear(print_new_demod).
% 0.83/1.00     dependent: clear(print_back_demod).
% 0.83/1.00     dependent: clear(print_back_sub).
% 0.83/1.00     dependent: set(control_memory).
% 0.83/1.00     dependent: assign(max_mem, 12000).
% 0.83/1.00     dependent: assign(pick_given_ratio, 4).
% 0.83/1.00     dependent: assign(stats_level, 1).
% 0.83/1.00     dependent: assign(pick_semantic_ratio, 3).
% 0.83/1.00     dependent: assign(sos_limit, 5000).
% 0.83/1.00     dependent: assign(max_weight, 60).
% 0.83/1.00  clear(print_given).
% 0.83/1.00  
% 0.83/1.00  formula_list(usable).
% 0.83/1.00  
% 0.83/1.00  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.83/1.00  
% 0.83/1.00  This ia a non-Horn set with equality.  The strategy will be
% 0.83/1.00  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.83/1.00  unit deletion, with positive clauses in sos and nonpositive
% 0.83/1.00  clauses in usable.
% 0.83/1.00  
% 0.83/1.00     dependent: set(knuth_bendix).
% 0.83/1.00     dependent: set(para_from).
% 0.83/1.00     dependent: set(para_into).
% 0.83/1.00     dependent: clear(para_from_right).
% 0.83/1.00     dependent: clear(para_into_right).
% 0.83/1.00     dependent: set(para_from_vars).
% 0.83/1.00     dependent: set(eq_units_both_ways).
% 0.83/1.00     dependent: set(dynamic_demod_all).
% 0.83/1.00     dependent: set(dynamic_demod).
% 0.83/1.00     dependent: set(order_eq).
% 0.83/1.00     dependent: set(back_demod).
% 0.83/1.00     dependent: set(lrpo).
% 0.83/1.00     dependent: set(hyper_res).
% 0.83/1.00     dependent: set(unit_deletion).
% 0.83/1.00     dependent: set(factor).
% 0.83/1.00  
% 0.83/1.00  ------------> process usable:
% 0.83/1.00  
% 0.83/1.00  ------------> process sos:
% 0.83/1.00    Following clause subsumed by 958 during input processing: 0 [demod,951] {-} gt($c1,tptp_minus_1).
% 0.83/1.00    Following clause subsumed by 958 during input processing: 0 [demod,953] {-} gt($c1,tptp_minus_1).
% 0.83/1.00  
% 0.83/1.00  ----> UNIT CONFLICT at   0.64 sec ----> 966 [binary,965.1,2.1] {-} $F.
% 0.83/1.00  
% 0.83/1.00  Length of proof is 3.  Level of proof is 3.
% 0.83/1.00  
% 0.83/1.00  ---------------- PROOF ----------------
% 0.83/1.00  % SZS status Theorem
% 0.83/1.00  % SZS output start Refutation
% 0.83/1.00  
% 0.83/1.00  2 [] {-} -gt(A,A).
% 0.83/1.00  945,944 [] {-} n0=$c2.
% 0.83/1.00  946 [] {-} n0=$c1.
% 0.83/1.00  948,947 [copy,946,demod,945] {-} $c2=$c1.
% 0.83/1.00  949 [] {-} n1=$c2.
% 0.83/1.00  951,950 [copy,949,demod,948] {-} n1=$c1.
% 0.83/1.00  964 [] {-} gt(n1,n0).
% 0.83/1.00  965 [copy,964,demod,951,945,948] {-} gt($c1,$c1).
% 0.83/1.00  966 [binary,965.1,2.1] {-} $F.
% 0.83/1.00  
% 0.83/1.00  % SZS output end Refutation
% 0.83/1.00  ------------ end of proof -------------
% 0.83/1.00  
% 0.83/1.00  
% 0.83/1.00  Search stopped by max_proofs option.
% 0.83/1.00  
% 0.83/1.00  
% 0.83/1.00  Search stopped by max_proofs option.
% 0.83/1.00  
% 0.83/1.00  ============ end of search ============
% 0.83/1.00  
% 0.83/1.00  That finishes the proof of the theorem.
% 0.83/1.00  
% 0.83/1.00  Process 12605 finished Wed Jun 15 05:42:55 2022
%------------------------------------------------------------------------------