TSTP Solution File: GRP123-9.003 by SOS---2.0

View Problem - Process Solution

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

% Computer : n025.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 7.48s 7.76s
% Output   : Refutation 7.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem  : GRP123-9.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.14  % Command  : sos-script %s
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jun 13 06:03:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox2 on n025.cluster.edu,
% 0.13/0.37  Mon Jun 13 06:03:08 2022
% 0.13/0.37  The command was "./sos".  The process ID is 19881.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.37  
% 0.13/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37  clauses in usable.
% 0.13/0.37  
% 0.13/0.37     dependent: set(knuth_bendix).
% 0.13/0.37     dependent: set(para_from).
% 0.13/0.37     dependent: set(para_into).
% 0.13/0.37     dependent: clear(para_from_right).
% 0.13/0.37     dependent: clear(para_into_right).
% 0.13/0.37     dependent: set(para_from_vars).
% 0.13/0.37     dependent: set(eq_units_both_ways).
% 0.13/0.37     dependent: set(dynamic_demod_all).
% 0.13/0.37     dependent: set(dynamic_demod).
% 0.13/0.37     dependent: set(order_eq).
% 0.13/0.37     dependent: set(back_demod).
% 0.13/0.37     dependent: set(lrpo).
% 0.13/0.37     dependent: set(hyper_res).
% 0.13/0.37     dependent: set(unit_deletion).
% 0.13/0.37     dependent: set(factor).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37    Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.37    Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.37    Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.20/0.40  
% 0.20/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40  
% 0.20/0.40  Stopped by limit on number of solutions
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  -------------- Softie stats --------------
% 0.20/0.40  
% 0.20/0.40  UPDATE_STOP: 300
% 0.20/0.40  SFINDER_TIME_LIMIT: 2
% 0.20/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40  number of clauses in intial UL: 25
% 0.20/0.40  number of clauses initially in problem: 30
% 0.20/0.40  percentage of clauses intially in UL: 83
% 0.20/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40  percent of all initial clauses that are short: 100
% 0.20/0.40  absolute distinct symbol count: 8
% 0.20/0.40     distinct predicate count: 5
% 0.20/0.40     distinct function count: 0
% 0.20/0.40     distinct constant count: 3
% 0.20/0.40  
% 0.20/0.40  ---------- no more Softie stats ----------
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  =========== start of search ===========
% 7.48/7.76  
% 7.48/7.76  -------- PROOF -------- 
% 7.48/7.76  % SZS status Unsatisfiable
% 7.48/7.76  % SZS output start Refutation
% 7.48/7.76  
% 7.48/7.76  Model 2 (0.00 seconds, 0 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on number of solutions
% 7.48/7.76  
% 7.48/7.76  Model 3 (0.00 seconds, 0 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on number of solutions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 4 [ 1 0 526 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 5 [ 2 1 101 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 6 [ 2 1 281 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 7 [ 1 1 6976 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 8 [ 5 1 3799 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 9 [ 7 26 215262 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 10 [ 10 3 15040 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 11 [ 10 13 100363 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 12 [ 11 30 210274 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 13 [ 20 13 126797 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  Stopped by limit on insertions
% 7.48/7.76  
% 7.48/7.76  Model 14 [ 18 1 398 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  ----> UNIT CONFLICT at   7.36 sec ----> 1273 [binary,1271.1,4.1] {-} $F.
% 7.48/7.76  
% 7.48/7.76  Length of proof is 14.  Level of proof is 7.
% 7.48/7.76  
% 7.48/7.76  ---------------- PROOF ----------------
% 7.48/7.76  % SZS status Unsatisfiable
% 7.48/7.76  % SZS output start Refutation
% 7.48/7.76  
% 7.48/7.76  3 [] {-} -equalish(e_1,e_2).
% 7.48/7.76  4 [copy,3,flip.1] {+} -equalish(e_2,e_1).
% 7.48/7.76  5 [] {-} -equalish(e_1,e_3).
% 7.48/7.76  6 [copy,5,flip.1] {+} -equalish(e_3,e_1).
% 7.48/7.76  7 [] {-} -equalish(e_2,e_3).
% 7.48/7.76  8 [copy,7,flip.1] {+} -equalish(e_3,e_2).
% 7.48/7.76  9 [] {+} -group_element(A)| -group_element(B)|product1(A,B,e_1)|product1(A,B,e_2)|product1(A,B,e_3).
% 7.48/7.76  11 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 7.48/7.76  12 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 7.48/7.76  13 [] {+} -group_element(A)| -group_element(B)|product2(A,B,e_1)|product2(A,B,e_2)|product2(A,B,e_3).
% 7.48/7.76  15 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 7.48/7.76  16 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 7.48/7.76  17 [] {+} -product1(A,B,C)| -product1(C,B,D)|product2(D,A,B).
% 7.48/7.76  29 [] {+} group_element(e_1).
% 7.48/7.76  30 [] {+} group_element(e_2).
% 7.48/7.76  31 [] {+} group_element(e_3).
% 7.48/7.76  32 [] {+} product1(A,A,A).
% 7.48/7.76  33 [] {+} product2(A,A,A).
% 7.48/7.76  44 [hyper,30,13,29] {-} product2(e_1,e_2,e_1)|product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 7.48/7.76  64 [hyper,31,9,30] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_2)|product1(e_2,e_3,e_3).
% 7.48/7.76  65 [hyper,31,9,29] {-} product1(e_1,e_3,e_1)|product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3).
% 7.48/7.76  347 [hyper,44,15,33,unit_del,4] {-} product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 7.48/7.76  363 [hyper,347,16,33,unit_del,4] {-} product2(e_1,e_2,e_3).
% 7.48/7.76  1036 [hyper,64,11,32,unit_del,8] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_3).
% 7.48/7.76  1040 [hyper,1036,12,32,unit_del,8] {-} product1(e_2,e_3,e_1).
% 7.48/7.76  1150 [hyper,65,12,1040,unit_del,4] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3).
% 7.48/7.76  1160 [hyper,1150,12,32,unit_del,6] {+} product1(e_1,e_3,e_2).
% 7.48/7.76  1161 [hyper,1160,17,1040] {+} product2(e_2,e_2,e_3).
% 7.48/7.76  1271 [hyper,1161,16,363,flip.1] {-} equalish(e_2,e_1).
% 7.48/7.76  1273 [binary,1271.1,4.1] {-} $F.
% 7.48/7.76  
% 7.48/7.76  % SZS output end Refutation
% 7.48/7.76  ------------ end of proof -------------
% 7.48/7.76  
% 7.48/7.76  
% 7.48/7.76  Search stopped by max_proofs option.
% 7.48/7.76  
% 7.48/7.76  
% 7.48/7.76  Search stopped by max_proofs option.
% 7.48/7.76  
% 7.48/7.76  ============ end of search ============
% 7.48/7.76  
% 7.48/7.76  ----------- soft-scott stats ----------
% 7.48/7.76  
% 7.48/7.76  true clauses given          15      (24.2%)
% 7.48/7.76  false clauses given         47
% 7.48/7.76  
% 7.48/7.76        FALSE     TRUE
% 7.48/7.76     4  1         0
% 7.48/7.76    10  0         1
% 7.48/7.76    12  34        158
% 7.48/7.76    14  8         128
% 7.48/7.76    16  0         288
% 7.48/7.76    18  5         97
% 7.48/7.76    20  3         429
% 7.48/7.76  tot:  51        1101      (95.6% true)
% 7.48/7.76  
% 7.48/7.76  
% 7.48/7.76  Model 14 [ 18 1 398 ] (0.00 seconds, 250000 Inserts)
% 7.48/7.76  
% 7.48/7.76  That finishes the proof of the theorem.
% 7.48/7.76  
% 7.48/7.76  Process 19881 finished Mon Jun 13 06:03:16 2022
%------------------------------------------------------------------------------