TSTP Solution File: GRP128-1.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP128-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:42 EDT 2022
% Result : Unsatisfiable 35.04s 35.22s
% Output : Refutation 35.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP128-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.08/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 07:39:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n018.cluster.edu,
% 0.13/0.37 Tue Jun 14 07:39:43 2022
% 0.13/0.37 The command was "./sos". The process ID is 26608.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 Following clause subsumed by 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.37 Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.37 Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.41
% 0.13/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 -------------- Softie stats --------------
% 0.13/0.41
% 0.13/0.41 UPDATE_STOP: 300
% 0.13/0.41 SFINDER_TIME_LIMIT: 2
% 0.13/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.41 number of clauses in intial UL: 13
% 0.13/0.41 number of clauses initially in problem: 16
% 0.13/0.41 percentage of clauses intially in UL: 81
% 0.13/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.41 percent of all initial clauses that are short: 100
% 0.13/0.41 absolute distinct symbol count: 6
% 0.13/0.41 distinct predicate count: 3
% 0.13/0.41 distinct function count: 0
% 0.13/0.41 distinct constant count: 3
% 0.13/0.41
% 0.13/0.41 ---------- no more Softie stats ----------
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41 =========== start of search ===========
% 35.04/35.22
% 35.04/35.22 -- HEY sandbox2, WE HAVE A PROOF!! --
% 35.04/35.22
% 35.04/35.22 Model 3 (0.00 seconds, 0 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on number of solutions
% 35.04/35.22
% 35.04/35.22 Model 4 [ 1 0 296 ] (0.00 seconds, 136971 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 5 [ 1 0 470 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 6 [ 1 11 104599 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 7 [ 1 1 11414 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 8 [ 1 4 27978 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 9 [ 2 1 200 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 10 [ 2 0 83 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 11 [ 2 1 4049 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Stopped by limit on insertions
% 35.04/35.22
% 35.04/35.22 Model 12 [ 2 0 750 ] (0.00 seconds, 250000 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 13 [ 2 1 2219 ] (0.00 seconds, 38795 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 14 [ 3 1 1619 ] (0.00 seconds, 53986 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 15 [ 4 1 444 ] (0.00 seconds, 14463 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 16 [ 5 0 329 ] (0.00 seconds, 14888 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 17 [ 5 4 21052 ] (0.00 seconds, 132965 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 18 [ 6 1 830 ] (0.00 seconds, 11302 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 19 [ 6 0 1936 ] (0.00 seconds, 99986 Inserts)
% 35.04/35.22
% 35.04/35.22 Model 20 [ 9 1 3879 ] (0.00 seconds, 41629 Inserts)
% 35.04/35.22
% 35.04/35.22 ----> UNIT CONFLICT at 34.78 sec ----> 2454 [binary,2452.1,6.1] {-} $F.
% 35.04/35.22
% 35.04/35.22 Length of proof is 35. Level of proof is 13.
% 35.04/35.22
% 35.04/35.22 ---------------- PROOF ----------------
% 35.04/35.22 % SZS status Unsatisfiable
% 35.04/35.22 % SZS output start Refutation
% 35.04/35.22
% 35.04/35.22 1 [] {-} -equalish(e_1,e_2).
% 35.04/35.22 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 35.04/35.22 3 [] {-} -equalish(e_1,e_3).
% 35.04/35.22 4 [copy,3,flip.1] {+} -equalish(e_3,e_1).
% 35.04/35.22 5 [] {-} -equalish(e_2,e_3).
% 35.04/35.22 6 [copy,5,flip.1] {+} -equalish(e_3,e_2).
% 35.04/35.22 7 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 35.04/35.22 8 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 35.04/35.22 9 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 35.04/35.22 10 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 35.04/35.22 11 [] {+} -product(A,B,C)| -product(C,B,D)|product(A,C,D).
% 35.04/35.22 12 [factor,7.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2)|product(A,A,e_3).
% 35.04/35.22 16 [factor,11.1.2] {+} -product(A,B,A)|product(A,A,A).
% 35.04/35.22 17 [] {+} group_element(e_1).
% 35.04/35.22 18 [] {+} group_element(e_2).
% 35.04/35.22 19 [] {+} group_element(e_3).
% 35.04/35.22 25 [hyper,18,7,17] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 35.04/35.22 26 [hyper,18,7,17] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 35.04/35.22 30 [hyper,19,12] {-} product(e_3,e_3,e_1)|product(e_3,e_3,e_2)|product(e_3,e_3,e_3).
% 35.04/35.22 31 [hyper,19,7,18] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_2)|product(e_2,e_3,e_3).
% 35.04/35.22 32 [hyper,19,7,17] {-} product(e_1,e_3,e_1)|product(e_1,e_3,e_2)|product(e_1,e_3,e_3).
% 35.04/35.22 33 [hyper,19,7,18] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_2)|product(e_3,e_2,e_3).
% 35.04/35.22 233 [hyper,25,16] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_1,e_1).
% 35.04/35.22 366 [hyper,26,16] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_3)|product(e_2,e_2,e_2).
% 35.04/35.22 587 [hyper,31,16] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3)|product(e_2,e_2,e_2).
% 35.04/35.22 695 [hyper,32,16] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_1,e_1).
% 35.04/35.22 836 [hyper,33,16] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_2)|product(e_3,e_3,e_3).
% 35.04/35.22 1286 [hyper,366,9,26,unit_del,2,factor_simp,factor_simp] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_3).
% 35.04/35.22 1494 [hyper,587,9,31,unit_del,6,factor_simp,factor_simp] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3).
% 35.04/35.22 1505 [hyper,1494,9,1286,unit_del,4] {-} product(e_2,e_3,e_3)|product(e_2,e_1,e_3).
% 35.04/35.22 1664 [hyper,233,9,25,unit_del,2,factor_simp,factor_simp] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 35.04/35.22 1732 [hyper,695,9,32,unit_del,4,factor_simp,factor_simp] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3).
% 35.04/35.22 1749 [hyper,1732,10,1505,unit_del,2] {-} product(e_1,e_3,e_2)|product(e_2,e_1,e_3).
% 35.04/35.22 1750 [hyper,1732,10,1494,unit_del,2] {-} product(e_1,e_3,e_2)|product(e_2,e_3,e_1).
% 35.04/35.22 1752 [hyper,1732,9,1664,unit_del,6] {-} product(e_1,e_3,e_2)|product(e_1,e_2,e_2).
% 35.04/35.22 2015 [hyper,836,9,33,unit_del,6,factor_simp,factor_simp] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_2).
% 35.04/35.22 2035 [hyper,2015,10,1752,unit_del,4] {-} product(e_3,e_2,e_1)|product(e_1,e_3,e_2).
% 35.04/35.22 2101 [hyper,2035,11,1752,factor_simp] {-} product(e_1,e_3,e_2)|product(e_3,e_1,e_2).
% 35.04/35.22 2159 [hyper,2101,11,1749,factor_simp] {-} product(e_1,e_3,e_2)|product(e_2,e_3,e_2).
% 35.04/35.22 2217 [hyper,2159,8,1750,unit_del,2,factor_simp] {+} product(e_1,e_3,e_2).
% 35.04/35.22 2223 [hyper,2217,11,1494] {-} product(e_2,e_1,e_2)|product(e_2,e_3,e_3).
% 35.04/35.22 2227 [hyper,2217,10,30,unit_del,4] {+} product(e_3,e_3,e_1)|product(e_3,e_3,e_3).
% 35.04/35.22 2326 [hyper,2223,8,1505,unit_del,6,factor_simp] {+} product(e_2,e_3,e_3).
% 35.04/35.22 2404 [hyper,2227,10,2326,unit_del,6] {+} product(e_3,e_3,e_1).
% 35.04/35.22 2438 [hyper,2404,11,2326] {+} product(e_2,e_3,e_1).
% 35.04/35.22 2452 [hyper,2438,10,2404] {-} equalish(e_3,e_2).
% 35.04/35.22 2454 [binary,2452.1,6.1] {-} $F.
% 35.04/35.22
% 35.04/35.22 % SZS output end Refutation
% 35.04/35.22 ------------ end of proof -------------
% 35.04/35.22
% 35.04/35.22
% 35.04/35.22 Search stopped by max_proofs option.
% 35.04/35.22
% 35.04/35.22
% 35.04/35.22 Search stopped by max_proofs option.
% 35.04/35.22
% 35.04/35.22 ============ end of search ============
% 35.04/35.22
% 35.04/35.22 ----------- soft-scott stats ----------
% 35.04/35.22
% 35.04/35.22 true clauses given 27 (22.9%)
% 35.04/35.22 false clauses given 91
% 35.04/35.22
% 35.04/35.22 FALSE TRUE
% 35.04/35.22 4 2 0
% 35.04/35.22 8 2 0
% 35.04/35.22 12 38 19
% 35.04/35.22 14 0 100
% 35.04/35.22 16 7 11
% 35.04/35.22 18 6 227
% 35.04/35.22 20 32 13
% 35.04/35.22 22 0 168
% 35.04/35.22 26 4 14
% 35.04/35.22 tot: 91 552 (85.8% true)
% 35.04/35.22
% 35.04/35.22
% 35.04/35.22 Model 20 [ 9 1 3879 ] (0.00 seconds, 41629 Inserts)
% 35.04/35.22
% 35.04/35.22 That finishes the proof of the theorem.
% 35.04/35.22
% 35.04/35.22 Process 26608 finished Tue Jun 14 07:40:18 2022
%------------------------------------------------------------------------------