TSTP Solution File: MGT005-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT005-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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:45 EDT 2022
% Result : Unsatisfiable 8.33s 8.57s
% Output : Refutation 8.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : MGT005-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.09 % Command : sos-script %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 9 12:31:52 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.31 ----- Otter 3.2, August 2001 -----
% 0.13/0.31 The process was started by sandbox2 on n032.cluster.edu,
% 0.13/0.31 Thu Jun 9 12:31:52 2022
% 0.13/0.31 The command was "./sos". The process ID is 10329.
% 0.13/0.31
% 0.13/0.31 set(prolog_style_variables).
% 0.13/0.31 set(auto).
% 0.13/0.31 dependent: set(auto1).
% 0.13/0.31 dependent: set(process_input).
% 0.13/0.31 dependent: clear(print_kept).
% 0.13/0.31 dependent: clear(print_new_demod).
% 0.13/0.31 dependent: clear(print_back_demod).
% 0.13/0.31 dependent: clear(print_back_sub).
% 0.13/0.31 dependent: set(control_memory).
% 0.13/0.31 dependent: assign(max_mem, 12000).
% 0.13/0.31 dependent: assign(pick_given_ratio, 4).
% 0.13/0.31 dependent: assign(stats_level, 1).
% 0.13/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.31 dependent: assign(sos_limit, 5000).
% 0.13/0.31 dependent: assign(max_weight, 60).
% 0.13/0.31 clear(print_given).
% 0.13/0.31
% 0.13/0.31 list(usable).
% 0.13/0.31
% 0.13/0.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 0.13/0.31
% 0.13/0.31 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.31 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.31 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.31 clauses in usable.
% 0.13/0.31
% 0.13/0.31 dependent: set(knuth_bendix).
% 0.13/0.31 dependent: set(para_from).
% 0.13/0.31 dependent: set(para_into).
% 0.13/0.31 dependent: clear(para_from_right).
% 0.13/0.31 dependent: clear(para_into_right).
% 0.13/0.31 dependent: set(para_from_vars).
% 0.13/0.31 dependent: set(eq_units_both_ways).
% 0.13/0.31 dependent: set(dynamic_demod_all).
% 0.13/0.31 dependent: set(dynamic_demod).
% 0.13/0.31 dependent: set(order_eq).
% 0.13/0.31 dependent: set(back_demod).
% 0.13/0.31 dependent: set(lrpo).
% 0.13/0.31 dependent: set(hyper_res).
% 0.13/0.31 dependent: set(unit_deletion).
% 0.13/0.31 dependent: set(factor).
% 0.13/0.31
% 0.13/0.31 ------------> process usable:
% 0.13/0.31 18 back subsumes 16.
% 0.13/0.31 18 back subsumes 15.
% 0.13/0.31
% 0.13/0.31 ------------> process sos:
% 0.13/0.31 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] {-} A=A.
% 0.13/0.31 41 back subsumes 22.
% 0.13/0.31
% 0.13/0.31 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 19
% 0.13/0.39 number of clauses initially in problem: 38
% 0.13/0.39 percentage of clauses intially in UL: 50
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 54
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 22
% 0.13/0.39 distinct predicate count: 9
% 0.13/0.39 distinct function count: 1
% 0.13/0.39 distinct constant count: 12
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 8.33/8.57
% 8.33/8.57 -------- PROOF --------
% 8.33/8.57 % SZS status Unsatisfiable
% 8.33/8.57 % SZS output start Refutation
% 8.33/8.57
% 8.33/8.57 Model 3 (0.00 seconds, 0 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on number of solutions
% 8.33/8.57
% 8.33/8.57 Model 4 (0.00 seconds, 0 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on number of solutions
% 8.33/8.57
% 8.33/8.57 Model 5 (0.00 seconds, 0 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on number of solutions
% 8.33/8.57
% 8.33/8.57 Model 6 (0.00 seconds, 0 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on number of solutions
% 8.33/8.57
% 8.33/8.57 Model 7 (0.00 seconds, 0 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on number of solutions
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 8 [ 2 2 314 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 9 [ 1 3 1459 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 10 [ 1 4 1350 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 11 [ 2 3 361 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 12 [ 2 6 394 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 13 [ 1 3 488 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 14 [ 4 2 227 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 15 [ 4 5 277 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 16 [ 1 9 814 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 17 [ 1 7 272 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 18 [ 2 6 1633 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 Stopped by limit on insertions
% 8.33/8.57
% 8.33/8.57 Model 19 [ 3 7 1003 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 ----> UNIT CONFLICT at 7.95 sec ----> 219 [binary,218.1,11.1] {-} $F.
% 8.33/8.57
% 8.33/8.57 Length of proof is 16. Level of proof is 8.
% 8.33/8.57
% 8.33/8.57 ---------------- PROOF ----------------
% 8.33/8.57 % SZS status Unsatisfiable
% 8.33/8.57 % SZS output start Refutation
% 8.33/8.57
% 8.33/8.57 2 [] {+} -greater(A,B)| -greater(B,A).
% 8.33/8.57 3 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 8.33/8.57 4 [] {+} -organization(A,B)|survival_chance(A,sk1(B,A),B).
% 8.33/8.57 5 [] {+} -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 8.33/8.57 6 [] {+} -reorganization(A,B,C)|greater(C,B).
% 8.33/8.57 7 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 8.33/8.57 8 [] {+} -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 8.33/8.57 9 [] {+} -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).
% 8.33/8.57 10 [] {+} -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.
% 8.33/8.57 11 [] {+} -greater(sk7,sk8).
% 8.33/8.57 12 [factor,2.1.2] {+} -greater(A,A).
% 8.33/8.57 23 [] {+} organization(sk2,sk11).
% 8.33/8.57 24 [] {+} organization(sk3,sk11).
% 8.33/8.57 25 [] {+} organization(sk2,sk13).
% 8.33/8.57 26 [] {+} organization(sk3,sk13).
% 8.33/8.57 27 [] {+} class(sk2,sk5,sk11).
% 8.33/8.57 28 [] {+} class(sk3,sk5,sk11).
% 8.33/8.57 29 [] {+} survival_chance(sk2,sk6,sk11).
% 8.33/8.57 30 [] {+} survival_chance(sk3,sk6,sk11).
% 8.33/8.57 31 [] {+} reorganization(sk2,sk11,sk12).
% 8.33/8.57 32 [] {+} reorganization(sk3,sk11,sk13).
% 8.33/8.57 33 [] {+} reorganization_type(sk2,sk4,sk11).
% 8.33/8.57 34 [] {+} reorganization_type(sk3,sk4,sk11).
% 8.33/8.57 35 [] {+} reorganization_free(sk2,sk12,sk13).
% 8.33/8.57 36 [] {+} survival_chance(sk2,sk7,sk13).
% 8.33/8.57 37 [] {+} survival_chance(sk3,sk8,sk13).
% 8.33/8.57 38 [] {+} complexity(sk2,sk9,sk11).
% 8.33/8.57 39 [] {+} complexity(sk3,sk10,sk11).
% 8.33/8.57 40 [] {+} greater(sk10,sk9).
% 8.33/8.57 78 [hyper,31,6] {+} greater(sk12,sk11).
% 8.33/8.57 157 [hyper,39,9,23,24,26,27,28,31,32,33,34,38,40] {+} greater(sk13,sk12).
% 8.33/8.57 164 [hyper,157,5,24,26,78] {+} organization(sk3,sk12).
% 8.33/8.57 165 [hyper,157,5,23,25,78] {+} organization(sk2,sk12).
% 8.33/8.57 170 [hyper,164,4] {+} survival_chance(sk3,sk1(sk12,sk3),sk12).
% 8.33/8.57 175 [hyper,165,4] {+} survival_chance(sk2,sk1(sk12,sk2),sk12).
% 8.33/8.57 186 [hyper,170,8,164,26,32,37,157,unit_del,12] {+} greater(sk11,sk12)|greater(sk1(sk12,sk3),sk8).
% 8.33/8.57 189 [hyper,175,10,23,24,165,164,27,28,29,30,31,32,33,34,170,38,39,40,flip.2] {+} greater(sk1(sk12,sk2),sk1(sk12,sk3))|sk1(sk12,sk3)=sk1(sk12,sk2).
% 8.33/8.57 193 [hyper,175,7,165,25,35,36,157] {-} greater(sk7,sk1(sk12,sk2)).
% 8.33/8.57 194 [hyper,186,3,78,unit_del,12] {+} greater(sk1(sk12,sk3),sk8).
% 8.33/8.57 196 [hyper,189,3,193] {+} sk1(sk12,sk3)=sk1(sk12,sk2)|greater(sk7,sk1(sk12,sk3)).
% 8.33/8.57 202 [para_from,189.2.1,194.1.1] {+} greater(sk1(sk12,sk2),sk8)|greater(sk1(sk12,sk2),sk1(sk12,sk3)).
% 8.33/8.57 214,213 [hyper,196,3,194,unit_del,11] {+} sk1(sk12,sk3)=sk1(sk12,sk2).
% 8.33/8.57 216 [back_demod,202,demod,214,unit_del,12] {+} greater(sk1(sk12,sk2),sk8).
% 8.33/8.57 218 [hyper,216,3,193] {-} greater(sk7,sk8).
% 8.33/8.57 219 [binary,218.1,11.1] {-} $F.
% 8.33/8.57
% 8.33/8.57 % SZS output end Refutation
% 8.33/8.57 ------------ end of proof -------------
% 8.33/8.57
% 8.33/8.57
% 8.33/8.57 Search stopped by max_proofs option.
% 8.33/8.57
% 8.33/8.57
% 8.33/8.57 Search stopped by max_proofs option.
% 8.33/8.57
% 8.33/8.57 ============ end of search ============
% 8.33/8.57
% 8.33/8.57 ----------- soft-scott stats ----------
% 8.33/8.57
% 8.33/8.57 true clauses given 28 (46.7%)
% 8.33/8.57 false clauses given 32
% 8.33/8.57
% 8.33/8.57 FALSE TRUE
% 8.33/8.57 6 0 1
% 8.33/8.57 7 0 2
% 8.33/8.57 12 0 3
% 8.33/8.57 13 0 1
% 8.33/8.57 14 0 4
% 8.33/8.57 59 0 37
% 8.33/8.57 60 0 78
% 8.33/8.57 tot: 0 126 (100.0% true)
% 8.33/8.57
% 8.33/8.57
% 8.33/8.57 Model 19 [ 3 7 1003 ] (0.00 seconds, 250000 Inserts)
% 8.33/8.57
% 8.33/8.57 That finishes the proof of the theorem.
% 8.33/8.57
% 8.33/8.57 Process 10329 finished Thu Jun 9 12:32:01 2022
%------------------------------------------------------------------------------