TSTP Solution File: GRP644+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP644+1 : TPTP v8.1.0. Released v3.4.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:43:48 EDT 2022
% Result : Theorem 0.48s 0.67s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP644+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n014.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 06:54:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n014.cluster.edu,
% 0.20/0.36 Mon Jun 13 06:54:37 2022
% 0.20/0.36 The command was "./sos". The process ID is 32151.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36 Following clause subsumed by 8 during input processing: 0 [] {-} v1_xboole_0(A)|v1_xboole_0(B)| -m1_relset_1(C,A,B)| -v1_funct_1(C)| -v1_funct_2(C,A,B)|v1_partfun1(C,A,B).
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 80 during input processing: 0 [copy,80,flip.1] {-} A=A.
% 0.20/0.36 80 back subsumes 53.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.48/0.65
% 0.48/0.65 Stopped by limit on insertions
% 0.48/0.65
% 0.48/0.65
% 0.48/0.65 Failed to model usable list: disabling FINDER
% 0.48/0.65
% 0.48/0.65
% 0.48/0.65
% 0.48/0.65 -------------- Softie stats --------------
% 0.48/0.65
% 0.48/0.65 UPDATE_STOP: 300
% 0.48/0.65 SFINDER_TIME_LIMIT: 2
% 0.48/0.65 SHORT_CLAUSE_CUTOFF: 4
% 0.48/0.65 number of clauses in intial UL: 51
% 0.48/0.65 number of clauses initially in problem: 78
% 0.48/0.65 percentage of clauses intially in UL: 65
% 0.48/0.65 percentage of distinct symbols occuring in initial UL: 80
% 0.48/0.65 percent of all initial clauses that are short: 98
% 0.48/0.65 absolute distinct symbol count: 46
% 0.48/0.65 distinct predicate count: 19
% 0.48/0.65 distinct function count: 18
% 0.48/0.65 distinct constant count: 9
% 0.48/0.65
% 0.48/0.65 ---------- no more Softie stats ----------
% 0.48/0.65
% 0.48/0.65
% 0.48/0.65
% 0.48/0.65 =========== start of search ===========
% 0.48/0.67
% 0.48/0.67 -------- PROOF --------
% 0.48/0.67 % SZS status Theorem
% 0.48/0.67 % SZS output start Refutation
% 0.48/0.67
% 0.48/0.67 -----> EMPTY CLAUSE at 0.29 sec ----> 800 [hyper,148,39,54,55,56,57,58,242,unit_del,1,2] {-} $F.
% 0.48/0.67
% 0.48/0.67 Length of proof is 3. Level of proof is 2.
% 0.48/0.67
% 0.48/0.67 ---------------- PROOF ----------------
% 0.48/0.67 % SZS status Theorem
% 0.48/0.67 % SZS output start Refutation
% 0.48/0.67
% 0.48/0.67 1 [] {+} -v3_struct_0($c3).
% 0.48/0.67 2 [] {+} -r2_hidden(k3_group_1($c3,$c1),k1_funct_1(k1_latsubgr($c3),$c2)).
% 0.48/0.67 15 [] {+} v3_struct_0(A)| -v3_group_1(A)| -v4_group_1(A)| -l1_group_1(A)| -m1_subset_1(B,u1_struct_0(A))|m1_subset_1(k3_group_1(A,B),u1_struct_0(A)).
% 0.48/0.67 38 [] {+} v3_struct_0(A)| -v3_group_1(A)| -v4_group_1(A)| -l1_group_1(A)| -v1_group_1(B)| -m1_group_2(B,A)| -m1_subset_1(C,u1_struct_0(A))| -r2_hidden(C,k1_funct_1(k1_latsubgr(A),B))|r1_rlvect_1(B,C).
% 0.48/0.67 39 [] {+} v3_struct_0(A)| -v3_group_1(A)| -v4_group_1(A)| -l1_group_1(A)| -v1_group_1(B)| -m1_group_2(B,A)| -m1_subset_1(C,u1_struct_0(A))|r2_hidden(C,k1_funct_1(k1_latsubgr(A),B))| -r1_rlvect_1(B,C).
% 0.48/0.67 46 [] {+} v3_struct_0(A)| -v3_group_1(A)| -v4_group_1(A)| -l1_group_1(A)| -m1_subset_1(B,u1_struct_0(A))| -m1_group_2(C,A)| -r1_rlvect_1(C,B)|r1_rlvect_1(C,k3_group_1(A,B)).
% 0.48/0.67 54 [] {-} v3_group_1($c3).
% 0.48/0.67 55 [] {-} v4_group_1($c3).
% 0.48/0.67 56 [] {-} l1_group_1($c3).
% 0.48/0.67 57 [] {-} v1_group_1($c2).
% 0.48/0.67 58 [] {-} m1_group_2($c2,$c3).
% 0.48/0.67 59 [] {-} m1_subset_1($c1,u1_struct_0($c3)).
% 0.48/0.67 60 [] {-} r2_hidden($c1,k1_funct_1(k1_latsubgr($c3),$c2)).
% 0.48/0.67 148 [hyper,59,15,54,55,56,unit_del,1] {-} m1_subset_1(k3_group_1($c3,$c1),u1_struct_0($c3)).
% 0.48/0.67 180 [hyper,60,38,54,55,56,57,58,59,unit_del,1] {-} r1_rlvect_1($c2,$c1).
% 0.48/0.67 242 [hyper,180,46,54,55,56,59,58,unit_del,1] {-} r1_rlvect_1($c2,k3_group_1($c3,$c1)).
% 0.48/0.67 800 [hyper,148,39,54,55,56,57,58,242,unit_del,1,2] {-} $F.
% 0.48/0.67
% 0.48/0.67 % SZS output end Refutation
% 0.48/0.67 ------------ end of proof -------------
% 0.48/0.67
% 0.48/0.67
% 0.48/0.67 Search stopped by max_proofs option.
% 0.48/0.67
% 0.48/0.67
% 0.48/0.67 Search stopped by max_proofs option.
% 0.48/0.67
% 0.48/0.67 ============ end of search ============
% 0.48/0.67
% 0.48/0.67 That finishes the proof of the theorem.
% 0.48/0.67
% 0.48/0.67 Process 32151 finished Mon Jun 13 06:54:37 2022
%------------------------------------------------------------------------------