%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP123-8.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:29 EDT 2022
% Result : Unsatisfiable 10.74s 10.97s
% Output : Refutation 10.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP123-8.003 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n016.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 05:33:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox2 on n016.cluster.edu,
% 0.18/0.35 Mon Jun 13 05:33:29 2022
% 0.18/0.35 The command was "./sos". The process ID is 5677.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.18/0.35
% 0.18/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35 clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.18/0.35 Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.18/0.35 Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.53
% 0.18/0.53 Stopped by limit on insertions
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53 Failed to model usable list: disabling FINDER
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53 -------------- Softie stats --------------
% 0.18/0.53
% 0.18/0.53 UPDATE_STOP: 300
% 0.18/0.53 SFINDER_TIME_LIMIT: 2
% 0.18/0.53 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.53 number of clauses in intial UL: 39
% 0.18/0.53 number of clauses initially in problem: 54
% 0.18/0.53 percentage of clauses intially in UL: 72
% 0.18/0.53 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.53 percent of all initial clauses that are short: 100
% 0.18/0.53 absolute distinct symbol count: 12
% 0.18/0.53 distinct predicate count: 8
% 0.18/0.53 distinct function count: 0
% 0.18/0.53 distinct constant count: 4
% 0.18/0.53
% 0.18/0.53 ---------- no more Softie stats ----------
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53 =========== start of search ===========
% 7.50/7.71
% 7.50/7.71
% 7.50/7.71 Changing weight limit from 60 to 24.
% 7.50/7.71
% 7.50/7.71 Resetting weight limit to 24 after 145 givens.
% 7.50/7.71
% 8.40/8.65
% 8.40/8.65
% 8.40/8.65 Changing weight limit from 24 to 23.
% 8.40/8.65
% 8.40/8.65 Resetting weight limit to 23 after 150 givens.
% 8.40/8.65
% 9.10/9.31
% 9.10/9.31
% 9.10/9.31 Changing weight limit from 23 to 22.
% 9.10/9.31
% 9.10/9.31 Resetting weight limit to 22 after 155 givens.
% 9.10/9.31
% 10.74/10.97
% 10.74/10.97 -- HEY sandbox2, WE HAVE A PROOF!! --
% 10.74/10.97
% 10.74/10.97 ----> UNIT CONFLICT at 10.59 sec ----> 7030 [binary,7028.1,8.1] {-} $F.
% 10.74/10.97
% 10.74/10.97 Length of proof is 14. Level of proof is 7.
% 10.74/10.97
% 10.74/10.97 ---------------- PROOF ----------------
% 10.74/10.97 % SZS status Unsatisfiable
% 10.74/10.97 % SZS output start Refutation
% 10.74/10.97
% 10.74/10.97 7 [] {-} -equalish(e_1,e_2).
% 10.74/10.97 8 [copy,7,flip.1] {+} -equalish(e_2,e_1).
% 10.74/10.97 9 [] {-} -equalish(e_1,e_3).
% 10.74/10.97 10 [copy,9,flip.1] {+} -equalish(e_3,e_1).
% 10.74/10.97 11 [] {-} -equalish(e_2,e_3).
% 10.74/10.97 12 [copy,11,flip.1] {+} -equalish(e_3,e_2).
% 10.74/10.97 13 [] {+} -group_element(A)| -group_element(B)|product1(A,B,e_1)|product1(A,B,e_2)|product1(A,B,e_3).
% 10.74/10.97 15 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 10.74/10.97 16 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 10.74/10.97 17 [] {+} -group_element(A)| -group_element(B)|product2(A,B,e_1)|product2(A,B,e_2)|product2(A,B,e_3).
% 10.74/10.97 19 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 10.74/10.97 20 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 10.74/10.97 21 [] {+} -product1(A,B,C)| -product1(C,B,D)|product2(D,A,B).
% 10.74/10.97 53 [] {-} group_element(e_1).
% 10.74/10.97 54 [] {-} group_element(e_2).
% 10.74/10.97 55 [] {-} group_element(e_3).
% 10.74/10.97 56 [] {-} product1(A,A,A).
% 10.74/10.97 57 [] {-} product2(A,A,A).
% 10.74/10.97 92 [hyper,54,17,53] {-} product2(e_1,e_2,e_1)|product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 10.74/10.97 112 [hyper,55,13,54] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_2)|product1(e_2,e_3,e_3).
% 10.74/10.97 113 [hyper,55,13,53] {-} product1(e_1,e_3,e_1)|product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3).
% 10.74/10.97 4759 [hyper,92,19,57,unit_del,8] {-} product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 10.74/10.97 4767 [hyper,4759,20,57,unit_del,8] {-} product2(e_1,e_2,e_3).
% 10.74/10.97 6843 [hyper,112,15,56,unit_del,12] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_3).
% 10.74/10.97 6853 [hyper,6843,16,56,unit_del,12] {-} product1(e_2,e_3,e_1).
% 10.74/10.97 6972 [hyper,113,16,6853,unit_del,8] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3).
% 10.74/10.97 6988 [hyper,6972,16,56,unit_del,10] {-} product1(e_1,e_3,e_2).
% 10.74/10.97 6989 [hyper,6988,21,6853] {-} product2(e_2,e_2,e_3).
% 10.74/10.97 7028 [hyper,6989,20,4767,flip.1] {-} equalish(e_2,e_1).
% 10.74/10.97 7030 [binary,7028.1,8.1] {-} $F.
% 10.74/10.97
% 10.74/10.97 % SZS output end Refutation
% 10.74/10.97 ------------ end of proof -------------
% 10.74/10.97
% 10.74/10.97
% 10.74/10.97 Search stopped by max_proofs option.
% 10.74/10.97
% 10.74/10.97
% 10.74/10.97 Search stopped by max_proofs option.
% 10.74/10.97
% 10.74/10.97 ============ end of search ============
% 10.74/10.97
% 10.74/10.97 That finishes the proof of the theorem.
% 10.74/10.97
% 10.74/10.97 Process 5677 finished Mon Jun 13 05:33:39 2022
%------------------------------------------------------------------------------