TSTP Solution File: MGT041+2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : MGT041+2 : TPTP v8.1.0. Released v2.0.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 : n026.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:34 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   45 (   9 unt;   0 def)
%            Number of atoms       :  112 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  119 (  52   ~;  40   |;  19   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   6 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   38 (  28   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f57,plain,
    $false,
    inference(avatar_sat_refutation,[],[f33,f44,f50,f52,f54,f56]) ).

fof(f56,plain,
    ~ spl2_3,
    inference(avatar_contradiction_clause,[],[f55]) ).

fof(f55,plain,
    ( $false
    | ~ spl2_3 ),
    inference(resolution,[],[f39,f17]) ).

fof(f17,plain,
    ~ has_elaborated_routines(sK0,sK1),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ? [X1,X0] :
      ( organisation_at_time(X1,X0)
      & number_of_routines(X1,X0,high)
      & ~ has_elaborated_routines(X1,X0)
      & founding_time(X1,X0) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ? [X1,X0] :
      ( founding_time(X0,X1)
      & number_of_routines(X0,X1,high)
      & ~ has_elaborated_routines(X0,X1)
      & organisation_at_time(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16) ).

fof(f39,plain,
    ( has_elaborated_routines(sK0,sK1)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f37]) ).

fof(f37,plain,
    ( spl2_3
  <=> has_elaborated_routines(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f54,plain,
    spl2_5,
    inference(avatar_contradiction_clause,[],[f53]) ).

fof(f53,plain,
    ( $false
    | spl2_5 ),
    inference(resolution,[],[f49,f16]) ).

fof(f16,plain,
    founding_time(sK0,sK1),
    inference(cnf_transformation,[],[f8]) ).

fof(f49,plain,
    ( ~ founding_time(sK0,sK1)
    | spl2_5 ),
    inference(avatar_component_clause,[],[f47]) ).

fof(f47,plain,
    ( spl2_5
  <=> founding_time(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).

fof(f52,plain,
    spl2_4,
    inference(avatar_contradiction_clause,[],[f51]) ).

fof(f51,plain,
    ( $false
    | spl2_4 ),
    inference(resolution,[],[f43,f19]) ).

fof(f19,plain,
    organisation_at_time(sK0,sK1),
    inference(cnf_transformation,[],[f8]) ).

fof(f43,plain,
    ( ~ organisation_at_time(sK0,sK1)
    | spl2_4 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f41,plain,
    ( spl2_4
  <=> organisation_at_time(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

fof(f50,plain,
    ( ~ spl2_5
    | ~ spl2_2
    | ~ spl2_4 ),
    inference(avatar_split_clause,[],[f45,f41,f30,f47]) ).

fof(f30,plain,
    ( spl2_2
  <=> first_mover(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

fof(f45,plain,
    ( ~ organisation_at_time(sK0,sK1)
    | ~ first_mover(sK0)
    | ~ founding_time(sK0,sK1) ),
    inference(resolution,[],[f22,f34]) ).

fof(f34,plain,
    ~ number_of_routines(sK0,sK1,low),
    inference(resolution,[],[f23,f18]) ).

fof(f18,plain,
    number_of_routines(sK0,sK1,high),
    inference(cnf_transformation,[],[f8]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ number_of_routines(X0,X1,high)
      | ~ number_of_routines(X0,X1,low) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ number_of_routines(X0,X1,high)
      | ~ number_of_routines(X0,X1,low) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ~ ( number_of_routines(X0,X1,high)
        & number_of_routines(X0,X1,low) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low) ).

fof(f22,plain,
    ! [X0,X1] :
      ( number_of_routines(X1,X0,low)
      | ~ first_mover(X1)
      | ~ founding_time(X1,X0)
      | ~ organisation_at_time(X1,X0) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ organisation_at_time(X1,X0)
      | ~ founding_time(X1,X0)
      | number_of_routines(X1,X0,low)
      | ~ first_mover(X1) ),
    inference(flattening,[],[f10]) ).

fof(f10,plain,
    ! [X1,X0] :
      ( number_of_routines(X1,X0,low)
      | ~ organisation_at_time(X1,X0)
      | ~ founding_time(X1,X0)
      | ~ first_mover(X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
    ! [X1,X0] :
      ( ( organisation_at_time(X1,X0)
        & founding_time(X1,X0)
        & first_mover(X1) )
     => number_of_routines(X1,X0,low) ),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] :
      ( ( founding_time(X0,X1)
        & first_mover(X0)
        & organisation_at_time(X0,X1) )
     => number_of_routines(X0,X1,low) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15) ).

fof(f44,plain,
    ( ~ spl2_1
    | spl2_3
    | ~ spl2_4 ),
    inference(avatar_split_clause,[],[f35,f41,f37,f26]) ).

fof(f26,plain,
    ( spl2_1
  <=> efficient_producer(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f35,plain,
    ( ~ organisation_at_time(sK0,sK1)
    | has_elaborated_routines(sK0,sK1)
    | ~ efficient_producer(sK0) ),
    inference(resolution,[],[f21,f16]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ~ founding_time(X0,X1)
      | ~ efficient_producer(X0)
      | has_elaborated_routines(X0,X1)
      | ~ organisation_at_time(X0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ founding_time(X0,X1)
      | ~ efficient_producer(X0)
      | ~ organisation_at_time(X0,X1)
      | has_elaborated_routines(X0,X1) ),
    inference(flattening,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( has_elaborated_routines(X0,X1)
      | ~ founding_time(X0,X1)
      | ~ organisation_at_time(X0,X1)
      | ~ efficient_producer(X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( ( founding_time(X0,X1)
        & organisation_at_time(X0,X1)
        & efficient_producer(X0) )
     => has_elaborated_routines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14) ).

fof(f33,plain,
    ( spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f24,f30,f26]) ).

fof(f24,plain,
    ( first_mover(sK0)
    | efficient_producer(sK0) ),
    inference(resolution,[],[f20,f19]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ organisation_at_time(X1,X0)
      | efficient_producer(X1)
      | first_mover(X1) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X1,X0] :
      ( efficient_producer(X1)
      | first_mover(X1)
      | ~ organisation_at_time(X1,X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,plain,
    ~ ? [X1,X0] :
        ( organisation_at_time(X1,X0)
        & ~ efficient_producer(X1)
        & ~ first_mover(X1) ),
    inference(rectify,[],[f6]) ).

fof(f6,negated_conjecture,
    ~ ? [X1,X0] :
        ( organisation_at_time(X0,X1)
        & ~ first_mover(X0)
        & ~ efficient_producer(X0) ),
    inference(negated_conjecture,[],[f5]) ).

fof(f5,conjecture,
    ? [X1,X0] :
      ( organisation_at_time(X0,X1)
      & ~ first_mover(X0)
      & ~ efficient_producer(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : MGT041+2 : TPTP v8.1.0. Released v2.0.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 : n026.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:31:35 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (26443)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.51  % (26453)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.20/0.51  % (26443)First to succeed.
% 0.20/0.52  % (26436)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.52  % (26443)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (26443)------------------------------
% 0.20/0.52  % (26443)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (26443)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (26443)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (26443)Memory used [KB]: 5373
% 0.20/0.52  % (26443)Time elapsed: 0.102 s
% 0.20/0.52  % (26443)Instructions burned: 1 (million)
% 0.20/0.52  % (26443)------------------------------
% 0.20/0.52  % (26443)------------------------------
% 0.20/0.52  % (26431)Success in time 0.161 s
%------------------------------------------------------------------------------