%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUN088+3 : 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 : n016.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.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   43 (  13 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  23   ~;  13   |;  10   &)
%                                         (   0 <=>;   2  =>;   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    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   23 (  17   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f62,plain,
    $false,
    inference(subsumption_resolution,[],[f60,f48]) ).

fof(f48,plain,
    r1(sK1),
    inference(definition_unfolding,[],[f30,f31]) ).

fof(f31,plain,
    sK0 = sK1,
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ( r2(sK0,sK1)
    & sK0 = sK1
    & r1(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f21,f20]) ).

fof(f20,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( r2(X0,X1)
            & X0 = X1 )
        & r1(X0) )
   => ( ? [X1] :
          ( r2(sK0,X1)
          & sK0 = X1 )
      & r1(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ( ? [X1] :
        ( r2(sK0,X1)
        & sK0 = X1 )
   => ( r2(sK0,sK1)
      & sK0 = sK1 ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

fof(f30,plain,
    r1(sK0),
    inference(cnf_transformation,[],[f22]) ).

fof(f60,plain,
    ~ r1(sK1),
    inference(resolution,[],[f54,f47]) ).

fof(f47,plain,
    r2(sK1,sK1),
    inference(definition_unfolding,[],[f32,f31]) ).

fof(f32,plain,
    r2(sK0,sK1),
    inference(cnf_transformation,[],[f22]) ).

fof(f54,plain,
    ! [X2,X1] :
      ( ~ r2(X1,X2)
      | ~ r1(X2) ),
    inference(equality_resolution,[],[f46]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUN088+3 : TPTP v8.1.0. Released v7.3.0.
% 0.13/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.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 10:14:16 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.49  % (12125)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50  % (12123)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50  % (12125)First to succeed.
% 0.20/0.50  % (12123)Also succeeded, but the first one will report.
% 0.20/0.50  % (12140)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.50  % (12125)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (12125)------------------------------
% 0.20/0.50  % (12125)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (12125)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (12125)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (12125)Memory used [KB]: 6012
% 0.20/0.50  % (12125)Time elapsed: 0.106 s
% 0.20/0.50  % (12125)Instructions burned: 2 (million)
% 0.20/0.50  % (12125)------------------------------
% 0.20/0.50  % (12125)------------------------------
% 0.20/0.50  % (12112)Success in time 0.155 s
%------------------------------------------------------------------------------