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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n016.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 : Tue Jul 19 14:27:06 EDT 2022

% Result   : Theorem 0.18s 0.40s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.11/0.33  % Computer : n016.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jun 20 09:54:40 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.34  ----- Otter 3.2, August 2001 -----
% 0.11/0.34  The process was started by sandbox on n016.cluster.edu,
% 0.11/0.34  Mon Jun 20 09:54:40 2022
% 0.11/0.34  The command was "./sos".  The process ID is 7215.
% 0.11/0.34  
% 0.11/0.34  set(prolog_style_variables).
% 0.11/0.34  set(auto).
% 0.11/0.34     dependent: set(auto1).
% 0.11/0.34     dependent: set(process_input).
% 0.11/0.34     dependent: clear(print_kept).
% 0.11/0.34     dependent: clear(print_new_demod).
% 0.11/0.34     dependent: clear(print_back_demod).
% 0.11/0.34     dependent: clear(print_back_sub).
% 0.11/0.34     dependent: set(control_memory).
% 0.11/0.34     dependent: assign(max_mem, 12000).
% 0.11/0.34     dependent: assign(pick_given_ratio, 4).
% 0.11/0.34     dependent: assign(stats_level, 1).
% 0.11/0.34     dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34     dependent: assign(sos_limit, 5000).
% 0.11/0.34     dependent: assign(max_weight, 60).
% 0.11/0.34  clear(print_given).
% 0.11/0.34  
% 0.11/0.34  formula_list(usable).
% 0.11/0.34  
% 0.11/0.34  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.11/0.34  
% 0.11/0.34  This ia a non-Horn set with equality.  The strategy will be
% 0.11/0.34  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34  unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34  clauses in usable.
% 0.11/0.34  
% 0.11/0.34     dependent: set(knuth_bendix).
% 0.11/0.34     dependent: set(para_from).
% 0.11/0.34     dependent: set(para_into).
% 0.11/0.34     dependent: clear(para_from_right).
% 0.11/0.34     dependent: clear(para_into_right).
% 0.11/0.34     dependent: set(para_from_vars).
% 0.11/0.34     dependent: set(eq_units_both_ways).
% 0.11/0.34     dependent: set(dynamic_demod_all).
% 0.11/0.34     dependent: set(dynamic_demod).
% 0.11/0.34     dependent: set(order_eq).
% 0.11/0.34     dependent: set(back_demod).
% 0.11/0.34     dependent: set(lrpo).
% 0.11/0.34     dependent: set(hyper_res).
% 0.11/0.34     dependent: set(unit_deletion).
% 0.11/0.34     dependent: set(factor).
% 0.11/0.34  
% 0.11/0.34  ------------> process usable:
% 0.11/0.34  
% 0.11/0.34  ------------> process sos:
% 0.11/0.34    Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.11/0.34  
% 0.11/0.34  ======= end of input processing =======
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Failed to model usable list: disabling FINDER
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  -------------- Softie stats --------------
% 0.18/0.40  
% 0.18/0.40  UPDATE_STOP: 300
% 0.18/0.40  SFINDER_TIME_LIMIT: 2
% 0.18/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.40  number of clauses in intial UL: 7
% 0.18/0.40  number of clauses initially in problem: 14
% 0.18/0.40  percentage of clauses intially in UL: 50
% 0.18/0.40  percentage of distinct symbols occuring in initial UL: 70
% 0.18/0.40  percent of all initial clauses that are short: 100
% 0.18/0.40  absolute distinct symbol count: 10
% 0.18/0.40     distinct predicate count: 3
% 0.18/0.40     distinct function count: 3
% 0.18/0.40     distinct constant count: 4
% 0.18/0.40  
% 0.18/0.40  ---------- no more Softie stats ----------
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  =========== start of search ===========
% 0.18/0.40  
% 0.18/0.40  -------- PROOF -------- 
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  % SZS output start Refutation
% 0.18/0.40  
% 0.18/0.40  -----> EMPTY CLAUSE at   0.03 sec ----> 50 [hyper,32,5,11] {-} $F.
% 0.18/0.40  
% 0.18/0.40  Length of proof is 1.  Level of proof is 1.
% 0.18/0.40  
% 0.18/0.40  ---------------- PROOF ----------------
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  % SZS output start Refutation
% 0.18/0.40  
% 0.18/0.40  3 [] {+} A!=singleton(B)|in(C,A)|C!=B.
% 0.18/0.40  5 [] {+} A!=empty_set| -in(B,A).
% 0.18/0.40  11 [] {-} singleton($c1)=empty_set.
% 0.18/0.40  14 [] {-} A=A.
% 0.18/0.40  32 [hyper,14,3,14] {-} in(A,singleton(A)).
% 0.18/0.40  50 [hyper,32,5,11] {-} $F.
% 0.18/0.40  
% 0.18/0.40  % SZS output end Refutation
% 0.18/0.40  ------------ end of proof -------------
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Search stopped by max_proofs option.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Search stopped by max_proofs option.
% 0.18/0.40  
% 0.18/0.40  ============ end of search ============
% 0.18/0.40  
% 0.18/0.40  That finishes the proof of the theorem.
% 0.18/0.40  
% 0.18/0.40  Process 7215 finished Mon Jun 20 09:54:40 2022
%------------------------------------------------------------------------------