TSTP Solution File: MGT041-2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n018.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 : Tue May 21 00:42:22 EDT 2024

% Result   : Unsatisfiable 0.52s 0.73s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  28   ~;  20   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   3 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    8 (   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f47,plain,
    $false,
    inference(avatar_sat_refutation,[],[f20,f26,f46]) ).

fof(f46,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f45]) ).

fof(f45,plain,
    ( $false
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f44,f4]) ).

fof(f4,axiom,
    organisation_at_time(sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_4) ).

fof(f44,plain,
    ( ~ organisation_at_time(sk1,sk2)
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f43,f19]) ).

fof(f19,plain,
    ( first_mover(sk1)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f17,plain,
    ( spl0_2
  <=> first_mover(sk1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f43,plain,
    ( ~ first_mover(sk1)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(subsumption_resolution,[],[f33,f5]) ).

fof(f5,axiom,
    founding_time(sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_5) ).

fof(f33,plain,
    ( ~ founding_time(sk1,sk2)
    | ~ first_mover(sk1)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(resolution,[],[f3,f9]) ).

fof(f9,plain,
    ~ number_of_routines(sk1,sk2,low),
    inference(unit_resulting_resolution,[],[f6,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_1) ).

fof(f6,axiom,
    number_of_routines(sk1,sk2,high),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_6) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( number_of_routines(X0,X1,low)
      | ~ founding_time(X0,X1)
      | ~ first_mover(X0)
      | ~ organisation_at_time(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15_3) ).

fof(f26,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f25,f13]) ).

fof(f13,plain,
    ( spl0_1
  <=> efficient_producer(sk1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f25,plain,
    ~ efficient_producer(sk1),
    inference(subsumption_resolution,[],[f24,f4]) ).

fof(f24,plain,
    ( ~ efficient_producer(sk1)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(subsumption_resolution,[],[f22,f5]) ).

fof(f22,plain,
    ( ~ founding_time(sk1,sk2)
    | ~ efficient_producer(sk1)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(resolution,[],[f2,f7]) ).

fof(f7,axiom,
    ~ has_elaborated_routines(sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_7) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( has_elaborated_routines(X0,X1)
      | ~ founding_time(X0,X1)
      | ~ efficient_producer(X0)
      | ~ organisation_at_time(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_2) ).

fof(f20,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f11,f17,f13]) ).

fof(f11,plain,
    ( first_mover(sk1)
    | efficient_producer(sk1) ),
    inference(resolution,[],[f8,f4]) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( ~ organisation_at_time(X0,X1)
      | first_mover(X0)
      | efficient_producer(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10_8) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 23:53:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a CNF_UNS_EPR_NEQ_NHN problem
% 0.14/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.73  % (27217)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.52/0.73  % (27217)First to succeed.
% 0.52/0.73  % (27213)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.73  % (27214)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.52/0.73  % (27215)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.52/0.73  % (27211)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.52/0.73  % (27216)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.73  % (27217)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27210"
% 0.52/0.73  % (27214)Also succeeded, but the first one will report.
% 0.52/0.73  % (27215)Also succeeded, but the first one will report.
% 0.52/0.73  % (27216)Also succeeded, but the first one will report.
% 0.52/0.73  % (27213)Also succeeded, but the first one will report.
% 0.52/0.73  % (27211)Also succeeded, but the first one will report.
% 0.52/0.73  % (27218)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.52/0.73  % (27217)Refutation found. Thanks to Tanya!
% 0.52/0.73  % SZS status Unsatisfiable for theBenchmark
% 0.52/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.73  % (27217)------------------------------
% 0.52/0.73  % (27217)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73  % (27217)Termination reason: Refutation
% 0.52/0.73  
% 0.52/0.73  % (27217)Memory used [KB]: 965
% 0.52/0.73  % (27217)Time elapsed: 0.003 s
% 0.52/0.73  % (27217)Instructions burned: 3 (million)
% 0.52/0.73  % (27210)Success in time 0.375 s
% 0.52/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------