TSTP Solution File: GRP132-2.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP132-2.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:50 EDT 2022
% Result : Unsatisfiable 8.32s 8.53s
% Output : Refutation 8.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP132-2.002 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n022.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 : Mon Jun 13 19:43:33 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 sandbox on n022.cluster.edu,
% 0.13/0.37 Mon Jun 13 19:43:33 2022
% 0.13/0.37 The command was "./sos". The process ID is 32518.
% 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 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 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: 20
% 0.13/0.41 number of clauses initially in problem: 24
% 0.13/0.41 percentage of clauses intially in UL: 83
% 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: 7
% 0.13/0.41 distinct predicate count: 5
% 0.13/0.41 distinct function count: 0
% 0.13/0.41 distinct constant count: 2
% 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 ===========
% 8.32/8.53
% 8.32/8.53 -------- PROOF --------
% 8.32/8.53 % SZS status Unsatisfiable
% 8.32/8.53 % SZS output start Refutation
% 8.32/8.53
% 8.32/8.53 Model 3 (0.00 seconds, 0 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on number of solutions
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 4 [ 1 1 329 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 5 [ 1 0 297 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 6 [ 2 1 184 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 7 [ 2 1 287 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 8 [ 2 4 238370 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 9 [ 3 1 212 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 10 [ 2 2 186498 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 11 [ 3 0 375 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 12 [ 3 1 277 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 13 [ 3 0 246 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 14 [ 3 1 170 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 15 [ 4 0 480 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 16 [ 4 0 443 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 Stopped by limit on insertions
% 8.32/8.53
% 8.32/8.53 Model 17 [ 6 1 190 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 ----> UNIT CONFLICT at 8.12 sec ----> 1769 [binary,1767.1,3.1] {-} $F.
% 8.32/8.53
% 8.32/8.53 Length of proof is 14. Level of proof is 6.
% 8.32/8.53
% 8.32/8.53 ---------------- PROOF ----------------
% 8.32/8.53 % SZS status Unsatisfiable
% 8.32/8.53 % SZS output start Refutation
% 8.32/8.53
% 8.32/8.53 2 [] {-} -equalish(e_1,e_2).
% 8.32/8.53 3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 8.32/8.53 4 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 8.32/8.53 6 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 8.32/8.53 7 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 8.32/8.53 9 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(B,E).
% 8.32/8.53 10 [factor,4.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2).
% 8.32/8.53 20 [factor,9.2.3] {+} -product(A,B,B)| -product(C,A,B)| -product(C,C,A)|equalish(B,A).
% 8.32/8.53 21 [factor,9.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(B,C).
% 8.32/8.53 24 [] {+} group_element(e_1).
% 8.32/8.53 25 [] {+} group_element(e_2).
% 8.32/8.53 52 [hyper,25,10] {+} product(e_2,e_2,e_1)|product(e_2,e_2,e_2).
% 8.32/8.53 66 [hyper,24,10] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 8.32/8.53 67 [hyper,24,4,25] {+} product(e_2,e_1,e_1)|product(e_2,e_1,e_2).
% 8.32/8.53 68 [hyper,24,4,25] {+} product(e_1,e_2,e_1)|product(e_1,e_2,e_2).
% 8.32/8.53 353 [hyper,66,7,67,unit_del,3] {+} product(e_1,e_1,e_1)|product(e_2,e_1,e_1).
% 8.32/8.53 455 [hyper,68,6,66,unit_del,3] {+} product(e_1,e_2,e_1)|product(e_1,e_1,e_1).
% 8.32/8.53 582 [hyper,52,7,68,unit_del,3] {+} product(e_2,e_2,e_1)|product(e_1,e_2,e_1).
% 8.32/8.53 1394 [hyper,455,20,353,66,unit_del,3,factor_simp,factor_simp] {+} product(e_1,e_1,e_1).
% 8.32/8.53 1724 [hyper,1394,21,582,68,unit_del,3,factor_simp] {+} product(e_1,e_2,e_1).
% 8.32/8.53 1767 [hyper,1724,6,1394,flip.1] {-} equalish(e_2,e_1).
% 8.32/8.53 1769 [binary,1767.1,3.1] {-} $F.
% 8.32/8.53
% 8.32/8.53 % SZS output end Refutation
% 8.32/8.53 ------------ end of proof -------------
% 8.32/8.53
% 8.32/8.53
% 8.32/8.53 Search stopped by max_proofs option.
% 8.32/8.53
% 8.32/8.53
% 8.32/8.53 Search stopped by max_proofs option.
% 8.32/8.53
% 8.32/8.53 ============ end of search ============
% 8.32/8.53
% 8.32/8.53 ----------- soft-scott stats ----------
% 8.32/8.53
% 8.32/8.53 true clauses given 8 (33.3%)
% 8.32/8.53 false clauses given 16
% 8.32/8.53
% 8.32/8.53 FALSE TRUE
% 8.32/8.53 3 0 1
% 8.32/8.53 4 3 1
% 8.32/8.53 7 0 4
% 8.32/8.53 8 0 1
% 8.32/8.53 10 5 1
% 8.32/8.53 11 13 4
% 8.32/8.53 12 14 1
% 8.32/8.53 14 8 8
% 8.32/8.53 15 30 41
% 8.32/8.53 16 18 34
% 8.32/8.53 18 3 1
% 8.32/8.53 19 23 117
% 8.32/8.53 20 35 67
% 8.32/8.53 23 20 135
% 8.32/8.53 24 10 14
% 8.32/8.53 27 4 201
% 8.32/8.53 31 0 22
% 8.32/8.53 tot: 186 653 (77.8% true)
% 8.32/8.53
% 8.32/8.53
% 8.32/8.53 Model 17 [ 6 1 190 ] (0.00 seconds, 250000 Inserts)
% 8.32/8.53
% 8.32/8.53 That finishes the proof of the theorem.
% 8.32/8.53
% 8.32/8.53 Process 32518 finished Mon Jun 13 19:43:41 2022
%------------------------------------------------------------------------------