%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GRP158-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 : n011.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.20s 0.58s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (  10 unt;   0 def)
%            Number of atoms       :   18 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   13 (   8   ~;   4   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f63,plain,
    $false,
    inference(subsumption_resolution,[],[f54,f34]) ).

fof(f34,plain,
    sQ0_eqProxy(a,greatest_lower_bound(a,b)),
    inference(equality_proxy_replacement,[],[f16,f18]) ).

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

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

fof(f54,plain,
    ~ sQ0_eqProxy(a,greatest_lower_bound(a,b)),
    inference(unit_resulting_resolution,[],[f40,f46,f36]) ).

fof(f36,plain,
    ! [X2,X3,X0,X1] :
      ( sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3))
      | ~ sQ0_eqProxy(X0,X1)
      | ~ sQ0_eqProxy(X2,X3) ),
    inference(equality_proxy_axiom,[],[f18]) ).

fof(f46,plain,
    ~ sQ0_eqProxy(multiply(c,a),multiply(c,greatest_lower_bound(a,b))),
    inference(unit_resulting_resolution,[],[f27,f19,f42]) ).

fof(f42,plain,
    ! [X2,X0,X1] :
      ( ~ sQ0_eqProxy(X1,X2)
      | sQ0_eqProxy(X0,X2)
      | ~ sQ0_eqProxy(X0,X1) ),
    inference(equality_proxy_axiom,[],[f18]) ).

fof(f19,plain,
    ~ sQ0_eqProxy(multiply(c,a),greatest_lower_bound(multiply(c,a),multiply(c,b))),
    inference(equality_proxy_replacement,[],[f17,f18]) ).

fof(f17,axiom,
    multiply(c,a) != greatest_lower_bound(multiply(c,a),multiply(c,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono2b) ).

fof(f27,plain,
    ! [X2,X0,X1] : sQ0_eqProxy(multiply(X0,greatest_lower_bound(X1,X2)),greatest_lower_bound(multiply(X0,X1),multiply(X0,X2))),
    inference(equality_proxy_replacement,[],[f13,f18]) ).

fof(f13,axiom,
    ! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).

fof(f40,plain,
    ! [X0] : sQ0_eqProxy(X0,X0),
    inference(equality_proxy_axiom,[],[f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP158-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.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 29 22:14:55 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.55  % (30159)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99788:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99788Mi)
% 0.20/0.57  % (30182)dis+21_1:8_aac=none:bs=unit_only:er=filter:fd=off:nwc=5.0:s2pl=no:i=111:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/111Mi)
% 0.20/0.57  % (30174)dis+10_1:7_drc=off:fd=preordered:plsq=on:sp=reverse_frequency:to=lpo:i=212:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/212Mi)
% 0.20/0.58  % (30180)dis+11_1:64_fd=off:nm=0:nwc=5.0:i=481:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/481Mi)
% 0.20/0.58  % (30160)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=10:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/10Mi)
% 0.20/0.58  % (30160)First to succeed.
% 0.20/0.58  % (30160)Refutation found. Thanks to Tanya!
% 0.20/0.58  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58  % (30160)------------------------------
% 0.20/0.58  % (30160)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58  % (30160)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58  % (30160)Termination reason: Refutation
% 0.20/0.58  
% 0.20/0.58  % (30160)Memory used [KB]: 5500
% 0.20/0.58  % (30160)Time elapsed: 0.156 s
% 0.20/0.58  % (30160)Instructions burned: 2 (million)
% 0.20/0.58  % (30160)------------------------------
% 0.20/0.58  % (30160)------------------------------
% 0.20/0.58  % (30158)Success in time 0.224 s
%------------------------------------------------------------------------------