TSTP Solution File: GRP131-2.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP131-2.002 : TPTP v8.1.0. Released v1.2.0.
% 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:49 EDT 2022
% Result : Unsatisfiable 7.56s 7.75s
% Output : Refutation 7.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP131-2.002 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 11:54:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n024.cluster.edu,
% 0.12/0.36 Mon Jun 13 11:54:18 2022
% 0.12/0.36 The command was "./sos". The process ID is 22222.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 16
% 0.12/0.39 number of clauses initially in problem: 20
% 0.12/0.39 percentage of clauses intially in UL: 80
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 7
% 0.12/0.39 distinct predicate count: 5
% 0.12/0.39 distinct function count: 0
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 7.56/7.75
% 7.56/7.75 -------- PROOF --------
% 7.56/7.75 % SZS status Unsatisfiable
% 7.56/7.75 % SZS output start Refutation
% 7.56/7.75
% 7.56/7.75 Model 2 (0.00 seconds, 0 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on number of solutions
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 3 [ 1 1 155 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 4 [ 1 0 187 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 5 [ 1 0 144 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 6 [ 1 0 384 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 7 [ 1 1 184 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 8 [ 2 0 298 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 9 [ 3 0 133 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 10 [ 2 1 1946 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 11 [ 2 1 64123 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 12 [ 3 1 188 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 13 [ 3 0 135 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 14 [ 4 0 256 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 15 [ 5 0 194 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 16 [ 6 0 282 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 Stopped by limit on insertions
% 7.56/7.75
% 7.56/7.75 Model 17 [ 6 0 187 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 ----> UNIT CONFLICT at 7.35 sec ----> 1486 [binary,1484.1,3.1] {+} $F.
% 7.56/7.75
% 7.56/7.75 Length of proof is 14. Level of proof is 6.
% 7.56/7.75
% 7.56/7.75 ---------------- PROOF ----------------
% 7.56/7.75 % SZS status Unsatisfiable
% 7.56/7.75 % SZS output start Refutation
% 7.56/7.75
% 7.56/7.75 2 [] {-} -equalish(e_1,e_2).
% 7.56/7.75 3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 7.56/7.75 4 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 7.56/7.75 6 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 7.56/7.75 7 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 7.56/7.75 9 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,B,A)| -product(F,E,D)|equalish(B,E).
% 7.56/7.75 10 [factor,4.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2).
% 7.56/7.75 17 [factor,9.2.4] {+} -product(A,B,C)| -product(C,D,C)| -product(C,B,A)|equalish(B,D).
% 7.56/7.75 20 [] {+} group_element(e_1).
% 7.56/7.75 21 [] {+} group_element(e_2).
% 7.56/7.75 40 [hyper,20,10] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 7.56/7.75 50 [hyper,21,10] {+} product(e_2,e_2,e_1)|product(e_2,e_2,e_2).
% 7.56/7.75 51 [hyper,21,4,20] {+} product(e_1,e_2,e_1)|product(e_1,e_2,e_2).
% 7.56/7.75 52 [hyper,21,4,20] {+} product(e_2,e_1,e_1)|product(e_2,e_1,e_2).
% 7.56/7.75 427 [hyper,51,7,50,unit_del,3] {+} product(e_1,e_2,e_1)|product(e_2,e_2,e_1).
% 7.56/7.75 428 [hyper,51,6,40,unit_del,3] {+} product(e_1,e_2,e_1)|product(e_1,e_1,e_1).
% 7.56/7.75 516 [hyper,52,7,40,unit_del,3] {+} product(e_2,e_1,e_2)|product(e_1,e_1,e_2).
% 7.56/7.75 1153 [hyper,428,17,427,51,unit_del,3,factor_simp,factor_simp] {+} product(e_1,e_2,e_1).
% 7.56/7.75 1425 [hyper,1153,17,1153,40,unit_del,3] {+} product(e_1,e_1,e_2).
% 7.56/7.75 1426 [hyper,1153,17,52,516,unit_del,3,factor_simp] {+} product(e_2,e_1,e_2).
% 7.56/7.75 1484 [hyper,1426,7,1425,flip.1] {-} equalish(e_2,e_1).
% 7.56/7.75 1486 [binary,1484.1,3.1] {+} $F.
% 7.56/7.75
% 7.56/7.75 % SZS output end Refutation
% 7.56/7.75 ------------ end of proof -------------
% 7.56/7.75
% 7.56/7.75
% 7.56/7.75 Search stopped by max_proofs option.
% 7.56/7.75
% 7.56/7.75
% 7.56/7.75 Search stopped by max_proofs option.
% 7.56/7.75
% 7.56/7.75 ============ end of search ============
% 7.56/7.75
% 7.56/7.75 ----------- soft-scott stats ----------
% 7.56/7.75
% 7.56/7.75 true clauses given 7 (29.2%)
% 7.56/7.75 false clauses given 17
% 7.56/7.75
% 7.56/7.75 FALSE TRUE
% 7.56/7.75 3 0 2
% 7.56/7.75 4 2 0
% 7.56/7.75 7 1 0
% 7.56/7.75 8 0 2
% 7.56/7.75 10 6 0
% 7.56/7.75 11 2 13
% 7.56/7.75 12 18 0
% 7.56/7.75 14 4 4
% 7.56/7.75 15 1 46
% 7.56/7.75 16 38 13
% 7.56/7.75 18 4 0
% 7.56/7.75 19 2 166
% 7.56/7.75 20 28 20
% 7.56/7.75 23 6 164
% 7.56/7.75 24 12 6
% 7.56/7.75 27 6 248
% 7.56/7.75 31 4 22
% 7.56/7.75 tot: 134 706 (84.0% true)
% 7.56/7.75
% 7.56/7.75
% 7.56/7.75 Model 17 [ 6 0 187 ] (0.00 seconds, 250000 Inserts)
% 7.56/7.75
% 7.56/7.75 That finishes the proof of the theorem.
% 7.56/7.75
% 7.56/7.75 Process 22222 finished Mon Jun 13 11:54:26 2022
%------------------------------------------------------------------------------