TSTP Solution File: GRP033-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP033-3 : TPTP v8.1.0. Bugfixed v4.0.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:08 EDT 2022
% Result : Unsatisfiable 0.51s 0.75s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP033-3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 06:35:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n014.cluster.edu,
% 0.12/0.35 Mon Jun 13 06:35:07 2022
% 0.12/0.35 The command was "./sos". The process ID is 8705.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=1, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 There is a clause for symmetry of equality is, so it is
% 0.12/0.35 assumed that equality is fully axiomatized; therefore,
% 0.12/0.35 paramodulation is disabled.
% 0.12/0.35
% 0.12/0.35 dependent: clear(para_from).
% 0.12/0.35 dependent: clear(para_into).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} equalish(A,A).
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 15
% 0.12/0.38 number of clauses initially in problem: 22
% 0.12/0.38 percentage of clauses intially in UL: 68
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 75
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 8
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 3
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.51/0.75
% 0.51/0.75 -------- PROOF --------
% 0.51/0.75 % SZS status Unsatisfiable
% 0.51/0.75 % SZS output start Refutation
% 0.51/0.75
% 0.51/0.75 Model 2 (0.00 seconds, 0 Inserts)
% 0.51/0.75
% 0.51/0.75 Stopped by limit on number of solutions
% 0.51/0.75
% 0.51/0.75 Model 3 (0.00 seconds, 0 Inserts)
% 0.51/0.75
% 0.51/0.75 Stopped by limit on number of solutions
% 0.51/0.75
% 0.51/0.75 Model 4 [ 1 1 64 ] (0.00 seconds, 2799 Inserts)
% 0.51/0.75
% 0.51/0.75 Stopped by limit on insertions
% 0.51/0.75
% 0.51/0.75 Model 5 [ 1 1 170 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.75
% 0.51/0.75 Stopped by limit on insertions
% 0.51/0.75
% 0.51/0.75 Model 6 [ 1 1 4409 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.75
% 0.51/0.75 Stopped by limit on insertions
% 0.51/0.75
% 0.51/0.75 Model 7 [ 2 5 118709 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.75
% 0.51/0.75 -----> EMPTY CLAUSE at 0.37 sec ----> 34 [hyper,31,15,18,17] {-} $F.
% 0.51/0.75
% 0.51/0.75 Length of proof is 2. Level of proof is 2.
% 0.51/0.75
% 0.51/0.75 ---------------- PROOF ----------------
% 0.51/0.75 % SZS status Unsatisfiable
% 0.51/0.75 % SZS output start Refutation
% 0.51/0.75
% 0.51/0.75 13 [] {+} -subgroup_member(A)| -subgroup_member(B)| -product(A,inverse(B),C)|subgroup_member(C).
% 0.51/0.75 14 [] {+} -subgroup_member(A)|subgroup_member(j(A)).
% 0.51/0.75 15 [] {+} -product(j(A),A,j(A))| -product(A,j(A),j(A))| -subgroup_member(A).
% 0.51/0.75 17 [] {+} product(identity,A,A).
% 0.51/0.75 18 [] {+} product(A,identity,A).
% 0.51/0.75 20 [] {+} product(A,inverse(A),identity).
% 0.51/0.75 22 [] {+} subgroup_member(a).
% 0.51/0.75 23 [hyper,22,14] {+} subgroup_member(j(a)).
% 0.51/0.75 31 [hyper,20,13,23,23] {-} subgroup_member(identity).
% 0.51/0.75 34 [hyper,31,15,18,17] {-} $F.
% 0.51/0.75
% 0.51/0.75 % SZS output end Refutation
% 0.51/0.75 ------------ end of proof -------------
% 0.51/0.75
% 0.51/0.75
% 0.51/0.75 Search stopped by max_proofs option.
% 0.51/0.75
% 0.51/0.75
% 0.51/0.75 Search stopped by max_proofs option.
% 0.51/0.75
% 0.51/0.75 ============ end of search ============
% 0.51/0.75
% 0.51/0.75 ----------- soft-scott stats ----------
% 0.51/0.75
% 0.51/0.75 true clauses given 2 (25.0%)
% 0.51/0.75 false clauses given 6
% 0.51/0.75
% 0.51/0.75 FALSE TRUE
% 0.51/0.75 4 0 2
% 0.51/0.75 5 1 1
% 0.51/0.75 6 2 3
% 0.51/0.75 tot: 3 6 (66.7% true)
% 0.51/0.75
% 0.51/0.75
% 0.51/0.75 Model 7 [ 2 5 118709 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.75
% 0.51/0.75 That finishes the proof of the theorem.
% 0.51/0.75
% 0.51/0.75 Process 8705 finished Mon Jun 13 06:35:07 2022
%------------------------------------------------------------------------------