TSTP Solution File: GRP123-7.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP123-7.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:29 EDT 2022
% Result : Unsatisfiable 5.25s 5.49s
% Output : Refutation 5.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP123-7.003 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n013.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 13:08:43 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 sandbox2 on n013.cluster.edu,
% 0.12/0.35 Mon Jun 13 13:08:43 2022
% 0.12/0.35 The command was "./sos". The process ID is 19318.
% 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 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.35 Following clause subsumed by 5 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.12/0.35 Following clause subsumed by 7 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.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 22
% 0.18/0.39 number of clauses initially in problem: 32
% 0.18/0.39 percentage of clauses intially in UL: 68
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 10
% 0.18/0.39 distinct predicate count: 7
% 0.18/0.39 distinct function count: 0
% 0.18/0.39 distinct constant count: 3
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 5.25/5.49
% 5.25/5.49 -------- PROOF --------
% 5.25/5.49 % SZS status Unsatisfiable
% 5.25/5.49 % SZS output start Refutation
% 5.25/5.49
% 5.25/5.49 Model 3 (0.00 seconds, 0 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on number of solutions
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 4 [ 1 0 173 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 5 [ 1 14 218294 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 6 [ 2 1 445 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 7 [ 1 0 504 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 8 [ 2 0 4269 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 9 [ 2 1 31533 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 10 [ 1 2 16905 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 11 [ 5 1 6287 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 12 [ 5 1 10574 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 13 [ 4 1 6372 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 14 [ 4 0 966 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 15 [ 3 10 179646 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 16 [ 4 1 2896 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 17 [ 3 6 94584 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 18 [ 10 0 161 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 19 [ 3 1 9821 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 20 [ 9 7 60688 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 21 [ 9 0 170 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 22 [ 5 0 506 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 23 [ 5 1 366 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 24 [ 8 14 118292 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 25 [ 8 8 99488 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 26 [ 9 2 20467 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 Stopped by limit on insertions
% 5.25/5.49
% 5.25/5.49 Model 27 [ 11 0 273 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 ----> UNIT CONFLICT at 5.11 sec ----> 1494 [binary,1492.1,3.1] {-} $F.
% 5.25/5.49
% 5.25/5.49 Length of proof is 14. Level of proof is 7.
% 5.25/5.49
% 5.25/5.49 ---------------- PROOF ----------------
% 5.25/5.49 % SZS status Unsatisfiable
% 5.25/5.49 % SZS output start Refutation
% 5.25/5.49
% 5.25/5.49 2 [] {-} -equalish(e_1,e_2).
% 5.25/5.49 3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 5.25/5.49 4 [] {-} -equalish(e_1,e_3).
% 5.25/5.49 5 [copy,4,flip.1] {+} -equalish(e_3,e_1).
% 5.25/5.49 6 [] {-} -equalish(e_2,e_3).
% 5.25/5.49 7 [copy,6,flip.1] {+} -equalish(e_3,e_2).
% 5.25/5.49 8 [] {+} -group_element(A)| -group_element(B)|product1(A,B,e_1)|product1(A,B,e_2)|product1(A,B,e_3).
% 5.25/5.49 10 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 5.25/5.49 11 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 5.25/5.49 12 [] {+} -group_element(A)| -group_element(B)|product2(A,B,e_1)|product2(A,B,e_2)|product2(A,B,e_3).
% 5.25/5.49 14 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 5.25/5.49 15 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 5.25/5.49 16 [] {+} -product1(A,B,C)| -product1(C,B,D)|product2(D,A,B).
% 5.25/5.49 31 [] {+} group_element(e_1).
% 5.25/5.49 32 [] {+} group_element(e_2).
% 5.25/5.49 33 [] {+} group_element(e_3).
% 5.25/5.49 34 [] {+} product1(A,A,A).
% 5.25/5.49 35 [] {+} product2(A,A,A).
% 5.25/5.49 54 [hyper,32,12,31] {+} product2(e_1,e_2,e_1)|product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 5.25/5.49 68 [hyper,33,8,32] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_2)|product1(e_2,e_3,e_3).
% 5.25/5.49 69 [hyper,33,8,31] {-} product1(e_1,e_3,e_1)|product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3).
% 5.25/5.49 630 [hyper,54,15,35,unit_del,3] {-} product2(e_1,e_2,e_1)|product2(e_1,e_2,e_3).
% 5.25/5.49 633 [hyper,630,14,35,unit_del,3] {+} product2(e_1,e_2,e_3).
% 5.25/5.49 1373 [hyper,68,10,34,unit_del,7] {-} product1(e_2,e_3,e_1)|product1(e_2,e_3,e_3).
% 5.25/5.49 1399 [hyper,1373,11,34,unit_del,7] {+} product1(e_2,e_3,e_1).
% 5.25/5.49 1449 [hyper,69,11,1399,unit_del,3] {-} product1(e_1,e_3,e_2)|product1(e_1,e_3,e_3).
% 5.25/5.49 1465 [hyper,1449,11,34,unit_del,5] {+} product1(e_1,e_3,e_2).
% 5.25/5.49 1466 [hyper,1465,16,1399] {+} product2(e_2,e_2,e_3).
% 5.25/5.49 1492 [hyper,1466,15,633,flip.1] {-} equalish(e_2,e_1).
% 5.25/5.49 1494 [binary,1492.1,3.1] {-} $F.
% 5.25/5.49
% 5.25/5.49 % SZS output end Refutation
% 5.25/5.49 ------------ end of proof -------------
% 5.25/5.49
% 5.25/5.49
% 5.25/5.49 Search stopped by max_proofs option.
% 5.25/5.49
% 5.25/5.49
% 5.25/5.49 Search stopped by max_proofs option.
% 5.25/5.49
% 5.25/5.49 ============ end of search ============
% 5.25/5.49
% 5.25/5.49 ----------- soft-scott stats ----------
% 5.25/5.49
% 5.25/5.49 true clauses given 20 (23.8%)
% 5.25/5.49 false clauses given 64
% 5.25/5.49
% 5.25/5.49 FALSE TRUE
% 5.25/5.49 4 1 0
% 5.25/5.49 10 0 1
% 5.25/5.49 11 25 28
% 5.25/5.49 12 69 113
% 5.25/5.49 14 8 128
% 5.25/5.49 15 152 249
% 5.25/5.49 18 25 77
% 5.25/5.49 19 176 170
% 5.25/5.49 23 0 42
% 5.25/5.49 tot: 456 808 (63.9% true)
% 5.25/5.49
% 5.25/5.49
% 5.25/5.49 Model 27 [ 11 0 273 ] (0.00 seconds, 250000 Inserts)
% 5.25/5.49
% 5.25/5.49 That finishes the proof of the theorem.
% 5.25/5.49
% 5.25/5.49 Process 19318 finished Mon Jun 13 13:08:49 2022
%------------------------------------------------------------------------------