TSTP Solution File: GRP125-1.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP125-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:35 EDT 2022
% Result : Unsatisfiable 2.32s 2.50s
% Output : Refutation 2.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP125-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 23:18:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n019.cluster.edu,
% 0.14/0.37 Mon Jun 13 23:18:39 2022
% 0.14/0.37 The command was "./sos". The process ID is 4899.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37 Following clause subsumed by 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.14/0.37 Following clause subsumed by 4 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.14/0.37 Following clause subsumed by 6 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.41
% 0.14/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.41
% 0.14/0.41 Stopped by limit on number of solutions
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 -------------- Softie stats --------------
% 0.14/0.41
% 0.14/0.41 UPDATE_STOP: 300
% 0.14/0.41 SFINDER_TIME_LIMIT: 2
% 0.14/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.41 number of clauses in intial UL: 13
% 0.14/0.41 number of clauses initially in problem: 17
% 0.14/0.41 percentage of clauses intially in UL: 76
% 0.14/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.41 percent of all initial clauses that are short: 100
% 0.14/0.41 absolute distinct symbol count: 6
% 0.14/0.41 distinct predicate count: 3
% 0.14/0.41 distinct function count: 0
% 0.14/0.41 distinct constant count: 3
% 0.14/0.41
% 0.14/0.41 ---------- no more Softie stats ----------
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.41
% 0.14/0.41 Stopped by limit on number of solutions
% 0.14/0.41
% 0.14/0.41 =========== start of search ===========
% 2.32/2.50
% 2.32/2.50 -------- PROOF --------
% 2.32/2.50 % SZS status Unsatisfiable
% 2.32/2.50 % SZS output start Refutation
% 2.32/2.50
% 2.32/2.50 Model 3 [ 1 0 89 ] (0.00 seconds, 180835 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 4 [ 2 1 102 ] (0.00 seconds, 178983 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 5 [ 2 0 287 ] (0.00 seconds, 16306 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 6 [ 2 1 12660 ] (0.00 seconds, 101318 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 7 [ 3 0 409 ] (0.00 seconds, 197613 Inserts)
% 2.32/2.50
% 2.32/2.50 Stopped by limit on insertions
% 2.32/2.50
% 2.32/2.50 Model 8 [ 3 1 679 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 9 [ 4 0 1028 ] (0.00 seconds, 53498 Inserts)
% 2.32/2.50
% 2.32/2.50 Stopped by limit on insertions
% 2.32/2.50
% 2.32/2.50 Model 10 [ 4 0 119 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 11 [ 6 1 3004 ] (0.00 seconds, 51737 Inserts)
% 2.32/2.50
% 2.32/2.50 Model 12 [ 8 0 105 ] (0.00 seconds, 32324 Inserts)
% 2.32/2.50
% 2.32/2.50 ----> UNIT CONFLICT at 2.10 sec ----> 155 [binary,153.1,4.1] {-} $F.
% 2.32/2.50
% 2.32/2.50 Length of proof is 10. Level of proof is 5.
% 2.32/2.50
% 2.32/2.50 ---------------- PROOF ----------------
% 2.32/2.50 % SZS status Unsatisfiable
% 2.32/2.50 % SZS output start Refutation
% 2.32/2.50
% 2.32/2.50 1 [] {-} -equalish(e_1,e_2).
% 2.32/2.50 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 2.32/2.50 3 [] {-} -equalish(e_1,e_3).
% 2.32/2.50 4 [copy,3,flip.1] {+} -equalish(e_3,e_1).
% 2.32/2.50 7 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 2.32/2.50 8 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 2.32/2.50 9 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 2.32/2.50 10 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 2.32/2.50 11 [] {+} -product(A,B,C)| -product(B,A,D)|product(C,D,A).
% 2.32/2.50 17 [] {+} group_element(e_1).
% 2.32/2.50 18 [] {+} group_element(e_2).
% 2.32/2.50 20 [] {+} product(A,A,A).
% 2.32/2.50 24 [hyper,18,7,17] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 2.32/2.50 25 [hyper,18,7,17] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 2.32/2.50 81 [hyper,24,9,20,unit_del,2] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 2.32/2.50 94 [hyper,81,10,20,unit_del,2] {+} product(e_1,e_2,e_3).
% 2.32/2.50 117 [hyper,25,10,20,unit_del,2] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3).
% 2.32/2.50 136 [hyper,117,9,20,unit_del,2] {+} product(e_2,e_1,e_3).
% 2.32/2.50 139 [hyper,136,11,94] {+} product(e_3,e_3,e_1).
% 2.32/2.50 153 [hyper,139,8,20] {-} equalish(e_3,e_1).
% 2.32/2.50 155 [binary,153.1,4.1] {-} $F.
% 2.32/2.50
% 2.32/2.50 % SZS output end Refutation
% 2.32/2.50 ------------ end of proof -------------
% 2.32/2.50
% 2.32/2.50
% 2.32/2.50 Search stopped by max_proofs option.
% 2.32/2.50
% 2.32/2.50
% 2.32/2.50 Search stopped by max_proofs option.
% 2.32/2.50
% 2.32/2.50 ============ end of search ============
% 2.32/2.50
% 2.32/2.50 ----------- soft-scott stats ----------
% 2.32/2.50
% 2.32/2.50 true clauses given 4 (21.1%)
% 2.32/2.50 false clauses given 15
% 2.32/2.50
% 2.32/2.50 FALSE TRUE
% 2.32/2.50 4 1 0
% 2.32/2.50 10 0 2
% 2.32/2.50 12 16 6
% 2.32/2.50 14 8 48
% 2.32/2.50 18 9 12
% 2.32/2.50 tot: 34 68 (66.7% true)
% 2.32/2.50
% 2.32/2.50
% 2.32/2.50 Model 12 [ 8 0 105 ] (0.00 seconds, 32324 Inserts)
% 2.32/2.50
% 2.32/2.50 That finishes the proof of the theorem.
% 2.32/2.50
% 2.32/2.50 Process 4899 finished Mon Jun 13 23:18:42 2022
%------------------------------------------------------------------------------