TSTP Solution File: GRP129-4.004 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GRP129-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n007.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 : Sat Jul 16 11:41:46 EDT 2022

% Result   : Unsatisfiable 2.34s 2.58s
% Output   : Refutation 2.34s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08  % Problem  : GRP129-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.05/0.09  % Command  : sos-script %s
% 0.08/0.28  % Computer : n007.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Mon Jun 13 07:01:23 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 0.08/0.30  ----- Otter 3.2, August 2001 -----
% 0.08/0.30  The process was started by sandbox on n007.cluster.edu,
% 0.08/0.30  Mon Jun 13 07:01:23 2022
% 0.08/0.30  The command was "./sos".  The process ID is 17678.
% 0.08/0.30  
% 0.08/0.30  set(prolog_style_variables).
% 0.08/0.30  set(auto).
% 0.08/0.30     dependent: set(auto1).
% 0.08/0.30     dependent: set(process_input).
% 0.08/0.30     dependent: clear(print_kept).
% 0.08/0.30     dependent: clear(print_new_demod).
% 0.08/0.30     dependent: clear(print_back_demod).
% 0.08/0.30     dependent: clear(print_back_sub).
% 0.08/0.30     dependent: set(control_memory).
% 0.08/0.30     dependent: assign(max_mem, 12000).
% 0.08/0.30     dependent: assign(pick_given_ratio, 4).
% 0.08/0.30     dependent: assign(stats_level, 1).
% 0.08/0.30     dependent: assign(pick_semantic_ratio, 3).
% 0.08/0.30     dependent: assign(sos_limit, 5000).
% 0.08/0.30     dependent: assign(max_weight, 60).
% 0.08/0.30  clear(print_given).
% 0.08/0.30  
% 0.08/0.30  list(usable).
% 0.08/0.30  
% 0.08/0.30  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.08/0.30  
% 0.08/0.30  This ia a non-Horn set with equality.  The strategy will be
% 0.08/0.30  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.08/0.30  unit deletion, with positive clauses in sos and nonpositive
% 0.08/0.30  clauses in usable.
% 0.08/0.30  
% 0.08/0.30     dependent: set(knuth_bendix).
% 0.08/0.30     dependent: set(para_from).
% 0.08/0.30     dependent: set(para_into).
% 0.08/0.30     dependent: clear(para_from_right).
% 0.08/0.30     dependent: clear(para_into_right).
% 0.08/0.30     dependent: set(para_from_vars).
% 0.08/0.30     dependent: set(eq_units_both_ways).
% 0.08/0.30     dependent: set(dynamic_demod_all).
% 0.08/0.30     dependent: set(dynamic_demod).
% 0.08/0.30     dependent: set(order_eq).
% 0.08/0.30     dependent: set(back_demod).
% 0.08/0.30     dependent: set(lrpo).
% 0.08/0.30     dependent: set(hyper_res).
% 0.08/0.30     dependent: set(unit_deletion).
% 0.08/0.30     dependent: set(factor).
% 0.08/0.30  
% 0.08/0.30  ------------> process usable:
% 0.08/0.30    Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.08/0.30    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.08/0.30    Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.08/0.30    Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.08/0.30    Following clause subsumed by 14 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.08/0.30    Following clause subsumed by 16 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.08/0.30  
% 0.08/0.30  ------------> process sos:
% 0.08/0.30  
% 0.08/0.30  ======= end of input processing =======
% 0.13/0.34  
% 0.13/0.34  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.34  
% 0.13/0.34  Stopped by limit on number of solutions
% 0.13/0.34  
% 0.13/0.34  
% 0.13/0.34  -------------- Softie stats --------------
% 0.13/0.34  
% 0.13/0.34  UPDATE_STOP: 300
% 0.13/0.34  SFINDER_TIME_LIMIT: 2
% 0.13/0.34  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.34  number of clauses in intial UL: 22
% 0.13/0.34  number of clauses initially in problem: 26
% 0.13/0.34  percentage of clauses intially in UL: 84
% 0.13/0.34  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.34  percent of all initial clauses that are short: 100
% 0.13/0.34  absolute distinct symbol count: 7
% 0.13/0.34     distinct predicate count: 3
% 0.13/0.34     distinct function count: 0
% 0.13/0.34     distinct constant count: 4
% 0.13/0.34  
% 0.13/0.34  ---------- no more Softie stats ----------
% 0.13/0.34  
% 0.13/0.34  
% 0.13/0.34  
% 0.13/0.34  =========== start of search ===========
% 2.34/2.58  
% 2.34/2.58  -------- PROOF -------- 
% 2.34/2.58  % SZS status Unsatisfiable
% 2.34/2.58  % SZS output start Refutation
% 2.34/2.58  
% 2.34/2.58  Model 2 (0.00 seconds, 0 Inserts)
% 2.34/2.58  
% 2.34/2.58  Stopped by limit on number of solutions
% 2.34/2.58  
% 2.34/2.58  Model 3 [ 1 3 8412 ] (0.00 seconds, 36529 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 4 [ 2 4 16656 ] (0.00 seconds, 37199 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 5 [ 2 1 3288 ] (0.00 seconds, 9160 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 6 [ 3 4 17377 ] (0.00 seconds, 91996 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 7 [ 3 1 1036 ] (0.00 seconds, 9763 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 8 [ 3 5 44327 ] (0.00 seconds, 79045 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 9 [ 6 2 8236 ] (0.00 seconds, 51433 Inserts)
% 2.34/2.58  
% 2.34/2.58  Model 10 [ 10 1 762 ] (0.00 seconds, 15600 Inserts)
% 2.34/2.58  
% 2.34/2.58  ----> UNIT CONFLICT at   2.24 sec ----> 1730 [binary,1728.1,14.1] {+} $F.
% 2.34/2.58  
% 2.34/2.58  Length of proof is 49.  Level of proof is 19.
% 2.34/2.58  
% 2.34/2.58  ---------------- PROOF ----------------
% 2.34/2.58  % SZS status Unsatisfiable
% 2.34/2.58  % SZS output start Refutation
% 2.34/2.58  
% 2.34/2.58  1 [] {+} -group_element(A)| -group_element(B)|product(e_1,A,B)|product(e_2,A,B)|product(e_3,A,B)|product(e_4,A,B).
% 2.34/2.58  2 [] {+} -group_element(A)| -group_element(B)|product(A,e_1,B)|product(A,e_2,B)|product(A,e_3,B)|product(A,e_4,B).
% 2.34/2.58  3 [] {+} product(A,B,C)| -product(C,A,D)| -product(B,C,D).
% 2.34/2.58  4 [] {+} product(A,B,C)| -product(B,D,C)| -product(D,A,B).
% 2.34/2.58  5 [] {-} -equalish(e_1,e_2).
% 2.34/2.58  6 [copy,5,flip.1] {+} -equalish(e_2,e_1).
% 2.34/2.58  7 [] {-} -equalish(e_1,e_3).
% 2.34/2.58  8 [copy,7,flip.1] {+} -equalish(e_3,e_1).
% 2.34/2.58  9 [] {-} -equalish(e_1,e_4).
% 2.34/2.58  10 [copy,9,flip.1] {+} -equalish(e_4,e_1).
% 2.34/2.58  11 [] {-} -equalish(e_2,e_3).
% 2.34/2.58  12 [copy,11,flip.1] {+} -equalish(e_3,e_2).
% 2.34/2.58  13 [] {-} -equalish(e_2,e_4).
% 2.34/2.58  14 [copy,13,flip.1] {+} -equalish(e_4,e_2).
% 2.34/2.58  15 [] {-} -equalish(e_3,e_4).
% 2.34/2.58  16 [copy,15,flip.1] {+} -equalish(e_4,e_3).
% 2.34/2.58  17 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3)|product(A,B,e_4).
% 2.34/2.58  18 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 2.34/2.58  19 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 2.34/2.58  20 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 2.34/2.58  21 [] {+} -product(A,B,C)| -product(B,C,D)|product(C,A,D).
% 2.34/2.58  24 [factor,3.2.3] {+} product(A,A,A)| -product(A,A,B).
% 2.34/2.58  25 [factor,17.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2)|product(A,A,e_3)|product(A,A,e_4).
% 2.34/2.58  29 [] {+} group_element(e_1).
% 2.34/2.58  30 [] {+} group_element(e_2).
% 2.34/2.58  33 [hyper,29,25] {-} product(e_1,e_1,e_1)|product(e_1,e_1,e_2)|product(e_1,e_1,e_3)|product(e_1,e_1,e_4).
% 2.34/2.58  39 [hyper,30,25] {-} product(e_2,e_2,e_1)|product(e_2,e_2,e_2)|product(e_2,e_2,e_3)|product(e_2,e_2,e_4).
% 2.34/2.58  42 [hyper,30,17,29] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 2.34/2.58  43 [hyper,30,17,29] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 2.34/2.58  44 [hyper,30,2,29] {-} product(e_1,e_1,e_2)|product(e_1,e_2,e_2)|product(e_1,e_3,e_2)|product(e_1,e_4,e_2).
% 2.34/2.58  47 [hyper,30,1,29] {-} product(e_1,e_2,e_1)|product(e_2,e_2,e_1)|product(e_3,e_2,e_1)|product(e_4,e_2,e_1).
% 2.34/2.58  107 [hyper,33,24,factor_simp] {-} product(e_1,e_1,e_1)|product(e_1,e_1,e_3)|product(e_1,e_1,e_4).
% 2.34/2.58  117 [hyper,107,24,factor_simp] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_4).
% 2.34/2.58  124 [hyper,117,24,factor_simp] {+} product(e_1,e_1,e_1).
% 2.34/2.58  158 [hyper,39,24,factor_simp] {-} product(e_2,e_2,e_2)|product(e_2,e_2,e_3)|product(e_2,e_2,e_4).
% 2.34/2.58  169 [hyper,158,24,factor_simp] {+} product(e_2,e_2,e_2)|product(e_2,e_2,e_4).
% 2.34/2.58  176 [hyper,169,24,factor_simp] {+} product(e_2,e_2,e_2).
% 2.34/2.58  178 [hyper,42,19,124,unit_del,6] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 2.34/2.58  195 [hyper,178,20,176,unit_del,6] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 2.34/2.58  234 [hyper,43,20,124,unit_del,6] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 2.34/2.58  255 [hyper,234,19,176,unit_del,6] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 2.34/2.58  263 [hyper,255,3,195] {-} product(e_2,e_1,e_4)|product(e_2,e_2,e_1)|product(e_1,e_2,e_4).
% 2.34/2.58  266 [hyper,255,3,195] {-} product(e_2,e_1,e_3)|product(e_2,e_2,e_1)|product(e_1,e_2,e_3).
% 2.34/2.58  294 [hyper,44,18,124,unit_del,6] {-} product(e_1,e_2,e_2)|product(e_1,e_3,e_2)|product(e_1,e_4,e_2).
% 2.34/2.58  335 [hyper,263,18,176,unit_del,6] {-} product(e_2,e_1,e_4)|product(e_1,e_2,e_4).
% 2.34/2.58  383 [hyper,266,18,176,unit_del,6] {-} product(e_2,e_1,e_3)|product(e_1,e_2,e_3).
% 2.34/2.58  436 [hyper,294,20,176,unit_del,6] {-} product(e_1,e_3,e_2)|product(e_1,e_4,e_2).
% 2.34/2.58  455 [hyper,47,19,124,unit_del,6] {-} product(e_2,e_2,e_1)|product(e_3,e_2,e_1)|product(e_4,e_2,e_1).
% 2.34/2.58  474 [hyper,436,21,383] {-} product(e_1,e_4,e_2)|product(e_3,e_2,e_2)|product(e_1,e_2,e_3).
% 2.34/2.58  836 [hyper,455,18,176,unit_del,6] {-} product(e_3,e_2,e_1)|product(e_4,e_2,e_1).
% 2.34/2.58  1037 [hyper,474,20,176,unit_del,12] {-} product(e_1,e_4,e_2)|product(e_1,e_2,e_3).
% 2.34/2.58  1050 [hyper,1037,4,383,factor_simp] {-} product(e_1,e_2,e_3)|product(e_4,e_2,e_3).
% 2.34/2.58  1060 [hyper,1037,18,335,unit_del,16] {-} product(e_1,e_4,e_2)|product(e_2,e_1,e_4).
% 2.34/2.58  1092 [hyper,1050,18,335,unit_del,16] {-} product(e_4,e_2,e_3)|product(e_2,e_1,e_4).
% 2.34/2.58  1102 [hyper,1050,18,836,unit_del,8] {-} product(e_1,e_2,e_3)|product(e_3,e_2,e_1).
% 2.34/2.58  1202 [hyper,1060,4,436,factor_simp] {-} product(e_1,e_4,e_2)|product(e_3,e_2,e_4).
% 2.34/2.58  1230 [hyper,1092,18,836,unit_del,8] {-} product(e_2,e_1,e_4)|product(e_3,e_2,e_1).
% 2.34/2.58  1318 [hyper,1102,4,383,factor_simp] {-} product(e_1,e_2,e_3)|product(e_1,e_3,e_1).
% 2.34/2.58  1359 [hyper,1202,18,836,unit_del,10] {-} product(e_1,e_4,e_2)|product(e_4,e_2,e_1).
% 2.34/2.58  1410 [hyper,1230,4,836,factor_simp] {-} product(e_3,e_2,e_1)|product(e_1,e_4,e_1).
% 2.34/2.58  1554 [hyper,1318,19,124,unit_del,8] {-} product(e_1,e_2,e_3).
% 2.34/2.58  1559 [hyper,1554,20,1092,unit_del,10] {-} product(e_2,e_1,e_4).
% 2.34/2.58  1665 [hyper,1410,19,124,unit_del,10] {-} product(e_3,e_2,e_1).
% 2.34/2.58  1689 [hyper,1665,20,1359,unit_del,16] {-} product(e_1,e_4,e_2).
% 2.34/2.58  1712 [hyper,1689,21,1559] {+} product(e_4,e_2,e_2).
% 2.34/2.58  1728 [hyper,1712,20,176,flip.1] {-} equalish(e_4,e_2).
% 2.34/2.58  1730 [binary,1728.1,14.1] {+} $F.
% 2.34/2.58  
% 2.34/2.58  % SZS output end Refutation
% 2.34/2.58  ------------ end of proof -------------
% 2.34/2.58  
% 2.34/2.58  
% 2.34/2.58  Search stopped by max_proofs option.
% 2.34/2.58  
% 2.34/2.58  
% 2.34/2.58  Search stopped by max_proofs option.
% 2.34/2.58  
% 2.34/2.58  ============ end of search ============
% 2.34/2.58  
% 2.34/2.58  ----------- soft-scott stats ----------
% 2.34/2.58  
% 2.34/2.58  true clauses given          12      (12.6%)
% 2.34/2.58  false clauses given         83
% 2.34/2.58  
% 2.34/2.58        FALSE     TRUE
% 2.34/2.58     4  1         0
% 2.34/2.58     8  13        0
% 2.34/2.58    10  0         5
% 2.34/2.58    12  36        52
% 2.34/2.58    14  8         48
% 2.34/2.58    16  44        24
% 2.34/2.58    18  4         17
% 2.34/2.58    20  44        36
% 2.34/2.58    24  9         46
% 2.34/2.58    28  5         0
% 2.34/2.58  tot:  164       228      (58.2% true)
% 2.34/2.58  
% 2.34/2.58  
% 2.34/2.58  Model 10 [ 10 1 762 ] (0.00 seconds, 15600 Inserts)
% 2.34/2.58  
% 2.34/2.58  That finishes the proof of the theorem.
% 2.34/2.58  
% 2.34/2.58  Process 17678 finished Mon Jun 13 07:01:26 2022
%------------------------------------------------------------------------------