TSTP Solution File: GRP123-2.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP123-2.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:27 EDT 2022
% Result : Unsatisfiable 10.05s 10.26s
% Output : Refutation 10.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP123-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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 06:43:07 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 n014.cluster.edu,
% 0.13/0.36 Mon Jun 13 06:43:07 2022
% 0.13/0.36 The command was "./sos". The process ID is 20658.
% 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 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.36 Following clause subsumed by 5 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.36 Following clause subsumed by 7 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.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 18
% 0.13/0.40 number of clauses initially in problem: 27
% 0.13/0.40 percentage of clauses intially in UL: 66
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 8
% 0.13/0.40 distinct predicate count: 5
% 0.13/0.40 distinct function count: 0
% 0.13/0.40 distinct constant count: 3
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 10.05/10.26
% 10.05/10.26 -------- PROOF --------
% 10.05/10.26 % SZS status Unsatisfiable
% 10.05/10.26 % SZS output start Refutation
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 3 [ 1 1 312 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Model 4 (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on number of solutions
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 5 [ 1 1 876 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 6 [ 2 0 198 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 7 [ 2 1 282 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 8 [ 2 1 42339 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 9 [ 3 0 309 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 10 [ 3 0 382 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 11 [ 5 0 313 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 12 [ 3 13 241461 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 13 [ 6 0 254 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 14 [ 5 1 2131 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 15 [ 6 1 557 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 16 [ 1 1 9393 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 17 [ 5 9 158330 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 18 [ 5 0 168 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 19 [ 6 0 126 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 20 [ 7 2 43780 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 21 [ 6 0 242 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 22 [ 9 2 25559 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 23 [ 8 1 148 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 Stopped by limit on insertions
% 10.05/10.26
% 10.05/10.26 Model 24 [ 11 7 224425 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 ----> UNIT CONFLICT at 9.87 sec ----> 2690 [binary,2688.1,5.1] {-} $F.
% 10.05/10.26
% 10.05/10.26 Length of proof is 10. Level of proof is 5.
% 10.05/10.26
% 10.05/10.26 ---------------- PROOF ----------------
% 10.05/10.26 % SZS status Unsatisfiable
% 10.05/10.26 % SZS output start Refutation
% 10.05/10.26
% 10.05/10.26 4 [] {-} -equalish(e_1,e_3).
% 10.05/10.26 5 [copy,4,flip.1] {+} -equalish(e_3,e_1).
% 10.05/10.26 6 [] {-} -equalish(e_2,e_3).
% 10.05/10.26 7 [copy,6,flip.1] {+} -equalish(e_3,e_2).
% 10.05/10.26 8 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 10.05/10.26 11 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 10.05/10.26 13 [] {+} -product(A,B,C)| -product(D,E,C)| -product(F,B,A)| -product(F,E,D)|equalish(B,E).
% 10.05/10.26 21 [factor,13.2.4] {+} -product(A,B,C)| -product(C,D,C)| -product(C,B,A)|equalish(B,D).
% 10.05/10.26 27 [] {+} group_element(e_1).
% 10.05/10.26 28 [] {+} group_element(e_2).
% 10.05/10.26 29 [] {+} group_element(e_3).
% 10.05/10.26 30 [] {+} product(A,A,A).
% 10.05/10.26 69 [hyper,29,8,28] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_2)|product(e_2,e_3,e_3).
% 10.05/10.26 70 [hyper,29,8,27] {-} product(e_1,e_3,e_1)|product(e_1,e_3,e_2)|product(e_1,e_3,e_3).
% 10.05/10.26 2514 [hyper,69,21,69,30,unit_del,7,factor_simp,factor_simp] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3).
% 10.05/10.26 2520 [hyper,2514,11,30,unit_del,7] {+} product(e_2,e_3,e_1).
% 10.05/10.26 2670 [hyper,70,21,70,30,unit_del,5,factor_simp,factor_simp] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3).
% 10.05/10.26 2680 [hyper,2670,21,2520,30,unit_del,5] {+} product(e_1,e_3,e_3).
% 10.05/10.26 2688 [hyper,2680,11,30] {-} equalish(e_3,e_1).
% 10.05/10.26 2690 [binary,2688.1,5.1] {-} $F.
% 10.05/10.26
% 10.05/10.26 % SZS output end Refutation
% 10.05/10.26 ------------ end of proof -------------
% 10.05/10.26
% 10.05/10.26
% 10.05/10.26 Search stopped by max_proofs option.
% 10.05/10.26
% 10.05/10.26
% 10.05/10.26 Search stopped by max_proofs option.
% 10.05/10.26
% 10.05/10.26 ============ end of search ============
% 10.05/10.26
% 10.05/10.26 ----------- soft-scott stats ----------
% 10.05/10.26
% 10.05/10.26 true clauses given 12 (26.7%)
% 10.05/10.26 false clauses given 33
% 10.05/10.26
% 10.05/10.26 FALSE TRUE
% 10.05/10.26 4 1 0
% 10.05/10.26 6 2 2
% 10.05/10.26 7 0 8
% 10.05/10.26 10 11 14
% 10.05/10.26 11 6 75
% 10.05/10.26 12 17 12
% 10.05/10.26 14 25 53
% 10.05/10.26 15 3 211
% 10.05/10.26 16 12 24
% 10.05/10.26 18 35 62
% 10.05/10.26 19 2 439
% 10.05/10.26 20 8 10
% 10.05/10.26 22 25 59
% 10.05/10.26 23 0 465
% 10.05/10.26 26 2 6
% 10.05/10.26 27 0 445
% 10.05/10.26 31 0 196
% 10.05/10.26 35 0 12
% 10.05/10.26 tot: 149 2093 (93.4% true)
% 10.05/10.26
% 10.05/10.26
% 10.05/10.26 Model 24 [ 11 7 224425 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.26
% 10.05/10.26 That finishes the proof of the theorem.
% 10.05/10.26
% 10.05/10.26 Process 20658 finished Mon Jun 13 06:43:17 2022
%------------------------------------------------------------------------------