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

% Computer : n028.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:14:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f42,plain,
    $false,
    inference(unit_resulting_resolution,[],[f22,f24,f39]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ sQ0_eqProxy(X0,X1)
      | sQ0_eqProxy(X1,X0) ),
    inference(equality_proxy_axiom,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( sQ0_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).

fof(f24,plain,
    ~ sQ0_eqProxy(a,greatest_lower_bound(a,a)),
    inference(equality_proxy_replacement,[],[f16,f17]) ).

fof(f16,axiom,
    a != greatest_lower_bound(a,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_reflb) ).

fof(f22,plain,
    ! [X0] : sQ0_eqProxy(greatest_lower_bound(X0,X0),X0),
    inference(equality_proxy_replacement,[],[f9,f17]) ).

fof(f9,axiom,
    ! [X0] : greatest_lower_bound(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP161-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n028.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   : Mon Aug 29 22:26:47 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (5742)lrs+10_5:1_br=off:ep=RSTC:sos=all:urr=on:i=267:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/267Mi)
% 0.19/0.50  % (5742)First to succeed.
% 0.19/0.50  % (5734)lrs+10_1:128_plsq=on:plsqc=2:s2a=on:ss=axioms:st=1.5:urr=on:i=321:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/321Mi)
% 0.19/0.51  % (5734)Also succeeded, but the first one will report.
% 0.19/0.51  % (5742)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  % (5742)------------------------------
% 0.19/0.51  % (5742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (5742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (5742)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (5742)Memory used [KB]: 5500
% 0.19/0.51  % (5742)Time elapsed: 0.061 s
% 0.19/0.51  % (5742)Instructions burned: 1 (million)
% 0.19/0.51  % (5742)------------------------------
% 0.19/0.51  % (5742)------------------------------
% 0.19/0.51  % (5719)Success in time 0.158 s
%------------------------------------------------------------------------------