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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM405+1 : TPTP v8.1.0. Released v3.2.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 : n014.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 18:04:59 EDT 2022

% Result   : Theorem 0.21s 0.57s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (   5 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   99 (  41   ~;  35   |;  15   &)
%                                         (   2 <=>;   5  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   47 (  38   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f229,plain,
    $false,
    inference(resolution,[],[f226,f212]) ).

fof(f212,plain,
    ! [X1] : in(sK5(sK8(X1)),sK11),
    inference(resolution,[],[f206,f139]) ).

fof(f139,plain,
    ! [X1] :
      ( ~ ordinal(X1)
      | in(X1,sK11) ),
    inference(cnf_transformation,[],[f91]) ).

fof(f91,plain,
    ! [X1] :
      ( in(X1,sK11)
      | ~ ordinal(X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f56,f90]) ).

fof(f90,plain,
    ( ? [X0] :
      ! [X1] :
        ( in(X1,X0)
        | ~ ordinal(X1) )
   => ! [X1] :
        ( in(X1,sK11)
        | ~ ordinal(X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f56,plain,
    ? [X0] :
    ! [X1] :
      ( in(X1,X0)
      | ~ ordinal(X1) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f31,negated_conjecture,
    ~ ! [X0] :
        ~ ! [X1] :
            ( ordinal(X1)
           => in(X1,X0) ),
    inference(negated_conjecture,[],[f30]) ).

fof(f30,conjecture,
    ! [X0] :
      ~ ! [X1] :
          ( ordinal(X1)
         => in(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_ordinal1) ).

fof(f206,plain,
    ! [X0] : ordinal(sK5(sK8(X0))),
    inference(duplicate_literal_removal,[],[f203]) ).

fof(f203,plain,
    ! [X0] :
      ( ordinal(sK5(sK8(X0)))
      | ordinal(sK5(sK8(X0))) ),
    inference(resolution,[],[f123,f134]) ).

fof(f134,plain,
    ! [X2,X0] :
      ( ~ in(X2,sK8(X0))
      | ordinal(X2) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f85,plain,
    ! [X0,X2] :
      ( ( in(X2,sK8(X0))
        | ~ ordinal(X2)
        | ~ in(X2,X0) )
      & ( ( ordinal(X2)
          & in(X2,X0) )
        | ~ in(X2,sK8(X0)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f83,f84]) ).

fof(f84,plain,
    ! [X0] :
      ( ? [X1] :
        ! [X2] :
          ( ( in(X2,X1)
            | ~ ordinal(X2)
            | ~ in(X2,X0) )
          & ( ( ordinal(X2)
              & in(X2,X0) )
            | ~ in(X2,X1) ) )
     => ! [X2] :
          ( ( in(X2,sK8(X0))
            | ~ ordinal(X2)
            | ~ in(X2,X0) )
          & ( ( ordinal(X2)
              & in(X2,X0) )
            | ~ in(X2,sK8(X0)) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f83,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( in(X2,X1)
        | ~ ordinal(X2)
        | ~ in(X2,X0) )
      & ( ( ordinal(X2)
          & in(X2,X0) )
        | ~ in(X2,X1) ) ),
    inference(flattening,[],[f82]) ).

fof(f82,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( in(X2,X1)
        | ~ ordinal(X2)
        | ~ in(X2,X0) )
      & ( ( ordinal(X2)
          & in(X2,X0) )
        | ~ in(X2,X1) ) ),
    inference(nnf_transformation,[],[f26]) ).

fof(f26,axiom,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( in(X2,X1)
    <=> ( ordinal(X2)
        & in(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_xboole_0__e2_43__ordinal1) ).

fof(f123,plain,
    ! [X0] :
      ( in(sK5(X0),X0)
      | ordinal(sK5(X0)) ),
    inference(cnf_transformation,[],[f77]) ).

fof(f77,plain,
    ! [X0] :
      ( ( ~ ordinal(sK5(X0))
        | ~ in(sK5(X0),X0) )
      & ( ordinal(sK5(X0))
        | in(sK5(X0),X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f75,f76]) ).

fof(f76,plain,
    ! [X0] :
      ( ? [X1] :
          ( ( ~ ordinal(X1)
            | ~ in(X1,X0) )
          & ( ordinal(X1)
            | in(X1,X0) ) )
     => ( ( ~ ordinal(sK5(X0))
          | ~ in(sK5(X0),X0) )
        & ( ordinal(sK5(X0))
          | in(sK5(X0),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f75,plain,
    ! [X0] :
    ? [X1] :
      ( ( ~ ordinal(X1)
        | ~ in(X1,X0) )
      & ( ordinal(X1)
        | in(X1,X0) ) ),
    inference(nnf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X0] :
    ? [X1] :
      ( in(X1,X0)
    <~> ordinal(X1) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,axiom,
    ! [X0] :
      ~ ! [X1] :
          ( ordinal(X1)
        <=> in(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_ordinal1) ).

fof(f226,plain,
    ! [X0] : ~ in(sK5(sK8(X0)),X0),
    inference(subsumption_resolution,[],[f224,f206]) ).

fof(f224,plain,
    ! [X0] :
      ( ~ ordinal(sK5(sK8(X0)))
      | ~ in(sK5(sK8(X0)),X0) ),
    inference(resolution,[],[f211,f135]) ).

fof(f135,plain,
    ! [X2,X0] :
      ( in(X2,sK8(X0))
      | ~ ordinal(X2)
      | ~ in(X2,X0) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f211,plain,
    ! [X0] : ~ in(sK5(sK8(X0)),sK8(X0)),
    inference(resolution,[],[f206,f124]) ).

fof(f124,plain,
    ! [X0] :
      ( ~ ordinal(sK5(X0))
      | ~ in(sK5(X0),X0) ),
    inference(cnf_transformation,[],[f77]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : NUM405+1 : TPTP v8.1.0. Released v3.2.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 : n014.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 06:29:18 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.54  % (15033)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.54  % (15033)Instruction limit reached!
% 0.21/0.54  % (15033)------------------------------
% 0.21/0.54  % (15033)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (15033)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (15033)Termination reason: Unknown
% 0.21/0.55  % (15033)Termination phase: Preprocessing 2
% 0.21/0.55  
% 0.21/0.55  % (15033)Memory used [KB]: 895
% 0.21/0.55  % (15033)Time elapsed: 0.004 s
% 0.21/0.55  % (15033)Instructions burned: 2 (million)
% 0.21/0.55  % (15033)------------------------------
% 0.21/0.55  % (15033)------------------------------
% 0.21/0.55  % (15040)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.55  % (15032)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.55  % (15031)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.55  TRYING [1]
% 0.21/0.55  % (15032)Instruction limit reached!
% 0.21/0.55  % (15032)------------------------------
% 0.21/0.55  % (15032)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  TRYING [2]
% 0.21/0.55  TRYING [3]
% 0.21/0.56  TRYING [4]
% 0.21/0.56  % (15047)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.56  % (15040)First to succeed.
% 0.21/0.56  % (15048)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.56  TRYING [5]
% 0.21/0.56  % (15039)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.56  % (15032)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (15032)Termination reason: Unknown
% 0.21/0.56  % (15032)Termination phase: Saturation
% 0.21/0.56  
% 0.21/0.56  % (15032)Memory used [KB]: 5500
% 0.21/0.56  % (15032)Time elapsed: 0.132 s
% 0.21/0.56  % (15032)Instructions burned: 7 (million)
% 0.21/0.56  % (15032)------------------------------
% 0.21/0.56  % (15032)------------------------------
% 0.21/0.56  % (15048)Also succeeded, but the first one will report.
% 0.21/0.57  % (15040)Refutation found. Thanks to Tanya!
% 0.21/0.57  % SZS status Theorem for theBenchmark
% 0.21/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57  % (15040)------------------------------
% 0.21/0.57  % (15040)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57  % (15040)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57  % (15040)Termination reason: Refutation
% 0.21/0.57  
% 0.21/0.57  % (15040)Memory used [KB]: 1023
% 0.21/0.57  % (15040)Time elapsed: 0.136 s
% 0.21/0.57  % (15040)Instructions burned: 5 (million)
% 0.21/0.57  % (15040)------------------------------
% 0.21/0.57  % (15040)------------------------------
% 0.21/0.57  % (15024)Success in time 0.199 s
%------------------------------------------------------------------------------