TSTP Solution File: GRP131-1.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP131-1.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 8.10s 8.27s
% Output : Refutation 8.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP131-1.002 : TPTP v8.1.0. Released v1.2.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n025.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 10:04:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n025.cluster.edu,
% 0.14/0.38 Tue Jun 14 10:04:39 2022
% 0.14/0.38 The command was "./sos". The process ID is 1283.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.14/0.38
% 0.14/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.38 clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: set(unit_deletion).
% 0.14/0.38 dependent: set(factor).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38 Following clause subsumed by 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 15
% 0.21/0.41 number of clauses initially in problem: 17
% 0.21/0.41 percentage of clauses intially in UL: 88
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 5
% 0.21/0.41 distinct predicate count: 3
% 0.21/0.41 distinct function count: 0
% 0.21/0.41 distinct constant count: 2
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 8.10/8.27
% 8.10/8.27 -------- PROOF --------
% 8.10/8.27 % SZS status Unsatisfiable
% 8.10/8.27 % SZS output start Refutation
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 3 [ 1 1 61 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 4 [ 1 1 57 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 5 [ 1 1 95 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 6 [ 1 1 98 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 7 [ 2 0 111 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 8 [ 2 1 75 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 9 [ 3 1 78 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 10 [ 3 0 59 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 11 [ 3 1 303 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 12 [ 3 0 163 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 13 [ 4 0 130 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 14 [ 4 0 94 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 15 [ 5 0 108 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 16 [ 5 0 165 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 Stopped by limit on insertions
% 8.10/8.27
% 8.10/8.27 Model 17 [ 6 1 7965 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 ----> UNIT CONFLICT at 7.87 sec ----> 1174 [binary,1172.1,2.1] {+} $F.
% 8.10/8.27
% 8.10/8.27 Length of proof is 14. Level of proof is 7.
% 8.10/8.27
% 8.10/8.27 ---------------- PROOF ----------------
% 8.10/8.27 % SZS status Unsatisfiable
% 8.10/8.27 % SZS output start Refutation
% 8.10/8.27
% 8.10/8.27 1 [] {-} -equalish(e_1,e_2).
% 8.10/8.27 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 8.10/8.27 3 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 8.10/8.27 5 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 8.10/8.27 6 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 8.10/8.27 8 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,B,A)| -product(F,E,D)|equalish(B,E).
% 8.10/8.27 9 [factor,3.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2).
% 8.10/8.27 16 [factor,8.2.4] {+} -product(A,B,C)| -product(C,D,C)| -product(C,B,A)|equalish(B,D).
% 8.10/8.27 17 [] {+} group_element(e_1).
% 8.10/8.27 18 [] {+} group_element(e_2).
% 8.10/8.27 19 [hyper,17,9] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 8.10/8.27 29 [hyper,18,9] {+} product(e_2,e_2,e_1)|product(e_2,e_2,e_2).
% 8.10/8.27 30 [hyper,18,3,17] {+} product(e_1,e_2,e_1)|product(e_1,e_2,e_2).
% 8.10/8.27 31 [hyper,18,3,17] {+} product(e_2,e_1,e_1)|product(e_2,e_1,e_2).
% 8.10/8.27 294 [hyper,31,16,31,29,unit_del,2,factor_simp] {+} product(e_2,e_1,e_1)|product(e_2,e_2,e_1).
% 8.10/8.27 296 [hyper,31,6,19,unit_del,2] {+} product(e_2,e_1,e_1)|product(e_1,e_1,e_1).
% 8.10/8.27 452 [hyper,294,16,19,29,unit_del,2,factor_simp] {+} product(e_2,e_2,e_1)|product(e_1,e_1,e_1).
% 8.10/8.27 455 [hyper,294,16,30,31,unit_del,2,factor_simp] {+} product(e_2,e_1,e_1)|product(e_1,e_2,e_1).
% 8.10/8.27 966 [hyper,452,5,296,unit_del,2,factor_simp] {+} product(e_1,e_1,e_1).
% 8.10/8.27 1140 [hyper,966,16,966,455,unit_del,2] {+} product(e_2,e_1,e_1).
% 8.10/8.27 1172 [hyper,1140,6,966,flip.1] {-} equalish(e_2,e_1).
% 8.10/8.27 1174 [binary,1172.1,2.1] {+} $F.
% 8.10/8.27
% 8.10/8.27 % SZS output end Refutation
% 8.10/8.27 ------------ end of proof -------------
% 8.10/8.27
% 8.10/8.27
% 8.10/8.27 Search stopped by max_proofs option.
% 8.10/8.27
% 8.10/8.27
% 8.10/8.27 Search stopped by max_proofs option.
% 8.10/8.27
% 8.10/8.27 ============ end of search ============
% 8.10/8.27
% 8.10/8.27 ----------- soft-scott stats ----------
% 8.10/8.27
% 8.10/8.27 true clauses given 5 (20.8%)
% 8.10/8.27 false clauses given 19
% 8.10/8.27
% 8.10/8.27 FALSE TRUE
% 8.10/8.27 3 0 1
% 8.10/8.27 4 3 1
% 8.10/8.27 7 0 1
% 8.10/8.27 8 0 1
% 8.10/8.27 10 4 3
% 8.10/8.27 12 9 3
% 8.10/8.27 14 0 18
% 8.10/8.27 16 24 28
% 8.10/8.27 18 7 72
% 8.10/8.27 20 23 33
% 8.10/8.27 22 14 57
% 8.10/8.27 24 10 14
% 8.10/8.27 26 14 108
% 8.10/8.27 30 4 10
% 8.10/8.27 tot: 112 350 (75.8% true)
% 8.10/8.27
% 8.10/8.27
% 8.10/8.27 Model 17 [ 6 1 7965 ] (0.00 seconds, 250000 Inserts)
% 8.10/8.27
% 8.10/8.27 That finishes the proof of the theorem.
% 8.10/8.27
% 8.10/8.27 Process 1283 finished Tue Jun 14 10:04:47 2022
%------------------------------------------------------------------------------