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

View Problem - Process Solution

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

% Computer : n017.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:42 EDT 2022

% Result   : Theorem 0.46s 0.65s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SET907+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14  % Command  : sos-script %s
% 0.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jul  9 21:12:02 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.37  ----- Otter 3.2, August 2001 -----
% 0.21/0.37  The process was started by sandbox on n017.cluster.edu,
% 0.21/0.37  Sat Jul  9 21:12:02 2022
% 0.21/0.37  The command was "./sos".  The process ID is 28365.
% 0.21/0.37  
% 0.21/0.37  set(prolog_style_variables).
% 0.21/0.37  set(auto).
% 0.21/0.37     dependent: set(auto1).
% 0.21/0.37     dependent: set(process_input).
% 0.21/0.37     dependent: clear(print_kept).
% 0.21/0.37     dependent: clear(print_new_demod).
% 0.21/0.37     dependent: clear(print_back_demod).
% 0.21/0.37     dependent: clear(print_back_sub).
% 0.21/0.37     dependent: set(control_memory).
% 0.21/0.37     dependent: assign(max_mem, 12000).
% 0.21/0.37     dependent: assign(pick_given_ratio, 4).
% 0.21/0.37     dependent: assign(stats_level, 1).
% 0.21/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37     dependent: assign(sos_limit, 5000).
% 0.21/0.37     dependent: assign(max_weight, 60).
% 0.21/0.37  clear(print_given).
% 0.21/0.37  
% 0.21/0.37  formula_list(usable).
% 0.21/0.37  
% 0.21/0.37  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.21/0.37  
% 0.21/0.37  This is a Horn set with equality.  The strategy will be
% 0.21/0.37  Knuth-Bendix and hyper_res, with positive clauses in
% 0.21/0.37  sos and nonpositive clauses in usable.
% 0.21/0.37  
% 0.21/0.37     dependent: set(knuth_bendix).
% 0.21/0.37     dependent: set(para_from).
% 0.21/0.37     dependent: set(para_into).
% 0.21/0.37     dependent: clear(para_from_right).
% 0.21/0.37     dependent: clear(para_into_right).
% 0.21/0.37     dependent: set(para_from_vars).
% 0.21/0.37     dependent: set(eq_units_both_ways).
% 0.21/0.37     dependent: set(dynamic_demod_all).
% 0.21/0.37     dependent: set(dynamic_demod).
% 0.21/0.37     dependent: set(order_eq).
% 0.21/0.37     dependent: set(back_demod).
% 0.21/0.37     dependent: set(lrpo).
% 0.21/0.37     dependent: set(hyper_res).
% 0.21/0.37     dependent: clear(order_hyper).
% 0.21/0.37  
% 0.21/0.37  ------------> process usable:
% 0.21/0.37  
% 0.21/0.37  ------------> process sos:
% 0.21/0.37    Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.21/0.37    Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.21/0.37    Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.21/0.37  
% 0.21/0.37  ======= end of input processing =======
% 0.21/0.40  
% 0.21/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.40  
% 0.21/0.40  Stopped by limit on number of solutions
% 0.21/0.40  
% 0.21/0.40  
% 0.21/0.40  -------------- Softie stats --------------
% 0.21/0.40  
% 0.21/0.40  UPDATE_STOP: 300
% 0.21/0.40  SFINDER_TIME_LIMIT: 2
% 0.21/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.40  number of clauses in intial UL: 9
% 0.21/0.40  number of clauses initially in problem: 18
% 0.21/0.40  percentage of clauses intially in UL: 50
% 0.21/0.40  percentage of distinct symbols occuring in initial UL: 90
% 0.21/0.40  percent of all initial clauses that are short: 100
% 0.21/0.40  absolute distinct symbol count: 11
% 0.21/0.40     distinct predicate count: 4
% 0.21/0.40     distinct function count: 2
% 0.21/0.40     distinct constant count: 5
% 0.21/0.40  
% 0.21/0.40  ---------- no more Softie stats ----------
% 0.21/0.40  
% 0.21/0.40  
% 0.21/0.40  
% 0.21/0.40  =========== start of search ===========
% 0.46/0.65  
% 0.46/0.65  -------- PROOF -------- 
% 0.46/0.65  % SZS status Theorem
% 0.46/0.65  % SZS output start Refutation
% 0.46/0.65  
% 0.46/0.65  Model 2 [ 1 0 89 ] (0.00 seconds, 13535 Inserts)
% 0.46/0.65  
% 0.46/0.65  Model 3 [ 1 0 191 ] (0.00 seconds, 9418 Inserts)
% 0.46/0.65  
% 0.46/0.65  Model 4 [ 2 1 270 ] (0.00 seconds, 159829 Inserts)
% 0.46/0.65  
% 0.46/0.65  Model 5 [ 2 1 190 ] (0.00 seconds, 196659 Inserts)
% 0.46/0.65  
% 0.46/0.65  Model 6 [ 2 0 195 ] (0.00 seconds, 82921 Inserts)
% 0.46/0.65  
% 0.46/0.65  Model 7 [ 12 0 234 ] (0.00 seconds, 15599 Inserts)
% 0.46/0.65  
% 0.46/0.65  Model 8 [ 13 0 305 ] (0.00 seconds, 81846 Inserts)
% 0.46/0.65  
% 0.46/0.65  ----> UNIT CONFLICT at   0.25 sec ----> 39 [binary,37.1,9.1] {-} $F.
% 0.46/0.65  
% 0.46/0.65  Length of proof is 2.  Level of proof is 2.
% 0.46/0.65  
% 0.46/0.65  ---------------- PROOF ----------------
% 0.46/0.65  % SZS status Theorem
% 0.46/0.65  % SZS output start Refutation
% 0.46/0.65  
% 0.46/0.65  5 [] {+} -subset(A,B)|set_union2(A,B)=B.
% 0.46/0.65  8 [] {+} subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 0.46/0.65  9 [] {+} set_union2(unordered_pair($c5,$c3),$c4)!=$c4.
% 0.46/0.65  16 [] {+} in($c5,$c4).
% 0.46/0.65  17 [] {+} in($c3,$c4).
% 0.46/0.65  24 [hyper,17,8,16] {-} subset(unordered_pair($c5,$c3),$c4).
% 0.46/0.65  37 [hyper,24,5] {-} set_union2(unordered_pair($c5,$c3),$c4)=$c4.
% 0.46/0.65  39 [binary,37.1,9.1] {-} $F.
% 0.46/0.65  
% 0.46/0.65  % SZS output end Refutation
% 0.46/0.65  ------------ end of proof -------------
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Search stopped by max_proofs option.
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Search stopped by max_proofs option.
% 0.46/0.65  
% 0.46/0.65  ============ end of search ============
% 0.46/0.65  
% 0.46/0.65  ----------- soft-scott stats ----------
% 0.46/0.65  
% 0.46/0.65  true clauses given           3      (21.4%)
% 0.46/0.65  false clauses given         11
% 0.46/0.65  
% 0.46/0.65        FALSE     TRUE
% 0.46/0.65     5  1         0
% 0.46/0.65     7  4         3
% 0.46/0.65     8  0         2
% 0.46/0.65  tot:  5         5      (50.0% true)
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Model 8 [ 13 0 305 ] (0.00 seconds, 81846 Inserts)
% 0.46/0.65  
% 0.46/0.65  That finishes the proof of the theorem.
% 0.46/0.65  
% 0.46/0.65  Process 28365 finished Sat Jul  9 21:12:02 2022
%------------------------------------------------------------------------------