TSTP Solution File: GRP038-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP038-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:09 EDT 2022
% Result : Unsatisfiable 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP038-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 07:05:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n015.cluster.edu,
% 0.13/0.37 Tue Jun 14 07:05:53 2022
% 0.13/0.37 The command was "./sos". The process ID is 16954.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.13/0.37
% 0.13/0.37 This is a Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.37 sos and nonpositive clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 6
% 0.20/0.41 number of clauses initially in problem: 16
% 0.20/0.41 percentage of clauses intially in UL: 37
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 55
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 9
% 0.20/0.41 distinct predicate count: 3
% 0.20/0.41 distinct function count: 2
% 0.20/0.41 distinct constant count: 4
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.20/0.47
% 0.20/0.47 -------- PROOF --------
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 6 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 7 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 ----> UNIT CONFLICT at 0.08 sec ----> 35 [binary,34.1,6.1] {-} $F.
% 0.20/0.47
% 0.20/0.47 Length of proof is 1. Level of proof is 1.
% 0.20/0.47
% 0.20/0.47 ---------------- PROOF ----------------
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 4 [] {+} -subgroup_member(A)| -subgroup_member(B)| -product(A,inverse(B),C)|subgroup_member(C).
% 0.20/0.47 6 [] {+} -subgroup_member(c).
% 0.20/0.47 13 [] {+} subgroup_member(a).
% 0.20/0.48 14 [] {+} subgroup_member(b).
% 0.20/0.48 15 [] {-} product(a,inverse(b),c).
% 0.20/0.48 34 [hyper,15,4,13,14] {-} subgroup_member(c).
% 0.20/0.48 35 [binary,34.1,6.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 1 (12.5%)
% 0.20/0.48 false clauses given 7
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 3 0 3
% 0.20/0.48 4 0 1
% 0.20/0.48 5 0 3
% 0.20/0.48 6 1 2
% 0.20/0.48 10 0 3
% 0.20/0.48 12 0 2
% 0.20/0.48 13 0 2
% 0.20/0.48 tot: 1 16 (94.1% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 7 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 16954 finished Tue Jun 14 07:05:54 2022
%------------------------------------------------------------------------------