%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.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 : n027.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:03:18 EDT 2022

% Result   : Unsatisfiable 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :    8 (   7 unt;   0 def)
%            Number of atoms       :    9 (   1 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    4 (   3   ~;   1   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    5 (   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,plain,
    $false,
    inference(subsumption_resolution,[],[f44,f17]) ).

fof(f17,plain,
    ~ less(n0,sF0),
    inference(definition_folding,[],[f15,f16]) ).

fof(f16,plain,
    successor(a) = sF0,
    introduced(function_definition,[]) ).

fof(f15,axiom,
    ~ less(n0,successor(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zero_is_less_than_all_successors) ).

fof(f44,plain,
    less(n0,sF0),
    inference(superposition,[],[f39,f16]) ).

fof(f39,plain,
    ! [X0] : less(n0,successor(X0)),
    inference(resolution,[],[f8,f1]) ).

fof(f1,axiom,
    ! [X0] : equalish(add(X0,n0),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',adding_zero) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(add(successor(X0),X1),X2)
      | less(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',smaller_number) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/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.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 06:05:31 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.49  % (29496)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (29496)First to succeed.
% 0.19/0.51  % (29496)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (29496)------------------------------
% 0.19/0.51  % (29496)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (29496)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (29496)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (29496)Memory used [KB]: 5373
% 0.19/0.51  % (29496)Time elapsed: 0.122 s
% 0.19/0.51  % (29496)Instructions burned: 2 (million)
% 0.19/0.51  % (29496)------------------------------
% 0.19/0.51  % (29496)------------------------------
% 0.19/0.51  % (29491)Success in time 0.171 s
%------------------------------------------------------------------------------