TSTP Solution File: GRP123-4.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP123-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:28 EDT 2022
% Result : Unsatisfiable 5.72s 5.98s
% Output : Refutation 5.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP123-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n024.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 18:39:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n024.cluster.edu,
% 0.12/0.35 Mon Jun 13 18:39:48 2022
% 0.12/0.35 The command was "./sos". The process ID is 11195.
% 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 4 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.35 Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.12/0.35 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 21
% 0.12/0.40 number of clauses initially in problem: 25
% 0.12/0.40 percentage of clauses intially in UL: 84
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 6
% 0.12/0.40 distinct predicate count: 3
% 0.12/0.40 distinct function count: 0
% 0.12/0.40 distinct constant count: 3
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 5.72/5.98
% 5.72/5.98 -------- PROOF --------
% 5.72/5.98 % SZS status Unsatisfiable
% 5.72/5.98 % SZS output start Refutation
% 5.72/5.98
% 5.72/5.98 Model 3 (0.00 seconds, 0 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on number of solutions
% 5.72/5.98
% 5.72/5.98 Model 4 (0.00 seconds, 0 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on number of solutions
% 5.72/5.98
% 5.72/5.98 Model 5 [ 2 1 193 ] (0.00 seconds, 103378 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 6 [ 2 0 894 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 7 [ 3 6 119449 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 8 [ 2 1 10321 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 9 [ 2 2 32353 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 10 [ 3 1 34817 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 11 [ 3 1 379 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Model 12 [ 2 12 100729 ] (0.00 seconds, 118138 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 13 [ 4 0 2321 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 14 [ 5 1 175 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 15 [ 5 12 175228 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 16 [ 5 12 98590 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 17 [ 3 4 35392 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 Stopped by limit on insertions
% 5.72/5.98
% 5.72/5.98 Model 18 [ 7 1 447 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 ----> UNIT CONFLICT at 5.60 sec ----> 1298 [binary,1296.1,8.1] {-} $F.
% 5.72/5.98
% 5.72/5.98 Length of proof is 10. Level of proof is 4.
% 5.72/5.98
% 5.72/5.98 ---------------- PROOF ----------------
% 5.72/5.98 % SZS status Unsatisfiable
% 5.72/5.98 % SZS output start Refutation
% 5.72/5.98
% 5.72/5.98 2 [] {+} -group_element(A)| -group_element(B)|product(A,e_1,B)|product(A,e_2,B)|product(A,e_3,B).
% 5.72/5.98 3 [] {-} -equalish(e_1,e_2).
% 5.72/5.98 4 [copy,3,flip.1] {+} -equalish(e_2,e_1).
% 5.72/5.98 7 [] {-} -equalish(e_2,e_3).
% 5.72/5.98 8 [copy,7,flip.1] {+} -equalish(e_3,e_2).
% 5.72/5.98 10 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 5.72/5.98 12 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 5.72/5.98 14 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,B,A)| -product(F,E,D)|equalish(B,E).
% 5.72/5.98 24 [factor,14.2.4] {+} -product(A,B,C)| -product(C,D,C)| -product(C,B,A)|equalish(B,D).
% 5.72/5.98 25 [] {+} group_element(e_1).
% 5.72/5.98 26 [] {+} group_element(e_2).
% 5.72/5.98 28 [] {+} product(A,A,A).
% 5.72/5.98 40 [hyper,26,2,25] {-} product(e_1,e_1,e_2)|product(e_1,e_2,e_2)|product(e_1,e_3,e_2).
% 5.72/5.98 41 [hyper,26,2,25] {+} product(e_2,e_1,e_1)|product(e_2,e_2,e_1)|product(e_2,e_3,e_1).
% 5.72/5.98 1195 [hyper,40,10,28,unit_del,4] {-} product(e_1,e_2,e_2)|product(e_1,e_3,e_2).
% 5.72/5.98 1222 [hyper,1195,12,28,unit_del,4] {+} product(e_1,e_3,e_2).
% 5.72/5.98 1292 [hyper,41,10,28,unit_del,4] {-} product(e_2,e_1,e_1)|product(e_2,e_3,e_1).
% 5.72/5.98 1294 [hyper,1292,12,28,unit_del,4] {+} product(e_2,e_3,e_1).
% 5.72/5.98 1296 [hyper,1294,24,1222,28] {-} equalish(e_3,e_2).
% 5.72/5.98 1298 [binary,1296.1,8.1] {-} $F.
% 5.72/5.98
% 5.72/5.98 % SZS output end Refutation
% 5.72/5.98 ------------ end of proof -------------
% 5.72/5.98
% 5.72/5.98
% 5.72/5.98 Search stopped by max_proofs option.
% 5.72/5.98
% 5.72/5.98
% 5.72/5.98 Search stopped by max_proofs option.
% 5.72/5.98
% 5.72/5.98 ============ end of search ============
% 5.72/5.98
% 5.72/5.98 ----------- soft-scott stats ----------
% 5.72/5.98
% 5.72/5.98 true clauses given 19 (44.2%)
% 5.72/5.98 false clauses given 24
% 5.72/5.98
% 5.72/5.98 FALSE TRUE
% 5.72/5.98 4 1 0
% 5.72/5.98 6 0 1
% 5.72/5.98 10 1 32
% 5.72/5.98 12 20 13
% 5.72/5.98 14 0 162
% 5.72/5.98 16 8 28
% 5.72/5.98 18 6 232
% 5.72/5.98 20 4 14
% 5.72/5.98 22 0 282
% 5.72/5.98 26 0 178
% 5.72/5.98 30 0 122
% 5.72/5.98 34 0 8
% 5.72/5.98 tot: 40 1072 (96.4% true)
% 5.72/5.98
% 5.72/5.98
% 5.72/5.98 Model 18 [ 7 1 447 ] (0.00 seconds, 250000 Inserts)
% 5.72/5.98
% 5.72/5.98 That finishes the proof of the theorem.
% 5.72/5.98
% 5.72/5.98 Process 11195 finished Mon Jun 13 18:39:54 2022
%------------------------------------------------------------------------------