TSTP Solution File: MGT049+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : MGT049+1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n008.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:25 EDT 2024

% Result   : Theorem 0.50s 0.73s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   5 unt;   0 def)
%            Number of atoms       :   57 (  24 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   53 (  17   ~;   8   |;  16   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   48 (  39   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f54,plain,
    $false,
    inference(subsumption_resolution,[],[f52,f47]) ).

fof(f47,plain,
    ! [X0,X1] : position(sK0,X0) = position(sK0,X1),
    inference(resolution,[],[f35,f25]) ).

fof(f25,plain,
    organization(sK0),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ( position(sK0,sK2) != position(sK0,sK1)
    & greater(age(sK0,sK2),age(sK0,sK1))
    & organization(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f23]) ).

fof(f23,plain,
    ( ? [X0,X1,X2] :
        ( position(X0,X2) != position(X0,X1)
        & greater(age(X0,X2),age(X0,X1))
        & organization(X0) )
   => ( position(sK0,sK2) != position(sK0,sK1)
      & greater(age(sK0,sK2),age(sK0,sK1))
      & organization(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f16,plain,
    ? [X0,X1,X2] :
      ( position(X0,X2) != position(X0,X1)
      & greater(age(X0,X2),age(X0,X1))
      & organization(X0) ),
    inference(flattening,[],[f15]) ).

fof(f15,plain,
    ? [X0,X1,X2] :
      ( position(X0,X2) != position(X0,X1)
      & greater(age(X0,X2),age(X0,X1))
      & organization(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,plain,
    ~ ! [X0,X1,X2] :
        ( ( greater(age(X0,X2),age(X0,X1))
          & organization(X0) )
       => position(X0,X2) = position(X0,X1) ),
    inference(rectify,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X3,X4] :
        ( ( greater(age(X0,X4),age(X0,X3))
          & organization(X0) )
       => position(X0,X4) = position(X0,X3) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0,X3,X4] :
      ( ( greater(age(X0,X4),age(X0,X3))
        & organization(X0) )
     => position(X0,X4) = position(X0,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_6) ).

fof(f35,plain,
    ! [X2,X0,X1] :
      ( ~ organization(X0)
      | position(X0,X2) = position(X0,X1) ),
    inference(subsumption_resolution,[],[f30,f28]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( external_ties(X0,X2) = external_ties(X0,X1)
      | ~ organization(X0) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( external_ties(X0,X2) = external_ties(X0,X1)
      | ~ organization(X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( organization(X0)
     => external_ties(X0,X2) = external_ties(X0,X1) ),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X3,X4] :
      ( organization(X0)
     => external_ties(X0,X4) = external_ties(X0,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_11) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( position(X0,X2) = position(X0,X1)
      | external_ties(X0,X2) != external_ties(X0,X1)
      | ~ organization(X0) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( ( ( position(X0,X2) = position(X0,X1)
          | external_ties(X0,X2) != external_ties(X0,X1) )
        & ( greater(position(X0,X2),position(X0,X1))
          | ~ greater(external_ties(X0,X2),external_ties(X0,X1)) ) )
      | ~ organization(X0) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( organization(X0)
     => ( ( external_ties(X0,X2) = external_ties(X0,X1)
         => position(X0,X2) = position(X0,X1) )
        & ( greater(external_ties(X0,X2),external_ties(X0,X1))
         => greater(position(X0,X2),position(X0,X1)) ) ) ),
    inference(rectify,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X3,X4] :
      ( organization(X0)
     => ( ( external_ties(X0,X4) = external_ties(X0,X3)
         => position(X0,X4) = position(X0,X3) )
        & ( greater(external_ties(X0,X4),external_ties(X0,X3))
         => greater(position(X0,X4),position(X0,X3)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_6) ).

fof(f52,plain,
    ! [X0] : position(sK0,sK1) != position(sK0,X0),
    inference(superposition,[],[f27,f47]) ).

fof(f27,plain,
    position(sK0,sK2) != position(sK0,sK1),
    inference(cnf_transformation,[],[f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : MGT049+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33  % Computer : n008.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    : 300
% 0.12/0.33  % DateTime   : Sun May 19 00:05:52 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.73  % (7801)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.50/0.73  % (7802)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.50/0.73  % (7803)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.50/0.73  % (7804)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.50/0.73  % (7805)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.50/0.73  % (7806)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.50/0.73  % (7799)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.50/0.73  % (7801)First to succeed.
% 0.50/0.73  % (7802)Refutation not found, incomplete strategy% (7802)------------------------------
% 0.50/0.73  % (7802)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.73  % (7802)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.73  % (7806)Also succeeded, but the first one will report.
% 0.50/0.73  
% 0.50/0.73  % (7802)Memory used [KB]: 984
% 0.50/0.73  % (7802)Time elapsed: 0.003 s
% 0.50/0.73  % (7802)Instructions burned: 2 (million)
% 0.50/0.73  % (7803)Also succeeded, but the first one will report.
% 0.50/0.73  % (7801)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7798"
% 0.50/0.73  % (7805)Also succeeded, but the first one will report.
% 0.50/0.73  % (7802)------------------------------
% 0.50/0.73  % (7802)------------------------------
% 0.50/0.73  % (7804)Also succeeded, but the first one will report.
% 0.50/0.73  % (7801)Refutation found. Thanks to Tanya!
% 0.50/0.73  % SZS status Theorem for theBenchmark
% 0.50/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.73  % (7801)------------------------------
% 0.50/0.73  % (7801)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.73  % (7801)Termination reason: Refutation
% 0.50/0.73  
% 0.50/0.73  % (7801)Memory used [KB]: 994
% 0.50/0.73  % (7801)Time elapsed: 0.003 s
% 0.50/0.73  % (7801)Instructions burned: 4 (million)
% 0.50/0.73  % (7798)Success in time 0.383 s
% 0.50/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------