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

View Problem - Process Solution

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

% Computer : n013.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:30 EDT 2022

% Result   : Unsatisfiable 48.43s 48.66s
% Output   : Refutation 48.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP124-1.004 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.33  % Computer : n013.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 : Mon Jun 13 22:00:29 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 sandbox on n013.cluster.edu,
% 0.13/0.35  Mon Jun 13 22:00:29 2022
% 0.13/0.35  The command was "./sos".  The process ID is 30510.
% 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 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.35    Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.35    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.35    Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.13/0.35    Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.13/0.35    Following clause subsumed by 12 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.18/0.39  
% 0.18/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39  
% 0.18/0.39  Stopped by limit on number of solutions
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  -------------- Softie stats --------------
% 0.18/0.39  
% 0.18/0.39  UPDATE_STOP: 300
% 0.18/0.39  SFINDER_TIME_LIMIT: 2
% 0.18/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39  number of clauses in intial UL: 24
% 0.18/0.39  number of clauses initially in problem: 29
% 0.18/0.39  percentage of clauses intially in UL: 82
% 0.18/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.39  percent of all initial clauses that are short: 100
% 0.18/0.39  absolute distinct symbol count: 7
% 0.18/0.39     distinct predicate count: 3
% 0.18/0.39     distinct function count: 0
% 0.18/0.39     distinct constant count: 4
% 0.18/0.39  
% 0.18/0.39  ---------- no more Softie stats ----------
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39  
% 0.18/0.39  Stopped by limit on number of solutions
% 0.18/0.39  
% 0.18/0.39  =========== start of search ===========
% 9.50/9.69  
% 9.50/9.69  
% 9.50/9.69  Changing weight limit from 60 to 28.
% 9.50/9.69  
% 9.50/9.69  Model 3 [ 1 1 189 ] (0.00 seconds, 89081 Inserts)
% 9.50/9.69  
% 9.50/9.69  Model 4 [ 2 1 415 ] (0.00 seconds, 31142 Inserts)
% 9.50/9.69  
% 9.50/9.69  Model 5 [ 3 1 1407 ] (0.00 seconds, 100212 Inserts)
% 9.50/9.69  
% 9.50/9.69  Model 6 [ 4 0 107 ] (0.00 seconds, 209171 Inserts)
% 9.50/9.69  
% 9.50/9.69  Resetting weight limit to 28 after 65 givens.
% 9.50/9.69  
% 48.43/48.66  
% 48.43/48.66  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 48.43/48.66  
% 48.43/48.66  ----> UNIT CONFLICT at  48.28 sec ----> 14489 [binary,14487.1,4.1] {+} $F.
% 48.43/48.66  
% 48.43/48.66  Length of proof is 26.  Level of proof is 12.
% 48.43/48.66  
% 48.43/48.66  ---------------- PROOF ----------------
% 48.43/48.66  % SZS status Unsatisfiable
% 48.43/48.66  % SZS output start Refutation
% 48.43/48.66  
% 48.43/48.66  1 [] {-} -equalish(e_1,e_2).
% 48.43/48.66  2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 48.43/48.66  3 [] {-} -equalish(e_1,e_3).
% 48.43/48.66  4 [copy,3,flip.1] {+} -equalish(e_3,e_1).
% 48.43/48.66  7 [] {-} -equalish(e_2,e_3).
% 48.43/48.66  8 [copy,7,flip.1] {+} -equalish(e_3,e_2).
% 48.43/48.66  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).
% 48.43/48.66  15 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 48.43/48.66  16 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 48.43/48.66  18 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(B,E).
% 48.43/48.66  30 [factor,18.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(B,C).
% 48.43/48.66  31 [] {+} group_element(e_1).
% 48.43/48.66  32 [] {+} group_element(e_2).
% 48.43/48.66  33 [] {+} group_element(e_3).
% 48.43/48.66  35 [] {-} product(A,A,A).
% 48.43/48.66  49 [hyper,32,13,31] {-} 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).
% 48.43/48.66  50 [hyper,32,13,31] {-} 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).
% 48.43/48.66  64 [hyper,33,13,32] {-} 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).
% 48.43/48.66  65 [hyper,33,13,31] {-} 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).
% 48.43/48.66  66 [hyper,33,13,32] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_2)|product(e_3,e_2,e_3)|product(e_3,e_2,e_4).
% 48.43/48.66  164 [hyper,49,15,35,unit_del,2] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 48.43/48.66  185 [hyper,164,16,35,unit_del,2] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 48.43/48.66  372 [hyper,50,16,35,unit_del,2] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 48.43/48.66  374 [hyper,372,15,35,unit_del,2] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 48.43/48.66  555 [hyper,64,15,35,unit_del,8] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 48.43/48.66  559 [hyper,555,16,35,unit_del,8] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_4).
% 48.43/48.66  609 [hyper,559,30,35,185,unit_del,4] {-} product(e_2,e_3,e_4)|product(e_1,e_2,e_4).
% 48.43/48.66  715 [hyper,609,15,374,unit_del,4] {-} product(e_1,e_2,e_4)|product(e_2,e_1,e_3).
% 48.43/48.66  1048 [hyper,65,15,35,unit_del,4] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 48.43/48.66  1094 [hyper,1048,16,35,unit_del,4] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_4).
% 48.43/48.66  1137 [hyper,1094,30,35,715,unit_del,8] {-} product(e_1,e_3,e_4)|product(e_1,e_2,e_4).
% 48.43/48.66  1249 [hyper,1137,16,609,unit_del,2,factor_simp] {-} product(e_1,e_2,e_4).
% 48.43/48.66  1250 [hyper,1249,15,1094,unit_del,8] {-} product(e_1,e_3,e_2).
% 48.43/48.66  9490 [hyper,66,30,35,1250,unit_del,2] {-} product(e_3,e_2,e_2)|product(e_3,e_2,e_3)|product(e_3,e_2,e_4).
% 48.43/48.66  14474 [hyper,9490,16,35,unit_del,8] {-} product(e_3,e_2,e_3)|product(e_3,e_2,e_4).
% 48.43/48.66  14485 [hyper,14474,15,35,unit_del,8] {-} product(e_3,e_2,e_4).
% 48.43/48.66  14487 [hyper,14485,16,1249,flip.1] {-} equalish(e_3,e_1).
% 48.43/48.66  14489 [binary,14487.1,4.1] {+} $F.
% 48.43/48.66  
% 48.43/48.66  % SZS output end Refutation
% 48.43/48.66  ------------ end of proof -------------
% 48.43/48.66  
% 48.43/48.66  
% 48.43/48.66  Search stopped by max_proofs option.
% 48.43/48.66  
% 48.43/48.66  
% 48.43/48.66  Search stopped by max_proofs option.
% 48.43/48.66  
% 48.43/48.66  ============ end of search ============
% 48.43/48.66  
% 48.43/48.66  ----------- soft-scott stats ----------
% 48.43/48.66  
% 48.43/48.66  true clauses given          59      (34.7%)
% 48.43/48.66  false clauses given        111
% 48.43/48.66  
% 48.43/48.66        FALSE     TRUE
% 48.43/48.66     4  1         0
% 48.43/48.66     8  0         12
% 48.43/48.66    10  0         31
% 48.43/48.66    12  9         452
% 48.43/48.66    14  0         385
% 48.43/48.66    16  533       1620
% 48.43/48.66    20  830       0
% 48.43/48.66    24  697       0
% 48.43/48.66    28  156       0
% 48.43/48.66  tot:  2226      2500      (52.9% true)
% 48.43/48.66  
% 48.43/48.66  
% 48.43/48.66  Model 6 [ 4 -4771 107 ] (0.00 seconds, 209171 Inserts)
% 48.43/48.66  
% 48.43/48.66  That finishes the proof of the theorem.
% 48.43/48.66  
% 48.43/48.66  Process 30510 finished Mon Jun 13 22:01:17 2022
%------------------------------------------------------------------------------