TSTP Solution File: GRP135-1.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP135-1.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:52 EDT 2022
% Result : Unsatisfiable 1.87s 2.09s
% Output : Refutation 1.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP135-1.002 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n021.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 20:45:12 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 n021.cluster.edu,
% 0.12/0.36 Mon Jun 13 20:45:12 2022
% 0.12/0.36 The command was "./sos". The process ID is 26176.
% 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=4.
% 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 2 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 10
% 0.12/0.39 number of clauses initially in problem: 12
% 0.12/0.39 percentage of clauses intially in UL: 83
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 5
% 0.12/0.39 distinct predicate count: 3
% 0.12/0.39 distinct function count: 0
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 1.87/2.09
% 1.87/2.09 -------- PROOF --------
% 1.87/2.09 % SZS status Unsatisfiable
% 1.87/2.09 % SZS output start Refutation
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 3 [ 1 1 106 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 4 [ 1 1 59 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 5 [ 1 0 111 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 6 [ 2 1 344 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 7 [ 2 0 114 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 8 [ 2 0 208 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 9 [ 3 0 979 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 10 [ 3 1 12600 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 11 [ 4 0 94 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 12 [ 4 0 68 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 Stopped by limit on insertions
% 1.87/2.09
% 1.87/2.09 Model 13 [ 5 1 153 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 ----> UNIT CONFLICT at 1.70 sec ----> 220 [binary,218.1,2.1] {+} $F.
% 1.87/2.09
% 1.87/2.09 Length of proof is 10. Level of proof is 7.
% 1.87/2.09
% 1.87/2.09 ---------------- PROOF ----------------
% 1.87/2.09 % SZS status Unsatisfiable
% 1.87/2.09 % SZS output start Refutation
% 1.87/2.09
% 1.87/2.09 1 [] {-} -equalish(e_1,e_2).
% 1.87/2.09 2 [copy,1,flip.1] {+} -equalish(e_2,e_1).
% 1.87/2.09 3 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 1.87/2.09 6 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 1.87/2.09 7 [] {+} -product(A,B,C)| -product(C,A,D)|product(D,A,B).
% 1.87/2.09 8 [factor,3.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2).
% 1.87/2.09 12 [] {+} group_element(e_1).
% 1.87/2.09 13 [] {+} group_element(e_2).
% 1.87/2.09 14 [hyper,12,8] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 1.87/2.09 18 [hyper,13,8] {+} product(e_2,e_2,e_1)|product(e_2,e_2,e_2).
% 1.87/2.09 19 [hyper,13,3,12] {+} product(e_1,e_2,e_1)|product(e_1,e_2,e_2).
% 1.87/2.09 99 [hyper,19,7,18,factor_simp] {+} product(e_1,e_2,e_1)|product(e_2,e_2,e_2).
% 1.87/2.09 162 [hyper,99,6,19,unit_del,2,factor_simp] {+} product(e_1,e_2,e_1).
% 1.87/2.09 197 [hyper,162,7,14,factor_simp] {+} product(e_1,e_1,e_2).
% 1.87/2.09 207 [hyper,197,7,162] {+} product(e_2,e_1,e_2).
% 1.87/2.09 218 [hyper,207,6,197,flip.1] {-} equalish(e_2,e_1).
% 1.87/2.09 220 [binary,218.1,2.1] {+} $F.
% 1.87/2.09
% 1.87/2.09 % SZS output end Refutation
% 1.87/2.09 ------------ end of proof -------------
% 1.87/2.09
% 1.87/2.09
% 1.87/2.09 Search stopped by max_proofs option.
% 1.87/2.09
% 1.87/2.09
% 1.87/2.09 Search stopped by max_proofs option.
% 1.87/2.09
% 1.87/2.09 ============ end of search ============
% 1.87/2.09
% 1.87/2.09 ----------- soft-scott stats ----------
% 1.87/2.09
% 1.87/2.09 true clauses given 3 (20.0%)
% 1.87/2.09 false clauses given 12
% 1.87/2.09
% 1.87/2.09 FALSE TRUE
% 1.87/2.09 3 0 2
% 1.87/2.09 4 2 0
% 1.87/2.09 10 3 1
% 1.87/2.09 12 18 0
% 1.87/2.09 14 0 16
% 1.87/2.09 16 9 0
% 1.87/2.09 18 0 6
% 1.87/2.09 tot: 32 25 (43.9% true)
% 1.87/2.09
% 1.87/2.09
% 1.87/2.09 Model 13 [ 5 1 153 ] (0.00 seconds, 250000 Inserts)
% 1.87/2.09
% 1.87/2.09 That finishes the proof of the theorem.
% 1.87/2.09
% 1.87/2.09 Process 26176 finished Mon Jun 13 20:45:14 2022
%------------------------------------------------------------------------------