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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET954+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:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jul  9 17:35:43 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox2 on n012.cluster.edu,
% 0.13/0.35  Sat Jul  9 17:35:44 2022
% 0.13/0.35  The command was "./sos".  The process ID is 21207.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  formula_list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This is a Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35  sos and nonpositive clauses in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(knuth_bendix).
% 0.13/0.35     dependent: set(para_from).
% 0.13/0.35     dependent: set(para_into).
% 0.13/0.35     dependent: clear(para_from_right).
% 0.13/0.35     dependent: clear(para_into_right).
% 0.13/0.35     dependent: set(para_from_vars).
% 0.13/0.35     dependent: set(eq_units_both_ways).
% 0.13/0.35     dependent: set(dynamic_demod_all).
% 0.13/0.35     dependent: set(dynamic_demod).
% 0.13/0.35     dependent: set(order_eq).
% 0.13/0.35     dependent: set(back_demod).
% 0.13/0.35     dependent: set(lrpo).
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: clear(order_hyper).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35    Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.13/0.35    Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.19/0.38  
% 0.19/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38  
% 0.19/0.38  Stopped by limit on number of solutions
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  -------------- Softie stats --------------
% 0.19/0.38  
% 0.19/0.38  UPDATE_STOP: 300
% 0.19/0.38  SFINDER_TIME_LIMIT: 2
% 0.19/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38  number of clauses in intial UL: 7
% 0.19/0.38  number of clauses initially in problem: 13
% 0.19/0.38  percentage of clauses intially in UL: 53
% 0.19/0.38  percentage of distinct symbols occuring in initial UL: 69
% 0.19/0.38  percent of all initial clauses that are short: 100
% 0.19/0.38  absolute distinct symbol count: 13
% 0.19/0.38     distinct predicate count: 3
% 0.19/0.38     distinct function count: 4
% 0.19/0.38     distinct constant count: 6
% 0.19/0.38  
% 0.19/0.38  ---------- no more Softie stats ----------
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  =========== start of search ===========
% 0.19/0.48  
% 0.19/0.48  -------- PROOF -------- 
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  % SZS output start Refutation
% 0.19/0.48  
% 0.19/0.48  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.48  
% 0.19/0.48  Stopped by limit on number of solutions
% 0.19/0.48  
% 0.19/0.48  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.48  
% 0.19/0.48  Stopped by limit on number of solutions
% 0.19/0.48  
% 0.19/0.48  Stopped by limit on insertions
% 0.19/0.48  
% 0.19/0.48  Model 4 [ 1 1 798 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.48  
% 0.19/0.48  ----> UNIT CONFLICT at   0.10 sec ----> 23 [binary,22.1,7.1] {-} $F.
% 0.19/0.48  
% 0.19/0.48  Length of proof is 3.  Level of proof is 2.
% 0.19/0.48  
% 0.19/0.48  ---------------- PROOF ----------------
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  % SZS output start Refutation
% 0.19/0.48  
% 0.19/0.48  3 [] {+} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 0.19/0.48  4 [] {+} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 0.19/0.48  5 [] {+} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 0.19/0.48  7 [] {+} -in(ordered_pair($c5,$c6),cartesian_product2($c3,$c4)).
% 0.19/0.48  13 [] {-} in(ordered_pair($c6,$c5),cartesian_product2($c4,$c3)).
% 0.19/0.48  16 [hyper,13,4] {+} in($c5,$c3).
% 0.19/0.48  17 [hyper,13,3] {+} in($c6,$c4).
% 0.19/0.48  22 [hyper,17,5,16] {-} in(ordered_pair($c5,$c6),cartesian_product2($c3,$c4)).
% 0.19/0.48  23 [binary,22.1,7.1] {-} $F.
% 0.19/0.48  
% 0.19/0.48  % SZS output end Refutation
% 0.19/0.48  ------------ end of proof -------------
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Search stopped by max_proofs option.
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Search stopped by max_proofs option.
% 0.19/0.48  
% 0.19/0.48  ============ end of search ============
% 0.19/0.48  
% 0.19/0.48  ----------- soft-scott stats ----------
% 0.19/0.48  
% 0.19/0.48  true clauses given           1      (20.0%)
% 0.19/0.48  false clauses given          4
% 0.19/0.48  
% 0.19/0.48        FALSE     TRUE
% 0.19/0.48     3  0         1
% 0.19/0.48     7  1         0
% 0.19/0.48    10  1         0
% 0.19/0.48    11  2         0
% 0.19/0.48    15  1         0
% 0.19/0.48  tot:  5         1      (16.7% true)
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Model 4 [ 1 1 798 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.48  
% 0.19/0.48  That finishes the proof of the theorem.
% 0.19/0.48  
% 0.19/0.48  Process 21207 finished Sat Jul  9 17:35:44 2022
%------------------------------------------------------------------------------