TSTP Solution File: GRP128-4.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP128-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:44 EDT 2022
% Result : Unsatisfiable 1.21s 1.41s
% Output : Refutation 1.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP128-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 12:36:14 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n013.cluster.edu,
% 0.14/0.37 Tue Jun 14 12:36:14 2022
% 0.14/0.37 The command was "./sos". The process ID is 14400.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37 Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.14/0.37 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.14/0.37 Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.20/0.44
% 0.20/0.44 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.44
% 0.20/0.44 Stopped by limit on number of solutions
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 -------------- Softie stats --------------
% 0.20/0.44
% 0.20/0.44 UPDATE_STOP: 300
% 0.20/0.44 SFINDER_TIME_LIMIT: 2
% 0.20/0.44 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.44 number of clauses in intial UL: 21
% 0.20/0.44 number of clauses initially in problem: 24
% 0.20/0.44 percentage of clauses intially in UL: 87
% 0.20/0.44 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.44 percent of all initial clauses that are short: 100
% 0.20/0.44 absolute distinct symbol count: 6
% 0.20/0.44 distinct predicate count: 3
% 0.20/0.44 distinct function count: 0
% 0.20/0.44 distinct constant count: 3
% 0.20/0.44
% 0.20/0.44 ---------- no more Softie stats ----------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 =========== start of search ===========
% 1.21/1.41
% 1.21/1.41 -------- PROOF --------
% 1.21/1.41 % SZS status Unsatisfiable
% 1.21/1.41 % SZS output start Refutation
% 1.21/1.41
% 1.21/1.41 Model 2 (0.00 seconds, 0 Inserts)
% 1.21/1.41
% 1.21/1.41 Stopped by limit on number of solutions
% 1.21/1.41
% 1.21/1.41 Model 3 [ 1 1 130 ] (0.00 seconds, 60866 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 4 [ 1 1 407 ] (0.00 seconds, 149203 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 5 [ 1 1 8310 ] (0.00 seconds, 53887 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 6 [ 2 1 13308 ] (0.00 seconds, 115300 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 7 [ 2 1 3610 ] (0.00 seconds, 31291 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 8 [ 2 2 15979 ] (0.00 seconds, 31489 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 9 [ 2 0 3602 ] (0.00 seconds, 104787 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 10 [ 2 1 6938 ] (0.00 seconds, 113332 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 11 [ 2 0 3574 ] (0.00 seconds, 70988 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 12 [ 3 1 9190 ] (0.00 seconds, 139916 Inserts)
% 1.21/1.41
% 1.21/1.41 Model 13 [ 5 2 14314 ] (0.00 seconds, 22998 Inserts)
% 1.21/1.41
% 1.21/1.41 ----> UNIT CONFLICT at 1.02 sec ----> 219 [binary,217.1,6.1] {-} $F.
% 1.21/1.41
% 1.21/1.41 Length of proof is 17. Level of proof is 8.
% 1.21/1.41
% 1.21/1.41 ---------------- PROOF ----------------
% 1.21/1.41 % SZS status Unsatisfiable
% 1.21/1.41 % SZS output start Refutation
% 1.21/1.41
% 1.21/1.41 3 [] {+} product(A,B,C)| -product(A,C,D)| -product(C,B,D).
% 1.21/1.41 5 [] {-} -equalish(e_1,e_2).
% 1.21/1.41 6 [copy,5,flip.1] {+} -equalish(e_2,e_1).
% 1.21/1.41 11 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 1.21/1.41 12 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 1.21/1.41 13 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 1.21/1.41 14 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 1.21/1.41 18 [factor,3.2.3] {+} product(A,A,A)| -product(A,A,B).
% 1.21/1.41 20 [factor,11.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2)|product(A,A,e_3).
% 1.21/1.41 25 [] {+} group_element(e_1).
% 1.21/1.41 26 [] {+} group_element(e_2).
% 1.21/1.41 28 [hyper,25,20] {-} product(e_1,e_1,e_1)|product(e_1,e_1,e_2)|product(e_1,e_1,e_3).
% 1.21/1.41 34 [hyper,26,20] {-} product(e_2,e_2,e_1)|product(e_2,e_2,e_2)|product(e_2,e_2,e_3).
% 1.21/1.41 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.21/1.41 38 [hyper,26,11,25] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 1.21/1.41 89 [hyper,28,18,factor_simp] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_3).
% 1.21/1.41 96 [hyper,89,18,factor_simp] {+} product(e_1,e_1,e_1).
% 1.21/1.41 119 [hyper,34,18,factor_simp] {+} product(e_2,e_2,e_2)|product(e_2,e_2,e_3).
% 1.21/1.41 138 [hyper,119,18,factor_simp] {+} product(e_2,e_2,e_2).
% 1.21/1.41 162 [hyper,37,13,96,unit_del,6] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 1.21/1.41 176 [hyper,162,14,138,unit_del,6] {+} product(e_1,e_2,e_3).
% 1.21/1.41 199 [hyper,38,14,96,unit_del,6] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 1.21/1.41 203 [hyper,199,13,138,unit_del,6] {+} product(e_2,e_1,e_3).
% 1.21/1.41 206 [hyper,203,3,176] {-} product(e_1,e_1,e_2).
% 1.21/1.41 217 [hyper,206,12,96,flip.1] {-} equalish(e_2,e_1).
% 1.21/1.41 219 [binary,217.1,6.1] {-} $F.
% 1.21/1.41
% 1.21/1.41 % SZS output end Refutation
% 1.21/1.41 ------------ end of proof -------------
% 1.21/1.41
% 1.21/1.41
% 1.21/1.41 Search stopped by max_proofs option.
% 1.21/1.41
% 1.21/1.41
% 1.21/1.41 Search stopped by max_proofs option.
% 1.21/1.41
% 1.21/1.41 ============ end of search ============
% 1.21/1.41
% 1.21/1.41 ----------- soft-scott stats ----------
% 1.21/1.41
% 1.21/1.41 true clauses given 5 (20.8%)
% 1.21/1.41 false clauses given 19
% 1.21/1.41
% 1.21/1.41 FALSE TRUE
% 1.21/1.41 3 0 2
% 1.21/1.41 4 1 0
% 1.21/1.41 10 0 2
% 1.21/1.41 12 18 29
% 1.21/1.41 14 24 32
% 1.21/1.41 18 10 11
% 1.21/1.41 tot: 53 76 (58.9% true)
% 1.21/1.41
% 1.21/1.41
% 1.21/1.41 Model 13 [ 5 -2 14314 ] (0.00 seconds, 22998 Inserts)
% 1.21/1.41
% 1.21/1.41 That finishes the proof of the theorem.
% 1.21/1.41
% 1.21/1.41 Process 14400 finished Tue Jun 14 12:36:15 2022
%------------------------------------------------------------------------------