TSTP Solution File: MGT008+1 by SOS---2.0

View Problem - Process Solution

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

% Computer : n022.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:47 EDT 2022

% Result   : Theorem 0.58s 0.81s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n022.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 : Thu Jun  9 07:23:34 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 sandbox on n022.cluster.edu,
% 0.12/0.35  Thu Jun  9 07:23:34 2022
% 0.12/0.35  The command was "./sos".  The process ID is 15385.
% 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  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set without equality.  The strategy will
% 0.12/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35  in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: clear(order_hyper).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.18/0.50  
% 0.18/0.50  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.50  
% 0.18/0.50  Stopped by limit on number of solutions
% 0.18/0.50  
% 0.18/0.50  
% 0.18/0.50  -------------- Softie stats --------------
% 0.18/0.50  
% 0.18/0.50  UPDATE_STOP: 300
% 0.18/0.50  SFINDER_TIME_LIMIT: 2
% 0.18/0.50  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.50  number of clauses in intial UL: 4
% 0.18/0.50  number of clauses initially in problem: 15
% 0.18/0.50  percentage of clauses intially in UL: 26
% 0.18/0.50  percentage of distinct symbols occuring in initial UL: 58
% 0.18/0.50  percent of all initial clauses that are short: 100
% 0.18/0.50  absolute distinct symbol count: 17
% 0.18/0.50     distinct predicate count: 7
% 0.18/0.50     distinct function count: 1
% 0.18/0.50     distinct constant count: 9
% 0.18/0.50  
% 0.18/0.50  ---------- no more Softie stats ----------
% 0.18/0.50  
% 0.18/0.50  
% 0.18/0.50  
% 0.18/0.50  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.50  
% 0.18/0.50  Stopped by limit on number of solutions
% 0.18/0.50  
% 0.18/0.50  =========== start of search ===========
% 0.58/0.81  
% 0.58/0.81  -------- PROOF -------- 
% 0.58/0.81  % SZS status Theorem
% 0.58/0.81  % SZS output start Refutation
% 0.58/0.81  
% 0.58/0.81  Model 3 (0.00 seconds, 0 Inserts)
% 0.58/0.81  
% 0.58/0.81  Stopped by limit on number of solutions
% 0.58/0.81  
% 0.58/0.81  Model 4 (0.00 seconds, 0 Inserts)
% 0.58/0.81  
% 0.58/0.81  Stopped by limit on number of solutions
% 0.58/0.81  
% 0.58/0.81  Model 5 (0.00 seconds, 0 Inserts)
% 0.58/0.81  
% 0.58/0.81  Stopped by limit on number of solutions
% 0.58/0.81  
% 0.58/0.81  Model 6 (0.00 seconds, 0 Inserts)
% 0.58/0.81  
% 0.58/0.81  Stopped by limit on number of solutions
% 0.58/0.81  
% 0.58/0.81  Stopped by limit on insertions
% 0.58/0.81  
% 0.58/0.81  Model 7 [ 1 5 1440 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.81  
% 0.58/0.81  ----> UNIT CONFLICT at   0.35 sec ----> 20 [binary,19.1,4.1] {+} $F.
% 0.58/0.81  
% 0.58/0.81  Length of proof is 4.  Level of proof is 3.
% 0.58/0.81  
% 0.58/0.81  ---------------- PROOF ----------------
% 0.58/0.81  % SZS status Theorem
% 0.58/0.81  % SZS output start Refutation
% 0.58/0.81  
% 0.58/0.81  1 [] {+} -organization(A,B)|inertia(A,$f1(A,B),B).
% 0.58/0.81  2 [] {+} -organization(A,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,D)| -size(A,F,B)| -size(C,G,D)| -inertia(A,H,B)| -inertia(C,I,D)| -greater(G,F)|greater(I,H).
% 0.58/0.81  3 [] {+} -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -inertia(A,E,B)| -inertia(C,F,D)| -survival_chance(A,G,B)| -survival_chance(C,H,D)| -greater(F,E)|greater(H,G).
% 0.58/0.81  4 [] {+} -greater($c5,$c6).
% 0.58/0.81  5 [] {+} organization($c9,$c2).
% 0.58/0.81  6 [] {+} organization($c8,$c1).
% 0.58/0.81  7 [] {+} reorganization_free($c9,$c2,$c2).
% 0.58/0.81  8 [] {+} reorganization_free($c8,$c1,$c1).
% 0.58/0.81  9 [] {+} class($c9,$c7,$c2).
% 0.58/0.81  10 [] {+} class($c8,$c7,$c1).
% 0.58/0.81  11 [] {+} survival_chance($c9,$c6,$c2).
% 0.58/0.81  12 [] {+} survival_chance($c8,$c5,$c1).
% 0.58/0.81  13 [] {+} size($c9,$c4,$c2).
% 0.58/0.81  14 [] {+} size($c8,$c3,$c1).
% 0.58/0.81  15 [] {+} greater($c3,$c4).
% 0.58/0.81  16 [hyper,5,1] {+} inertia($c9,$f1($c9,$c2),$c2).
% 0.58/0.81  17 [hyper,6,1] {+} inertia($c8,$f1($c8,$c1),$c1).
% 0.58/0.81  18 [hyper,17,2,5,6,9,10,13,14,16,15] {-} greater($f1($c8,$c1),$f1($c9,$c2)).
% 0.58/0.81  19 [hyper,18,3,5,6,7,8,16,17,11,12] {-} greater($c5,$c6).
% 0.58/0.81  20 [binary,19.1,4.1] {+} $F.
% 0.58/0.81  
% 0.58/0.81  % SZS output end Refutation
% 0.58/0.81  ------------ end of proof -------------
% 0.58/0.81  
% 0.58/0.81  
% 0.58/0.81  Search stopped by max_proofs option.
% 0.58/0.81  
% 0.58/0.81  
% 0.58/0.81  Search stopped by max_proofs option.
% 0.58/0.81  
% 0.58/0.81  ============ end of search ============
% 0.58/0.81  
% 0.58/0.81  ----------- soft-scott stats ----------
% 0.58/0.81  
% 0.58/0.81  true clauses given           7      (50.0%)
% 0.58/0.81  false clauses given          7
% 0.58/0.81  
% 0.58/0.81        FALSE     TRUE
% 0.58/0.81  tot:  0         0      (-nan% true)
% 0.58/0.81  
% 0.58/0.81  
% 0.58/0.81  Model 7 [ 1 5 1440 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.81  
% 0.58/0.81  That finishes the proof of the theorem.
% 0.58/0.81  
% 0.58/0.81  Process 15385 finished Thu Jun  9 07:23:35 2022
%------------------------------------------------------------------------------