TSTP Solution File: SET002-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n005.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:13:56 EDT 2022

% Result   : Unsatisfiable 1.50s 1.70s
% Output   : Refutation 1.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n005.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 10:04:22 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 n005.cluster.edu,
% 0.12/0.36  Mon Jul 11 10:04:22 2022
% 0.12/0.36  The command was "./sos".  The process ID is 12514.
% 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  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  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.12/0.40  
% 0.12/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40  
% 0.12/0.40  Stopped by limit on number of solutions
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  -------------- Softie stats --------------
% 0.12/0.40  
% 0.12/0.40  UPDATE_STOP: 300
% 0.12/0.40  SFINDER_TIME_LIMIT: 2
% 0.12/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40  number of clauses in intial UL: 15
% 0.12/0.40  number of clauses initially in problem: 22
% 0.12/0.40  percentage of clauses intially in UL: 68
% 0.12/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40  percent of all initial clauses that are short: 100
% 0.12/0.40  absolute distinct symbol count: 8
% 0.12/0.40     distinct predicate count: 4
% 0.12/0.40     distinct function count: 2
% 0.12/0.40     distinct constant count: 2
% 0.12/0.40  
% 0.12/0.40  ---------- no more Softie stats ----------
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40  
% 0.12/0.40  Stopped by limit on number of solutions
% 0.12/0.40  
% 0.12/0.40  =========== start of search ===========
% 1.50/1.70  
% 1.50/1.70  -------- PROOF -------- 
% 1.50/1.70  % SZS status Unsatisfiable
% 1.50/1.70  % SZS output start Refutation
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 3 [ 1 1 327 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 4 [ 1 1 106 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 5 [ 1 1 308 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 6 [ 3 0 98 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 7 [ 1 1 524 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 8 [ 2 1 955 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 9 [ 2 0 192 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 10 [ 8 1 102 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 11 [ 2 0 700 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 12 [ 9 1 98 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 13 [ 10 1 154 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 14 [ 10 5 193285 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 15 [ 6 0 104 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 16 [ 18 0 118 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 17 [ 11 1 300 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  Stopped by limit on insertions
% 1.50/1.70  
% 1.50/1.70  Model 18 [ 9 0 98 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  ----> UNIT CONFLICT at   1.32 sec ----> 535 [binary,533.1,11.1] {+} $F.
% 1.50/1.70  
% 1.50/1.70  Length of proof is 16.  Level of proof is 10.
% 1.50/1.70  
% 1.50/1.70  ---------------- PROOF ----------------
% 1.50/1.70  % SZS status Unsatisfiable
% 1.50/1.70  % SZS output start Refutation
% 1.50/1.70  
% 1.50/1.70  2 [] {+} -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 1.50/1.70  5 [] {+} -subset(A,B)| -subset(B,A)|equal_sets(B,A).
% 1.50/1.70  6 [] {+} -union(A,B,C)| -member(D,C)|member(D,A)|member(D,B).
% 1.50/1.70  8 [] {+} -union(A,B,C)| -member(D,B)|member(D,C).
% 1.50/1.70  9 [] {+} -member(g(A,B,C),A)| -member(g(A,B,C),C)|union(A,B,C).
% 1.50/1.70  11 [] {+} -equal_sets(aUa,a).
% 1.50/1.70  13 [factor,6.3.4] {+} -union(A,A,B)| -member(C,B)|member(C,A).
% 1.50/1.70  14 [factor,9.1.2] {+} -member(g(A,B,A),A)|union(A,B,A).
% 1.50/1.70  16 [] {+} subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 1.50/1.70  17 [] {-} union(A,B,C)|member(g(A,B,C),A)|member(g(A,B,C),B)|member(g(A,B,C),C).
% 1.50/1.70  18 [] {+} union(a,a,aUa).
% 1.50/1.70  24 [hyper,16,5,16] {-} member(member_of_1_not_of_2(A,B),A)|equal_sets(A,B)|member(member_of_1_not_of_2(B,A),B).
% 1.50/1.70  39 [hyper,17,8,18] {-} union(A,a,B)|member(g(A,a,B),A)|member(g(A,a,B),B)|member(g(A,a,B),aUa).
% 1.50/1.70  56 [factor,39.2.3] {+} union(A,a,A)|member(g(A,a,A),A)|member(g(A,a,A),aUa).
% 1.50/1.70  75 [factor,56.2.3] {-} union(aUa,a,aUa)|member(g(aUa,a,aUa),aUa).
% 1.50/1.70  117 [hyper,24,13,18] {-} equal_sets(aUa,A)|member(member_of_1_not_of_2(A,aUa),A)|member(member_of_1_not_of_2(aUa,A),a).
% 1.50/1.70  164 [hyper,117,2,unit_del,11] {-} member(member_of_1_not_of_2(a,aUa),a)|subset(aUa,a).
% 1.50/1.70  203 [hyper,75,14,factor_simp] {+} union(aUa,a,aUa).
% 1.50/1.70  218 [hyper,164,5,16,unit_del,11,factor_simp] {+} member(member_of_1_not_of_2(a,aUa),a).
% 1.50/1.70  219 [hyper,218,8,203] {+} member(member_of_1_not_of_2(a,aUa),aUa).
% 1.50/1.70  229 [hyper,219,2] {+} subset(a,aUa).
% 1.50/1.70  332 [hyper,229,5,16,unit_del,11] {+} member(member_of_1_not_of_2(aUa,a),aUa).
% 1.50/1.70  404 [hyper,332,13,18] {+} member(member_of_1_not_of_2(aUa,a),a).
% 1.50/1.70  415 [hyper,404,2] {+} subset(aUa,a).
% 1.50/1.70  533 [hyper,415,5,229] {-} equal_sets(aUa,a).
% 1.50/1.70  535 [binary,533.1,11.1] {+} $F.
% 1.50/1.70  
% 1.50/1.70  % SZS output end Refutation
% 1.50/1.70  ------------ end of proof -------------
% 1.50/1.70  
% 1.50/1.70  
% 1.50/1.70  Search stopped by max_proofs option.
% 1.50/1.70  
% 1.50/1.70  
% 1.50/1.70  Search stopped by max_proofs option.
% 1.50/1.70  
% 1.50/1.70  ============ end of search ============
% 1.50/1.70  
% 1.50/1.70  ----------- soft-scott stats ----------
% 1.50/1.70  
% 1.50/1.70  true clauses given           7      (16.3%)
% 1.50/1.70  false clauses given         36
% 1.50/1.70  
% 1.50/1.70        FALSE     TRUE
% 1.50/1.70     9  0         1
% 1.50/1.70    10  4         17
% 1.50/1.70    11  3         9
% 1.50/1.70    13  5         7
% 1.50/1.70    14  0         28
% 1.50/1.70    15  9         26
% 1.50/1.70    16  3         33
% 1.50/1.70    18  4         0
% 1.50/1.70    19  6         7
% 1.50/1.70    20  0         31
% 1.50/1.70    21  16        39
% 1.50/1.70    22  5         19
% 1.50/1.70    23  6         1
% 1.50/1.70    24  2         0
% 1.50/1.70    25  4         5
% 1.50/1.70    26  6         30
% 1.50/1.70    27  13        7
% 1.50/1.70    28  4         6
% 1.50/1.70    29  1         3
% 1.50/1.70    30  3         2
% 1.50/1.70    31  6         3
% 1.50/1.70    32  9         21
% 1.50/1.70    35  2         5
% 1.50/1.70    36  3         0
% 1.50/1.70    37  1         2
% 1.50/1.70    38  6         3
% 1.50/1.70    41  1         3
% 1.50/1.70    43  3         0
% 1.50/1.70  tot:  125       308      (71.1% true)
% 1.50/1.70  
% 1.50/1.70  
% 1.50/1.70  Model 18 [ 9 0 98 ] (0.00 seconds, 250000 Inserts)
% 1.50/1.70  
% 1.50/1.70  That finishes the proof of the theorem.
% 1.50/1.70  
% 1.50/1.70  Process 12514 finished Mon Jul 11 10:04:23 2022
%------------------------------------------------------------------------------