TSTP Solution File: CAT013-3 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : CAT013-3 : TPTP v8.1.0. Released v1.0.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 : n022.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 15:50:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f72,plain,
    $false,
    inference(unit_resulting_resolution,[],[f42,f45,f62,f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ there_exists(X0)
      | ~ sQ0_eqProxy(X0,X1)
      | equivalent(X0,X1) ),
    inference(equality_proxy_replacement,[],[f3,f20]) ).

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

fof(f3,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ there_exists(X0)
      | equivalent(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_and_equality_implies_equivalence1) ).

fof(f62,plain,
    ! [X0] : ~ equivalent(X0,compose(codomain(a),a)),
    inference(unit_resulting_resolution,[],[f61,f12]) ).

fof(f12,axiom,
    ! [X0,X1] :
      ( there_exists(X1)
      | ~ equivalent(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_implies_existence3) ).

fof(f61,plain,
    ~ there_exists(compose(codomain(a),a)),
    inference(unit_resulting_resolution,[],[f47,f32]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( sQ0_eqProxy(domain(X0),codomain(X1))
      | ~ there_exists(compose(X0,X1)) ),
    inference(equality_proxy_replacement,[],[f7,f20]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( domain(X0) = codomain(X1)
      | ~ there_exists(compose(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition1) ).

fof(f47,plain,
    ~ sQ0_eqProxy(domain(codomain(a)),codomain(a)),
    inference(unit_resulting_resolution,[],[f27,f40]) ).

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

fof(f27,plain,
    ~ sQ0_eqProxy(codomain(a),domain(codomain(a))),
    inference(equality_proxy_replacement,[],[f19,f20]) ).

fof(f19,axiom,
    codomain(a) != domain(codomain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_of_codomain_is_codomain) ).

fof(f45,plain,
    ! [X0] : sQ0_eqProxy(X0,compose(codomain(X0),X0)),
    inference(unit_resulting_resolution,[],[f22,f40]) ).

fof(f22,plain,
    ! [X0] : sQ0_eqProxy(compose(codomain(X0),X0),X0),
    inference(equality_proxy_replacement,[],[f11,f20]) ).

fof(f11,axiom,
    ! [X0] : compose(codomain(X0),X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_codomain) ).

fof(f42,plain,
    there_exists(a),
    inference(unit_resulting_resolution,[],[f18,f5]) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ there_exists(codomain(X0))
      | there_exists(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',codomain_has_elements) ).

fof(f18,axiom,
    there_exists(codomain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_codomain_exists) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : CAT013-3 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n022.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.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 29 16:20:11 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.20/0.49  % (18177)lrs+10_1:1_sos=all:ss=axioms:st=1.5:i=20:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/20Mi)
% 0.20/0.49  % (18159)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.49  % (18159)First to succeed.
% 0.20/0.50  % (18159)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (18159)------------------------------
% 0.20/0.50  % (18159)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (18159)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (18159)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (18159)Memory used [KB]: 5884
% 0.20/0.50  % (18159)Time elapsed: 0.094 s
% 0.20/0.50  % (18159)Instructions burned: 3 (million)
% 0.20/0.50  % (18159)------------------------------
% 0.20/0.50  % (18159)------------------------------
% 0.20/0.50  % (18148)Success in time 0.154 s
%------------------------------------------------------------------------------