TSTP Solution File: GRP125-4.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP125-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:37 EDT 2022
% Result : Unsatisfiable 0.86s 1.06s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP125-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n026.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:08:50 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 n026.cluster.edu,
% 0.12/0.36 Mon Jun 13 11:08:51 2022
% 0.12/0.36 The command was "./sos". The process ID is 8001.
% 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 6 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.36 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.12/0.36 Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 21
% 0.19/0.43 number of clauses initially in problem: 25
% 0.19/0.43 percentage of clauses intially in UL: 84
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 6
% 0.19/0.43 distinct predicate count: 3
% 0.19/0.43 distinct function count: 0
% 0.19/0.43 distinct constant count: 3
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 0.86/1.06
% 0.86/1.06 -------- PROOF --------
% 0.86/1.06 % SZS status Unsatisfiable
% 0.86/1.06 % SZS output start Refutation
% 0.86/1.06
% 0.86/1.06 Model 3 [ 1 3 16670 ] (0.00 seconds, 31655 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 4 [ 2 2 24126 ] (0.00 seconds, 68146 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 5 [ 2 1 150 ] (0.00 seconds, 13101 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 6 [ 2 3 26747 ] (0.00 seconds, 43581 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 7 [ 3 2 14587 ] (0.00 seconds, 53274 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 8 [ 3 1 11112 ] (0.00 seconds, 18675 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 9 [ 4 1 6549 ] (0.00 seconds, 135403 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 10 [ 4 0 1830 ] (0.00 seconds, 151526 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 11 [ 5 1 4156 ] (0.00 seconds, 18398 Inserts)
% 0.86/1.06
% 0.86/1.06 Model 12 [ 8 1 2038 ] (0.00 seconds, 8139 Inserts)
% 0.86/1.06
% 0.86/1.06 ----> UNIT CONFLICT at 0.68 sec ----> 170 [binary,168.1,8.1] {+} $F.
% 0.86/1.06
% 0.86/1.06 Length of proof is 10. Level of proof is 5.
% 0.86/1.06
% 0.86/1.06 ---------------- PROOF ----------------
% 0.86/1.06 % SZS status Unsatisfiable
% 0.86/1.06 % SZS output start Refutation
% 0.86/1.06
% 0.86/1.06 5 [] {-} -equalish(e_1,e_2).
% 0.86/1.06 6 [copy,5,flip.1] {+} -equalish(e_2,e_1).
% 0.86/1.06 7 [] {-} -equalish(e_1,e_3).
% 0.86/1.06 8 [copy,7,flip.1] {+} -equalish(e_3,e_1).
% 0.86/1.06 11 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 0.86/1.06 12 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 0.86/1.06 13 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 0.86/1.06 14 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 0.86/1.06 15 [] {+} -product(A,B,C)| -product(B,A,D)|product(C,D,A).
% 0.86/1.06 25 [] {+} group_element(e_1).
% 0.86/1.06 26 [] {+} group_element(e_2).
% 0.86/1.06 28 [] {+} product(A,A,A).
% 0.86/1.06 32 [hyper,26,11,25] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 0.86/1.06 33 [hyper,26,11,25] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 0.86/1.06 80 [hyper,32,13,28,unit_del,6] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 0.86/1.06 84 [hyper,80,14,28,unit_del,6] {+} product(e_1,e_2,e_3).
% 0.86/1.06 130 [hyper,33,14,28,unit_del,6] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 0.86/1.06 140 [hyper,130,13,28,unit_del,6] {+} product(e_2,e_1,e_3).
% 0.86/1.06 154 [hyper,140,15,84] {+} product(e_3,e_3,e_1).
% 0.86/1.06 168 [hyper,154,12,28] {-} equalish(e_3,e_1).
% 0.86/1.06 170 [binary,168.1,8.1] {+} $F.
% 0.86/1.06
% 0.86/1.06 % SZS output end Refutation
% 0.86/1.06 ------------ end of proof -------------
% 0.86/1.06
% 0.86/1.06
% 0.86/1.06 Search stopped by max_proofs option.
% 0.86/1.06
% 0.86/1.06
% 0.86/1.06 Search stopped by max_proofs option.
% 0.86/1.06
% 0.86/1.06 ============ end of search ============
% 0.86/1.06
% 0.86/1.06 ----------- soft-scott stats ----------
% 0.86/1.06
% 0.86/1.06 true clauses given 3 (16.7%)
% 0.86/1.06 false clauses given 15
% 0.86/1.06
% 0.86/1.06 FALSE TRUE
% 0.86/1.06 4 1 0
% 0.86/1.06 10 2 1
% 0.86/1.06 12 26 0
% 0.86/1.06 14 12 36
% 0.86/1.06 18 12 6
% 0.86/1.06 tot: 53 43 (44.8% true)
% 0.86/1.06
% 0.86/1.06
% 0.86/1.06 Model 12 [ 8 1 2038 ] (0.00 seconds, 8139 Inserts)
% 0.86/1.06
% 0.86/1.06 That finishes the proof of the theorem.
% 0.86/1.06
% 0.86/1.06 Process 8001 finished Mon Jun 13 11:08:51 2022
%------------------------------------------------------------------------------