TSTP Solution File: GRP132-1.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP132-1.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:49 EDT 2022
% Result : Unsatisfiable 9.00s 9.19s
% Output : Refutation 9.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP132-1.002 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 12:09:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n011.cluster.edu,
% 0.12/0.35 Mon Jun 13 12:09:33 2022
% 0.12/0.35 The command was "./sos". The process ID is 2884.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 Following clause subsumed by 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 19
% 0.18/0.38 number of clauses initially in problem: 21
% 0.18/0.38 percentage of clauses intially in UL: 90
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 5
% 0.18/0.38 distinct predicate count: 3
% 0.18/0.38 distinct function count: 0
% 0.18/0.38 distinct constant count: 2
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 9.00/9.19
% 9.00/9.19 -------- PROOF --------
% 9.00/9.19 % SZS status Unsatisfiable
% 9.00/9.19 % SZS output start Refutation
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 3 [ 1 1 57 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 4 [ 1 0 85 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 5 [ 1 0 1669 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 6 [ 1 0 66 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 7 [ 2 0 108 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 8 [ 2 1 109 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 9 [ 2 1 232 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 10 [ 2 1 4187 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 11 [ 3 1 118 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 12 [ 3 0 2240 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 13 [ 4 0 85 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 14 [ 4 0 140 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 15 [ 4 1 138 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 16 [ 5 0 78 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 17 [ 5 1 90 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 18 [ 7 1 82 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 Stopped by limit on insertions
% 9.00/9.19
% 9.00/9.19 Model 19 [ 6 0 121 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 ----> UNIT CONFLICT at 8.81 sec ----> 1492 [binary,1490.1,2.1] {+} $F.
% 9.00/9.19
% 9.00/9.19 Length of proof is 19. Level of proof is 6.
% 9.00/9.19
% 9.00/9.19 ---------------- PROOF ----------------
% 9.00/9.19 % SZS status Unsatisfiable
% 9.00/9.19 % SZS output start Refutation
% 9.00/9.19
% 9.00/9.19 1 [] {-} -equalish(e_1,e_2).
% 9.00/9.19 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 9.00/9.19 3 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 9.00/9.19 5 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 9.00/9.19 6 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 9.00/9.19 7 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(A,D).
% 9.00/9.19 8 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(B,E).
% 9.00/9.19 9 [factor,3.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2).
% 9.00/9.19 16 [factor,7.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(A,C).
% 9.00/9.19 20 [factor,8.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(B,C).
% 9.00/9.19 21 [] {+} group_element(e_1).
% 9.00/9.19 22 [] {+} group_element(e_2).
% 9.00/9.19 23 [hyper,21,9] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 9.00/9.19 37 [hyper,22,9] {+} product(e_2,e_2,e_1)|product(e_2,e_2,e_2).
% 9.00/9.19 38 [hyper,22,3,21] {+} product(e_1,e_2,e_1)|product(e_1,e_2,e_2).
% 9.00/9.19 39 [hyper,22,3,21] {+} product(e_2,e_1,e_1)|product(e_2,e_1,e_2).
% 9.00/9.19 328 [hyper,39,6,23,unit_del,2] {+} product(e_2,e_1,e_1)|product(e_1,e_1,e_1).
% 9.00/9.19 329 [hyper,39,5,37,unit_del,2] {+} product(e_2,e_1,e_1)|product(e_2,e_2,e_1).
% 9.00/9.19 436 [hyper,38,6,37,unit_del,2] {+} product(e_1,e_2,e_2)|product(e_2,e_2,e_2).
% 9.00/9.19 437 [hyper,38,5,23,unit_del,2] {+} product(e_1,e_2,e_2)|product(e_1,e_1,e_2).
% 9.00/9.19 443 [hyper,38,6,37,unit_del,2] {+} product(e_1,e_2,e_1)|product(e_2,e_2,e_1).
% 9.00/9.19 548 [hyper,328,20,23,37,unit_del,2,factor_simp] {+} product(e_1,e_1,e_1)|product(e_2,e_2,e_1).
% 9.00/9.19 551 [hyper,328,5,38,unit_del,2] {+} product(e_2,e_1,e_1)|product(e_1,e_2,e_2).
% 9.00/9.19 1248 [hyper,548,16,329,443,unit_del,2,factor_simp,factor_simp] {+} product(e_2,e_2,e_1).
% 9.00/9.19 1249 [hyper,548,5,328,unit_del,2,factor_simp] {+} product(e_1,e_1,e_1).
% 9.00/9.19 1349 [hyper,551,20,437,436,unit_del,2,factor_simp,factor_simp] {+} product(e_1,e_2,e_2).
% 9.00/9.19 1490 [hyper,1249,20,1248,1349] {-} equalish(e_2,e_1).
% 9.00/9.19 1492 [binary,1490.1,2.1] {+} $F.
% 9.00/9.19
% 9.00/9.19 % SZS output end Refutation
% 9.00/9.19 ------------ end of proof -------------
% 9.00/9.19
% 9.00/9.19
% 9.00/9.19 Search stopped by max_proofs option.
% 9.00/9.19
% 9.00/9.19
% 9.00/9.19 Search stopped by max_proofs option.
% 9.00/9.19
% 9.00/9.19 ============ end of search ============
% 9.00/9.19
% 9.00/9.19 ----------- soft-scott stats ----------
% 9.00/9.19
% 9.00/9.19 true clauses given 9 (32.1%)
% 9.00/9.19 false clauses given 19
% 9.00/9.19
% 9.00/9.19 FALSE TRUE
% 9.00/9.19 3 0 1
% 9.00/9.19 4 2 1
% 9.00/9.19 8 1 0
% 9.00/9.19 10 3 4
% 9.00/9.19 12 11 11
% 9.00/9.19 14 0 23
% 9.00/9.19 16 6 56
% 9.00/9.19 18 1 59
% 9.00/9.19 20 4 54
% 9.00/9.19 22 0 85
% 9.00/9.19 24 0 12
% 9.00/9.19 26 0 148
% 9.00/9.19 30 0 20
% 9.00/9.19 tot: 28 474 (94.4% true)
% 9.00/9.19
% 9.00/9.19
% 9.00/9.19 Model 19 [ 6 0 121 ] (0.00 seconds, 250000 Inserts)
% 9.00/9.19
% 9.00/9.19 That finishes the proof of the theorem.
% 9.00/9.19
% 9.00/9.19 Process 2884 finished Mon Jun 13 12:09:42 2022
%------------------------------------------------------------------------------