TSTP Solution File: MGT005-2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %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  : 300s
% DateTime : Wed Aug 31 17:51:19 EDT 2022

% Result   : Unsatisfiable 2.08s 0.66s
% Output   : Refutation 2.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   89 (  44 unt;   3 typ;   0 def)
%            Number of atoms       :  408 (  27 equ)
%            Maximal formula atoms :   19 (   4 avg)
%            Number of connectives :  625 ( 303   ~; 322   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    4 (   0 usr;   3 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;  13 con; 0-0 aty)
%            Number of variables   :  188 ( 188   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_10,type,
    sQ1_eqProxy: ( $int * $int ) > $o ).

tff(pred_def_11,type,
    sQ2_eqProxy: ( $rat * $rat ) > $o ).

tff(pred_def_12,type,
    sQ3_eqProxy: ( $real * $real ) > $o ).

fof(f397,plain,
    $false,
    inference(subsumption_resolution,[],[f396,f63]) ).

fof(f63,plain,
    sk10 != sk11,
    inference(literal_reordering,[],[f38]) ).

fof(f38,axiom,
    sk10 != sk11,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_63) ).

fof(f396,plain,
    sk10 = sk11,
    inference(subsumption_resolution,[],[f394,f54]) ).

fof(f54,plain,
    ~ greater(sk10,sk11),
    inference(literal_reordering,[],[f37]) ).

fof(f37,axiom,
    ~ greater(sk10,sk11),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_62) ).

fof(f394,plain,
    ( greater(sk10,sk11)
    | sk10 = sk11 ),
    inference(resolution,[],[f391,f45]) ).

fof(f45,plain,
    survival_chance(sk5,sk10,sk14),
    inference(literal_reordering,[],[f30]) ).

fof(f30,axiom,
    survival_chance(sk5,sk10,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_55) ).

fof(f391,plain,
    ! [X0] :
      ( ~ survival_chance(sk5,X0,sk14)
      | greater(X0,sk11)
      | sk11 = X0 ),
    inference(resolution,[],[f389,f46]) ).

fof(f46,plain,
    survival_chance(sk6,sk11,sk14),
    inference(literal_reordering,[],[f31]) ).

fof(f31,axiom,
    survival_chance(sk6,sk11,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_56) ).

fof(f389,plain,
    ! [X0,X1] :
      ( ~ survival_chance(sk6,X0,sk14)
      | greater(X1,X0)
      | ~ survival_chance(sk5,X1,sk14)
      | X0 = X1 ),
    inference(subsumption_resolution,[],[f387,f47]) ).

fof(f47,plain,
    survival_chance(sk5,sk9,sk15),
    inference(literal_reordering,[],[f23]) ).

fof(f23,axiom,
    survival_chance(sk5,sk9,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_48) ).

fof(f387,plain,
    ! [X0,X1] :
      ( ~ survival_chance(sk6,X0,sk14)
      | ~ survival_chance(sk5,X1,sk14)
      | greater(X1,X0)
      | ~ survival_chance(sk5,sk9,sk15)
      | X0 = X1 ),
    inference(resolution,[],[f385,f66]) ).

fof(f66,plain,
    survival_chance(sk6,sk9,sk15),
    inference(literal_reordering,[],[f24]) ).

fof(f24,axiom,
    survival_chance(sk6,sk9,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_49) ).

fof(f385,plain,
    ! [X2,X0,X1] :
      ( ~ survival_chance(sk6,X2,sk15)
      | ~ survival_chance(sk6,X1,sk14)
      | ~ survival_chance(sk5,X0,sk14)
      | ~ survival_chance(sk5,X2,sk15)
      | X0 = X1
      | greater(X0,X1) ),
    inference(subsumption_resolution,[],[f384,f69]) ).

fof(f69,plain,
    organization(sk5,sk17),
    inference(literal_reordering,[],[f19]) ).

fof(f19,axiom,
    organization(sk5,sk17),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_44) ).

fof(f384,plain,
    ! [X2,X0,X1] :
      ( ~ survival_chance(sk6,X1,sk14)
      | ~ survival_chance(sk6,X2,sk15)
      | X0 = X1
      | ~ survival_chance(sk5,X0,sk14)
      | greater(X0,X1)
      | ~ organization(sk5,sk17)
      | ~ survival_chance(sk5,X2,sk15) ),
    inference(subsumption_resolution,[],[f383,f74]) ).

fof(f74,plain,
    organization(sk5,sk15),
    inference(literal_reordering,[],[f17]) ).

fof(f17,axiom,
    organization(sk5,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_42) ).

fof(f383,plain,
    ! [X2,X0,X1] :
      ( greater(X0,X1)
      | ~ survival_chance(sk5,X0,sk14)
      | ~ organization(sk5,sk15)
      | ~ organization(sk5,sk17)
      | X0 = X1
      | ~ survival_chance(sk6,X2,sk15)
      | ~ survival_chance(sk6,X1,sk14)
      | ~ survival_chance(sk5,X2,sk15) ),
    inference(resolution,[],[f367,f294]) ).

fof(f294,plain,
    ! [X15] :
      ( organization(X15,sk14)
      | ~ organization(X15,sk17)
      | ~ organization(X15,sk15) ),
    inference(resolution,[],[f287,f153]) ).

fof(f153,plain,
    ! [X54,X53] :
      ( ~ greater(X54,sk14)
      | organization(X53,sk14)
      | ~ organization(X53,sk15)
      | ~ organization(X53,X54) ),
    inference(resolution,[],[f119,f73]) ).

fof(f73,plain,
    ! [X2,X3,X0,X1] :
      ( ~ greater(X3,X1)
      | organization(X0,X3)
      | ~ organization(X0,X1)
      | ~ greater(X2,X3)
      | ~ organization(X0,X2) ),
    inference(literal_reordering,[],[f6]) ).

fof(f6,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ organization(X0,X2)
      | organization(X0,X3)
      | ~ greater(X3,X1)
      | ~ greater(X2,X3)
      | ~ organization(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp13_31) ).

fof(f119,plain,
    greater(sk14,sk15),
    inference(resolution,[],[f50,f51]) ).

fof(f51,plain,
    reorganization(sk5,sk15,sk14),
    inference(literal_reordering,[],[f40]) ).

fof(f40,plain,
    reorganization(sk5,sk15,sk14),
    inference(definition_unfolding,[],[f25,f36]) ).

fof(f36,axiom,
    sk16 = sk14,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_61) ).

fof(f25,axiom,
    reorganization(sk5,sk15,sk16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_50) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( ~ reorganization(X0,X1,X2)
      | greater(X2,X1) ),
    inference(literal_reordering,[],[f7]) ).

fof(f7,axiom,
    ! [X2,X0,X1] :
      ( greater(X2,X1)
      | ~ reorganization(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp7_32) ).

fof(f287,plain,
    greater(sk17,sk14),
    inference(resolution,[],[f286,f51]) ).

fof(f286,plain,
    ! [X0] :
      ( ~ reorganization(sk5,sk15,X0)
      | greater(sk17,X0) ),
    inference(subsumption_resolution,[],[f285,f43]) ).

fof(f43,plain,
    organization(sk6,sk17),
    inference(literal_reordering,[],[f20]) ).

fof(f20,axiom,
    organization(sk6,sk17),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_45) ).

fof(f285,plain,
    ! [X0] :
      ( ~ organization(sk6,sk17)
      | ~ reorganization(sk5,sk15,X0)
      | greater(sk17,X0) ),
    inference(resolution,[],[f280,f56]) ).

fof(f56,plain,
    reorganization(sk6,sk15,sk17),
    inference(literal_reordering,[],[f26]) ).

fof(f26,axiom,
    reorganization(sk6,sk15,sk17),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_51) ).

fof(f280,plain,
    ! [X0,X1] :
      ( ~ reorganization(sk6,sk15,X0)
      | greater(X0,X1)
      | ~ reorganization(sk5,sk15,X1)
      | ~ organization(sk6,X0) ),
    inference(subsumption_resolution,[],[f279,f70]) ).

fof(f70,plain,
    class(sk5,sk8,sk15),
    inference(literal_reordering,[],[f21]) ).

fof(f21,axiom,
    class(sk5,sk8,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_46) ).

fof(f279,plain,
    ! [X0,X1] :
      ( ~ reorganization(sk5,sk15,X1)
      | ~ reorganization(sk6,sk15,X0)
      | greater(X0,X1)
      | ~ organization(sk6,X0)
      | ~ class(sk5,sk8,sk15) ),
    inference(resolution,[],[f278,f76]) ).

fof(f76,plain,
    class(sk6,sk8,sk15),
    inference(literal_reordering,[],[f22]) ).

fof(f22,axiom,
    class(sk6,sk8,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_47) ).

fof(f278,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk6,X1,sk15)
      | ~ organization(sk6,X0)
      | ~ reorganization(sk6,sk15,X0)
      | ~ reorganization(sk5,sk15,X2)
      | ~ class(sk5,X1,sk15)
      | greater(X0,X2) ),
    inference(subsumption_resolution,[],[f277,f60]) ).

fof(f60,plain,
    reorganization_type(sk5,sk7,sk15),
    inference(literal_reordering,[],[f27]) ).

fof(f27,axiom,
    reorganization_type(sk5,sk7,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_52) ).

fof(f277,plain,
    ! [X2,X0,X1] :
      ( ~ reorganization(sk6,sk15,X0)
      | ~ organization(sk6,X0)
      | ~ class(sk6,X1,sk15)
      | ~ reorganization(sk5,sk15,X2)
      | ~ reorganization_type(sk5,sk7,sk15)
      | greater(X0,X2)
      | ~ class(sk5,X1,sk15) ),
    inference(resolution,[],[f210,f65]) ).

fof(f65,plain,
    reorganization_type(sk6,sk7,sk15),
    inference(literal_reordering,[],[f28]) ).

fof(f28,axiom,
    reorganization_type(sk6,sk7,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_53) ).

fof(f210,plain,
    ! [X2,X3,X0,X1] :
      ( ~ reorganization_type(sk6,X1,sk15)
      | ~ reorganization(sk6,sk15,X2)
      | ~ reorganization_type(sk5,X1,sk15)
      | ~ class(sk6,X3,sk15)
      | ~ reorganization(sk5,sk15,X0)
      | greater(X2,X0)
      | ~ class(sk5,X3,sk15)
      | ~ organization(sk6,X2) ),
    inference(subsumption_resolution,[],[f209,f71]) ).

fof(f71,plain,
    organization(sk6,sk15),
    inference(literal_reordering,[],[f18]) ).

fof(f18,axiom,
    organization(sk6,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_43) ).

fof(f209,plain,
    ! [X2,X3,X0,X1] :
      ( ~ organization(sk6,X2)
      | ~ reorganization(sk6,sk15,X2)
      | ~ reorganization_type(sk6,X1,sk15)
      | ~ class(sk5,X3,sk15)
      | ~ organization(sk6,sk15)
      | ~ class(sk6,X3,sk15)
      | greater(X2,X0)
      | ~ reorganization(sk5,sk15,X0)
      | ~ reorganization_type(sk5,X1,sk15) ),
    inference(resolution,[],[f181,f68]) ).

fof(f68,plain,
    complexity(sk6,sk13,sk15),
    inference(literal_reordering,[],[f33]) ).

fof(f33,axiom,
    complexity(sk6,sk13,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_58) ).

fof(f181,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ complexity(X1,sk13,sk15)
      | ~ reorganization(sk5,sk15,X4)
      | ~ reorganization_type(sk5,X0,sk15)
      | ~ organization(X1,X3)
      | ~ reorganization(X1,sk15,X3)
      | ~ reorganization_type(X1,X0,sk15)
      | greater(X3,X4)
      | ~ class(X1,X2,sk15)
      | ~ class(sk5,X2,sk15)
      | ~ organization(X1,sk15) ),
    inference(subsumption_resolution,[],[f180,f74]) ).

fof(f180,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ class(sk5,X2,sk15)
      | ~ reorganization_type(X1,X0,sk15)
      | ~ reorganization(sk5,sk15,X4)
      | ~ organization(sk5,sk15)
      | ~ complexity(X1,sk13,sk15)
      | ~ organization(X1,X3)
      | ~ reorganization(X1,sk15,X3)
      | ~ reorganization_type(sk5,X0,sk15)
      | ~ organization(X1,sk15)
      | greater(X3,X4)
      | ~ class(X1,X2,sk15) ),
    inference(resolution,[],[f140,f57]) ).

fof(f57,plain,
    complexity(sk5,sk12,sk15),
    inference(literal_reordering,[],[f32]) ).

fof(f32,axiom,
    complexity(sk5,sk12,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_57) ).

fof(f140,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ complexity(X2,sk12,X3)
      | ~ reorganization_type(X2,X5,X3)
      | ~ class(X0,X6,X3)
      | ~ complexity(X0,sk13,X3)
      | ~ organization(X0,X1)
      | ~ reorganization_type(X0,X5,X3)
      | ~ class(X2,X6,X3)
      | ~ organization(X0,X3)
      | greater(X1,X4)
      | ~ organization(X2,X3)
      | ~ reorganization(X0,X3,X1)
      | ~ reorganization(X2,X3,X4) ),
    inference(resolution,[],[f52,f59]) ).

fof(f59,plain,
    greater(sk13,sk12),
    inference(literal_reordering,[],[f34]) ).

fof(f34,axiom,
    greater(sk13,sk12),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_59) ).

fof(f52,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( ~ greater(X8,X7)
      | ~ organization(X2,X3)
      | ~ reorganization(X0,X1,X5)
      | ~ reorganization_type(X0,X6,X1)
      | ~ reorganization_type(X2,X6,X1)
      | greater(X3,X5)
      | ~ class(X2,X4,X1)
      | ~ reorganization(X2,X1,X3)
      | ~ organization(X0,X1)
      | ~ organization(X2,X1)
      | ~ class(X0,X4,X1)
      | ~ complexity(X2,X8,X1)
      | ~ complexity(X0,X7,X1) ),
    inference(literal_reordering,[],[f10]) ).

fof(f10,axiom,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( ~ class(X2,X4,X1)
      | ~ reorganization(X2,X1,X3)
      | ~ complexity(X0,X7,X1)
      | ~ organization(X2,X1)
      | ~ organization(X2,X3)
      | ~ reorganization_type(X0,X6,X1)
      | ~ reorganization(X0,X1,X5)
      | ~ reorganization_type(X2,X6,X1)
      | greater(X3,X5)
      | ~ organization(X0,X1)
      | ~ class(X0,X4,X1)
      | ~ complexity(X2,X8,X1)
      | ~ greater(X8,X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a10_FOL_35) ).

fof(f367,plain,
    ! [X2,X0,X1] :
      ( ~ organization(sk5,sk14)
      | greater(X0,X1)
      | ~ survival_chance(sk5,X2,sk15)
      | ~ survival_chance(sk6,X1,sk14)
      | ~ survival_chance(sk5,X0,sk14)
      | ~ survival_chance(sk6,X2,sk15)
      | X0 = X1 ),
    inference(subsumption_resolution,[],[f366,f43]) ).

fof(f366,plain,
    ! [X2,X0,X1] :
      ( ~ survival_chance(sk5,X0,sk14)
      | ~ survival_chance(sk5,X2,sk15)
      | X0 = X1
      | ~ survival_chance(sk6,X2,sk15)
      | greater(X0,X1)
      | ~ organization(sk6,sk17)
      | ~ survival_chance(sk6,X1,sk14)
      | ~ organization(sk5,sk14) ),
    inference(subsumption_resolution,[],[f365,f71]) ).

fof(f365,plain,
    ! [X2,X0,X1] :
      ( X0 = X1
      | ~ survival_chance(sk6,X1,sk14)
      | ~ survival_chance(sk5,X2,sk15)
      | ~ survival_chance(sk6,X2,sk15)
      | ~ survival_chance(sk5,X0,sk14)
      | ~ organization(sk6,sk15)
      | ~ organization(sk6,sk17)
      | greater(X0,X1)
      | ~ organization(sk5,sk14) ),
    inference(resolution,[],[f363,f294]) ).

fof(f363,plain,
    ! [X2,X0,X1] :
      ( ~ organization(sk6,sk14)
      | X0 = X1
      | ~ survival_chance(sk5,X0,sk14)
      | ~ survival_chance(sk5,X2,sk15)
      | ~ survival_chance(sk6,X1,sk14)
      | ~ survival_chance(sk6,X2,sk15)
      | greater(X0,X1)
      | ~ organization(sk5,sk14) ),
    inference(resolution,[],[f347,f51]) ).

fof(f347,plain,
    ! [X2,X3,X0,X1] :
      ( ~ reorganization(sk5,sk15,X1)
      | ~ organization(sk6,X1)
      | ~ organization(sk5,X1)
      | greater(X2,X0)
      | X0 = X2
      | ~ survival_chance(sk5,X2,X1)
      | ~ survival_chance(sk6,X0,X1)
      | ~ survival_chance(sk6,X3,sk15)
      | ~ survival_chance(sk5,X3,sk15) ),
    inference(resolution,[],[f345,f56]) ).

fof(f345,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ reorganization(sk6,sk15,X2)
      | ~ survival_chance(sk6,X4,X1)
      | ~ organization(sk5,X1)
      | ~ organization(sk6,X1)
      | ~ reorganization(sk5,sk15,X1)
      | greater(X0,X4)
      | X0 = X4
      | ~ survival_chance(sk5,X3,sk15)
      | ~ survival_chance(sk5,X0,X1)
      | ~ survival_chance(sk6,X3,sk15) ),
    inference(subsumption_resolution,[],[f344,f70]) ).

fof(f344,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ survival_chance(sk5,X3,sk15)
      | ~ survival_chance(sk6,X3,sk15)
      | greater(X0,X4)
      | ~ reorganization(sk5,sk15,X1)
      | ~ survival_chance(sk5,X0,X1)
      | X0 = X4
      | ~ class(sk5,sk8,sk15)
      | ~ organization(sk5,X1)
      | ~ survival_chance(sk6,X4,X1)
      | ~ reorganization(sk6,sk15,X2)
      | ~ organization(sk6,X1) ),
    inference(resolution,[],[f324,f76]) ).

fof(f324,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ class(sk6,X0,sk15)
      | ~ survival_chance(sk5,X3,X2)
      | ~ reorganization(sk5,sk15,X2)
      | ~ reorganization(sk6,sk15,X4)
      | ~ survival_chance(sk6,X5,sk15)
      | ~ survival_chance(sk5,X5,sk15)
      | ~ survival_chance(sk6,X1,X2)
      | ~ class(sk5,X0,sk15)
      | greater(X3,X1)
      | ~ organization(sk6,X2)
      | X1 = X3
      | ~ organization(sk5,X2) ),
    inference(subsumption_resolution,[],[f323,f60]) ).

fof(f323,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ class(sk5,X0,sk15)
      | ~ class(sk6,X0,sk15)
      | ~ reorganization(sk5,sk15,X2)
      | ~ organization(sk5,X2)
      | greater(X3,X1)
      | ~ organization(sk6,X2)
      | ~ reorganization(sk6,sk15,X4)
      | ~ reorganization_type(sk5,sk7,sk15)
      | ~ survival_chance(sk6,X1,X2)
      | ~ survival_chance(sk5,X3,X2)
      | ~ survival_chance(sk6,X5,sk15)
      | X1 = X3
      | ~ survival_chance(sk5,X5,sk15) ),
    inference(resolution,[],[f249,f65]) ).

fof(f249,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ reorganization_type(sk6,X4,sk15)
      | ~ class(sk6,X0,sk15)
      | ~ survival_chance(sk6,X2,X3)
      | ~ organization(sk6,X3)
      | greater(X1,X2)
      | ~ reorganization(sk6,sk15,X5)
      | ~ class(sk5,X0,sk15)
      | ~ reorganization(sk5,sk15,X3)
      | ~ reorganization_type(sk5,X4,sk15)
      | ~ survival_chance(sk6,X6,sk15)
      | ~ survival_chance(sk5,X1,X3)
      | X1 = X2
      | ~ organization(sk5,X3)
      | ~ survival_chance(sk5,X6,sk15) ),
    inference(subsumption_resolution,[],[f248,f71]) ).

fof(f248,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ reorganization_type(sk5,X4,sk15)
      | ~ reorganization(sk6,sk15,X5)
      | ~ survival_chance(sk6,X6,sk15)
      | ~ survival_chance(sk5,X6,sk15)
      | ~ reorganization(sk5,sk15,X3)
      | ~ class(sk6,X0,sk15)
      | ~ organization(sk6,sk15)
      | ~ survival_chance(sk5,X1,X3)
      | ~ survival_chance(sk6,X2,X3)
      | ~ organization(sk6,X3)
      | ~ class(sk5,X0,sk15)
      | greater(X1,X2)
      | ~ reorganization_type(sk6,X4,sk15)
      | ~ organization(sk5,X3)
      | X1 = X2 ),
    inference(resolution,[],[f184,f68]) ).

fof(f184,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ complexity(X0,sk13,sk15)
      | ~ class(X0,X1,sk15)
      | X2 = X3
      | ~ class(sk5,X1,sk15)
      | ~ survival_chance(sk5,X2,X4)
      | ~ organization(X0,X4)
      | ~ reorganization_type(X0,X6,sk15)
      | ~ reorganization(X0,sk15,X7)
      | ~ survival_chance(sk5,X5,sk15)
      | ~ organization(sk5,X4)
      | greater(X2,X3)
      | ~ reorganization(sk5,sk15,X4)
      | ~ survival_chance(X0,X5,sk15)
      | ~ reorganization_type(sk5,X6,sk15)
      | ~ organization(X0,sk15)
      | ~ survival_chance(X0,X3,X4) ),
    inference(subsumption_resolution,[],[f183,f74]) ).

fof(f183,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ reorganization(X0,sk15,X7)
      | ~ reorganization_type(X0,X6,sk15)
      | ~ survival_chance(sk5,X5,sk15)
      | ~ complexity(X0,sk13,sk15)
      | ~ organization(X0,X4)
      | ~ class(X0,X1,sk15)
      | ~ reorganization(sk5,sk15,X4)
      | ~ organization(sk5,X4)
      | ~ survival_chance(X0,X5,sk15)
      | X2 = X3
      | ~ organization(sk5,sk15)
      | greater(X2,X3)
      | ~ survival_chance(sk5,X2,X4)
      | ~ class(sk5,X1,sk15)
      | ~ organization(X0,sk15)
      | ~ reorganization_type(sk5,X6,sk15)
      | ~ survival_chance(X0,X3,X4) ),
    inference(resolution,[],[f142,f57]) ).

fof(f142,plain,
    ! [X2,X3,X0,X1,X8,X6,X9,X7,X4,X5] :
      ( ~ complexity(X4,sk12,X2)
      | ~ complexity(X0,sk13,X2)
      | ~ class(X0,X7,X2)
      | X5 = X6
      | greater(X5,X6)
      | ~ organization(X4,X2)
      | ~ reorganization(X4,X2,X9)
      | ~ survival_chance(X0,X1,X2)
      | ~ class(X4,X7,X2)
      | ~ survival_chance(X4,X5,X9)
      | ~ reorganization_type(X0,X3,X2)
      | ~ survival_chance(X4,X1,X2)
      | ~ survival_chance(X0,X6,X9)
      | ~ reorganization_type(X4,X3,X2)
      | ~ organization(X0,X2)
      | ~ reorganization(X0,X2,X8)
      | ~ organization(X0,X9)
      | ~ organization(X4,X9) ),
    inference(resolution,[],[f61,f59]) ).

fof(f61,plain,
    ! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
      ( ~ greater(X11,X10)
      | ~ survival_chance(X2,X5,X1)
      | ~ reorganization_type(X2,X7,X1)
      | ~ reorganization_type(X0,X7,X1)
      | ~ organization(X0,X1)
      | ~ complexity(X2,X11,X1)
      | X8 = X9
      | ~ class(X0,X4,X1)
      | ~ class(X2,X4,X1)
      | ~ survival_chance(X0,X5,X1)
      | ~ reorganization(X2,X1,X6)
      | ~ organization(X0,X3)
      | greater(X8,X9)
      | ~ organization(X2,X3)
      | ~ survival_chance(X0,X8,X3)
      | ~ complexity(X0,X10,X1)
      | ~ organization(X2,X1)
      | ~ reorganization(X0,X1,X3)
      | ~ survival_chance(X2,X9,X3) ),
    inference(literal_reordering,[],[f11]) ).

fof(f11,axiom,
    ! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
      ( ~ reorganization_type(X0,X7,X1)
      | ~ reorganization(X2,X1,X6)
      | ~ organization(X2,X3)
      | ~ survival_chance(X0,X8,X3)
      | ~ organization(X2,X1)
      | ~ complexity(X2,X11,X1)
      | ~ organization(X0,X1)
      | ~ greater(X11,X10)
      | ~ complexity(X0,X10,X1)
      | X8 = X9
      | greater(X8,X9)
      | ~ class(X0,X4,X1)
      | ~ reorganization_type(X2,X7,X1)
      | ~ survival_chance(X2,X9,X3)
      | ~ class(X2,X4,X1)
      | ~ survival_chance(X0,X5,X1)
      | ~ survival_chance(X2,X5,X1)
      | ~ reorganization(X0,X1,X3)
      | ~ organization(X0,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a11_FOL_36) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 03:13:19 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.55  % (16022)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.55  % (16021)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55  % (16022)Instruction limit reached!
% 0.20/0.55  % (16022)------------------------------
% 0.20/0.55  % (16022)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (16020)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56  % (16038)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.56  % (16021)Instruction limit reached!
% 0.20/0.56  % (16021)------------------------------
% 0.20/0.56  % (16021)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (16028)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.56  % (16030)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.56  % (16022)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (16022)Termination reason: Unknown
% 0.20/0.56  % (16022)Termination phase: Blocked clause elimination
% 0.20/0.56  
% 0.20/0.56  % (16022)Memory used [KB]: 895
% 0.20/0.56  % (16022)Time elapsed: 0.003 s
% 0.20/0.56  % (16022)Instructions burned: 2 (million)
% 0.20/0.56  % (16022)------------------------------
% 0.20/0.56  % (16022)------------------------------
% 0.20/0.56  % (16036)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.56  % (16037)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.56  TRYING [1]
% 0.20/0.56  % (16029)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.57  TRYING [2]
% 0.20/0.58  % (16021)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58  % (16021)Termination reason: Unknown
% 0.20/0.58  % (16021)Termination phase: Saturation
% 0.20/0.58  
% 0.20/0.58  % (16021)Memory used [KB]: 5500
% 0.20/0.58  % (16021)Time elapsed: 0.128 s
% 0.20/0.58  % (16021)Instructions burned: 7 (million)
% 0.20/0.58  % (16021)------------------------------
% 0.20/0.58  % (16021)------------------------------
% 0.20/0.59  % (16017)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.79/0.61  % (16016)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.79/0.62  % (16039)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.79/0.62  % (16018)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.79/0.62  % (16041)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.79/0.62  % (16023)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.79/0.62  % (16014)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.79/0.62  % (16040)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.79/0.62  % (16015)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.79/0.62  % (16043)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.79/0.63  % (16033)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.79/0.63  % (16024)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.79/0.63  % (16031)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.79/0.63  % (16027)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.79/0.63  % (16042)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.79/0.63  % (16015)Refutation not found, incomplete strategy% (16015)------------------------------
% 1.79/0.63  % (16015)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.79/0.63  % (16015)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.79/0.63  % (16015)Termination reason: Refutation not found, incomplete strategy
% 1.79/0.63  
% 1.79/0.63  % (16015)Memory used [KB]: 5500
% 1.79/0.63  % (16015)Time elapsed: 0.159 s
% 1.79/0.63  % (16015)Instructions burned: 5 (million)
% 1.79/0.63  % (16015)------------------------------
% 1.79/0.63  % (16015)------------------------------
% 1.79/0.63  TRYING [1]
% 2.08/0.63  % (16025)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 2.08/0.63  % (16019)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 2.08/0.64  % (16026)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 2.08/0.64  % (16020)Instruction limit reached!
% 2.08/0.64  % (16020)------------------------------
% 2.08/0.64  % (16020)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.08/0.64  TRYING [2]
% 2.08/0.64  % (16020)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.08/0.64  % (16020)Termination reason: Unknown
% 2.08/0.64  % (16020)Termination phase: Finite model building constraint generation
% 2.08/0.64  
% 2.08/0.64  % (16020)Memory used [KB]: 11001
% 2.08/0.64  % (16020)Time elapsed: 0.154 s
% 2.08/0.64  % (16020)Instructions burned: 51 (million)
% 2.08/0.64  % (16020)------------------------------
% 2.08/0.64  % (16020)------------------------------
% 2.08/0.64  % (16032)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 2.08/0.64  TRYING [1]
% 2.08/0.64  TRYING [2]
% 2.08/0.64  % (16035)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 2.08/0.66  % (16034)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 2.08/0.66  % (16028)First to succeed.
% 2.08/0.66  % (16028)Refutation found. Thanks to Tanya!
% 2.08/0.66  % SZS status Unsatisfiable for theBenchmark
% 2.08/0.66  % SZS output start Proof for theBenchmark
% See solution above
% 2.08/0.66  % (16028)------------------------------
% 2.08/0.66  % (16028)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.08/0.66  % (16028)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.08/0.66  % (16028)Termination reason: Refutation
% 2.08/0.66  
% 2.08/0.66  % (16028)Memory used [KB]: 6396
% 2.08/0.66  % (16028)Time elapsed: 0.042 s
% 2.08/0.66  % (16028)Instructions burned: 46 (million)
% 2.08/0.66  % (16028)------------------------------
% 2.08/0.66  % (16028)------------------------------
% 2.08/0.66  % (16013)Success in time 0.298 s
%------------------------------------------------------------------------------