%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUN067+2 : TPTP v8.1.0. Released v7.3.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 : n023.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:08:03 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   29 (   9 unt;   0 def)
%            Number of atoms       :   76 (  33 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   88 (  41   ~;  22   |;  22   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   50 (  40   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f174,plain,
    $false,
    inference(subsumption_resolution,[],[f172,f111]) ).

fof(f111,plain,
    r1(sK20),
    inference(equality_resolution,[],[f97]) ).

fof(f97,plain,
    ! [X1] :
      ( sK20 != X1
      | r1(X1) ),
    inference(cnf_transformation,[],[f58]) ).

fof(f58,plain,
    ! [X1] :
      ( ( ~ r1(X1)
        & sK20 != X1 )
      | ( r1(X1)
        & sK20 = X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK20])],[f1,f57]) ).

fof(f57,plain,
    ( ? [X0] :
      ! [X1] :
        ( ( ~ r1(X1)
          & X0 != X1 )
        | ( r1(X1)
          & X0 = X1 ) )
   => ! [X1] :
        ( ( ~ r1(X1)
          & sK20 != X1 )
        | ( r1(X1)
          & sK20 = X1 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f1,axiom,
    ? [X0] :
    ! [X1] :
      ( ( ~ r1(X1)
        & X0 != X1 )
      | ( r1(X1)
        & X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).

fof(f172,plain,
    ~ r1(sK20),
    inference(resolution,[],[f105,f125]) ).

fof(f125,plain,
    ! [X0] : r2(X0,sK20),
    inference(backward_demodulation,[],[f103,f115]) ).

fof(f115,plain,
    ! [X1] : sK20 = X1,
    inference(subsumption_resolution,[],[f98,f114]) ).

fof(f114,plain,
    ! [X0] : r1(X0),
    inference(backward_demodulation,[],[f64,f63]) ).

fof(f63,plain,
    ! [X0] : sK3(X0) = X0,
    inference(cnf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X0] :
      ( r1(sK3(X0))
      & sK3(X0) = X0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f25,f30]) ).

fof(f30,plain,
    ! [X0] :
      ( ? [X1] :
          ( r1(X1)
          & X0 = X1 )
     => ( r1(sK3(X0))
        & sK3(X0) = X0 ) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ! [X0] :
    ? [X1] :
      ( r1(X1)
      & X0 = X1 ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,plain,
    ~ ? [X0] :
      ! [X1] :
        ( ~ r1(X1)
        | X0 != X1 ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ? [X38] :
      ! [X21] :
        ( X21 != X38
        | ~ r1(X21) ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ? [X38] :
    ! [X21] :
      ( X21 != X38
      | ~ r1(X21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonzerosexist) ).

fof(f64,plain,
    ! [X0] : r1(sK3(X0)),
    inference(cnf_transformation,[],[f31]) ).

fof(f98,plain,
    ! [X1] :
      ( ~ r1(X1)
      | sK20 = X1 ),
    inference(cnf_transformation,[],[f58]) ).

fof(f103,plain,
    ! [X0] : r2(X0,sK13(X0)),
    inference(equality_resolution,[],[f78]) ).

fof(f78,plain,
    ! [X2,X0] :
      ( sK13(X0) != X2
      | r2(X0,X2) ),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X0,X2] :
      ( ( ~ r2(X0,X2)
        & sK13(X0) != X2 )
      | ( r2(X0,X2)
        & sK13(X0) = X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f20,f44]) ).

fof(f44,plain,
    ! [X0] :
      ( ? [X1] :
        ! [X2] :
          ( ( ~ r2(X0,X2)
            & X1 != X2 )
          | ( r2(X0,X2)
            & X1 = X2 ) )
     => ! [X2] :
          ( ( ~ r2(X0,X2)
            & sK13(X0) != X2 )
          | ( r2(X0,X2)
            & sK13(X0) = X2 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( ~ r2(X0,X2)
        & X1 != X2 )
      | ( r2(X0,X2)
        & X1 = X2 ) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X2] :
    ? [X3] :
    ! [X4] :
      ( ( ~ r2(X2,X4)
        & X3 != X4 )
      | ( r2(X2,X4)
        & X3 = X4 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f105,plain,
    ! [X2,X0] :
      ( ~ r2(X0,X2)
      | ~ r1(X2) ),
    inference(equality_resolution,[],[f81]) ).

fof(f81,plain,
    ! [X2,X0,X1] :
      ( ~ r2(X0,X1)
      | X1 != X2
      | ~ r1(X2) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ! [X2] :
          ( X1 != X2
          | ~ r1(X2) ) ),
    inference(rectify,[],[f11]) ).

fof(f11,axiom,
    ! [X40,X41] :
      ( ~ r2(X40,X41)
      | ! [X42] :
          ( ~ r1(X42)
          | X41 != X42 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7a) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/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 : n023.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 10:06:35 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.51  % (4662)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51  % (4670)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.51  % (4670)First to succeed.
% 0.20/0.52  % (4654)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.20/0.52  % (4662)Also succeeded, but the first one will report.
% 0.20/0.52  % (4670)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (4670)------------------------------
% 0.20/0.52  % (4670)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (4670)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (4670)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (4670)Memory used [KB]: 5500
% 0.20/0.52  % (4670)Time elapsed: 0.097 s
% 0.20/0.52  % (4670)Instructions burned: 4 (million)
% 0.20/0.52  % (4670)------------------------------
% 0.20/0.52  % (4670)------------------------------
% 0.20/0.52  % (4645)Success in time 0.167 s
%------------------------------------------------------------------------------