TSTP Solution File: GRP124-2.004 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP124-2.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:31 EDT 2022
% Result : Unsatisfiable 2.66s 2.86s
% Output : Refutation 2.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP124-2.004 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Tue Jun 14 05:55:54 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 n025.cluster.edu,
% 0.12/0.35 Tue Jun 14 05:55:54 2022
% 0.12/0.35 The command was "./sos". The process ID is 17552.
% 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=6.
% 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 9 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.12/0.35 Following clause subsumed by 7 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.12/0.35 Following clause subsumed by 11 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.12/0.35 Following clause subsumed by 13 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 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: 25
% 0.18/0.39 number of clauses initially in problem: 39
% 0.18/0.39 percentage of clauses intially in UL: 64
% 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: 9
% 0.18/0.39 distinct predicate count: 5
% 0.18/0.39 distinct function count: 0
% 0.18/0.39 distinct constant count: 4
% 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 ===========
% 2.66/2.86
% 2.66/2.86 -------- PROOF --------
% 2.66/2.86 % SZS status Unsatisfiable
% 2.66/2.86 % SZS output start Refutation
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 3 [ 1 1 190 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 4 [ 1 0 436 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 5 [ 2 1 196 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 6 [ 3 1 392 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 7 [ 3 0 379 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 8 [ 3 0 4568 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 9 [ 3 1 539 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 10 [ 3 1 118 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 11 [ 5 0 188 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 12 [ 5 1 181 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 13 [ 5 7 168722 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 14 [ 5 1 7675 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 Stopped by limit on insertions
% 2.66/2.86
% 2.66/2.86 Model 15 [ 6 2 40198 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 ----> UNIT CONFLICT at 2.48 sec ----> 1820 [binary,1818.1,9.1] {-} $F.
% 2.66/2.86
% 2.66/2.86 Length of proof is 21. Level of proof is 8.
% 2.66/2.86
% 2.66/2.86 ---------------- PROOF ----------------
% 2.66/2.86 % SZS status Unsatisfiable
% 2.66/2.86 % SZS output start Refutation
% 2.66/2.86
% 2.66/2.86 1 [] {+} -product(A,e_1,B)| -next(A,C)| -greater(B,C).
% 2.66/2.86 2 [] {-} -equalish(e_1,e_2).
% 2.66/2.86 3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 2.66/2.86 4 [] {-} -equalish(e_1,e_3).
% 2.66/2.86 5 [copy,4,flip.1] {+} -equalish(e_3,e_1).
% 2.66/2.86 8 [] {-} -equalish(e_2,e_3).
% 2.66/2.86 9 [copy,8,flip.1] {+} -equalish(e_3,e_2).
% 2.66/2.86 14 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3)|product(A,B,e_4).
% 2.66/2.86 16 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 2.66/2.86 17 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 2.66/2.86 19 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|equalish(B,E).
% 2.66/2.86 31 [factor,19.2.4] {+} -product(A,B,C)| -product(C,C,C)| -product(C,A,B)|equalish(B,C).
% 2.66/2.86 33 [] {+} next(e_2,e_3).
% 2.66/2.86 40 [] {+} greater(e_4,e_3).
% 2.66/2.86 41 [] {+} group_element(e_1).
% 2.66/2.86 42 [] {+} group_element(e_2).
% 2.66/2.86 43 [] {+} group_element(e_3).
% 2.66/2.86 45 [] {-} product(A,A,A).
% 2.66/2.86 85 [hyper,42,14,41] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 2.66/2.86 86 [hyper,42,14,41] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 2.66/2.86 100 [hyper,43,14,42] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_2)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 2.66/2.86 101 [hyper,43,14,41] {-} product(e_1,e_3,e_1)|product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 2.66/2.86 844 [hyper,85,16,45,unit_del,3] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 2.66/2.86 846 [hyper,844,17,45,unit_del,3] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 2.66/2.86 1121 [hyper,86,17,45,unit_del,3] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 2.66/2.86 1143 [hyper,1121,16,45,unit_del,3] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 2.66/2.86 1320 [hyper,1143,1,33,40] {-} product(e_2,e_1,e_3).
% 2.66/2.86 1361 [hyper,100,16,45,unit_del,9] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 2.66/2.86 1364 [hyper,1361,17,45,unit_del,9] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_4).
% 2.66/2.86 1485 [hyper,1364,31,45,846,unit_del,5] {-} product(e_2,e_3,e_4)|product(e_1,e_2,e_4).
% 2.66/2.86 1669 [hyper,101,16,45,unit_del,5] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 2.66/2.86 1764 [hyper,1669,31,45,1320,unit_del,9] {-} product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 2.66/2.86 1770 [hyper,1764,17,45,unit_del,5] {-} product(e_1,e_3,e_4).
% 2.66/2.86 1775 [hyper,1770,17,1485,unit_del,3] {-} product(e_1,e_2,e_4).
% 2.66/2.86 1818 [hyper,1775,16,1770] {-} equalish(e_3,e_2).
% 2.66/2.86 1820 [binary,1818.1,9.1] {-} $F.
% 2.66/2.86
% 2.66/2.86 % SZS output end Refutation
% 2.66/2.86 ------------ end of proof -------------
% 2.66/2.86
% 2.66/2.86
% 2.66/2.86 Search stopped by max_proofs option.
% 2.66/2.86
% 2.66/2.86
% 2.66/2.86 Search stopped by max_proofs option.
% 2.66/2.86
% 2.66/2.86 ============ end of search ============
% 2.66/2.86
% 2.66/2.86 ----------- soft-scott stats ----------
% 2.66/2.86
% 2.66/2.86 true clauses given 12 (26.7%)
% 2.66/2.86 false clauses given 33
% 2.66/2.86
% 2.66/2.86 FALSE TRUE
% 2.66/2.86 4 3 0
% 2.66/2.86 6 0 4
% 2.66/2.86 7 0 13
% 2.66/2.86 10 0 25
% 2.66/2.86 11 0 141
% 2.66/2.86 12 0 42
% 2.66/2.86 14 0 85
% 2.66/2.86 15 0 171
% 2.66/2.86 16 8 24
% 2.66/2.86 18 0 76
% 2.66/2.86 19 0 227
% 2.66/2.86 20 0 12
% 2.66/2.86 22 0 86
% 2.66/2.86 23 0 219
% 2.66/2.86 26 0 12
% 2.66/2.86 27 0 94
% 2.66/2.86 31 0 10
% 2.66/2.86 tot: 11 1241 (99.1% true)
% 2.66/2.86
% 2.66/2.86
% 2.66/2.86 Model 15 [ 6 -110 40198 ] (0.00 seconds, 250000 Inserts)
% 2.66/2.86
% 2.66/2.86 That finishes the proof of the theorem.
% 2.66/2.86
% 2.66/2.86 Process 17552 finished Tue Jun 14 05:55:57 2022
%------------------------------------------------------------------------------