TSTP Solution File: GRP124-6.004 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP124-6.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 2.04s 2.23s
% Output : Refutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP124-6.004 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.32 % Computer : n023.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Mon Jun 13 14:17:36 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.17/0.34 ----- Otter 3.2, August 2001 -----
% 0.17/0.34 The process was started by sandbox on n023.cluster.edu,
% 0.17/0.34 Mon Jun 13 14:17:36 2022
% 0.17/0.34 The command was "./sos". The process ID is 23680.
% 0.17/0.34
% 0.17/0.34 set(prolog_style_variables).
% 0.17/0.34 set(auto).
% 0.17/0.34 dependent: set(auto1).
% 0.17/0.34 dependent: set(process_input).
% 0.17/0.34 dependent: clear(print_kept).
% 0.17/0.34 dependent: clear(print_new_demod).
% 0.17/0.34 dependent: clear(print_back_demod).
% 0.17/0.34 dependent: clear(print_back_sub).
% 0.17/0.34 dependent: set(control_memory).
% 0.17/0.34 dependent: assign(max_mem, 12000).
% 0.17/0.34 dependent: assign(pick_given_ratio, 4).
% 0.17/0.34 dependent: assign(stats_level, 1).
% 0.17/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.17/0.34 dependent: assign(sos_limit, 5000).
% 0.17/0.34 dependent: assign(max_weight, 60).
% 0.17/0.34 clear(print_given).
% 0.17/0.34
% 0.17/0.34 list(usable).
% 0.17/0.34
% 0.17/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.17/0.34
% 0.17/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.17/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.17/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.17/0.34 clauses in usable.
% 0.17/0.34
% 0.17/0.34 dependent: set(knuth_bendix).
% 0.17/0.34 dependent: set(para_from).
% 0.17/0.34 dependent: set(para_into).
% 0.17/0.34 dependent: clear(para_from_right).
% 0.17/0.34 dependent: clear(para_into_right).
% 0.17/0.34 dependent: set(para_from_vars).
% 0.17/0.34 dependent: set(eq_units_both_ways).
% 0.17/0.34 dependent: set(dynamic_demod_all).
% 0.17/0.34 dependent: set(dynamic_demod).
% 0.17/0.34 dependent: set(order_eq).
% 0.17/0.34 dependent: set(back_demod).
% 0.17/0.34 dependent: set(lrpo).
% 0.17/0.34 dependent: set(hyper_res).
% 0.17/0.34 dependent: set(unit_deletion).
% 0.17/0.34 dependent: set(factor).
% 0.17/0.34
% 0.17/0.34 ------------> process usable:
% 0.17/0.34 Following clause subsumed by 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.17/0.34 Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.17/0.34 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.17/0.34 Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.17/0.34 Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.17/0.34 Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.17/0.34
% 0.17/0.34 ------------> process sos:
% 0.17/0.34 36 back subsumes 30.
% 0.17/0.34
% 0.17/0.34 ======= end of input processing =======
% 0.17/0.36
% 0.17/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.36
% 0.17/0.36 Stopped by limit on number of solutions
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36 -------------- Softie stats --------------
% 0.17/0.36
% 0.17/0.36 UPDATE_STOP: 300
% 0.17/0.36 SFINDER_TIME_LIMIT: 2
% 0.17/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.36 number of clauses in intial UL: 23
% 0.17/0.36 number of clauses initially in problem: 29
% 0.17/0.36 percentage of clauses intially in UL: 79
% 0.17/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.17/0.36 percent of all initial clauses that are short: 100
% 0.17/0.36 absolute distinct symbol count: 8
% 0.17/0.36 distinct predicate count: 4
% 0.17/0.36 distinct function count: 0
% 0.17/0.36 distinct constant count: 4
% 0.17/0.36
% 0.17/0.36 ---------- no more Softie stats ----------
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36 =========== start of search ===========
% 2.04/2.23
% 2.04/2.23 -------- PROOF --------
% 2.04/2.23 % SZS status Unsatisfiable
% 2.04/2.23 % SZS output start Refutation
% 2.04/2.23
% 2.04/2.23 Model 2 (0.00 seconds, 0 Inserts)
% 2.04/2.23
% 2.04/2.23 Stopped by limit on number of solutions
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Model 3 [ 1 0 229 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Model 4 [ 2 1 190 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Stopped by limit on insertions
% 2.04/2.23
% 2.04/2.23 Model 5 [ 15 0 188 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.23
% 2.04/2.23 ----> UNIT CONFLICT at 1.87 sec ----> 1442 [binary,1440.1,8.1] {+} $F.
% 2.04/2.23
% 2.04/2.23 Length of proof is 39. Level of proof is 13.
% 2.04/2.23
% 2.04/2.23 ---------------- PROOF ----------------
% 2.04/2.23 % SZS status Unsatisfiable
% 2.04/2.23 % SZS output start Refutation
% 2.04/2.23
% 2.04/2.23 1 [] {-} -equalish(e_1,e_2).
% 2.04/2.23 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 2.04/2.23 3 [] {-} -equalish(e_1,e_3).
% 2.04/2.23 4 [copy,3,flip.1] {+} -equalish(e_3,e_1).
% 2.04/2.23 5 [] {-} -equalish(e_1,e_4).
% 2.04/2.23 6 [copy,5,flip.1] {+} -equalish(e_4,e_1).
% 2.04/2.23 7 [] {-} -equalish(e_2,e_3).
% 2.04/2.23 8 [copy,7,flip.1] {+} -equalish(e_3,e_2).
% 2.04/2.23 9 [] {-} -equalish(e_2,e_4).
% 2.04/2.23 10 [copy,9,flip.1] {+} -equalish(e_4,e_2).
% 2.04/2.23 13 [] {+} -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).
% 2.04/2.23 15 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 2.04/2.23 16 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 2.04/2.23 17 [] {+} -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).
% 2.04/2.23 18 [] {+} -product2(A,B,C)| -product2(A,B,D)|equalish(C,D).
% 2.04/2.23 19 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 2.04/2.23 20 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 2.04/2.23 21 [] {+} -product1(A,B,C)| -product1(C,A,D)|product2(D,B,A).
% 2.04/2.23 31 [] {+} group_element(e_1).
% 2.04/2.23 32 [] {+} group_element(e_2).
% 2.04/2.23 33 [] {+} group_element(e_3).
% 2.04/2.23 35 [] {-} product1(A,A,A).
% 2.04/2.23 36 [] {-} product2(A,A,A).
% 2.04/2.23 45 [hyper,32,13,31] {-} 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).
% 2.04/2.23 46 [hyper,32,13,31] {-} 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).
% 2.04/2.23 53 [hyper,33,17,32] {-} 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).
% 2.04/2.23 54 [hyper,33,17,31] {-} 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).
% 2.04/2.23 57 [hyper,33,13,32] {-} 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).
% 2.04/2.23 58 [hyper,33,13,31] {-} 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).
% 2.04/2.23 245 [hyper,45,15,35,unit_del,2] {-} product1(e_1,e_2,e_2)|product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 2.04/2.23 247 [hyper,245,16,35,unit_del,2] {-} product1(e_1,e_2,e_3)|product1(e_1,e_2,e_4).
% 2.04/2.23 312 [hyper,46,16,35,unit_del,2] {-} product1(e_2,e_1,e_2)|product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 2.04/2.23 316 [hyper,312,15,35,unit_del,2] {-} product1(e_2,e_1,e_3)|product1(e_2,e_1,e_4).
% 2.04/2.23 393 [hyper,53,19,36,unit_del,8] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_3)|product2(e_2,e_3,e_4).
% 2.04/2.23 396 [hyper,393,20,36,unit_del,8] {-} product2(e_2,e_3,e_1)|product2(e_2,e_3,e_4).
% 2.04/2.23 499 [hyper,54,19,36,unit_del,4] {-} product2(e_1,e_3,e_2)|product2(e_1,e_3,e_3)|product2(e_1,e_3,e_4).
% 2.04/2.23 517 [hyper,499,20,36,unit_del,4] {-} product2(e_1,e_3,e_2)|product2(e_1,e_3,e_4).
% 2.04/2.23 520 [hyper,517,20,396,unit_del,2] {-} product2(e_1,e_3,e_2)|product2(e_2,e_3,e_1).
% 2.04/2.23 787 [hyper,57,15,35,unit_del,8] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_3)|product1(e_2,e_3,e_4).
% 2.04/2.23 918 [hyper,58,15,35,unit_del,4] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3)|product1(e_1,e_3,e_4).
% 2.04/2.23 925 [hyper,787,16,35,unit_del,8] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_4).
% 2.04/2.23 929 [hyper,925,15,316,unit_del,4] {-} product1(e_2,e_3,e_1)|product1(e_2,e_1,e_3).
% 2.04/2.23 1019 [hyper,918,16,35,unit_del,4] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_4).
% 2.04/2.23 1041 [hyper,1019,16,925,unit_del,2] {-} product1(e_1,e_3,e_2)|product1(e_2,e_3,e_1).
% 2.04/2.23 1042 [hyper,1019,15,247,unit_del,8] {-} product1(e_1,e_3,e_2)|product1(e_1,e_2,e_3).
% 2.04/2.23 1091 [hyper,1041,21,929,factor_simp] {-} product1(e_2,e_3,e_1)|product2(e_3,e_3,e_1).
% 2.04/2.23 1131 [hyper,1042,21,1041,factor_simp] {-} product1(e_1,e_3,e_2)|product2(e_3,e_3,e_2).
% 2.04/2.23 1174 [hyper,1091,18,36,unit_del,4] {-} product1(e_2,e_3,e_1).
% 2.04/2.23 1192 [hyper,1174,21,247] {-} product2(e_3,e_3,e_2)|product1(e_1,e_2,e_4).
% 2.04/2.23 1217 [hyper,1131,18,36,unit_del,8] {-} product1(e_1,e_3,e_2).
% 2.04/2.23 1218 [hyper,1217,21,316] {-} product2(e_4,e_3,e_1)|product1(e_2,e_1,e_3).
% 2.04/2.23 1297 [hyper,1192,18,36,unit_del,8] {-} product1(e_1,e_2,e_4).
% 2.04/2.23 1298 [hyper,1297,21,1174] {-} product2(e_4,e_3,e_2).
% 2.04/2.23 1318 [hyper,1298,20,520,unit_del,6] {-} product2(e_2,e_3,e_1).
% 2.04/2.23 1406 [hyper,1218,20,1318,unit_del,10] {-} product1(e_2,e_1,e_3).
% 2.04/2.23 1407 [hyper,1406,21,1217] {+} product2(e_3,e_3,e_1).
% 2.04/2.23 1440 [hyper,1407,20,1318,flip.1] {-} equalish(e_3,e_2).
% 2.04/2.23 1442 [binary,1440.1,8.1] {+} $F.
% 2.04/2.23
% 2.04/2.23 % SZS output end Refutation
% 2.04/2.23 ------------ end of proof -------------
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Search stopped by max_proofs option.
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Search stopped by max_proofs option.
% 2.04/2.23
% 2.04/2.23 ============ end of search ============
% 2.04/2.23
% 2.04/2.23 ----------- soft-scott stats ----------
% 2.04/2.23
% 2.04/2.23 true clauses given 16 (20.8%)
% 2.04/2.23 false clauses given 61
% 2.04/2.23
% 2.04/2.23 FALSE TRUE
% 2.04/2.23 10 0 9
% 2.04/2.23 12 81 103
% 2.04/2.23 14 48 72
% 2.04/2.23 16 111 81
% 2.04/2.23 18 36 54
% 2.04/2.23 20 2 0
% 2.04/2.23 tot: 278 319 (53.4% true)
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Model 5 [ 15 0 188 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.23
% 2.04/2.23 That finishes the proof of the theorem.
% 2.04/2.23
% 2.04/2.23 Process 23680 finished Mon Jun 13 14:17:38 2022
%------------------------------------------------------------------------------