TSTP Solution File: GRP126-1.004 by SOS---2.0

View Problem - Process Solution

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

% Computer : n011.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:37 EDT 2022

% Result   : Unsatisfiable 0.61s 0.84s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP126-1.004 : TPTP v8.1.0. Released v1.2.0.
% 0.10/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n011.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 07:35:03 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 n011.cluster.edu,
% 0.12/0.35  Mon Jun 13 07:35:03 2022
% 0.12/0.35  The command was "./sos".  The process ID is 8561.
% 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 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.35    Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.12/0.35    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.12/0.35    Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.12/0.35    Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.12/0.35    Following clause subsumed by 12 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.12/0.37  
% 0.12/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37  
% 0.12/0.37  Stopped by limit on number of solutions
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  -------------- Softie stats --------------
% 0.12/0.37  
% 0.12/0.37  UPDATE_STOP: 300
% 0.12/0.37  SFINDER_TIME_LIMIT: 2
% 0.12/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37  number of clauses in intial UL: 16
% 0.12/0.37  number of clauses initially in problem: 21
% 0.12/0.37  percentage of clauses intially in UL: 76
% 0.12/0.37  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37  percent of all initial clauses that are short: 100
% 0.12/0.37  absolute distinct symbol count: 7
% 0.12/0.37     distinct predicate count: 3
% 0.12/0.37     distinct function count: 0
% 0.12/0.37     distinct constant count: 4
% 0.12/0.37  
% 0.12/0.37  ---------- no more Softie stats ----------
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  =========== start of search ===========
% 0.61/0.84  
% 0.61/0.84  -------- PROOF -------- 
% 0.61/0.84  % SZS status Unsatisfiable
% 0.61/0.84  % SZS output start Refutation
% 0.61/0.84  
% 0.61/0.84  Model 2 (0.00 seconds, 0 Inserts)
% 0.61/0.84  
% 0.61/0.84  Stopped by limit on number of solutions
% 0.61/0.84  
% 0.61/0.84  Model 3 [ 1 1 168 ] (0.00 seconds, 30369 Inserts)
% 0.61/0.84  
% 0.61/0.84  Model 4 [ 2 1 156 ] (0.00 seconds, 41732 Inserts)
% 0.61/0.84  
% 0.61/0.84  ----> UNIT CONFLICT at   0.46 sec ----> 701 [binary,699.1,8.1] {-} $F.
% 0.61/0.84  
% 0.61/0.84  Length of proof is 34.  Level of proof is 13.
% 0.61/0.84  
% 0.61/0.84  ---------------- PROOF ----------------
% 0.61/0.84  % SZS status Unsatisfiable
% 0.61/0.84  % SZS output start Refutation
% 0.61/0.84  
% 0.61/0.84  1 [] {-} -equalish(e_1,e_2).
% 0.61/0.84  2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 0.61/0.84  3 [] {-} -equalish(e_1,e_3).
% 0.61/0.84  4 [copy,3,flip.1] {+} -equalish(e_3,e_1).
% 0.61/0.84  5 [] {-} -equalish(e_1,e_4).
% 0.61/0.84  6 [copy,5,flip.1] {+} -equalish(e_4,e_1).
% 0.61/0.84  7 [] {-} -equalish(e_2,e_3).
% 0.61/0.84  8 [copy,7,flip.1] {+} -equalish(e_3,e_2).
% 0.61/0.84  9 [] {-} -equalish(e_2,e_4).
% 0.61/0.84  10 [copy,9,flip.1] {+} -equalish(e_4,e_2).
% 0.61/0.84  13 [] {+} -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).
% 0.61/0.84  14 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 0.61/0.84  15 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 0.61/0.84  16 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 0.61/0.84  17 [] {+} -product(A,B,C)| -product(B,A,D)|product(C,D,B).
% 0.61/0.84  23 [] {+} group_element(e_1).
% 0.61/0.84  24 [] {+} group_element(e_2).
% 0.61/0.84  25 [] {+} group_element(e_3).
% 0.61/0.84  27 [] {-} product(A,A,A).
% 0.61/0.84  31 [hyper,24,13,23] {-} 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).
% 0.61/0.84  32 [hyper,24,13,23] {-} 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).
% 0.61/0.84  36 [hyper,25,13,24] {-} 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).
% 0.61/0.84  37 [hyper,25,13,23] {-} 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).
% 0.61/0.84  64 [hyper,31,15,27,unit_del,2] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 0.61/0.84  77 [hyper,64,16,27,unit_del,2] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 0.61/0.84  128 [hyper,32,16,27,unit_del,2] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 0.61/0.84  146 [hyper,128,15,27,unit_del,2] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 0.61/0.84  167 [hyper,146,17,77] {-} product(e_2,e_1,e_4)|product(e_3,e_3,e_2)|product(e_1,e_2,e_4).
% 0.61/0.84  170 [hyper,146,17,77] {-} product(e_2,e_1,e_3)|product(e_4,e_4,e_2)|product(e_1,e_2,e_3).
% 0.61/0.84  234 [hyper,167,14,27,unit_del,8] {-} product(e_2,e_1,e_4)|product(e_1,e_2,e_4).
% 0.61/0.84  236 [hyper,234,17,77,factor_simp] {-} product(e_1,e_2,e_4)|product(e_3,e_4,e_2).
% 0.61/0.84  238 [hyper,234,17,146,factor_simp] {-} product(e_2,e_1,e_4)|product(e_3,e_4,e_1).
% 0.61/0.84  239 [hyper,234,17,146,factor_simp] {-} product(e_2,e_1,e_4)|product(e_4,e_3,e_2).
% 0.61/0.84  357 [hyper,36,15,27,unit_del,8] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 0.61/0.84  366 [hyper,170,14,27,unit_del,10] {-} product(e_2,e_1,e_3)|product(e_1,e_2,e_3).
% 0.61/0.84  369 [hyper,366,17,77,factor_simp] {-} product(e_1,e_2,e_3)|product(e_4,e_3,e_2).
% 0.61/0.84  372 [hyper,366,17,77,factor_simp] {-} product(e_1,e_2,e_3)|product(e_3,e_4,e_1).
% 0.61/0.84  398 [hyper,369,17,239,factor_simp] {-} product(e_4,e_3,e_2)|product(e_3,e_4,e_2).
% 0.61/0.84  417 [hyper,372,17,238,factor_simp] {-} product(e_3,e_4,e_1)|product(e_4,e_3,e_1).
% 0.61/0.84  438 [hyper,37,15,27,unit_del,4] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 0.61/0.84  582 [hyper,357,16,27,unit_del,8] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_4).
% 0.61/0.84  587 [hyper,582,16,417,unit_del,10] {-} product(e_2,e_3,e_4)|product(e_3,e_4,e_1).
% 0.61/0.84  634 [hyper,587,15,238,unit_del,4,factor_simp] {-} product(e_3,e_4,e_1).
% 0.61/0.84  641 [hyper,634,14,398,unit_del,2] {-} product(e_4,e_3,e_2).
% 0.61/0.84  643 [hyper,634,14,236,unit_del,2] {-} product(e_1,e_2,e_4).
% 0.61/0.84  691 [hyper,438,16,641,unit_del,6] {-} product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 0.61/0.84  695 [hyper,691,16,27,unit_del,4] {-} product(e_1,e_3,e_4).
% 0.61/0.84  699 [hyper,695,15,643,flip.1] {-} equalish(e_3,e_2).
% 0.61/0.84  701 [binary,699.1,8.1] {-} $F.
% 0.61/0.84  
% 0.61/0.84  % SZS output end Refutation
% 0.61/0.84  ------------ end of proof -------------
% 0.61/0.84  
% 0.61/0.84  
% 0.61/0.84  Search stopped by max_proofs option.
% 0.61/0.84  
% 0.61/0.84  
% 0.61/0.84  Search stopped by max_proofs option.
% 0.61/0.84  
% 0.61/0.84  ============ end of search ============
% 0.61/0.84  
% 0.61/0.84  ----------- soft-scott stats ----------
% 0.61/0.84  
% 0.61/0.84  true clauses given           8      (16.0%)
% 0.61/0.84  false clauses given         42
% 0.61/0.84  
% 0.61/0.84        FALSE     TRUE
% 0.61/0.84     4  1         0
% 0.61/0.84    10  0         5
% 0.61/0.84    12  13        33
% 0.61/0.84    14  0         56
% 0.61/0.84    16  13        15
% 0.61/0.84    18  0         21
% 0.61/0.84  tot:  27        130      (82.8% true)
% 0.61/0.84  
% 0.61/0.84  
% 0.61/0.84  Model 4 [ 2 -35 156 ] (0.00 seconds, 41732 Inserts)
% 0.61/0.84  
% 0.61/0.84  That finishes the proof of the theorem.
% 0.61/0.84  
% 0.61/0.84  Process 8561 finished Mon Jun 13 07:35:04 2022
%------------------------------------------------------------------------------