TSTP Solution File: SET810+4 by SOS---2.0

View Problem - Process Solution

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

% Computer : n025.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 05:20:48 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SET810+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n025.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 : Sun Jul 10 07:21:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n025.cluster.edu,
% 0.12/0.35  Sun Jul 10 07:21:01 2022
% 0.12/0.35  The command was "./sos".  The process ID is 16077.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.12/0.35  
% 0.12/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35  clauses in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(knuth_bendix).
% 0.12/0.35     dependent: set(para_from).
% 0.12/0.35     dependent: set(para_into).
% 0.12/0.35     dependent: clear(para_from_right).
% 0.12/0.35     dependent: clear(para_into_right).
% 0.12/0.35     dependent: set(para_from_vars).
% 0.12/0.35     dependent: set(eq_units_both_ways).
% 0.12/0.35     dependent: set(dynamic_demod_all).
% 0.12/0.35     dependent: set(dynamic_demod).
% 0.12/0.35     dependent: set(order_eq).
% 0.12/0.35     dependent: set(back_demod).
% 0.12/0.35     dependent: set(lrpo).
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35    Following clause subsumed by 91 during input processing: 0 [copy,91,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Failed to model usable list: disabling FINDER
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  -------------- Softie stats --------------
% 0.19/0.43  
% 0.19/0.43  UPDATE_STOP: 300
% 0.19/0.43  SFINDER_TIME_LIMIT: 2
% 0.19/0.43  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43  number of clauses in intial UL: 63
% 0.19/0.43  number of clauses initially in problem: 90
% 0.19/0.43  percentage of clauses intially in UL: 70
% 0.19/0.43  percentage of distinct symbols occuring in initial UL: 91
% 0.19/0.43  percent of all initial clauses that are short: 100
% 0.19/0.43  absolute distinct symbol count: 37
% 0.19/0.43     distinct predicate count: 9
% 0.19/0.43     distinct function count: 23
% 0.19/0.43     distinct constant count: 5
% 0.19/0.43  
% 0.19/0.43  ---------- no more Softie stats ----------
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  =========== start of search ===========
% 0.19/0.47  
% 0.19/0.47  -------- PROOF -------- 
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  % SZS output start Refutation
% 0.19/0.47  
% 0.19/0.47  -----> EMPTY CLAUSE at   0.09 sec ----> 822 [hyper,416,64,343,359] {-} $F.
% 0.19/0.47  
% 0.19/0.47  Length of proof is 9.  Level of proof is 3.
% 0.19/0.47  
% 0.19/0.47  ---------------- PROOF ----------------
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  % SZS output start Refutation
% 0.19/0.47  
% 0.19/0.47  1 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 0.19/0.47  5 [] {+} equal_set(A,B)| -subset(A,B)| -subset(B,A).
% 0.19/0.47  29 [] {+} -member(A,on)|strict_well_order(member_predicate,A).
% 0.19/0.47  30 [] {+} -member(A,on)| -member(B,A)|subset(B,A).
% 0.19/0.47  33 [] {+} -strict_well_order(A,B)|strict_order(A,B).
% 0.19/0.47  45 [] {+} apply(member_predicate,A,B)| -member(A,B).
% 0.19/0.47  46 [] {+} -strict_order(A,B)| -member(C,B)| -member(D,B)| -apply(A,C,D)| -apply(A,D,C).
% 0.19/0.47  64 [factor,46.2.3,factor_simp] {+} -strict_order(A,B)| -member(C,B)| -apply(A,C,C).
% 0.19/0.47  87 [] {-} member($c2,on).
% 0.19/0.47  88 [] {-} member($c1,on).
% 0.19/0.47  89 [] {-} member($c2,$c1).
% 0.19/0.47  90 [] {-} member($c1,$c2).
% 0.19/0.47  131 [hyper,88,29] {-} strict_well_order(member_predicate,$c1).
% 0.19/0.47  234 [hyper,89,30,88] {-} subset($c2,$c1).
% 0.19/0.47  261 [hyper,90,45] {-} apply(member_predicate,$c1,$c2).
% 0.19/0.47  263 [hyper,90,30,87] {-} subset($c1,$c2).
% 0.19/0.47  343 [hyper,131,33] {-} strict_order(member_predicate,$c1).
% 0.19/0.47  359 [hyper,234,1,90] {-} member($c1,$c1).
% 0.19/0.47  376,375 [hyper,263,5,234] {-} equal_set($c2,$c1).
% 0.19/0.47  416 [back_demod,261,demod,376] {-} apply(member_predicate,$c1,$c1).
% 0.19/0.47  822 [hyper,416,64,343,359] {-} $F.
% 0.19/0.47  
% 0.19/0.47  % SZS output end Refutation
% 0.19/0.47  ------------ end of proof -------------
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Search stopped by max_proofs option.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Search stopped by max_proofs option.
% 0.19/0.47  
% 0.19/0.47  ============ end of search ============
% 0.19/0.47  
% 0.19/0.47  That finishes the proof of the theorem.
% 0.19/0.47  
% 0.19/0.47  Process 16077 finished Sun Jul 10 07:21:01 2022
%------------------------------------------------------------------------------