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

View Problem - Process Solution

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

% Computer : n021.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:32 EDT 2022

% Result   : Unsatisfiable 3.79s 3.96s
% Output   : Refutation 3.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP124-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n021.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 : Tue Jun 14 07:25:27 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox2 on n021.cluster.edu,
% 0.13/0.35  Tue Jun 14 07:25:27 2022
% 0.13/0.35  The command was "./sos".  The process ID is 13689.
% 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  list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.35  
% 0.13/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35  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: set(unit_deletion).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35    Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.35    Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.35    Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.35    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.13/0.35    Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.13/0.35    Following clause subsumed by 14 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.19/0.40  
% 0.19/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  -------------- Softie stats --------------
% 0.19/0.40  
% 0.19/0.40  UPDATE_STOP: 300
% 0.19/0.40  SFINDER_TIME_LIMIT: 2
% 0.19/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40  number of clauses in intial UL: 28
% 0.19/0.40  number of clauses initially in problem: 33
% 0.19/0.40  percentage of clauses intially in UL: 84
% 0.19/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40  percent of all initial clauses that are short: 100
% 0.19/0.40  absolute distinct symbol count: 7
% 0.19/0.40     distinct predicate count: 3
% 0.19/0.40     distinct function count: 0
% 0.19/0.40     distinct constant count: 4
% 0.19/0.40  
% 0.19/0.40  ---------- no more Softie stats ----------
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  =========== start of search ===========
% 3.79/3.96  
% 3.79/3.96  -------- PROOF -------- 
% 3.79/3.96  % SZS status Unsatisfiable
% 3.79/3.96  % SZS output start Refutation
% 3.79/3.96  
% 3.79/3.96  Model 2 (0.00 seconds, 0 Inserts)
% 3.79/3.96  
% 3.79/3.96  Stopped by limit on number of solutions
% 3.79/3.96  
% 3.79/3.96  Stopped by limit on insertions
% 3.79/3.96  
% 3.79/3.96  Model 3 [ 1 1 305 ] (0.00 seconds, 250000 Inserts)
% 3.79/3.96  
% 3.79/3.96  Model 4 [ 2 18 133118 ] (0.00 seconds, 214624 Inserts)
% 3.79/3.96  
% 3.79/3.96  ----> UNIT CONFLICT at   3.59 sec ----> 1983 [binary,1981.1,12.1] {-} $F.
% 3.79/3.96  
% 3.79/3.96  Length of proof is 21.  Level of proof is 8.
% 3.79/3.96  
% 3.79/3.96  ---------------- PROOF ----------------
% 3.79/3.96  % SZS status Unsatisfiable
% 3.79/3.96  % SZS output start Refutation
% 3.79/3.96  
% 3.79/3.96  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).
% 3.79/3.96  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).
% 3.79/3.96  3 [] {-} -equalish(e_1,e_2).
% 3.79/3.96  4 [copy,3,flip.1] {+} -equalish(e_2,e_1).
% 3.79/3.96  5 [] {-} -equalish(e_1,e_3).
% 3.79/3.96  6 [copy,5,flip.1] {+} -equalish(e_3,e_1).
% 3.79/3.96  7 [] {-} -equalish(e_1,e_4).
% 3.79/3.96  8 [copy,7,flip.1] {+} -equalish(e_4,e_1).
% 3.79/3.96  9 [] {-} -equalish(e_2,e_3).
% 3.79/3.96  10 [copy,9,flip.1] {+} -equalish(e_3,e_2).
% 3.79/3.96  11 [] {-} -equalish(e_2,e_4).
% 3.79/3.96  12 [copy,11,flip.1] {+} -equalish(e_4,e_2).
% 3.79/3.96  15 [] {+} -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).
% 3.79/3.96  16 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 3.79/3.96  17 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 3.79/3.96  18 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 3.79/3.96  20 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(B,E).
% 3.79/3.96  34 [factor,20.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(B,C).
% 3.79/3.96  35 [] {+} group_element(e_1).
% 3.79/3.96  36 [] {+} group_element(e_2).
% 3.79/3.96  39 [] {-} product(A,A,A).
% 3.79/3.96  53 [hyper,36,15,35] {-} 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).
% 3.79/3.96  56 [hyper,36,2,35] {-} product(e_2,e_1,e_1)|product(e_2,e_2,e_1)|product(e_2,e_3,e_1)|product(e_2,e_4,e_1).
% 3.79/3.96  57 [hyper,36,1,35] {-} product(e_1,e_1,e_2)|product(e_2,e_1,e_2)|product(e_3,e_1,e_2)|product(e_4,e_1,e_2).
% 3.79/3.96  192 [hyper,53,17,39,unit_del,4] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 3.79/3.96  213 [hyper,192,18,39,unit_del,4] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 3.79/3.96  995 [hyper,56,18,39,unit_del,4] {-} product(e_2,e_2,e_1)|product(e_2,e_3,e_1)|product(e_2,e_4,e_1).
% 3.79/3.96  999 [hyper,995,16,39,unit_del,4] {-} product(e_2,e_3,e_1)|product(e_2,e_4,e_1).
% 3.79/3.96  1036 [hyper,999,34,39,213,unit_del,8] {-} product(e_2,e_3,e_1)|product(e_1,e_2,e_3).
% 3.79/3.96  1338 [hyper,57,16,39,unit_del,4] {-} product(e_2,e_1,e_2)|product(e_3,e_1,e_2)|product(e_4,e_1,e_2).
% 3.79/3.96  1348 [hyper,1338,17,39,unit_del,4] {-} product(e_3,e_1,e_2)|product(e_4,e_1,e_2).
% 3.79/3.96  1572 [hyper,1348,34,1036,39,unit_del,10] {-} product(e_4,e_1,e_2)|product(e_2,e_3,e_1).
% 3.79/3.96  1685 [hyper,1572,34,39,999,unit_del,4,factor_simp] {-} product(e_2,e_3,e_1).
% 3.79/3.96  1686 [hyper,1572,34,1348,39,unit_del,4,factor_simp] {-} product(e_4,e_1,e_2).
% 3.79/3.96  1687 [hyper,1685,34,39,213,unit_del,6] {-} product(e_1,e_2,e_4).
% 3.79/3.96  1981 [hyper,1687,34,39,1686,flip.1] {-} equalish(e_4,e_2).
% 3.79/3.96  1983 [binary,1981.1,12.1] {-} $F.
% 3.79/3.96  
% 3.79/3.96  % SZS output end Refutation
% 3.79/3.96  ------------ end of proof -------------
% 3.79/3.96  
% 3.79/3.96  
% 3.79/3.96  Search stopped by max_proofs option.
% 3.79/3.96  
% 3.79/3.96  
% 3.79/3.96  Search stopped by max_proofs option.
% 3.79/3.96  
% 3.79/3.96  ============ end of search ============
% 3.79/3.96  
% 3.79/3.96  ----------- soft-scott stats ----------
% 3.79/3.96  
% 3.79/3.96  true clauses given          14      (33.3%)
% 3.79/3.96  false clauses given         28
% 3.79/3.96  
% 3.79/3.96        FALSE     TRUE
% 3.79/3.96     8  2         0
% 3.79/3.96    10  0         30
% 3.79/3.96    12  7         70
% 3.79/3.96    14  0         89
% 3.79/3.96    16  71        208
% 3.79/3.96    18  0         108
% 3.79/3.96    20  26        116
% 3.79/3.96    22  0         210
% 3.79/3.96    24  12        48
% 3.79/3.96    26  0         144
% 3.79/3.96    30  0         108
% 3.79/3.96    34  0         8
% 3.79/3.96  tot:  118       1139      (90.6% true)
% 3.79/3.96  
% 3.79/3.96  
% 3.79/3.96  Model 4 [ 2 -299 133118 ] (0.00 seconds, 214624 Inserts)
% 3.79/3.96  
% 3.79/3.96  That finishes the proof of the theorem.
% 3.79/3.96  
% 3.79/3.96  Process 13689 finished Tue Jun 14 07:25:31 2022
%------------------------------------------------------------------------------