TSTP Solution File: GRP124-3.004 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GRP124-3.004 : TPTP v8.1.0. Released v1.2.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 : Sat Jul 16 11:41:31 EDT 2022

% Result   : Unsatisfiable 39.41s 39.61s
% Output   : Refutation 39.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : GRP124-3.004 : TPTP v8.1.0. Released v1.2.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 13 09:46:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n014.cluster.edu,
% 0.12/0.35  Mon Jun 13 09:46:07 2022
% 0.12/0.35  The command was "./sos".  The process ID is 6881.
% 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  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 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    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.35    Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.12/0.35    Following clause subsumed by 14 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.12/0.35    Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.12/0.35    Following clause subsumed by 16 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.12/0.35    Following clause subsumed by 18 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.18/0.56  
% 0.18/0.56  Stopped by limit on insertions
% 0.18/0.56  
% 0.18/0.56  
% 0.18/0.56  Failed to model usable list: disabling FINDER
% 0.18/0.56  
% 0.18/0.56  
% 0.18/0.56  
% 0.18/0.56  -------------- Softie stats --------------
% 0.18/0.56  
% 0.18/0.56  UPDATE_STOP: 300
% 0.18/0.56  SFINDER_TIME_LIMIT: 2
% 0.18/0.56  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.56  number of clauses in intial UL: 42
% 0.18/0.56  number of clauses initially in problem: 62
% 0.18/0.56  percentage of clauses intially in UL: 67
% 0.18/0.56  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.56  percent of all initial clauses that are short: 100
% 0.18/0.56  absolute distinct symbol count: 11
% 0.18/0.56     distinct predicate count: 6
% 0.18/0.56     distinct function count: 0
% 0.18/0.56     distinct constant count: 5
% 0.18/0.56  
% 0.18/0.56  ---------- no more Softie stats ----------
% 0.18/0.56  
% 0.18/0.56  
% 0.18/0.56  
% 0.18/0.56  =========== start of search ===========
% 9.20/9.38  
% 9.20/9.38  
% 9.20/9.38  Changing weight limit from 60 to 32.
% 9.20/9.38  
% 9.20/9.38  Resetting weight limit to 32 after 80 givens.
% 9.20/9.38  
% 11.25/11.45  
% 11.25/11.45  
% 11.25/11.45  Changing weight limit from 32 to 27.
% 11.25/11.45  
% 11.25/11.45  Resetting weight limit to 27 after 85 givens.
% 11.25/11.45  
% 13.74/13.95  
% 13.74/13.95  
% 13.74/13.95  Changing weight limit from 27 to 23.
% 13.74/13.95  
% 13.74/13.95  Resetting weight limit to 23 after 90 givens.
% 13.74/13.95  
% 16.71/16.89  
% 16.71/16.89  
% 16.71/16.89  Changing weight limit from 23 to 21.
% 16.71/16.89  
% 16.71/16.89  Resetting weight limit to 21 after 100 givens.
% 16.71/16.89  
% 19.11/19.31  
% 19.11/19.31  
% 19.11/19.31  Changing weight limit from 21 to 20.
% 19.11/19.31  
% 19.11/19.31  Resetting weight limit to 20 after 130 givens.
% 19.11/19.31  
% 19.32/19.52  
% 19.32/19.52  
% 19.32/19.52  Changing weight limit from 20 to 19.
% 19.32/19.52  
% 19.32/19.52  Resetting weight limit to 19 after 135 givens.
% 19.32/19.52  
% 22.94/23.18  
% 22.94/23.18  
% 22.94/23.18  Changing weight limit from 19 to 18.
% 22.94/23.18  
% 22.94/23.18  Resetting weight limit to 18 after 185 givens.
% 22.94/23.18  
% 33.91/34.13  
% 33.91/34.13  
% 33.91/34.13  Changing weight limit from 18 to 17.
% 33.91/34.13  
% 33.91/34.13  Modelling stopped after 300 given clauses and 0.00 seconds
% 33.91/34.13  
% 33.91/34.13  
% 33.91/34.13  Resetting weight limit to 17 after 785 givens.
% 33.91/34.13  
% 39.41/39.61  
% 39.41/39.61  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 39.41/39.61  
% 39.41/39.61  ----> UNIT CONFLICT at  39.21 sec ----> 13841 [binary,13839.1,18.1] {-} $F.
% 39.41/39.61  
% 39.41/39.61  Length of proof is 28.  Level of proof is 13.
% 39.41/39.61  
% 39.41/39.61  ---------------- PROOF ----------------
% 39.41/39.61  % SZS status Unsatisfiable
% 39.41/39.61  % SZS output start Refutation
% 39.41/39.61  
% 39.41/39.61  2 [] {+} -group_element(A)|cycle(A,e_0)|cycle(A,e_1)|cycle(A,e_2)|cycle(A,e_3).
% 39.41/39.61  5 [] {+} -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 39.41/39.61  6 [] {+} -cycle(A,B)| -product(A,e_1,C)| -greater(B,e_0)| -next(A,D)|equalish(C,D).
% 39.41/39.61  7 [] {-} -equalish(e_1,e_2).
% 39.41/39.61  8 [copy,7,flip.1] {+} -equalish(e_2,e_1).
% 39.41/39.61  9 [] {-} -equalish(e_1,e_3).
% 39.41/39.61  10 [copy,9,flip.1] {+} -equalish(e_3,e_1).
% 39.41/39.61  13 [] {-} -equalish(e_2,e_3).
% 39.41/39.61  14 [copy,13,flip.1] {+} -equalish(e_3,e_2).
% 39.41/39.61  17 [] {-} -equalish(e_3,e_4).
% 39.41/39.61  18 [copy,17,flip.1] {+} -equalish(e_4,e_3).
% 39.41/39.61  19 [] {+} -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).
% 39.41/39.61  21 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 39.41/39.61  22 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 39.41/39.61  24 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(B,E).
% 39.41/39.61  43 [factor,24.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(B,C).
% 39.41/39.61  51 [] {-} next(e_2,e_3).
% 39.41/39.61  53 [] {-} greater(e_1,e_0).
% 39.41/39.61  54 [] {-} greater(e_2,e_0).
% 39.41/39.61  55 [] {-} greater(e_3,e_0).
% 39.41/39.61  61 [] {-} greater(e_4,e_2).
% 39.41/39.61  64 [] {-} group_element(e_1).
% 39.41/39.61  65 [] {-} group_element(e_2).
% 39.41/39.61  66 [] {-} group_element(e_3).
% 39.41/39.61  68 [] {-} product(A,A,A).
% 39.41/39.61  124 [hyper,65,19,64] {-} 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).
% 39.41/39.61  125 [hyper,65,19,64] {-} 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).
% 39.41/39.61  126 [hyper,65,2] {-} cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2)|cycle(e_2,e_3).
% 39.41/39.61  145 [hyper,66,19,65] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_2)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 39.41/39.61  146 [hyper,66,19,64] {-} product(e_1,e_3,e_1)|product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 39.41/39.61  10500 [hyper,124,21,68,unit_del,8] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 39.41/39.61  10554 [hyper,125,22,68,unit_del,8] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 39.41/39.61  10726 [hyper,145,21,68,unit_del,14] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 39.41/39.61  10738 [hyper,146,21,68,unit_del,10] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 39.41/39.61  12756 [hyper,10500,22,68,unit_del,8] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 39.41/39.61  12867 [hyper,10554,21,68,unit_del,8] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 39.41/39.61  13015 [hyper,10726,22,68,unit_del,14] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_4).
% 39.41/39.61  13041 [hyper,13015,43,68,12756,unit_del,10] {-} product(e_2,e_3,e_4)|product(e_1,e_2,e_4).
% 39.41/39.61  13141 [hyper,13041,21,12867,unit_del,10] {-} product(e_1,e_2,e_4)|product(e_2,e_1,e_3).
% 39.41/39.61  13387 [hyper,10738,22,68,unit_del,10] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_4).
% 39.41/39.61  13458 [hyper,13387,43,68,13141,unit_del,14] {-} product(e_1,e_3,e_4)|product(e_1,e_2,e_4).
% 39.41/39.61  13585 [hyper,13458,22,13041,unit_del,8,factor_simp] {-} product(e_1,e_2,e_4).
% 39.41/39.61  13592 [hyper,13585,21,13387,unit_del,14] {-} product(e_1,e_3,e_2).
% 39.41/39.61  13664 [hyper,13592,43,68,12867,unit_del,14] {-} product(e_2,e_1,e_4).
% 39.41/39.61  13764 [hyper,13664,6,126,55,51,unit_del,18] {-} cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2).
% 39.41/39.61  13816 [hyper,13764,5,13664,61] {-} cycle(e_2,e_1)|cycle(e_2,e_2).
% 39.41/39.61  13829 [hyper,13816,6,13664,53,51,unit_del,18] {-} cycle(e_2,e_2).
% 39.41/39.61  13839 [hyper,13829,6,13664,54,51] {-} equalish(e_4,e_3).
% 39.41/39.61  13841 [binary,13839.1,18.1] {-} $F.
% 39.41/39.61  
% 39.41/39.61  % SZS output end Refutation
% 39.41/39.61  ------------ end of proof -------------
% 39.41/39.61  
% 39.41/39.61  
% 39.41/39.61  Search stopped by max_proofs option.
% 39.41/39.61  
% 39.41/39.61  
% 39.41/39.61  Search stopped by max_proofs option.
% 39.41/39.61  
% 39.41/39.61  ============ end of search ============
% 39.41/39.61  
% 39.41/39.61  That finishes the proof of the theorem.
% 39.41/39.61  
% 39.41/39.61  Process 6881 finished Mon Jun 13 09:46:46 2022
%------------------------------------------------------------------------------