TSTP Solution File: GRP123-6.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP123-6.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 4.60s 4.77s
% Output : Refutation 4.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP123-6.003 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 15:27:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n013.cluster.edu,
% 0.13/0.36 Mon Jun 13 15:27:59 2022
% 0.13/0.36 The command was "./sos". The process ID is 30219.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 Following clause subsumed by 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.36 Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.36 Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 21
% 0.13/0.38 number of clauses initially in problem: 26
% 0.13/0.38 percentage of clauses intially in UL: 80
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 7
% 0.13/0.38 distinct predicate count: 4
% 0.13/0.38 distinct function count: 0
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 4.60/4.77
% 4.60/4.77 -------- PROOF --------
% 4.60/4.77 % SZS status Unsatisfiable
% 4.60/4.77 % SZS output start Refutation
% 4.60/4.77
% 4.60/4.77 Model 2 (0.00 seconds, 0 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on number of solutions
% 4.60/4.77
% 4.60/4.77 Model 3 (0.00 seconds, 0 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on number of solutions
% 4.60/4.77
% 4.60/4.77 Model 4 (0.00 seconds, 0 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on number of solutions
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 5 [ 2 0 265 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 6 [ 4 0 2488 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 7 [ 3 1 1658 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 8 [ 2 12 110589 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 9 [ 4 0 1029 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 10 [ 3 13 87217 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 11 [ 5 0 1580 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 12 [ 3 1 9710 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 13 [ 5 1 3143 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 14 [ 7 18 153638 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 15 [ 4 0 1889 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 16 [ 8 1 6682 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 17 [ 9 1 829 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 Model 18 [ 6 15 116638 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 Stopped by limit on insertions
% 4.60/4.77
% 4.60/4.77 ----> UNIT CONFLICT at 4.38 sec ----> 987 [binary,985.1,6.1] {+} $F.
% 4.60/4.77
% 4.60/4.77 Length of proof is 17. Level of proof is 6.
% 4.60/4.77
% 4.60/4.77 ---------------- PROOF ----------------
% 4.60/4.77 % SZS status Unsatisfiable
% 4.60/4.77 % SZS output start Refutation
% 4.60/4.77
% 4.60/4.77 1 [] {-} -equalish(e_1,e_2).
% 4.60/4.77 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 4.60/4.77 3 [] {-} -equalish(e_1,e_3).
% 4.60/4.77 4 [copy,3,flip.1] {+} -equalish(e_3,e_1).
% 4.60/4.77 5 [] {-} -equalish(e_2,e_3).
% 4.60/4.77 6 [copy,5,flip.1] {+} -equalish(e_3,e_2).
% 4.60/4.77 7 [] {+} -group_element(A)| -group_element(B)|product1(A,B,e_1)|product1(A,B,e_2)|product1(A,B,e_3).
% 4.60/4.77 9 [] {+} -product1(A,B,C)| -product1(A,D,C)|equalish(B,D).
% 4.60/4.77 10 [] {+} -product1(A,B,C)| -product1(D,B,C)|equalish(A,D).
% 4.60/4.77 11 [] {+} -group_element(A)| -group_element(B)|product2(A,B,e_1)|product2(A,B,e_2)|product2(A,B,e_3).
% 4.60/4.77 13 [] {+} -product2(A,B,C)| -product2(A,D,C)|equalish(B,D).
% 4.60/4.77 14 [] {+} -product2(A,B,C)| -product2(D,B,C)|equalish(A,D).
% 4.60/4.77 15 [] {+} -product1(A,B,C)| -product1(C,B,D)|product2(D,A,B).
% 4.60/4.77 25 [] {+} group_element(e_1).
% 4.60/4.77 26 [] {+} group_element(e_2).
% 4.60/4.77 27 [] {+} group_element(e_3).
% 4.60/4.77 28 [] {+} product1(A,A,A).
% 4.60/4.77 29 [] {+} product2(A,A,A).
% 4.60/4.77 36 [hyper,26,11,25] {-} product2(e_1,e_2,e_1)|product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 4.60/4.77 39 [hyper,26,7,25] {-} product1(e_2,e_1,e_1)|product1(e_2,e_1,e_2)|product1(e_2,e_1,e_3).
% 4.60/4.77 48 [hyper,27,11,26] {+} product2(e_3,e_2,e_1)|product2(e_3,e_2,e_2)|product2(e_3,e_2,e_3).
% 4.60/4.77 53 [hyper,27,7,25] {-} product1(e_3,e_1,e_1)|product1(e_3,e_1,e_2)|product1(e_3,e_1,e_3).
% 4.60/4.77 75 [hyper,36,13,29,unit_del,2] {-} product2(e_1,e_2,e_2)|product2(e_1,e_2,e_3).
% 4.60/4.77 77 [hyper,75,14,29,unit_del,2] {+} product2(e_1,e_2,e_3).
% 4.60/4.77 268 [hyper,39,10,28,unit_del,2] {-} product1(e_2,e_1,e_2)|product1(e_2,e_1,e_3).
% 4.60/4.77 272 [hyper,268,9,28,unit_del,2] {+} product1(e_2,e_1,e_3).
% 4.60/4.77 880 [hyper,48,14,29,unit_del,6] {-} product2(e_3,e_2,e_1)|product2(e_3,e_2,e_3).
% 4.60/4.77 886 [hyper,880,14,77,unit_del,4] {+} product2(e_3,e_2,e_1).
% 4.60/4.77 942 [hyper,53,10,28,unit_del,4] {-} product1(e_3,e_1,e_2)|product1(e_3,e_1,e_3).
% 4.60/4.77 954 [hyper,942,10,272,unit_del,6] {+} product1(e_3,e_1,e_2).
% 4.60/4.77 955 [hyper,954,15,272] {-} product2(e_2,e_2,e_1).
% 4.60/4.77 985 [hyper,955,14,886] {-} equalish(e_3,e_2).
% 4.60/4.77 987 [binary,985.1,6.1] {+} $F.
% 4.60/4.77
% 4.60/4.77 % SZS output end Refutation
% 4.60/4.77 ------------ end of proof -------------
% 4.60/4.77
% 4.60/4.77
% 4.60/4.77 Search stopped by max_proofs option.
% 4.60/4.77
% 4.60/4.77
% 4.60/4.77 Search stopped by max_proofs option.
% 4.60/4.77
% 4.60/4.77 ============ end of search ============
% 4.60/4.77
% 4.60/4.77 ----------- soft-scott stats ----------
% 4.60/4.77
% 4.60/4.77 true clauses given 18 (29.0%)
% 4.60/4.77 false clauses given 44
% 4.60/4.77
% 4.60/4.77 FALSE TRUE
% 4.60/4.77 4 1 1
% 4.60/4.77 8 2 0
% 4.60/4.77 10 0 3
% 4.60/4.77 12 54 79
% 4.60/4.77 14 0 120
% 4.60/4.77 16 128 138
% 4.60/4.77 18 16 74
% 4.60/4.77 20 142 44
% 4.60/4.77 tot: 343 459 (57.2% true)
% 4.60/4.77
% 4.60/4.77
% 4.60/4.77 Model 18 [ 6 -22 116638 ] (0.00 seconds, 250000 Inserts)
% 4.60/4.77
% 4.60/4.77 That finishes the proof of the theorem.
% 4.60/4.77
% 4.60/4.77 Process 30219 finished Mon Jun 13 15:28:03 2022
%------------------------------------------------------------------------------