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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUM584+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 14:19:44 EDT 2022

% Result   : Theorem 2.22s 2.43s
% Output   : Refutation 2.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : NUM584+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n026.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 : Thu Jul  7 16:02:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox on n026.cluster.edu,
% 0.12/0.36  Thu Jul  7 16:02:24 2022
% 0.12/0.36  The command was "./sos".  The process ID is 11274.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  formula_list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.12/0.36  
% 0.12/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36  clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36    Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.12/0.36  155 back subsumes 154.
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 211 during input processing: 0 [copy,211,flip.1] {-} A=A.
% 0.12/0.36  211 back subsumes 181.
% 0.12/0.36  211 back subsumes 165.
% 0.12/0.36  211 back subsumes 160.
% 0.12/0.36  211 back subsumes 159.
% 0.12/0.36  211 back subsumes 157.
% 0.12/0.36  211 back subsumes 153.
% 0.12/0.36  211 back subsumes 147.
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.67/0.89  
% 0.67/0.89  Stopped by limit on insertions
% 0.67/0.89  
% 0.67/0.89  
% 0.67/0.89  Failed to model usable list: disabling FINDER
% 0.67/0.89  
% 0.67/0.89  
% 0.67/0.89  
% 0.67/0.89  -------------- Softie stats --------------
% 0.67/0.89  
% 0.67/0.89  UPDATE_STOP: 300
% 0.67/0.89  SFINDER_TIME_LIMIT: 2
% 0.67/0.89  SHORT_CLAUSE_CUTOFF: 4
% 0.67/0.89  number of clauses in intial UL: 171
% 0.67/0.89  number of clauses initially in problem: 200
% 0.67/0.89  percentage of clauses intially in UL: 85
% 0.67/0.89  percentage of distinct symbols occuring in initial UL: 96
% 0.67/0.89  percent of all initial clauses that are short: 100
% 0.67/0.89  absolute distinct symbol count: 56
% 0.67/0.89     distinct predicate count: 10
% 0.67/0.89     distinct function count: 35
% 0.67/0.89     distinct constant count: 11
% 0.67/0.89  
% 0.67/0.89  ---------- no more Softie stats ----------
% 0.67/0.89  
% 0.67/0.89  
% 0.67/0.89  
% 0.67/0.89  =========== start of search ===========
% 1.75/1.94  
% 1.75/1.94  
% 1.75/1.94  Changing weight limit from 60 to 30.
% 1.75/1.94  
% 1.75/1.94  Resetting weight limit to 30 after 45 givens.
% 1.75/1.94  
% 2.18/2.38  
% 2.18/2.38  
% 2.18/2.38  Changing weight limit from 30 to 26.
% 2.18/2.38  
% 2.18/2.38  Resetting weight limit to 26 after 50 givens.
% 2.18/2.38  
% 2.22/2.43  
% 2.22/2.43  -------- PROOF -------- 
% 2.22/2.43  % SZS status Theorem
% 2.22/2.43  % SZS output start Refutation
% 2.22/2.43  
% 2.22/2.43  ----> UNIT CONFLICT at   2.06 sec ----> 7648 [binary,7647.1,146.1] {-} $F.
% 2.22/2.43  
% 2.22/2.43  Length of proof is 2.  Level of proof is 2.
% 2.22/2.43  
% 2.22/2.43  ---------------- PROOF ----------------
% 2.22/2.43  % SZS status Theorem
% 2.22/2.43  % SZS output start Refutation
% 2.22/2.43  
% 2.22/2.43  7 [] {+} -aSet0(A)| -aSubsetOf0(B,A)|aSet0(B).
% 2.22/2.43  95 [] {+} -aSet0(A)| -aElementOf0(B,szNzAzT0)|C!=slbdtsldtrb0(A,B)|aElementOf0(D,C)| -aSubsetOf0(D,A)|sbrdtbr0(D)!=B.
% 2.22/2.43  146 [] {+} -aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)).
% 2.22/2.43  183 [] {-} aSet0(szNzAzT0).
% 2.22/2.43  190 [] {-} aElementOf0(xK,szNzAzT0).
% 2.22/2.43  191 [] {-} aSubsetOf0(xS,szNzAzT0).
% 2.22/2.43  208 [] {-} sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))=xK.
% 2.22/2.43  210 [] {-} aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS).
% 2.22/2.43  211 [] {-} A=A.
% 2.22/2.43  1325 [hyper,191,7,183] {-} aSet0(xS).
% 2.22/2.43  7647 [hyper,210,95,1325,190,211,208] {-} aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)).
% 2.22/2.43  7648 [binary,7647.1,146.1] {-} $F.
% 2.22/2.43  
% 2.22/2.43  % SZS output end Refutation
% 2.22/2.43  ------------ end of proof -------------
% 2.22/2.43  
% 2.22/2.43  
% 2.22/2.43  Search stopped by max_proofs option.
% 2.22/2.43  
% 2.22/2.43  
% 2.22/2.43  Search stopped by max_proofs option.
% 2.22/2.43  
% 2.22/2.43  ============ end of search ============
% 2.22/2.43  
% 2.22/2.43  That finishes the proof of the theorem.
% 2.22/2.43  
% 2.22/2.43  Process 11274 finished Thu Jul  7 16:02:26 2022
%------------------------------------------------------------------------------