%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP130-4.003 : 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:48 EDT 2022
% Result : Unsatisfiable 1.06s 1.31s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP130-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n021.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 : Tue Jun 14 05:03:42 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 sandbox on n021.cluster.edu,
% 0.13/0.37 Tue Jun 14 05:03:42 2022
% 0.13/0.37 The command was "./sos". The process ID is 2866.
% 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 6 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.37 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.37 Following clause subsumed by 10 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.43
% 0.20/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 -------------- Softie stats --------------
% 0.20/0.43
% 0.20/0.43 UPDATE_STOP: 300
% 0.20/0.43 SFINDER_TIME_LIMIT: 2
% 0.20/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.43 number of clauses in intial UL: 21
% 0.20/0.43 number of clauses initially in problem: 24
% 0.20/0.43 percentage of clauses intially in UL: 87
% 0.20/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.43 percent of all initial clauses that are short: 100
% 0.20/0.43 absolute distinct symbol count: 6
% 0.20/0.43 distinct predicate count: 3
% 0.20/0.43 distinct function count: 0
% 0.20/0.43 distinct constant count: 3
% 0.20/0.43
% 0.20/0.43 ---------- no more Softie stats ----------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 =========== start of search ===========
% 1.06/1.31
% 1.06/1.31 -------- PROOF --------
% 1.06/1.31 % SZS status Unsatisfiable
% 1.06/1.31 % SZS output start Refutation
% 1.06/1.31
% 1.06/1.31 Model 2 (0.00 seconds, 0 Inserts)
% 1.06/1.31
% 1.06/1.31 Stopped by limit on number of solutions
% 1.06/1.31
% 1.06/1.31 Model 3 [ 1 3 14365 ] (0.00 seconds, 41865 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 4 [ 1 1 3869 ] (0.00 seconds, 33404 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 5 [ 2 2 13319 ] (0.00 seconds, 101659 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 6 [ 2 1 5625 ] (0.00 seconds, 28552 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 7 [ 2 0 138 ] (0.00 seconds, 62440 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 8 [ 2 5 29442 ] (0.00 seconds, 77146 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 9 [ 2 2 25581 ] (0.00 seconds, 152112 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 10 [ 2 6 66466 ] (0.00 seconds, 141859 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 11 [ 3 0 3838 ] (0.00 seconds, 18365 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 12 [ 5 0 501 ] (0.00 seconds, 28117 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 13 [ 4 1 9832 ] (0.00 seconds, 28440 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 14 [ 7 1 2288 ] (0.00 seconds, 6958 Inserts)
% 1.06/1.31
% 1.06/1.31 Model 15 [ 5 1 9570 ] (0.00 seconds, 64303 Inserts)
% 1.06/1.31
% 1.06/1.31 ----> UNIT CONFLICT at 0.92 sec ----> 432 [binary,430.1,6.1] {-} $F.
% 1.06/1.31
% 1.06/1.31 Length of proof is 22. Level of proof is 8.
% 1.06/1.31
% 1.06/1.31 ---------------- PROOF ----------------
% 1.06/1.31 % SZS status Unsatisfiable
% 1.06/1.31 % SZS output start Refutation
% 1.06/1.31
% 1.06/1.31 2 [] {+} -group_element(A)| -group_element(B)|product(A,e_1,B)|product(A,e_2,B)|product(A,e_3,B).
% 1.06/1.31 3 [] {+} product(A,B,C)| -product(D,B,A)| -product(A,C,D).
% 1.06/1.31 4 [] {+} product(A,B,C)| -product(C,D,A)| -product(A,D,B).
% 1.06/1.31 5 [] {-} -equalish(e_1,e_2).
% 1.06/1.31 6 [copy,5,flip.1] {+} -equalish(e_2,e_1).
% 1.06/1.31 9 [] {-} -equalish(e_2,e_3).
% 1.06/1.31 10 [copy,9,flip.1] {+} -equalish(e_3,e_2).
% 1.06/1.31 11 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 1.06/1.31 12 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 1.06/1.31 14 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 1.06/1.31 15 [] {+} -product(A,B,C)| -product(A,C,D)|product(D,B,A).
% 1.06/1.31 17 [factor,2.1.2] {+} -group_element(A)|product(A,e_1,A)|product(A,e_2,A)|product(A,e_3,A).
% 1.06/1.31 18 [factor,3.2.3] {+} product(A,B,B)| -product(A,B,A).
% 1.06/1.31 19 [factor,4.2.3] {+} product(A,A,A)| -product(A,B,A).
% 1.06/1.31 24 [factor,15.1.2] {+} -product(A,B,B)|product(B,B,A).
% 1.06/1.31 25 [] {+} group_element(e_1).
% 1.06/1.31 26 [] {+} group_element(e_2).
% 1.06/1.31 29 [hyper,25,17] {-} product(e_1,e_1,e_1)|product(e_1,e_2,e_1)|product(e_1,e_3,e_1).
% 1.06/1.31 35 [hyper,26,17] {-} product(e_2,e_1,e_2)|product(e_2,e_2,e_2)|product(e_2,e_3,e_2).
% 1.06/1.31 37 [hyper,26,11,25] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 1.06/1.31 39 [hyper,26,2,25] {-} product(e_1,e_1,e_2)|product(e_1,e_2,e_2)|product(e_1,e_3,e_2).
% 1.06/1.31 128 [hyper,29,19,factor_simp] {+} product(e_1,e_1,e_1)|product(e_1,e_3,e_1).
% 1.06/1.31 135 [hyper,128,19,factor_simp] {+} product(e_1,e_1,e_1).
% 1.06/1.31 236 [hyper,35,19,factor_simp] {+} product(e_2,e_2,e_2)|product(e_2,e_3,e_2).
% 1.06/1.31 244 [hyper,236,19,factor_simp] {+} product(e_2,e_2,e_2).
% 1.06/1.31 279 [hyper,37,18,factor_simp] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 1.06/1.31 284 [hyper,279,24] {-} product(e_1,e_2,e_3)|product(e_2,e_2,e_1).
% 1.06/1.31 314 [hyper,284,4,279,factor_simp] {-} product(e_1,e_2,e_3)|product(e_2,e_1,e_1).
% 1.06/1.31 336 [hyper,314,14,135,unit_del,6] {+} product(e_1,e_2,e_3).
% 1.06/1.31 388 [hyper,39,12,135,unit_del,6] {-} product(e_1,e_2,e_2)|product(e_1,e_3,e_2).
% 1.06/1.31 396 [hyper,388,12,336,unit_del,10] {+} product(e_1,e_3,e_2).
% 1.06/1.31 399 [hyper,396,15,336] {+} product(e_2,e_2,e_1).
% 1.06/1.31 430 [hyper,244,12,399,flip.1] {-} equalish(e_2,e_1).
% 1.06/1.31 432 [binary,430.1,6.1] {-} $F.
% 1.06/1.31
% 1.06/1.31 % SZS output end Refutation
% 1.06/1.31 ------------ end of proof -------------
% 1.06/1.31
% 1.06/1.31
% 1.06/1.31 Search stopped by max_proofs option.
% 1.06/1.31
% 1.06/1.31
% 1.06/1.31 Search stopped by max_proofs option.
% 1.06/1.31
% 1.06/1.31 ============ end of search ============
% 1.06/1.31
% 1.06/1.31 ----------- soft-scott stats ----------
% 1.06/1.31
% 1.06/1.31 true clauses given 6 (16.2%)
% 1.06/1.31 false clauses given 31
% 1.06/1.31
% 1.06/1.31 FALSE TRUE
% 1.06/1.31 4 3 0
% 1.06/1.31 8 2 0
% 1.06/1.31 10 1 2
% 1.06/1.31 12 29 22
% 1.06/1.31 14 24 24
% 1.06/1.31 18 9 9
% 1.06/1.31 tot: 68 57 (45.6% true)
% 1.06/1.31
% 1.06/1.31
% 1.06/1.31 Model 15 [ 5 1 9570 ] (0.00 seconds, 64303 Inserts)
% 1.06/1.31
% 1.06/1.31 That finishes the proof of the theorem.
% 1.06/1.31
% 1.06/1.31 Process 2866 finished Tue Jun 14 05:03:43 2022
%------------------------------------------------------------------------------