TSTP Solution File: MGT049+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : MGT049+1 : 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 : n015.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:37 EDT 2022

% Result   : Theorem 0.21s 0.53s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   28 (   9 unt;   0 def)
%            Number of atoms       :   71 (  32 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   65 (  22   ~;  12   |;  19   &)
%                                         (   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    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   57 (  45   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f71,plain,
    $false,
    inference(subsumption_resolution,[],[f69,f50]) ).

fof(f50,plain,
    sF6 != sF5,
    inference(definition_folding,[],[f43,f49,f48]) ).

fof(f48,plain,
    position(sK1,sK0) = sF5,
    introduced(function_definition,[]) ).

fof(f49,plain,
    sF6 = position(sK1,sK2),
    introduced(function_definition,[]) ).

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

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

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

fof(f31,plain,
    ? [X0,X1,X2] :
      ( greater(age(X1,X2),age(X1,X0))
      & position(X1,X2) != position(X1,X0)
      & organization(X1) ),
    inference(rectify,[],[f23]) ).

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

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

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

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

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

fof(f69,plain,
    sF6 = sF5,
    inference(backward_demodulation,[],[f49,f65]) ).

fof(f65,plain,
    ! [X0] : sF5 = position(sK1,X0),
    inference(superposition,[],[f48,f56]) ).

fof(f56,plain,
    ! [X0,X1] : position(sK1,X1) = position(sK1,X0),
    inference(resolution,[],[f51,f42]) ).

fof(f42,plain,
    organization(sK1),
    inference(cnf_transformation,[],[f33]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( ~ organization(X0)
      | position(X0,X2) = position(X0,X1) ),
    inference(subsumption_resolution,[],[f38,f34]) ).

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

fof(f26,plain,
    ! [X0,X1,X2] :
      ( external_ties(X2,X1) = external_ties(X2,X0)
      | ~ organization(X2) ),
    inference(rectify,[],[f25]) ).

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

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

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

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

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ~ organization(X0)
      | ( ( ~ greater(external_ties(X0,X2),external_ties(X0,X1))
          | greater(position(X0,X2),position(X0,X1)) )
        & ( external_ties(X0,X1) != external_ties(X0,X2)
          | position(X0,X2) = position(X0,X1) ) ) ),
    inference(rectify,[],[f24]) ).

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

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

fof(f7,axiom,
    ! [X0,X4,X3] :
      ( 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/sandbox/benchmark/theBenchmark.p',assumption_6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.14/0.34  % Computer : n015.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 03:31:35 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.21/0.51  % (4721)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)
% 0.21/0.52  % (4713)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)
% 0.21/0.52  % (4711)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)
% 0.21/0.52  % (4714)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52  % (4714)First to succeed.
% 0.21/0.52  % (4739)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)
% 0.21/0.52  % (4723)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52  % (4736)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.21/0.53  % (4732)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.21/0.53  % (4724)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.21/0.53  % (4712)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)
% 0.21/0.53  % (4715)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)
% 0.21/0.53  % (4714)Refutation found. Thanks to Tanya!
% 0.21/0.53  % SZS status Theorem for theBenchmark
% 0.21/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53  % (4714)------------------------------
% 0.21/0.53  % (4714)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53  % (4714)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (4714)Termination reason: Refutation
% 0.21/0.53  
% 0.21/0.53  % (4714)Memory used [KB]: 5373
% 0.21/0.53  % (4714)Time elapsed: 0.131 s
% 0.21/0.53  % (4714)Instructions burned: 2 (million)
% 0.21/0.53  % (4714)------------------------------
% 0.21/0.53  % (4714)------------------------------
% 0.21/0.53  % (4709)Success in time 0.182 s
%------------------------------------------------------------------------------