TSTP Solution File: NUM505+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM505+3 : TPTP v8.2.0. Released v4.0.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 : n006.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 01:42:48 EDT 2024

% Result   : Theorem 0.53s 0.74s
% Output   : Refutation 0.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (   6 unt;   0 def)
%            Number of atoms       :  100 (  26 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  121 (  51   ~;  38   |;  26   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (  14   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f345,plain,
    $false,
    inference(avatar_sat_refutation,[],[f323,f338,f344]) ).

fof(f344,plain,
    ( ~ spl16_1
    | ~ spl16_2 ),
    inference(avatar_contradiction_clause,[],[f343]) ).

fof(f343,plain,
    ( $false
    | ~ spl16_1
    | ~ spl16_2 ),
    inference(subsumption_resolution,[],[f342,f339]) ).

fof(f339,plain,
    ( ~ sdtlseqdt0(xp,xp)
    | ~ spl16_1 ),
    inference(superposition,[],[f237,f318]) ).

fof(f318,plain,
    ( xp = xk
    | ~ spl16_1 ),
    inference(avatar_component_clause,[],[f316]) ).

fof(f316,plain,
    ( spl16_1
  <=> xp = xk ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).

fof(f237,plain,
    ~ sdtlseqdt0(xp,xk),
    inference(cnf_transformation,[],[f158]) ).

fof(f158,plain,
    ( ( ( ~ sdtlseqdt0(xk,xp)
        & ! [X0] :
            ( xp != sdtpldt0(xk,X0)
            | ~ aNaturalNumber0(X0) ) )
      | xp = xk )
    & ~ sdtlseqdt0(xp,xk)
    & ! [X1] :
        ( xk != sdtpldt0(xp,X1)
        | ~ aNaturalNumber0(X1) ) ),
    inference(rectify,[],[f70]) ).

fof(f70,plain,
    ( ( ( ~ sdtlseqdt0(xk,xp)
        & ! [X1] :
            ( xp != sdtpldt0(xk,X1)
            | ~ aNaturalNumber0(X1) ) )
      | xp = xk )
    & ~ sdtlseqdt0(xp,xk)
    & ! [X0] :
        ( sdtpldt0(xp,X0) != xk
        | ~ aNaturalNumber0(X0) ) ),
    inference(flattening,[],[f69]) ).

fof(f69,plain,
    ( ( ( ~ sdtlseqdt0(xk,xp)
        & ! [X1] :
            ( xp != sdtpldt0(xk,X1)
            | ~ aNaturalNumber0(X1) ) )
      | xp = xk )
    & ~ sdtlseqdt0(xp,xk)
    & ! [X0] :
        ( sdtpldt0(xp,X0) != xk
        | ~ aNaturalNumber0(X0) ) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f57,plain,
    ~ ( ~ ( sdtlseqdt0(xp,xk)
          | ? [X0] :
              ( sdtpldt0(xp,X0) = xk
              & aNaturalNumber0(X0) ) )
     => ( ( sdtlseqdt0(xk,xp)
          | ? [X1] :
              ( xp = sdtpldt0(xk,X1)
              & aNaturalNumber0(X1) ) )
        & xp != xk ) ),
    inference(rectify,[],[f51]) ).

fof(f51,negated_conjecture,
    ~ ( ~ ( sdtlseqdt0(xp,xk)
          | ? [X0] :
              ( sdtpldt0(xp,X0) = xk
              & aNaturalNumber0(X0) ) )
     => ( ( sdtlseqdt0(xk,xp)
          | ? [X0] :
              ( xp = sdtpldt0(xk,X0)
              & aNaturalNumber0(X0) ) )
        & xp != xk ) ),
    inference(negated_conjecture,[],[f50]) ).

fof(f50,conjecture,
    ( ~ ( sdtlseqdt0(xp,xk)
        | ? [X0] :
            ( sdtpldt0(xp,X0) = xk
            & aNaturalNumber0(X0) ) )
   => ( ( sdtlseqdt0(xk,xp)
        | ? [X0] :
            ( xp = sdtpldt0(xk,X0)
            & aNaturalNumber0(X0) ) )
      & xp != xk ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f342,plain,
    ( sdtlseqdt0(xp,xp)
    | ~ spl16_1
    | ~ spl16_2 ),
    inference(superposition,[],[f321,f318]) ).

fof(f321,plain,
    ( sdtlseqdt0(xk,xp)
    | ~ spl16_2 ),
    inference(avatar_component_clause,[],[f320]) ).

fof(f320,plain,
    ( spl16_2
  <=> sdtlseqdt0(xk,xp) ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_2])]) ).

fof(f338,plain,
    spl16_2,
    inference(avatar_split_clause,[],[f337,f320]) ).

fof(f337,plain,
    sdtlseqdt0(xk,xp),
    inference(subsumption_resolution,[],[f336,f215]) ).

fof(f215,plain,
    aNaturalNumber0(xk),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,axiom,
    ( xk = sdtsldt0(sdtasdt0(xn,xm),xp)
    & sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
    & aNaturalNumber0(xk) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).

fof(f336,plain,
    ( sdtlseqdt0(xk,xp)
    | ~ aNaturalNumber0(xk) ),
    inference(subsumption_resolution,[],[f329,f178]) ).

fof(f178,plain,
    aNaturalNumber0(xp),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,axiom,
    ( aNaturalNumber0(xp)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).

fof(f329,plain,
    ( sdtlseqdt0(xk,xp)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xk) ),
    inference(resolution,[],[f237,f294]) ).

fof(f294,plain,
    ! [X0,X1] :
      ( sdtlseqdt0(X1,X0)
      | sdtlseqdt0(X0,X1)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f121]) ).

fof(f121,plain,
    ! [X0,X1] :
      ( ( sdtlseqdt0(X1,X0)
        & X0 != X1 )
      | sdtlseqdt0(X0,X1)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(flattening,[],[f120]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ( sdtlseqdt0(X1,X0)
        & X0 != X1 )
      | sdtlseqdt0(X0,X1)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( ( sdtlseqdt0(X1,X0)
          & X0 != X1 )
        | sdtlseqdt0(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).

fof(f323,plain,
    ( spl16_1
    | ~ spl16_2 ),
    inference(avatar_split_clause,[],[f239,f320,f316]) ).

fof(f239,plain,
    ( ~ sdtlseqdt0(xk,xp)
    | xp = xk ),
    inference(cnf_transformation,[],[f158]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM505+3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.15/0.35  % Computer : n006.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 20 06:55:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  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.53/0.73  % (6979)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.53/0.73  % (6972)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.53/0.73  % (6974)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.73  % (6973)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.53/0.73  % (6975)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.53/0.73  % (6976)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.53/0.73  % (6977)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.53/0.73  % (6978)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.53/0.74  % (6977)First to succeed.
% 0.53/0.74  % (6977)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6971"
% 0.53/0.74  % (6977)Refutation found. Thanks to Tanya!
% 0.53/0.74  % SZS status Theorem for theBenchmark
% 0.53/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.74  % (6977)------------------------------
% 0.53/0.74  % (6977)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74  % (6977)Termination reason: Refutation
% 0.53/0.74  
% 0.53/0.74  % (6977)Memory used [KB]: 1168
% 0.53/0.74  % (6977)Time elapsed: 0.007 s
% 0.53/0.74  % (6977)Instructions burned: 10 (million)
% 0.53/0.74  % (6971)Success in time 0.371 s
% 0.53/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------