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

View Problem - Process Solution

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

% Computer : n018.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:34 EDT 2022

% Result   : Unsatisfiable 4.49s 4.69s
% Output   : Refutation 4.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GRP124-9.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.14  % Command  : sos-script %s
% 0.15/0.36  % Computer : n018.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Mon Jun 13 11:39:12 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.38  ----- Otter 3.2, August 2001 -----
% 0.22/0.38  The process was started by sandbox on n018.cluster.edu,
% 0.22/0.38  Mon Jun 13 11:39:12 2022
% 0.22/0.38  The command was "./sos".  The process ID is 22677.
% 0.22/0.38  
% 0.22/0.38  set(prolog_style_variables).
% 0.22/0.38  set(auto).
% 0.22/0.38     dependent: set(auto1).
% 0.22/0.38     dependent: set(process_input).
% 0.22/0.38     dependent: clear(print_kept).
% 0.22/0.38     dependent: clear(print_new_demod).
% 0.22/0.38     dependent: clear(print_back_demod).
% 0.22/0.38     dependent: clear(print_back_sub).
% 0.22/0.38     dependent: set(control_memory).
% 0.22/0.38     dependent: assign(max_mem, 12000).
% 0.22/0.38     dependent: assign(pick_given_ratio, 4).
% 0.22/0.38     dependent: assign(stats_level, 1).
% 0.22/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.22/0.38     dependent: assign(sos_limit, 5000).
% 0.22/0.38     dependent: assign(max_weight, 60).
% 0.22/0.38  clear(print_given).
% 0.22/0.38  
% 0.22/0.38  list(usable).
% 0.22/0.38  
% 0.22/0.38  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.22/0.38  
% 0.22/0.38  This ia a non-Horn set with equality.  The strategy will be
% 0.22/0.38  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.22/0.38  unit deletion, with positive clauses in sos and nonpositive
% 0.22/0.38  clauses in usable.
% 0.22/0.38  
% 0.22/0.38     dependent: set(knuth_bendix).
% 0.22/0.38     dependent: set(para_from).
% 0.22/0.38     dependent: set(para_into).
% 0.22/0.38     dependent: clear(para_from_right).
% 0.22/0.38     dependent: clear(para_into_right).
% 0.22/0.38     dependent: set(para_from_vars).
% 0.22/0.38     dependent: set(eq_units_both_ways).
% 0.22/0.38     dependent: set(dynamic_demod_all).
% 0.22/0.38     dependent: set(dynamic_demod).
% 0.22/0.38     dependent: set(order_eq).
% 0.22/0.38     dependent: set(back_demod).
% 0.22/0.38     dependent: set(lrpo).
% 0.22/0.38     dependent: set(hyper_res).
% 0.22/0.38     dependent: set(unit_deletion).
% 0.22/0.38     dependent: set(factor).
% 0.22/0.38  
% 0.22/0.38  ------------> process usable:
% 0.22/0.38    Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.22/0.38    Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.22/0.38    Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.22/0.38    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.22/0.38    Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.22/0.38    Following clause subsumed by 14 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.22/0.38  
% 0.22/0.38  ------------> process sos:
% 0.22/0.38  40 back subsumes 34.
% 0.22/0.38  
% 0.22/0.38  ======= end of input processing =======
% 0.22/0.40  
% 0.22/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.40  
% 0.22/0.40  Stopped by limit on number of solutions
% 0.22/0.40  
% 0.22/0.40  
% 0.22/0.40  -------------- Softie stats --------------
% 0.22/0.40  
% 0.22/0.40  UPDATE_STOP: 300
% 0.22/0.40  SFINDER_TIME_LIMIT: 2
% 0.22/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.40  number of clauses in intial UL: 27
% 0.22/0.40  number of clauses initially in problem: 33
% 0.22/0.40  percentage of clauses intially in UL: 81
% 0.22/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.40  percent of all initial clauses that are short: 100
% 0.22/0.40  absolute distinct symbol count: 9
% 0.22/0.40     distinct predicate count: 5
% 0.22/0.40     distinct function count: 0
% 0.22/0.40     distinct constant count: 4
% 0.22/0.40  
% 0.22/0.40  ---------- no more Softie stats ----------
% 0.22/0.40  
% 0.22/0.40  
% 0.22/0.40  
% 0.22/0.40  =========== start of search ===========
% 2.50/2.68  
% 2.50/2.68  
% 2.50/2.68  Changing weight limit from 60 to 24.
% 2.50/2.68  
% 2.50/2.68  Model 2 (0.00 seconds, 0 Inserts)
% 2.50/2.68  
% 2.50/2.68  Stopped by limit on number of solutions
% 2.50/2.68  
% 2.50/2.68  Stopped by limit on insertions
% 2.50/2.68  
% 2.50/2.68  Stopped by limit on insertions
% 2.50/2.68  
% 2.50/2.68  Stopped by limit on insertions
% 2.50/2.68  
% 2.50/2.68  Resetting weight limit to 24 after 85 givens.
% 2.50/2.68  
% 3.15/3.35  
% 3.15/3.35  
% 3.15/3.35  Changing weight limit from 24 to 25.
% 3.15/3.35  
% 3.15/3.35  Stopped by limit on insertions
% 3.15/3.35  
% 3.15/3.35  Stopped by limit on insertions
% 3.15/3.35  
% 3.15/3.35  Stopped by limit on insertions
% 3.15/3.35  
% 3.15/3.35  Resetting weight limit to 25 after 90 givens.
% 3.15/3.35  
% 3.86/4.05  
% 3.86/4.05  
% 3.86/4.05  Changing weight limit from 25 to 26.
% 3.86/4.05  
% 3.86/4.05  Stopped by limit on insertions
% 3.86/4.05  
% 3.86/4.05  Stopped by limit on insertions
% 3.86/4.05  
% 3.86/4.05  Stopped by limit on insertions
% 3.86/4.05  
% 3.86/4.05  Resetting weight limit to 26 after 95 givens.
% 3.86/4.05  
% 4.49/4.69  
% 4.49/4.69  -------- PROOF -------- 
% 4.49/4.69  % SZS status Unsatisfiable
% 4.49/4.69  % SZS output start Refutation
% 4.49/4.69  
% 4.49/4.69  Stopped by limit on insertions
% 4.49/4.69  
% 4.49/4.69  Stopped by limit on insertions
% 4.49/4.69  
% 4.49/4.69  Model 3 [ 15 0 3005 ] (0.00 seconds, 250000 Inserts)
% 4.49/4.69  
% 4.49/4.69  ----> UNIT CONFLICT at   4.28 sec ----> 3795 [binary,3793.1,10.1] {-} $F.
% 4.49/4.69  
% 4.49/4.69  Length of proof is 40.  Level of proof is 14.
% 4.49/4.69  
% 4.49/4.69  ---------------- PROOF ----------------
% 4.49/4.69  % SZS status Unsatisfiable
% 4.49/4.69  % SZS output start Refutation
% 4.49/4.69  
% 4.49/4.69  3 [] {-} -equalish(e_1,e_2).
% 4.49/4.69  4 [copy,3,flip.1] {+} -equalish(e_2,e_1).
% 4.49/4.69  5 [] {-} -equalish(e_1,e_3).
% 4.49/4.69  6 [copy,5,flip.1] {+} -equalish(e_3,e_1).
% 4.49/4.69  7 [] {-} -equalish(e_1,e_4).
% 4.49/4.69  8 [copy,7,flip.1] {+} -equalish(e_4,e_1).
% 4.49/4.69  9 [] {-} -equalish(e_2,e_3).
% 4.49/4.69  10 [copy,9,flip.1] {+} -equalish(e_3,e_2).
% 4.49/4.69  11 [] {-} -equalish(e_2,e_4).
% 4.49/4.69  12 [copy,11,flip.1] {+} -equalish(e_4,e_2).
% 4.49/4.69  15 [] {+} -group_element(A)| -group_element(B)|product1(A,B,e_1)|product1(A,B,e_2)|product1(A,B,e_3)|product1(A,B,e_4).
% 4.49/4.69  17 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 4.49/4.69  18 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 4.49/4.69  19 [] {+} -group_element(A)| -group_element(B)|product2(A,B,e_1)|product2(A,B,e_2)|product2(A,B,e_3)|product2(A,B,e_4).
% 4.49/4.69  20 [] {+} -product2(A,B,C)| -product2(A,B,D)|equalish(C,D).
% 4.49/4.69  21 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 4.49/4.69  22 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 4.49/4.69  23 [] {+} -product1(A,B,C)| -product1(C,A,D)|product2(D,B,A).
% 4.49/4.69  35 [] {+} group_element(e_1).
% 4.49/4.69  36 [] {+} group_element(e_2).
% 4.49/4.69  37 [] {-} group_element(e_3).
% 4.49/4.69  39 [] {-} product1(A,A,A).
% 4.49/4.69  40 [] {-} product2(A,A,A).
% 4.49/4.69  53 [hyper,36,15,35] {-} product1(e_1,e_2,e_1)|product1(e_1,e_2,e_2)|product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 4.49/4.69  54 [hyper,36,15,35] {-} product1(e_2,e_1,e_1)|product1(e_2,e_1,e_2)|product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 4.49/4.69  67 [hyper,37,19,36] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_2)|product2(e_2,e_3,e_3)|product2(e_2,e_3,e_4).
% 4.49/4.69  68 [hyper,37,19,35] {-} product2(e_1,e_3,e_1)|product2(e_1,e_3,e_2)|product2(e_1,e_3,e_3)|product2(e_1,e_3,e_4).
% 4.49/4.69  71 [hyper,37,15,36] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_2)|product1(e_2,e_3,e_3)|product1(e_2,e_3,e_4).
% 4.49/4.69  72 [hyper,37,15,35] {-} product1(e_1,e_3,e_1)|product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3)|product1(e_1,e_3,e_4).
% 4.49/4.69  597 [hyper,53,17,39,unit_del,4] {-} product1(e_1,e_2,e_2)|product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 4.49/4.69  599 [hyper,597,18,39,unit_del,4] {-} product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 4.49/4.69  808 [hyper,54,18,39,unit_del,4] {-} product1(e_2,e_1,e_2)|product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 4.49/4.69  812 [hyper,808,17,39,unit_del,4] {-} product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 4.49/4.69  1307 [hyper,67,21,40,unit_del,10] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_3)|product2(e_2,e_3,e_4).
% 4.49/4.69  1310 [hyper,1307,22,40,unit_del,10] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_4).
% 4.49/4.69  1543 [hyper,68,21,40,unit_del,6] {-} product2(e_1,e_3,e_2)|product2(e_1,e_3,e_3)|product2(e_1,e_3,e_4).
% 4.49/4.69  1547 [hyper,1543,22,40,unit_del,6] {-} product2(e_1,e_3,e_2)|product2(e_1,e_3,e_4).
% 4.49/4.69  1694 [hyper,1547,22,1310,unit_del,4] {-} product2(e_1,e_3,e_2)|product2(e_2,e_3,e_1).
% 4.49/4.69  2376 [hyper,71,17,39,unit_del,10] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_3)|product1(e_2,e_3,e_4).
% 4.49/4.69  2381 [hyper,2376,18,39,unit_del,10] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_4).
% 4.49/4.69  2398 [hyper,2381,23,599] {-} product1(e_2,e_3,e_4)|product2(e_3,e_3,e_2)|product1(e_1,e_2,e_4).
% 4.49/4.69  2399 [hyper,2381,17,812,unit_del,6] {-} product1(e_2,e_3,e_1)|product1(e_2,e_1,e_3).
% 4.49/4.69  2560 [hyper,72,17,39,unit_del,6] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3)|product1(e_1,e_3,e_4).
% 4.49/4.69  2573 [hyper,2398,20,40,unit_del,10] {-} product1(e_2,e_3,e_4)|product1(e_1,e_2,e_4).
% 4.49/4.69  2574 [hyper,2573,17,812,unit_del,6] {-} product1(e_1,e_2,e_4)|product1(e_2,e_1,e_3).
% 4.49/4.69  2985 [hyper,2560,18,39,unit_del,6] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_4).
% 4.49/4.69  3139 [hyper,2985,18,2573,unit_del,4] {-} product1(e_1,e_3,e_2)|product1(e_1,e_2,e_4).
% 4.49/4.69  3192 [hyper,3139,23,2574,factor_simp] {-} product1(e_1,e_2,e_4)|product2(e_3,e_3,e_1).
% 4.49/4.69  3193 [hyper,3139,17,2985,unit_del,10,factor_simp] {-} product1(e_1,e_3,e_2).
% 4.49/4.69  3194 [hyper,3193,23,2399] {-} product2(e_3,e_3,e_1)|product1(e_2,e_3,e_1).
% 4.49/4.69  3195 [hyper,3193,23,812] {-} product2(e_4,e_3,e_1)|product1(e_2,e_1,e_3).
% 4.49/4.69  3221 [hyper,3192,20,40,unit_del,6] {-} product1(e_1,e_2,e_4).
% 4.49/4.69  3390 [hyper,3194,20,40,unit_del,6] {-} product1(e_2,e_3,e_1).
% 4.49/4.69  3391 [hyper,3390,23,3221] {-} product2(e_4,e_3,e_2).
% 4.49/4.69  3411 [hyper,3391,22,1694,unit_del,8] {-} product2(e_2,e_3,e_1).
% 4.49/4.69  3629 [hyper,3195,22,3411,unit_del,12] {-} product1(e_2,e_1,e_3).
% 4.49/4.69  3774 [hyper,3629,23,3193] {+} product2(e_3,e_3,e_1).
% 4.49/4.69  3793 [hyper,3774,22,3411,flip.1] {-} equalish(e_3,e_2).
% 4.49/4.69  3795 [binary,3793.1,10.1] {-} $F.
% 4.49/4.69  
% 4.49/4.69  % SZS output end Refutation
% 4.49/4.69  ------------ end of proof -------------
% 4.49/4.69  
% 4.49/4.69  
% 4.49/4.69  Search stopped by max_proofs option.
% 4.49/4.69  
% 4.49/4.69  
% 4.49/4.69  Search stopped by max_proofs option.
% 4.49/4.69  
% 4.49/4.69  ============ end of search ============
% 4.49/4.69  
% 4.49/4.69  ----------- soft-scott stats ----------
% 4.49/4.69  
% 4.49/4.69  true clauses given          22      (22.4%)
% 4.49/4.69  false clauses given         76
% 4.49/4.69  
% 4.49/4.69        FALSE     TRUE
% 4.49/4.69    10  0         11
% 4.49/4.69    12  81        103
% 4.49/4.69    14  48        56
% 4.49/4.69    16  113       98
% 4.49/4.69    18  36        42
% 4.49/4.69    20  3         1008
% 4.49/4.69    24  35        945
% 4.49/4.69  tot:  316       2263      (87.7% true)
% 4.49/4.69  
% 4.49/4.69  
% 4.49/4.69  Model 3 [ 15 0 3005 ] (0.00 seconds, 250000 Inserts)
% 4.49/4.69  
% 4.49/4.69  That finishes the proof of the theorem.
% 4.49/4.69  
% 4.49/4.69  Process 22677 finished Mon Jun 13 11:39:17 2022
%------------------------------------------------------------------------------