%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : 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 16:20:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f83,plain,
    $false,
    inference(subsumption_resolution,[],[f82,f16]) ).

fof(f16,axiom,
    c = least_upper_bound(a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1a_1) ).

fof(f82,plain,
    c != least_upper_bound(a,c),
    inference(forward_demodulation,[],[f81,f17]) ).

fof(f17,axiom,
    c = least_upper_bound(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1a_2) ).

fof(f81,plain,
    c != least_upper_bound(a,least_upper_bound(b,c)),
    inference(superposition,[],[f18,f7]) ).

fof(f7,axiom,
    ! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).

fof(f18,axiom,
    c != least_upper_bound(least_upper_bound(a,b),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1a) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/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 : n005.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   : Mon Aug 29 22:16:48 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.44  % (19159)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.44  % (19138)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.44  % (19138)First to succeed.
% 0.20/0.45  % (19138)Refutation found. Thanks to Tanya!
% 0.20/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.45  % (19138)------------------------------
% 0.20/0.45  % (19138)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.45  % (19138)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.45  % (19138)Termination reason: Refutation
% 0.20/0.45  
% 0.20/0.45  % (19138)Memory used [KB]: 5373
% 0.20/0.45  % (19138)Time elapsed: 0.053 s
% 0.20/0.45  % (19138)Instructions burned: 4 (million)
% 0.20/0.45  % (19138)------------------------------
% 0.20/0.45  % (19138)------------------------------
% 0.20/0.45  % (19130)Success in time 0.1 s
%------------------------------------------------------------------------------