TSTP Solution File: SEU137+2 by SOS---2.0

View Problem - Process Solution

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

% Computer : n014.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:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n014.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 : Mon Jun 20 09:10:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox on n014.cluster.edu,
% 0.12/0.36  Mon Jun 20 09:10:32 2022
% 0.12/0.36  The command was "./sos".  The process ID is 23287.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  formula_list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.36  
% 0.12/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36  clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36    Following clause subsumed by 26 during input processing: 0 [] {-} set_difference(A,B)!=empty_set|subset(A,B).
% 0.12/0.36    Following clause subsumed by 27 during input processing: 0 [] {-} set_difference(A,B)=empty_set| -subset(A,B).
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 64 during input processing: 0 [copy,64,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.12/0.36    Following clause subsumed by 65 during input processing: 0 [copy,65,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.12/0.36    Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] {-} A=A.
% 0.12/0.36  100 back subsumes 61.
% 0.12/0.36  100 back subsumes 59.
% 0.12/0.36  100 back subsumes 47.
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.12/0.39  
% 0.12/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  -------------- Softie stats --------------
% 0.12/0.39  
% 0.12/0.39  UPDATE_STOP: 300
% 0.12/0.39  SFINDER_TIME_LIMIT: 2
% 0.12/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39  number of clauses in intial UL: 52
% 0.12/0.39  number of clauses initially in problem: 99
% 0.12/0.39  percentage of clauses intially in UL: 52
% 0.12/0.39  percentage of distinct symbols occuring in initial UL: 71
% 0.12/0.39  percent of all initial clauses that are short: 100
% 0.12/0.39  absolute distinct symbol count: 21
% 0.12/0.39     distinct predicate count: 5
% 0.12/0.39     distinct function count: 11
% 0.12/0.39     distinct constant count: 5
% 0.12/0.39  
% 0.12/0.39  ---------- no more Softie stats ----------
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  =========== start of search ===========
% 0.18/0.42  
% 0.18/0.42  -------- PROOF -------- 
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  % SZS output start Refutation
% 0.18/0.42  
% 0.18/0.42  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.42  
% 0.18/0.42  Stopped by limit on number of solutions
% 0.18/0.42  
% 0.18/0.42  Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.42  
% 0.18/0.42  Stopped by limit on number of solutions
% 0.18/0.42  
% 0.18/0.42  ----> UNIT CONFLICT at   0.04 sec ----> 169 [binary,167.1,110.1] {+} $F.
% 0.18/0.42  
% 0.18/0.42  Length of proof is 3.  Level of proof is 2.
% 0.18/0.42  
% 0.18/0.42  ---------------- PROOF ----------------
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  % SZS output start Refutation
% 0.18/0.42  
% 0.18/0.42  30 [] {+} -subset(A,B)|set_union2(A,B)=B.
% 0.18/0.42  39 [] {-} $c3!=set_union2($c4,set_difference($c3,$c4)).
% 0.18/0.42  40 [copy,39,flip.1] {-} set_union2($c4,set_difference($c3,$c4))!=$c3.
% 0.18/0.42  88,87 [] {+} set_union2(A,set_difference(B,A))=set_union2(A,B).
% 0.18/0.42  95 [] {-} subset($c4,$c3).
% 0.18/0.42  110 [back_demod,40,demod,88] {-} set_union2($c4,$c3)!=$c3.
% 0.18/0.42  167 [hyper,95,30] {-} set_union2($c4,$c3)=$c3.
% 0.18/0.42  169 [binary,167.1,110.1] {+} $F.
% 0.18/0.42  
% 0.18/0.42  % SZS output end Refutation
% 0.18/0.42  ------------ end of proof -------------
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Search stopped by max_proofs option.
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Search stopped by max_proofs option.
% 0.18/0.42  
% 0.18/0.42  ============ end of search ============
% 0.18/0.42  
% 0.18/0.42  ----------- soft-scott stats ----------
% 0.18/0.42  
% 0.18/0.42  true clauses given           1      (33.3%)
% 0.18/0.42  false clauses given          2
% 0.18/0.42  
% 0.18/0.42        FALSE     TRUE
% 0.18/0.42     2  0         1
% 0.18/0.42     3  0         5
% 0.18/0.42     5  2         15
% 0.18/0.42     6  0         3
% 0.18/0.42     7  3         2
% 0.18/0.42     8  3         9
% 0.18/0.42     9  1         5
% 0.18/0.42    10  1         3
% 0.18/0.42    11  3         6
% 0.18/0.42    12  0         1
% 0.18/0.42    13  1         0
% 0.18/0.42    14  0         1
% 0.18/0.42    15  1         2
% 0.18/0.42    16  0         4
% 0.18/0.42    17  5         1
% 0.18/0.42    21  0         3
% 0.18/0.42    22  0         2
% 0.18/0.42    23  1         1
% 0.18/0.42    25  0         3
% 0.18/0.42    31  0         3
% 0.18/0.42    33  0         2
% 0.18/0.42  tot:  21        72      (77.4% true)
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.42  
% 0.18/0.42  That finishes the proof of the theorem.
% 0.18/0.42  
% 0.18/0.42  Process 23287 finished Mon Jun 20 09:10:33 2022
%------------------------------------------------------------------------------