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

View Problem - Process Solution

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

% Computer : n020.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:32 EDT 2022

% Result   : Theorem 9.36s 9.61s
% Output   : Refutation 9.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM561+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul  5 18:49:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.38  ----- Otter 3.2, August 2001 -----
% 0.20/0.38  The process was started by sandbox2 on n020.cluster.edu,
% 0.20/0.38  Tue Jul  5 18:49:44 2022
% 0.20/0.38  The command was "./sos".  The process ID is 12656.
% 0.20/0.38  
% 0.20/0.38  set(prolog_style_variables).
% 0.20/0.38  set(auto).
% 0.20/0.38     dependent: set(auto1).
% 0.20/0.38     dependent: set(process_input).
% 0.20/0.38     dependent: clear(print_kept).
% 0.20/0.38     dependent: clear(print_new_demod).
% 0.20/0.38     dependent: clear(print_back_demod).
% 0.20/0.38     dependent: clear(print_back_sub).
% 0.20/0.38     dependent: set(control_memory).
% 0.20/0.38     dependent: assign(max_mem, 12000).
% 0.20/0.38     dependent: assign(pick_given_ratio, 4).
% 0.20/0.38     dependent: assign(stats_level, 1).
% 0.20/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.38     dependent: assign(sos_limit, 5000).
% 0.20/0.38     dependent: assign(max_weight, 60).
% 0.20/0.38  clear(print_given).
% 0.20/0.38  
% 0.20/0.38  formula_list(usable).
% 0.20/0.38  
% 0.20/0.38  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.20/0.38  
% 0.20/0.38  This ia a non-Horn set with equality.  The strategy will be
% 0.20/0.38  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.38  unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.38  clauses in usable.
% 0.20/0.38  
% 0.20/0.38     dependent: set(knuth_bendix).
% 0.20/0.38     dependent: set(para_from).
% 0.20/0.38     dependent: set(para_into).
% 0.20/0.38     dependent: clear(para_from_right).
% 0.20/0.38     dependent: clear(para_into_right).
% 0.20/0.38     dependent: set(para_from_vars).
% 0.20/0.38     dependent: set(eq_units_both_ways).
% 0.20/0.38     dependent: set(dynamic_demod_all).
% 0.20/0.38     dependent: set(dynamic_demod).
% 0.20/0.38     dependent: set(order_eq).
% 0.20/0.38     dependent: set(back_demod).
% 0.20/0.38     dependent: set(lrpo).
% 0.20/0.38     dependent: set(hyper_res).
% 0.20/0.38     dependent: set(unit_deletion).
% 0.20/0.38     dependent: set(factor).
% 0.20/0.38  
% 0.20/0.38  ------------> process usable:
% 0.20/0.38  132 back subsumes 131.
% 0.20/0.38  
% 0.20/0.38  ------------> process sos:
% 0.20/0.38    Following clause subsumed by 163 during input processing: 0 [copy,163,flip.1] {-} A=A.
% 0.20/0.38  163 back subsumes 142.
% 0.20/0.38  163 back subsumes 137.
% 0.20/0.38  163 back subsumes 136.
% 0.20/0.38  163 back subsumes 134.
% 0.20/0.38  163 back subsumes 130.
% 0.20/0.38  163 back subsumes 124.
% 0.20/0.38  
% 0.20/0.38  ======= end of input processing =======
% 0.56/0.74  
% 0.56/0.74  Stopped by limit on insertions
% 0.56/0.74  
% 0.56/0.74  
% 0.56/0.74  Failed to model usable list: disabling FINDER
% 0.56/0.74  
% 0.56/0.74  
% 0.56/0.74  
% 0.56/0.74  -------------- Softie stats --------------
% 0.56/0.74  
% 0.56/0.74  UPDATE_STOP: 300
% 0.56/0.74  SFINDER_TIME_LIMIT: 2
% 0.56/0.74  SHORT_CLAUSE_CUTOFF: 4
% 0.56/0.74  number of clauses in intial UL: 145
% 0.56/0.74  number of clauses initially in problem: 154
% 0.56/0.74  percentage of clauses intially in UL: 94
% 0.56/0.74  percentage of distinct symbols occuring in initial UL: 100
% 0.56/0.74  percent of all initial clauses that are short: 100
% 0.56/0.74  absolute distinct symbol count: 43
% 0.56/0.74     distinct predicate count: 10
% 0.56/0.74     distinct function count: 28
% 0.56/0.74     distinct constant count: 5
% 0.56/0.74  
% 0.56/0.74  ---------- no more Softie stats ----------
% 0.56/0.74  
% 0.56/0.74  
% 0.56/0.74  
% 0.56/0.74  =========== start of search ===========
% 5.24/5.41  
% 5.24/5.41  
% 5.24/5.41  Changing weight limit from 60 to 45.
% 5.24/5.41  
% 5.24/5.41  Resetting weight limit to 45 after 35 givens.
% 5.24/5.41  
% 6.67/6.94  
% 6.67/6.94  
% 6.67/6.94  Changing weight limit from 45 to 32.
% 6.67/6.94  
% 6.67/6.94  Resetting weight limit to 32 after 40 givens.
% 6.67/6.94  
% 7.19/7.38  
% 7.19/7.38  
% 7.19/7.38  Changing weight limit from 32 to 29.
% 7.19/7.38  
% 7.19/7.38  Resetting weight limit to 29 after 45 givens.
% 7.19/7.38  
% 7.59/7.81  
% 7.59/7.81  
% 7.59/7.81  Changing weight limit from 29 to 27.
% 7.59/7.81  
% 7.59/7.81  Resetting weight limit to 27 after 50 givens.
% 7.59/7.81  
% 8.07/8.30  
% 8.07/8.30  
% 8.07/8.30  Changing weight limit from 27 to 25.
% 8.07/8.30  
% 8.07/8.30  Resetting weight limit to 25 after 55 givens.
% 8.07/8.30  
% 8.59/8.76  
% 8.59/8.76  
% 8.59/8.76  Changing weight limit from 25 to 24.
% 8.59/8.76  
% 8.59/8.76  Resetting weight limit to 24 after 65 givens.
% 8.59/8.76  
% 9.06/9.29  
% 9.06/9.29  
% 9.06/9.29  Changing weight limit from 24 to 23.
% 9.06/9.29  
% 9.06/9.29  Resetting weight limit to 23 after 70 givens.
% 9.06/9.29  
% 9.36/9.61  
% 9.36/9.61  -------- PROOF -------- 
% 9.36/9.61  % SZS status Theorem
% 9.36/9.61  % SZS output start Refutation
% 9.36/9.61  
% 9.36/9.61  ----> UNIT CONFLICT at   9.21 sec ----> 13776 [binary,13775.1,123.1] {-} $F.
% 9.36/9.61  
% 9.36/9.61  Length of proof is 3.  Level of proof is 3.
% 9.36/9.61  
% 9.36/9.61  ---------------- PROOF ----------------
% 9.36/9.61  % SZS status Theorem
% 9.36/9.61  % SZS output start Refutation
% 9.36/9.61  
% 9.36/9.61  12 [] {+} -aSet0(A)|aSubsetOf0(A,A).
% 9.36/9.61  106 [] {+} -aFunction0(A)|aSet0(szDzozmdt0(A)).
% 9.36/9.61  119 [] {+} -aFunction0(A)| -aSubsetOf0(B,szDzozmdt0(A))|C!=sdtlcdtrc0(A,B)|aElementOf0(D,C)| -aElementOf0(E,B)|sdtlpdtrp0(A,E)!=D.
% 9.36/9.61  123 [] {+} -aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))).
% 9.36/9.61  161 [] {-} aFunction0(xF).
% 9.36/9.61  162 [] {-} aElementOf0(xx,szDzozmdt0(xF)).
% 9.36/9.61  163 [] {-} A=A.
% 9.36/9.61  310 [hyper,161,106] {-} aSet0(szDzozmdt0(xF)).
% 9.36/9.61  1179 [hyper,310,12] {-} aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF)).
% 9.36/9.61  13775 [hyper,1179,119,161,163,162,163] {-} aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))).
% 9.36/9.61  13776 [binary,13775.1,123.1] {-} $F.
% 9.36/9.61  
% 9.36/9.61  % SZS output end Refutation
% 9.36/9.61  ------------ end of proof -------------
% 9.36/9.61  
% 9.36/9.61  
% 9.36/9.61  Search stopped by max_proofs option.
% 9.36/9.61  
% 9.36/9.61  
% 9.36/9.61  Search stopped by max_proofs option.
% 9.36/9.61  
% 9.36/9.61  ============ end of search ============
% 9.36/9.61  
% 9.36/9.61  That finishes the proof of the theorem.
% 9.36/9.61  
% 9.36/9.61  Process 12656 finished Tue Jul  5 18:49:53 2022
%------------------------------------------------------------------------------