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

View Problem - Process Solution

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

% Computer : n024.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:21:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET881+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 11:56:28 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n024.cluster.edu,
% 0.19/0.36  Sun Jul 10 11:56:28 2022
% 0.19/0.36  The command was "./sos".  The process ID is 15772.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  formula_list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.36  
% 0.19/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36  clauses in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(knuth_bendix).
% 0.19/0.36     dependent: set(para_from).
% 0.19/0.36     dependent: set(para_into).
% 0.19/0.36     dependent: clear(para_from_right).
% 0.19/0.36     dependent: clear(para_into_right).
% 0.19/0.36     dependent: set(para_from_vars).
% 0.19/0.36     dependent: set(eq_units_both_ways).
% 0.19/0.36     dependent: set(dynamic_demod_all).
% 0.19/0.36     dependent: set(dynamic_demod).
% 0.19/0.36     dependent: set(order_eq).
% 0.19/0.36     dependent: set(back_demod).
% 0.19/0.36     dependent: set(lrpo).
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: set(unit_deletion).
% 0.19/0.36     dependent: set(factor).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36    Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.19/0.36    Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.19/0.36  
% 0.19/0.36  ======= end of input processing =======
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Failed to model usable list: disabling FINDER
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  -------------- Softie stats --------------
% 0.19/0.42  
% 0.19/0.42  UPDATE_STOP: 300
% 0.19/0.42  SFINDER_TIME_LIMIT: 2
% 0.19/0.42  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42  number of clauses in intial UL: 12
% 0.19/0.42  number of clauses initially in problem: 18
% 0.19/0.42  percentage of clauses intially in UL: 66
% 0.19/0.42  percentage of distinct symbols occuring in initial UL: 91
% 0.19/0.42  percent of all initial clauses that are short: 100
% 0.19/0.42  absolute distinct symbol count: 12
% 0.19/0.42     distinct predicate count: 3
% 0.19/0.42     distinct function count: 4
% 0.19/0.42     distinct constant count: 5
% 0.19/0.42  
% 0.19/0.42  ---------- no more Softie stats ----------
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  =========== start of search ===========
% 0.19/0.42  
% 0.19/0.42  -------- PROOF -------- 
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  % SZS output start Refutation
% 0.19/0.42  
% 0.19/0.42  ----> UNIT CONFLICT at   0.04 sec ----> 41 [binary,39.1,26.1] {-} $F.
% 0.19/0.42  
% 0.19/0.42  Length of proof is 3.  Level of proof is 2.
% 0.19/0.42  
% 0.19/0.42  ---------------- PROOF ----------------
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  % SZS output start Refutation
% 0.19/0.42  
% 0.19/0.42  4 [] {+} A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 0.19/0.42  8 [] {+} set_difference(singleton(A),B)=empty_set| -in(A,B).
% 0.19/0.42  10 [] {+} set_difference(singleton($c4),unordered_pair($c4,$c3))!=empty_set.
% 0.19/0.42  13 [] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.19/0.42  17 [] {-} A=A.
% 0.19/0.42  26 [para_from,13.1.1,10.1.1.2] {-} set_difference(singleton($c4),unordered_pair($c3,$c4))!=empty_set.
% 0.19/0.42  37 [hyper,17,4,17] {-} in(A,unordered_pair(B,A)).
% 0.19/0.42  39 [hyper,37,8] {-} set_difference(singleton(A),unordered_pair(B,A))=empty_set.
% 0.19/0.42  41 [binary,39.1,26.1] {-} $F.
% 0.19/0.42  
% 0.19/0.42  % SZS output end Refutation
% 0.19/0.42  ------------ end of proof -------------
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Search stopped by max_proofs option.
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Search stopped by max_proofs option.
% 0.19/0.42  
% 0.19/0.42  ============ end of search ============
% 0.19/0.42  
% 0.19/0.42  That finishes the proof of the theorem.
% 0.19/0.42  
% 0.19/0.42  Process 15772 finished Sun Jul 10 11:56:28 2022
%------------------------------------------------------------------------------