TSTP Solution File: GRP124-7.004 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP124-7.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:33 EDT 2022
% Result : Unsatisfiable 4.06s 4.28s
% Output : Refutation 4.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP124-7.004 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n015.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.34 % DateTime : Mon Jun 13 22:49:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n015.cluster.edu,
% 0.13/0.35 Mon Jun 13 22:49:38 2022
% 0.13/0.35 The command was "./sos". The process ID is 4072.
% 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 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.35 Following clause subsumed by 5 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.35 Following clause subsumed by 9 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.35 Following clause subsumed by 7 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.13/0.35 Following clause subsumed by 11 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.13/0.35 Following clause subsumed by 13 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 46 back subsumes 31.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 24
% 0.13/0.39 number of clauses initially in problem: 39
% 0.13/0.39 percentage of clauses intially in UL: 61
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 11
% 0.13/0.39 distinct predicate count: 7
% 0.13/0.39 distinct function count: 0
% 0.13/0.39 distinct constant count: 4
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 4.06/4.28
% 4.06/4.28 -------- PROOF --------
% 4.06/4.28 % SZS status Unsatisfiable
% 4.06/4.28 % SZS output start Refutation
% 4.06/4.28
% 4.06/4.28 Model 3 (0.00 seconds, 0 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on number of solutions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 4 [ 1 1 8929 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 5 [ 2 1 225 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 6 [ 3 0 172 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 7 [ 3 2 23769 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 8 [ 3 1 2177 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 9 [ 3 1 343 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 10 [ 4 1 344 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Stopped by limit on insertions
% 4.06/4.28
% 4.06/4.28 Model 11 [ 17 1 1426 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 ----> UNIT CONFLICT at 3.89 sec ----> 2161 [binary,2159.1,9.1] {-} $F.
% 4.06/4.28
% 4.06/4.28 Length of proof is 40. Level of proof is 14.
% 4.06/4.28
% 4.06/4.28 ---------------- PROOF ----------------
% 4.06/4.28 % SZS status Unsatisfiable
% 4.06/4.28 % SZS output start Refutation
% 4.06/4.28
% 4.06/4.28 2 [] {-} -equalish(e_1,e_2).
% 4.06/4.28 3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 4.06/4.28 4 [] {-} -equalish(e_1,e_3).
% 4.06/4.28 5 [copy,4,flip.1] {+} -equalish(e_3,e_1).
% 4.06/4.28 6 [] {-} -equalish(e_1,e_4).
% 4.06/4.28 7 [copy,6,flip.1] {+} -equalish(e_4,e_1).
% 4.06/4.28 8 [] {-} -equalish(e_2,e_3).
% 4.06/4.28 9 [copy,8,flip.1] {+} -equalish(e_3,e_2).
% 4.06/4.28 10 [] {-} -equalish(e_2,e_4).
% 4.06/4.28 11 [copy,10,flip.1] {+} -equalish(e_4,e_2).
% 4.06/4.28 14 [] {+} -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.06/4.28 16 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 4.06/4.28 17 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 4.06/4.28 18 [] {+} -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.06/4.28 19 [] {+} -product2(A,B,C)| -product2(A,B,D)|equalish(C,D).
% 4.06/4.28 20 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 4.06/4.28 21 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 4.06/4.28 22 [] {+} -product1(A,B,C)| -product1(C,A,D)|product2(D,B,A).
% 4.06/4.28 41 [] {+} group_element(e_1).
% 4.06/4.28 42 [] {+} group_element(e_2).
% 4.06/4.28 43 [] {+} group_element(e_3).
% 4.06/4.28 45 [] {-} product1(A,A,A).
% 4.06/4.28 46 [] {-} product2(A,A,A).
% 4.06/4.28 67 [hyper,42,14,41] {-} 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.06/4.28 68 [hyper,42,14,41] {-} 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.06/4.28 75 [hyper,43,18,42] {-} 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.06/4.28 76 [hyper,43,18,41] {-} 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.06/4.28 79 [hyper,43,14,42] {-} 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.06/4.28 80 [hyper,43,14,41] {-} 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.06/4.28 339 [hyper,67,16,45,unit_del,3] {-} product1(e_1,e_2,e_2)|product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 4.06/4.28 387 [hyper,339,17,45,unit_del,3] {-} product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 4.06/4.28 452 [hyper,68,17,45,unit_del,3] {-} product1(e_2,e_1,e_2)|product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 4.06/4.28 488 [hyper,452,16,45,unit_del,3] {-} product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 4.06/4.28 537 [hyper,75,20,46,unit_del,9] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_3)|product2(e_2,e_3,e_4).
% 4.06/4.28 543 [hyper,537,21,46,unit_del,9] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_4).
% 4.06/4.28 669 [hyper,76,20,46,unit_del,5] {-} product2(e_1,e_3,e_2)|product2(e_1,e_3,e_3)|product2(e_1,e_3,e_4).
% 4.06/4.28 676 [hyper,669,21,46,unit_del,5] {-} product2(e_1,e_3,e_2)|product2(e_1,e_3,e_4).
% 4.06/4.28 713 [hyper,676,21,543,unit_del,3] {-} product2(e_1,e_3,e_2)|product2(e_2,e_3,e_1).
% 4.06/4.28 1175 [hyper,79,16,45,unit_del,9] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_3)|product1(e_2,e_3,e_4).
% 4.06/4.28 1183 [hyper,1175,17,45,unit_del,9] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_4).
% 4.06/4.28 1201 [hyper,1183,22,387] {-} product1(e_2,e_3,e_4)|product2(e_3,e_3,e_2)|product1(e_1,e_2,e_4).
% 4.06/4.28 1203 [hyper,1183,16,488,unit_del,5] {-} product1(e_2,e_3,e_1)|product1(e_2,e_1,e_3).
% 4.06/4.28 1391 [hyper,1201,19,46,unit_del,9] {-} product1(e_2,e_3,e_4)|product1(e_1,e_2,e_4).
% 4.06/4.28 1394 [hyper,1391,16,488,unit_del,5] {-} product1(e_1,e_2,e_4)|product1(e_2,e_1,e_3).
% 4.06/4.28 1806 [hyper,80,16,45,unit_del,5] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3)|product1(e_1,e_3,e_4).
% 4.06/4.28 1846 [hyper,1806,17,45,unit_del,5] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_4).
% 4.06/4.28 1870 [hyper,1846,17,1391,unit_del,3] {-} product1(e_1,e_3,e_2)|product1(e_1,e_2,e_4).
% 4.06/4.28 1923 [hyper,1870,22,1394,factor_simp] {-} product1(e_1,e_2,e_4)|product2(e_3,e_3,e_1).
% 4.06/4.28 1925 [hyper,1870,16,1846,unit_del,9,factor_simp] {-} product1(e_1,e_3,e_2).
% 4.06/4.28 1926 [hyper,1925,22,1203] {-} product2(e_3,e_3,e_1)|product1(e_2,e_3,e_1).
% 4.06/4.28 1927 [hyper,1925,22,488] {-} product2(e_4,e_3,e_1)|product1(e_2,e_1,e_3).
% 4.06/4.28 1974 [hyper,1923,19,46,unit_del,5] {-} product1(e_1,e_2,e_4).
% 4.06/4.28 2006 [hyper,1926,19,46,unit_del,5] {-} product1(e_2,e_3,e_1).
% 4.06/4.28 2007 [hyper,2006,22,1974] {-} product2(e_4,e_3,e_2).
% 4.06/4.28 2044 [hyper,2007,21,713,unit_del,7] {-} product2(e_2,e_3,e_1).
% 4.06/4.28 2135 [hyper,1927,21,2044,unit_del,11] {-} product1(e_2,e_1,e_3).
% 4.06/4.28 2136 [hyper,2135,22,1925] {+} product2(e_3,e_3,e_1).
% 4.06/4.28 2159 [hyper,2136,21,2044,flip.1] {-} equalish(e_3,e_2).
% 4.06/4.28 2161 [binary,2159.1,9.1] {-} $F.
% 4.06/4.28
% 4.06/4.28 % SZS output end Refutation
% 4.06/4.28 ------------ end of proof -------------
% 4.06/4.28
% 4.06/4.28
% 4.06/4.28 Search stopped by max_proofs option.
% 4.06/4.28
% 4.06/4.28
% 4.06/4.28 Search stopped by max_proofs option.
% 4.06/4.28
% 4.06/4.28 ============ end of search ============
% 4.06/4.28
% 4.06/4.28 ----------- soft-scott stats ----------
% 4.06/4.28
% 4.06/4.28 true clauses given 25 (25.3%)
% 4.06/4.28 false clauses given 74
% 4.06/4.28
% 4.06/4.28 FALSE TRUE
% 4.06/4.28 10 5 10
% 4.06/4.28 11 26 76
% 4.06/4.28 12 77 103
% 4.06/4.28 14 0 72
% 4.06/4.28 15 0 162
% 4.06/4.28 16 112 81
% 4.06/4.28 18 0 54
% 4.06/4.28 19 0 108
% 4.06/4.28 tot: 220 666 (75.2% true)
% 4.06/4.28
% 4.06/4.28
% 4.06/4.28 Model 11 [ 17 1 1426 ] (0.00 seconds, 250000 Inserts)
% 4.06/4.28
% 4.06/4.28 That finishes the proof of the theorem.
% 4.06/4.28
% 4.06/4.28 Process 4072 finished Mon Jun 13 22:49:42 2022
%------------------------------------------------------------------------------