TSTP Solution File: MGT005+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 : Sun Jul 17 22:25:46 EDT 2022
% Result : Theorem 0.37s 0.58s
% Output : Refutation 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.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 : Thu Jun 9 09:11:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 ----- Otter 3.2, August 2001 -----
% 0.12/0.37 The process was started by sandbox2 on n024.cluster.edu,
% 0.12/0.37 Thu Jun 9 09:11:04 2022
% 0.12/0.37 The command was "./sos". The process ID is 15327.
% 0.12/0.37
% 0.12/0.37 set(prolog_style_variables).
% 0.12/0.37 set(auto).
% 0.12/0.37 dependent: set(auto1).
% 0.12/0.37 dependent: set(process_input).
% 0.12/0.37 dependent: clear(print_kept).
% 0.12/0.37 dependent: clear(print_new_demod).
% 0.12/0.37 dependent: clear(print_back_demod).
% 0.12/0.37 dependent: clear(print_back_sub).
% 0.12/0.37 dependent: set(control_memory).
% 0.12/0.37 dependent: assign(max_mem, 12000).
% 0.12/0.37 dependent: assign(pick_given_ratio, 4).
% 0.12/0.37 dependent: assign(stats_level, 1).
% 0.12/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37 dependent: assign(sos_limit, 5000).
% 0.12/0.37 dependent: assign(max_weight, 60).
% 0.12/0.37 clear(print_given).
% 0.12/0.37
% 0.12/0.37 formula_list(usable).
% 0.12/0.37
% 0.12/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 0.12/0.37
% 0.12/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37 clauses in usable.
% 0.12/0.37
% 0.12/0.37 dependent: set(knuth_bendix).
% 0.12/0.37 dependent: set(para_from).
% 0.12/0.37 dependent: set(para_into).
% 0.12/0.37 dependent: clear(para_from_right).
% 0.12/0.37 dependent: clear(para_into_right).
% 0.12/0.37 dependent: set(para_from_vars).
% 0.12/0.37 dependent: set(eq_units_both_ways).
% 0.12/0.37 dependent: set(dynamic_demod_all).
% 0.12/0.37 dependent: set(dynamic_demod).
% 0.12/0.37 dependent: set(order_eq).
% 0.12/0.37 dependent: set(back_demod).
% 0.12/0.37 dependent: set(lrpo).
% 0.12/0.37 dependent: set(hyper_res).
% 0.12/0.37 dependent: set(unit_deletion).
% 0.12/0.37 dependent: set(factor).
% 0.12/0.37
% 0.12/0.37 ------------> process usable:
% 0.12/0.37 27 back subsumes 25.
% 0.12/0.37 27 back subsumes 24.
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37 Following clause subsumed by 76 during input processing: 0 [copy,76,flip.1] {-} A=A.
% 0.12/0.37 76 back subsumes 21.
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Failed to model usable list: disabling FINDER
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 -------------- Softie stats --------------
% 0.19/0.42
% 0.19/0.42 UPDATE_STOP: 300
% 0.19/0.42 SFINDER_TIME_LIMIT: 2
% 0.19/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42 number of clauses in intial UL: 51
% 0.19/0.42 number of clauses initially in problem: 73
% 0.19/0.42 percentage of clauses intially in UL: 69
% 0.19/0.42 percentage of distinct symbols occuring in initial UL: 57
% 0.19/0.42 percent of all initial clauses that are short: 100
% 0.19/0.42 absolute distinct symbol count: 26
% 0.19/0.42 distinct predicate count: 9
% 0.19/0.42 distinct function count: 4
% 0.19/0.42 distinct constant count: 13
% 0.19/0.42
% 0.19/0.42 ---------- no more Softie stats ----------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 =========== start of search ===========
% 0.37/0.58
% 0.37/0.58 -------- PROOF --------
% 0.37/0.58 % SZS status Theorem
% 0.37/0.58 % SZS output start Refutation
% 0.37/0.58
% 0.37/0.58 -----> EMPTY CLAUSE at 0.22 sec ----> 265 [hyper,78,11,56,57,234,233,60,61,62,63,64,65,66,67,77,71,72,73,unit_del,18,19] {-} $F.
% 0.37/0.58
% 0.37/0.58 Length of proof is 6. Level of proof is 2.
% 0.37/0.58
% 0.37/0.58 ---------------- PROOF ----------------
% 0.37/0.58 % SZS status Theorem
% 0.37/0.58 % SZS output start Refutation
% 0.37/0.58
% 0.37/0.58 6 [] {+} -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 0.37/0.58 7 [] {+} -reorganization(A,B,C)|greater(C,B).
% 0.37/0.58 10 [] {+} -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 0.37/0.58 11 [] {+} -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 0.37/0.58 18 [] {+} -greater($c8,$c7).
% 0.37/0.58 19 [] {+} $c8!=$c7.
% 0.37/0.58 56 [] {-} organization($c13,$c3).
% 0.37/0.58 57 [] {-} organization($c12,$c3).
% 0.37/0.58 58 [] {-} organization($c13,$c1).
% 0.37/0.58 59 [] {-} organization($c12,$c1).
% 0.37/0.58 60 [] {-} class($c13,$c10,$c3).
% 0.37/0.58 61 [] {-} class($c12,$c10,$c3).
% 0.37/0.58 62 [] {-} survival_chance($c13,$c9,$c3).
% 0.37/0.58 63 [] {-} survival_chance($c12,$c9,$c3).
% 0.37/0.58 64 [] {-} reorganization($c13,$c3,$c2).
% 0.37/0.58 65 [] {-} reorganization($c12,$c3,$c1).
% 0.37/0.58 66 [] {-} reorganization_type($c13,$c11,$c3).
% 0.37/0.58 67 [] {-} reorganization_type($c12,$c11,$c3).
% 0.37/0.58 69 [] {-} survival_chance($c13,$c8,$c4).
% 0.37/0.58 70 [] {-} survival_chance($c12,$c7,$c4).
% 0.37/0.58 71 [] {-} complexity($c13,$c6,$c3).
% 0.37/0.58 72 [] {-} complexity($c12,$c5,$c3).
% 0.37/0.58 73 [] {-} greater($c5,$c6).
% 0.37/0.58 75,74 [] {-} $c4=$c2.
% 0.37/0.58 77 [back_demod,70,demod,75] {-} survival_chance($c12,$c7,$c2).
% 0.37/0.58 78 [back_demod,69,demod,75] {-} survival_chance($c13,$c8,$c2).
% 0.37/0.58 155 [hyper,64,7] {-} greater($c2,$c3).
% 0.37/0.58 223 [hyper,72,10,56,57,59,60,61,64,65,66,67,71,73] {-} greater($c1,$c2).
% 0.37/0.58 233 [hyper,223,6,57,59,155] {-} organization($c12,$c2).
% 0.37/0.58 234 [hyper,223,6,56,58,155] {-} organization($c13,$c2).
% 0.37/0.58 265 [hyper,78,11,56,57,234,233,60,61,62,63,64,65,66,67,77,71,72,73,unit_del,18,19] {-} $F.
% 0.37/0.58
% 0.37/0.58 % SZS output end Refutation
% 0.37/0.58 ------------ end of proof -------------
% 0.37/0.58
% 0.37/0.58
% 0.37/0.58 Search stopped by max_proofs option.
% 0.37/0.58
% 0.37/0.58
% 0.37/0.58 Search stopped by max_proofs option.
% 0.37/0.58
% 0.37/0.58 ============ end of search ============
% 0.37/0.58
% 0.37/0.58 That finishes the proof of the theorem.
% 0.37/0.58
% 0.37/0.58 Process 15327 finished Thu Jun 9 09:11:04 2022
%------------------------------------------------------------------------------