TSTP Solution File: MGT060-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : MGT060-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n021.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:26:04 EDT 2022

% Result   : Unsatisfiable 2.32s 2.52s
% Output   : Refutation 2.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT060-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun  9 09:21:38 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox2 on n021.cluster.edu,
% 0.13/0.35  Thu Jun  9 09:21:38 2022
% 0.13/0.35  The command was "./sos".  The process ID is 8252.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.35  
% 0.13/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35  clauses in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(knuth_bendix).
% 0.13/0.35     dependent: set(para_from).
% 0.13/0.35     dependent: set(para_into).
% 0.13/0.35     dependent: clear(para_from_right).
% 0.13/0.35     dependent: clear(para_into_right).
% 0.13/0.35     dependent: set(para_from_vars).
% 0.13/0.35     dependent: set(eq_units_both_ways).
% 0.13/0.35     dependent: set(dynamic_demod_all).
% 0.13/0.35     dependent: set(dynamic_demod).
% 0.13/0.35     dependent: set(order_eq).
% 0.13/0.35     dependent: set(back_demod).
% 0.13/0.35     dependent: set(lrpo).
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: set(unit_deletion).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35    Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.19/0.38  
% 0.19/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38  
% 0.19/0.38  Stopped by limit on number of solutions
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  -------------- Softie stats --------------
% 0.19/0.38  
% 0.19/0.38  UPDATE_STOP: 300
% 0.19/0.38  SFINDER_TIME_LIMIT: 2
% 0.19/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38  number of clauses in intial UL: 18
% 0.19/0.38  number of clauses initially in problem: 27
% 0.19/0.38  percentage of clauses intially in UL: 66
% 0.19/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38  percent of all initial clauses that are short: 100
% 0.19/0.38  absolute distinct symbol count: 18
% 0.19/0.38     distinct predicate count: 9
% 0.19/0.38     distinct function count: 1
% 0.19/0.38     distinct constant count: 8
% 0.19/0.38  
% 0.19/0.38  ---------- no more Softie stats ----------
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.38  
% 0.19/0.38  Stopped by limit on number of solutions
% 0.19/0.38  
% 0.19/0.38  =========== start of search ===========
% 2.32/2.52  
% 2.32/2.52  -------- PROOF -------- 
% 2.32/2.52  % SZS status Unsatisfiable
% 2.32/2.52  % SZS output start Refutation
% 2.32/2.52  
% 2.32/2.52  Model 3 (0.00 seconds, 0 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on number of solutions
% 2.32/2.52  
% 2.32/2.52  Model 4 (0.00 seconds, 0 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on number of solutions
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 5 [ 1 1 160 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 6 [ 4 1 159 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 7 [ 1 1 45843 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 8 [ 4 0 130 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 9 [ 1 0 186 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 10 [ 1 1 763 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 11 [ 5 1 192 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 12 [ 2 0 249 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 13 [ 5 1 5082 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 14 [ 15 1 28674 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 15 [ 15 0 187 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 16 [ 11 0 241 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 17 [ 5 0 177 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 18 [ 3 1 6610 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 19 [ 18 0 1114 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 20 [ 3 2 46370 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 21 [ 20 1 214 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 22 [ 4 0 314 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 23 [ 6 1 168 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  Stopped by limit on insertions
% 2.32/2.52  
% 2.32/2.52  Model 24 [ 13 1 106 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  ----> UNIT CONFLICT at   2.15 sec ----> 2083 [binary,2082.1,18.1] {-} $F.
% 2.32/2.52  
% 2.32/2.52  Length of proof is 24.  Level of proof is 12.
% 2.32/2.52  
% 2.32/2.52  ---------------- PROOF ----------------
% 2.32/2.52  % SZS status Unsatisfiable
% 2.32/2.52  % SZS output start Refutation
% 2.32/2.52  
% 2.32/2.52  7 [] {+} -smaller(A,B)|greater(B,A).
% 2.32/2.52  9 [] {+} -greater(A,B)| -greater(B,A).
% 2.32/2.52  10 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 2.32/2.52  11 [] {+} -organization(A)| -has_immunity(A,B)|hazard_of_mortality(A,B)=very_low.
% 2.32/2.52  12 [] {+} -organization(A)|has_immunity(A,B)| -is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=low.
% 2.32/2.52  13 [] {+} -organization(A)|has_immunity(A,B)|is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=mod1.
% 2.32/2.52  14 [] {+} -organization(A)|has_immunity(A,B)| -is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=mod2.
% 2.32/2.52  15 [] {+} -organization(A)|has_immunity(A,B)|is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=high.
% 2.32/2.52  16 [] {+} -has_immunity(sk1,sk3).
% 2.32/2.52  17 [] {+} -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 2.32/2.52  18 [factor,9.1.2] {+} -greater(A,A).
% 2.32/2.52  19 [] {+} smaller(A,B)|A=B|greater(A,B).
% 2.32/2.52  20 [] {+} greater(high,mod1).
% 2.32/2.52  21 [] {+} greater(mod1,low).
% 2.32/2.52  22 [] {+} greater(low,very_low).
% 2.32/2.52  24 [] {+} greater(mod2,low).
% 2.32/2.52  25 [] {+} organization(sk1).
% 2.32/2.52  26 [] {+} has_immunity(sk1,sk2).
% 2.32/2.52  28 [hyper,19,7] {+} A=B|greater(A,B)|greater(B,A).
% 2.32/2.52  30 [para_from,19.2.1,17.1.2] {+} -greater(hazard_of_mortality(sk1,sk3),A)|smaller(hazard_of_mortality(sk1,sk2),A)|greater(hazard_of_mortality(sk1,sk2),A).
% 2.32/2.52  36 [para_from,19.2.1,17.1.1.1] {+} -greater(hazard_of_mortality(A,sk3),hazard_of_mortality(sk1,sk2))|smaller(sk1,A)|greater(sk1,A).
% 2.32/2.52  59 [hyper,21,10,20] {-} greater(high,low).
% 2.32/2.52  81 [hyper,24,10,22] {+} greater(mod2,very_low).
% 2.32/2.52  91,90 [hyper,26,11,25] {-} hazard_of_mortality(sk1,sk2)=very_low.
% 2.32/2.52  154 [hyper,28,10,22] {-} very_low=A|greater(A,very_low)|greater(low,A).
% 2.32/2.52  675 [para_into,36.1.1,14.5.1,demod,91,unit_del,81] {+} smaller(sk1,A)|greater(sk1,A)| -organization(A)|has_immunity(A,sk3)| -is_aligned(A,sk3)|positional_advantage(A,sk3).
% 2.32/2.52  677 [para_into,36.1.1,12.5.1,demod,91,unit_del,22] {+} smaller(sk1,A)|greater(sk1,A)| -organization(A)|has_immunity(A,sk3)| -is_aligned(A,sk3)| -positional_advantage(A,sk3).
% 2.32/2.52  763 [para_from,154.1.1,22.1.2,factor_simp] {+} greater(low,A)|greater(A,very_low).
% 2.32/2.52  774 [hyper,763,30,demod,91,91,unit_del,18] {-} greater(low,hazard_of_mortality(sk1,sk3))|smaller(very_low,very_low).
% 2.32/2.52  889 [hyper,774,7,unit_del,18] {-} greater(low,hazard_of_mortality(sk1,sk3)).
% 2.32/2.52  949 [hyper,889,10,59] {-} greater(high,hazard_of_mortality(sk1,sk3)).
% 2.32/2.52  953 [hyper,889,10,21] {-} greater(mod1,hazard_of_mortality(sk1,sk3)).
% 2.32/2.52  1018 [para_into,953.1.2,13.5.1,unit_del,18,25,16] {+} is_aligned(sk1,sk3)| -positional_advantage(sk1,sk3).
% 2.32/2.52  1283 [para_into,949.1.2,15.5.1,unit_del,18,25,16] {+} is_aligned(sk1,sk3)|positional_advantage(sk1,sk3).
% 2.32/2.52  1797 [hyper,1283,1018,factor_simp] {+} is_aligned(sk1,sk3).
% 2.32/2.52  1901 [para_into,675.1.1,28.1.1] {+} smaller(A,B)|greater(sk1,B)| -organization(B)|has_immunity(B,sk3)| -is_aligned(B,sk3)|positional_advantage(B,sk3)|greater(sk1,A)|greater(A,sk1).
% 2.32/2.52  1927 [factor,1901.2.8,unit_del,18,25,16,1797,18] {+} smaller(sk1,sk1)|positional_advantage(sk1,sk3).
% 2.32/2.52  1978 [hyper,1927,7,unit_del,18] {+} positional_advantage(sk1,sk3).
% 2.32/2.52  2050 [para_into,677.1.1,28.1.1] {+} smaller(A,B)|greater(sk1,B)| -organization(B)|has_immunity(B,sk3)| -is_aligned(B,sk3)| -positional_advantage(B,sk3)|greater(sk1,A)|greater(A,sk1).
% 2.32/2.52  2076 [factor,2050.2.8,unit_del,18,25,16,1797,1978,18] {-} smaller(sk1,sk1).
% 2.32/2.52  2082 [hyper,2076,7] {-} greater(sk1,sk1).
% 2.32/2.52  2083 [binary,2082.1,18.1] {-} $F.
% 2.32/2.52  
% 2.32/2.52  % SZS output end Refutation
% 2.32/2.52  ------------ end of proof -------------
% 2.32/2.52  
% 2.32/2.52  
% 2.32/2.52  Search stopped by max_proofs option.
% 2.32/2.52  
% 2.32/2.52  
% 2.32/2.52  Search stopped by max_proofs option.
% 2.32/2.52  
% 2.32/2.52  ============ end of search ============
% 2.32/2.52  
% 2.32/2.52  ----------- soft-scott stats ----------
% 2.32/2.52  
% 2.32/2.52  true clauses given          33      (32.4%)
% 2.32/2.52  false clauses given         69
% 2.32/2.52  
% 2.32/2.52        FALSE     TRUE
% 2.32/2.52     3  0         9
% 2.32/2.52     5  0         1
% 2.32/2.52     6  0         29
% 2.32/2.52     8  0         2
% 2.32/2.52     9  17        230
% 2.32/2.52    10  1         0
% 2.32/2.52    11  0         264
% 2.32/2.52    12  22        112
% 2.32/2.52    13  0         93
% 2.32/2.52    14  0         52
% 2.32/2.52    15  10        194
% 2.32/2.52    16  2         13
% 2.32/2.52    17  0         71
% 2.32/2.52    18  0         3
% 2.32/2.52    19  1         95
% 2.32/2.52    20  0         114
% 2.32/2.52    21  0         22
% 2.32/2.52    22  29        33
% 2.32/2.52    23  0         191
% 2.32/2.52    24  9         38
% 2.32/2.52    25  0         95
% 2.32/2.52    26  0         23
% 2.32/2.52    27  0         30
% 2.32/2.52  tot:  91        1714      (95.0% true)
% 2.32/2.52  
% 2.32/2.52  
% 2.32/2.52  Model 24 [ 13 -16 106 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.52  
% 2.32/2.52  That finishes the proof of the theorem.
% 2.32/2.52  
% 2.32/2.52  Process 8252 finished Thu Jun  9 09:21:40 2022
%------------------------------------------------------------------------------