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

View Problem - Process Solution

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

% Computer : n012.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:22:05 EDT 2022

% Result   : Theorem 0.79s 0.99s
% Output   : Refutation 0.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n012.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 Jul 11 08:05:58 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n012.cluster.edu,
% 0.12/0.35  Mon Jul 11 08:05:58 2022
% 0.12/0.35  The command was "./sos".  The process ID is 16353.
% 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=3.
% 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 11 during input processing: 0 [copy,11,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.35    Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 9
% 0.19/0.39  number of clauses initially in problem: 16
% 0.19/0.39  percentage of clauses intially in UL: 56
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 78
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 14
% 0.19/0.39     distinct predicate count: 4
% 0.19/0.39     distinct function count: 6
% 0.19/0.39     distinct constant count: 4
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 0.79/0.99  
% 0.79/0.99  -------- PROOF -------- 
% 0.79/0.99  % SZS status Theorem
% 0.79/0.99  % SZS output start Refutation
% 0.79/0.99  
% 0.79/0.99  Model 3 (0.00 seconds, 0 Inserts)
% 0.79/0.99  
% 0.79/0.99  Stopped by limit on number of solutions
% 0.79/0.99  
% 0.79/0.99  Stopped by limit on insertions
% 0.79/0.99  
% 0.79/0.99  Stopped by limit on insertions
% 0.79/0.99  
% 0.79/0.99  Stopped by limit on insertions
% 0.79/0.99  
% 0.79/0.99  ----> UNIT CONFLICT at   0.61 sec ----> 47 [binary,46.1,9.1] {-} $F.
% 0.79/0.99  
% 0.79/0.99  Length of proof is 5.  Level of proof is 4.
% 0.79/0.99  
% 0.79/0.99  ---------------- PROOF ----------------
% 0.79/0.99  % SZS status Theorem
% 0.79/0.99  % SZS output start Refutation
% 0.79/0.99  
% 0.79/0.99  3 [] {+} subset(A,B)| -in($f1(A,B),B).
% 0.79/0.99  6 [] {-} -in(A,$c4)|A=ordered_pair($f3(A),$f2(A)).
% 0.79/0.99  7 [copy,6,flip.2] {+} -in(A,$c4)|ordered_pair($f3(A),$f2(A))=A.
% 0.79/1.00  8 [] {+} -in(ordered_pair(A,B),$c4)|in(ordered_pair(A,B),$c3).
% 0.79/1.00  9 [] {+} -subset($c4,$c3).
% 0.79/1.00  12 [] {-} subset(A,B)|in($f1(A,B),A).
% 0.79/1.00  19 [hyper,12,9] {-} in($f1($c4,$c3),$c4).
% 0.79/1.00  21,20 [hyper,19,7] {+} ordered_pair($f3($f1($c4,$c3)),$f2($f1($c4,$c3)))=$f1($c4,$c3).
% 0.79/1.00  44 [para_from,20.1.1,8.2.1,demod,21,unit_del,19] {-} in($f1($c4,$c3),$c3).
% 0.79/1.00  46 [hyper,44,3] {-} subset($c4,$c3).
% 0.79/1.00  47 [binary,46.1,9.1] {-} $F.
% 0.79/1.00  
% 0.79/1.00  % SZS output end Refutation
% 0.79/1.00  ------------ end of proof -------------
% 0.79/1.00  
% 0.79/1.00  
% 0.79/1.00  Search stopped by max_proofs option.
% 0.79/1.00  
% 0.79/1.00  
% 0.79/1.00  Search stopped by max_proofs option.
% 0.79/1.00  
% 0.79/1.00  ============ end of search ============
% 0.79/1.00  
% 0.79/1.00  ----------- soft-scott stats ----------
% 0.79/1.00  
% 0.79/1.00  true clauses given           3      (25.0%)
% 0.79/1.00  false clauses given          9
% 0.79/1.00  
% 0.79/1.00        FALSE     TRUE
% 0.79/1.00     4  0         1
% 0.79/1.00    10  2         0
% 0.79/1.00    12  1         0
% 0.79/1.00    13  0         2
% 0.79/1.00    14  1         0
% 0.79/1.00    15  4         0
% 0.79/1.00    18  1         0
% 0.79/1.00    19  0         1
% 0.79/1.00  tot:  9         4      (30.8% true)
% 0.79/1.00  
% 0.79/1.00  
% 0.79/1.00  Model 3 (0.00 seconds, 0 Inserts)
% 0.79/1.00  
% 0.79/1.00  That finishes the proof of the theorem.
% 0.79/1.00  
% 0.79/1.00  Process 16353 finished Mon Jul 11 08:05:58 2022
%------------------------------------------------------------------------------