%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUN088+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_uns --cores 0 -t %d %s

% Computer : n002.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:07:50 EDT 2022

% Result   : Theorem 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   53 (  13 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   61 (  26   ~;  16   |;  16   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   30 (  20   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f76,plain,
    $false,
    inference(subsumption_resolution,[],[f74,f41]) ).

fof(f41,plain,
    r1(sK2),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ( r1(sK2)
    & sK1 = sK2
    & r2(sK3,sK1)
    & r1(sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f19,f24,f23,f22]) ).

fof(f22,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( r1(X1)
            & X0 = X1 )
        & ? [X2] :
            ( r2(X2,X0)
            & r1(X2) ) )
   => ( ? [X1] :
          ( r1(X1)
          & sK1 = X1 )
      & ? [X2] :
          ( r2(X2,sK1)
          & r1(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f23,plain,
    ( ? [X1] :
        ( r1(X1)
        & sK1 = X1 )
   => ( r1(sK2)
      & sK1 = sK2 ) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ( ? [X2] :
        ( r2(X2,sK1)
        & r1(X2) )
   => ( r2(sK3,sK1)
      & r1(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ? [X0] :
      ( ? [X1] :
          ( r1(X1)
          & X0 = X1 )
      & ? [X2] :
          ( r2(X2,X0)
          & r1(X2) ) ),
    inference(ennf_transformation,[],[f14]) ).

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

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

fof(f12,conjecture,
    ! [X38] :
      ( ! [X21] :
          ( ~ r1(X21)
          | X21 != X38 )
      | ! [X22] :
          ( ~ r2(X22,X38)
          | ~ r1(X22) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerouneqone) ).

fof(f74,plain,
    ~ r1(sK2),
    inference(resolution,[],[f51,f52]) ).

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

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

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

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

fof(f51,plain,
    r2(sK3,sK2),
    inference(definition_unfolding,[],[f39,f40]) ).

fof(f40,plain,
    sK1 = sK2,
    inference(cnf_transformation,[],[f25]) ).

fof(f39,plain,
    r2(sK3,sK1),
    inference(cnf_transformation,[],[f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : NUN088+2 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.33  % Computer : n002.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Tue Aug 30 10:04:14 EDT 2022
% 0.14/0.33  % CPUTime    : 
% 0.19/0.46  % (2666)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.47  % (2652)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.47  % (2652)First to succeed.
% 0.19/0.48  % (2652)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (2652)------------------------------
% 0.19/0.48  % (2652)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (2652)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (2652)Termination reason: Refutation
% 0.19/0.48  
% 0.19/0.48  % (2652)Memory used [KB]: 5884
% 0.19/0.48  % (2652)Time elapsed: 0.082 s
% 0.19/0.48  % (2652)Instructions burned: 2 (million)
% 0.19/0.48  % (2652)------------------------------
% 0.19/0.48  % (2652)------------------------------
% 0.19/0.48  % (2641)Success in time 0.135 s
%------------------------------------------------------------------------------