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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n018.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:37 EDT 2022

% Result   : Theorem 2.32s 2.54s
% Output   : Refutation 2.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n018.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 Jul  6 15:14:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.37  ----- Otter 3.2, August 2001 -----
% 0.12/0.37  The process was started by sandbox on n018.cluster.edu,
% 0.12/0.37  Wed Jul  6 15:14:38 2022
% 0.12/0.37  The command was "./sos".  The process ID is 5510.
% 0.12/0.37  
% 0.12/0.37  set(prolog_style_variables).
% 0.12/0.37  set(auto).
% 0.12/0.37     dependent: set(auto1).
% 0.12/0.37     dependent: set(process_input).
% 0.12/0.37     dependent: clear(print_kept).
% 0.12/0.37     dependent: clear(print_new_demod).
% 0.12/0.37     dependent: clear(print_back_demod).
% 0.12/0.37     dependent: clear(print_back_sub).
% 0.12/0.37     dependent: set(control_memory).
% 0.12/0.37     dependent: assign(max_mem, 12000).
% 0.12/0.37     dependent: assign(pick_given_ratio, 4).
% 0.12/0.37     dependent: assign(stats_level, 1).
% 0.12/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37     dependent: assign(sos_limit, 5000).
% 0.12/0.37     dependent: assign(max_weight, 60).
% 0.12/0.37  clear(print_given).
% 0.12/0.37  
% 0.12/0.37  formula_list(usable).
% 0.12/0.37  
% 0.12/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.12/0.37  
% 0.12/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37  clauses in usable.
% 0.12/0.37  
% 0.12/0.37     dependent: set(knuth_bendix).
% 0.12/0.37     dependent: set(para_from).
% 0.12/0.37     dependent: set(para_into).
% 0.12/0.37     dependent: clear(para_from_right).
% 0.12/0.37     dependent: clear(para_into_right).
% 0.12/0.37     dependent: set(para_from_vars).
% 0.12/0.37     dependent: set(eq_units_both_ways).
% 0.12/0.37     dependent: set(dynamic_demod_all).
% 0.12/0.37     dependent: set(dynamic_demod).
% 0.12/0.37     dependent: set(order_eq).
% 0.12/0.37     dependent: set(back_demod).
% 0.12/0.37     dependent: set(lrpo).
% 0.12/0.37     dependent: set(hyper_res).
% 0.12/0.37     dependent: set(unit_deletion).
% 0.12/0.37     dependent: set(factor).
% 0.12/0.37  
% 0.12/0.37  ------------> process usable:
% 0.12/0.37    Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.12/0.37  153 back subsumes 152.
% 0.12/0.37  
% 0.12/0.37  ------------> process sos:
% 0.12/0.37    Following clause subsumed by 207 during input processing: 0 [copy,207,flip.1] {-} A=A.
% 0.12/0.37  207 back subsumes 163.
% 0.12/0.37  207 back subsumes 158.
% 0.12/0.37  207 back subsumes 157.
% 0.12/0.37  207 back subsumes 155.
% 0.12/0.37  207 back subsumes 151.
% 0.12/0.37  207 back subsumes 145.
% 0.12/0.37  
% 0.12/0.37  ======= end of input processing =======
% 0.45/0.66  
% 0.45/0.66  Stopped by limit on insertions
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  Failed to model usable list: disabling FINDER
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  -------------- Softie stats --------------
% 0.45/0.66  
% 0.45/0.66  UPDATE_STOP: 300
% 0.45/0.66  SFINDER_TIME_LIMIT: 2
% 0.45/0.66  SHORT_CLAUSE_CUTOFF: 4
% 0.45/0.66  number of clauses in intial UL: 168
% 0.45/0.66  number of clauses initially in problem: 197
% 0.45/0.66  percentage of clauses intially in UL: 85
% 0.45/0.66  percentage of distinct symbols occuring in initial UL: 92
% 0.45/0.66  percent of all initial clauses that are short: 100
% 0.45/0.66  absolute distinct symbol count: 56
% 0.45/0.66     distinct predicate count: 10
% 0.45/0.66     distinct function count: 35
% 0.45/0.66     distinct constant count: 11
% 0.45/0.66  
% 0.45/0.66  ---------- no more Softie stats ----------
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  =========== start of search ===========
% 1.31/1.50  
% 1.31/1.50  
% 1.31/1.50  Changing weight limit from 60 to 32.
% 1.31/1.50  
% 1.31/1.50  Resetting weight limit to 32 after 45 givens.
% 1.31/1.50  
% 1.73/1.97  
% 1.73/1.97  
% 1.73/1.97  Changing weight limit from 32 to 26.
% 1.73/1.97  
% 1.73/1.97  Resetting weight limit to 26 after 50 givens.
% 1.73/1.97  
% 2.21/2.40  
% 2.21/2.40  
% 2.21/2.40  Changing weight limit from 26 to 23.
% 2.21/2.40  
% 2.21/2.40  Resetting weight limit to 23 after 55 givens.
% 2.21/2.40  
% 2.32/2.54  
% 2.32/2.54  -------- PROOF -------- 
% 2.32/2.54  % SZS status Theorem
% 2.32/2.54  % SZS output start Refutation
% 2.32/2.54  
% 2.32/2.54  -----> EMPTY CLAUSE at   2.15 sec ----> 8307 [back_demod,144,demod,8240,201,8240,201,unit_del,187,188] {-} $F.
% 2.32/2.54  
% 2.32/2.54  Length of proof is 1.  Level of proof is 1.
% 2.32/2.54  
% 2.32/2.54  ---------------- PROOF ----------------
% 2.32/2.54  % SZS status Theorem
% 2.32/2.54  % SZS output start Refutation
% 2.32/2.54  
% 2.32/2.54  144 [] {+} -aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)| -isCountable0(sdtlpdtrp0(xN,xi)).
% 2.32/2.54  187 [] {-} aSubsetOf0(xS,szNzAzT0).
% 2.32/2.54  188 [] {-} isCountable0(xS).
% 2.32/2.54  201,200 [] {-} sdtlpdtrp0(xN,sz00)=xS.
% 2.32/2.54  205 [] {-} xi=sz00|aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0).
% 2.32/2.54  206 [] {-} xi=sz00|isCountable0(sdtlpdtrp0(xN,xi)).
% 2.32/2.54  8240,8239 [hyper,206,144,205,factor_simp] {-} xi=sz00.
% 2.32/2.54  8307 [back_demod,144,demod,8240,201,8240,201,unit_del,187,188] {-} $F.
% 2.32/2.54  
% 2.32/2.54  % SZS output end Refutation
% 2.32/2.54  ------------ end of proof -------------
% 2.32/2.54  
% 2.32/2.54  
% 2.32/2.54  Search stopped by max_proofs option.
% 2.32/2.54  
% 2.32/2.54  
% 2.32/2.54  Search stopped by max_proofs option.
% 2.32/2.54  
% 2.32/2.54  ============ end of search ============
% 2.32/2.54  
% 2.32/2.54  That finishes the proof of the theorem.
% 2.32/2.54  
% 2.32/2.54  Process 5510 finished Wed Jul  6 15:14:40 2022
%------------------------------------------------------------------------------