%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUM850+1 : TPTP v8.1.0. Released v4.1.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 : n005.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:02:35 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :   27 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   23 (  10   ~;   7   |;   3   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (  19   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f258,plain,
    $false,
    inference(unit_resulting_resolution,[],[f189,f188,f173]) ).

fof(f173,plain,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | vplus(X1,sK0(X0,X1)) = X0 ),
    inference(cnf_transformation,[],[f135]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( ( greater(X0,X1)
        | ! [X2] : vplus(X1,X2) != X0 )
      & ( vplus(X1,sK0(X0,X1)) = X0
        | ~ greater(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f133,f134]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( ? [X3] : vplus(X1,X3) = X0
     => vplus(X1,sK0(X0,X1)) = X0 ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ! [X0,X1] :
      ( ( greater(X0,X1)
        | ! [X2] : vplus(X1,X2) != X0 )
      & ( ? [X3] : vplus(X1,X3) = X0
        | ~ greater(X0,X1) ) ),
    inference(rectify,[],[f132]) ).

fof(f132,plain,
    ! [X0,X1] :
      ( ( greater(X0,X1)
        | ! [X2] : vplus(X1,X2) != X0 )
      & ( ? [X2] : vplus(X1,X2) = X0
        | ~ greater(X0,X1) ) ),
    inference(nnf_transformation,[],[f64]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( greater(X0,X1)
    <=> ? [X2] : vplus(X1,X2) = X0 ),
    inference(rectify,[],[f37]) ).

fof(f37,axiom,
    ! [X66,X65] :
      ( greater(X66,X65)
    <=> ? [X67] : vplus(X65,X67) = X66 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).

fof(f188,plain,
    ! [X0] : vd470 != vplus(vd471,X0),
    inference(cnf_transformation,[],[f112]) ).

fof(f112,plain,
    ! [X0] : vd470 != vplus(vd471,X0),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ? [X0] : vd470 = vplus(vd471,X0),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ? [X0] : vd470 = vplus(vd471,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(conseq_conjunct1(conseq(302)))') ).

fof(f189,plain,
    greater(vd470,vd471),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    greater(vd470,vd471),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(302), 472, 0)') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM850+1 : TPTP v8.1.0. Released v4.1.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 : n005.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 09:02:48 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (21895)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.50  % (21888)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50  % (21899)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.51  % (21899)First to succeed.
% 0.20/0.51  % (21889)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.51  % (21915)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.51  % (21899)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (21899)------------------------------
% 0.20/0.51  % (21899)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (21899)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (21899)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (21899)Memory used [KB]: 6140
% 0.20/0.51  % (21899)Time elapsed: 0.102 s
% 0.20/0.51  % (21899)Instructions burned: 5 (million)
% 0.20/0.51  % (21899)------------------------------
% 0.20/0.51  % (21899)------------------------------
% 0.20/0.51  % (21883)Success in time 0.159 s
%------------------------------------------------------------------------------