TSTP Solution File: CAT010-4 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : CAT010-4 : 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_sat --cores 0 -t %d %s

% Computer : n001.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:51:16 EDT 2022

% Result   : Unsatisfiable 0.19s 0.58s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   33 (  19 unt;   0 def)
%            Number of atoms       :   47 (  18 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   29 (  15   ~;  13   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f293,plain,
    $false,
    inference(avatar_sat_refutation,[],[f49,f292]) ).

fof(f292,plain,
    ~ spl3_2,
    inference(avatar_contradiction_clause,[],[f291]) ).

fof(f291,plain,
    ( $false
    | ~ spl3_2 ),
    inference(subsumption_resolution,[],[f283,f18]) ).

fof(f18,plain,
    sF2 != sF1,
    inference(definition_folding,[],[f13,f17,f16,f15]) ).

fof(f15,plain,
    compose(a,b) = sF0,
    introduced(function_definition,[]) ).

fof(f16,plain,
    codomain(sF0) = sF1,
    introduced(function_definition,[]) ).

fof(f17,plain,
    codomain(a) = sF2,
    introduced(function_definition,[]) ).

fof(f13,axiom,
    codomain(compose(a,b)) != codomain(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).

fof(f283,plain,
    ( sF2 = sF1
    | ~ spl3_2 ),
    inference(superposition,[],[f282,f68]) ).

fof(f68,plain,
    ( domain(sF2) = sF2
    | ~ spl3_2 ),
    inference(forward_demodulation,[],[f67,f17]) ).

fof(f67,plain,
    ( codomain(a) = domain(sF2)
    | ~ spl3_2 ),
    inference(subsumption_resolution,[],[f65,f29]) ).

fof(f29,plain,
    ( there_exists(a)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f27]) ).

fof(f27,plain,
    ( spl3_2
  <=> there_exists(a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f65,plain,
    ( codomain(a) = domain(sF2)
    | ~ there_exists(a) ),
    inference(superposition,[],[f7,f34]) ).

fof(f34,plain,
    a = compose(sF2,a),
    inference(superposition,[],[f11,f17]) ).

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

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

fof(f282,plain,
    domain(sF2) = sF1,
    inference(forward_demodulation,[],[f281,f16]) ).

fof(f281,plain,
    domain(sF2) = codomain(sF0),
    inference(subsumption_resolution,[],[f279,f19]) ).

fof(f19,plain,
    there_exists(sF0),
    inference(forward_demodulation,[],[f12,f15]) ).

fof(f12,axiom,
    there_exists(compose(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).

fof(f279,plain,
    ( domain(sF2) = codomain(sF0)
    | ~ there_exists(sF0) ),
    inference(superposition,[],[f7,f270]) ).

fof(f270,plain,
    compose(sF2,sF0) = sF0,
    inference(superposition,[],[f228,f15]) ).

fof(f228,plain,
    ! [X15] : compose(sF2,compose(a,X15)) = compose(a,X15),
    inference(superposition,[],[f9,f34]) ).

fof(f9,axiom,
    ! [X2,X0,X1] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_compose) ).

fof(f49,plain,
    spl3_2,
    inference(avatar_contradiction_clause,[],[f48]) ).

fof(f48,plain,
    ( $false
    | spl3_2 ),
    inference(subsumption_resolution,[],[f47,f28]) ).

fof(f28,plain,
    ( ~ there_exists(a)
    | spl3_2 ),
    inference(avatar_component_clause,[],[f27]) ).

fof(f47,plain,
    there_exists(a),
    inference(resolution,[],[f45,f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( ~ there_exists(domain(X0))
      | there_exists(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_has_elements) ).

fof(f45,plain,
    there_exists(domain(a)),
    inference(subsumption_resolution,[],[f37,f19]) ).

fof(f37,plain,
    ( there_exists(domain(a))
    | ~ there_exists(sF0) ),
    inference(superposition,[],[f6,f15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : CAT010-4 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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.13/0.34  % Computer : n001.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 16:38:59 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.53  % (2043)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.55  % (2058)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.55  % (2067)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.55  % (2050)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.55  % (2066)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.55  % (2051)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.56  % (2059)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.58  % (2050)First to succeed.
% 0.19/0.58  % (2050)Refutation found. Thanks to Tanya!
% 0.19/0.58  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.58  % (2050)------------------------------
% 0.19/0.58  % (2050)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.58  % (2050)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.58  % (2050)Termination reason: Refutation
% 0.19/0.58  
% 0.19/0.58  % (2050)Memory used [KB]: 5500
% 0.19/0.58  % (2050)Time elapsed: 0.164 s
% 0.19/0.58  % (2050)Instructions burned: 9 (million)
% 0.19/0.58  % (2050)------------------------------
% 0.19/0.58  % (2050)------------------------------
% 0.19/0.58  % (2037)Success in time 0.233 s
%------------------------------------------------------------------------------