TSTP Solution File: SYN062+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN062+1 : TPTP v8.1.0. Released v2.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 : n025.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 19:25:23 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   34 (   5 unt;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   81 (  32   ~;  25   |;  15   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   3 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   17 (  14   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f38,plain,
    $false,
    inference(avatar_sat_refutation,[],[f31,f34,f37]) ).

fof(f37,plain,
    spl1_2,
    inference(avatar_contradiction_clause,[],[f36]) ).

fof(f36,plain,
    ( $false
    | spl1_2 ),
    inference(subsumption_resolution,[],[f35,f18]) ).

fof(f18,plain,
    big_k(sK0),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ( ~ big_j(sK0)
    & big_f(sK0)
    & big_k(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f14]) ).

fof(f14,plain,
    ( ? [X0] :
        ( ~ big_j(X0)
        & big_f(X0)
        & big_k(X0) )
   => ( ~ big_j(sK0)
      & big_f(sK0)
      & big_k(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ? [X0] :
      ( ~ big_j(X0)
      & big_f(X0)
      & big_k(X0) ),
    inference(flattening,[],[f11]) ).

fof(f11,plain,
    ? [X0] :
      ( ~ big_j(X0)
      & big_f(X0)
      & big_k(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,negated_conjecture,
    ~ ! [X0] :
        ( ( big_f(X0)
          & big_k(X0) )
       => big_j(X0) ),
    inference(negated_conjecture,[],[f4]) ).

fof(f4,conjecture,
    ! [X0] :
      ( ( big_f(X0)
        & big_k(X0) )
     => big_j(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32) ).

fof(f35,plain,
    ( ~ big_k(sK0)
    | spl1_2 ),
    inference(resolution,[],[f30,f17]) ).

fof(f17,plain,
    ! [X0] :
      ( big_h(X0)
      | ~ big_k(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0] :
      ( big_h(X0)
      | ~ big_k(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] :
      ( big_k(X0)
     => big_h(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_3) ).

fof(f30,plain,
    ( ~ big_h(sK0)
    | spl1_2 ),
    inference(avatar_component_clause,[],[f28]) ).

fof(f28,plain,
    ( spl1_2
  <=> big_h(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f34,plain,
    ( ~ spl1_2
    | spl1_1 ),
    inference(avatar_split_clause,[],[f33,f24,f28]) ).

fof(f24,plain,
    ( spl1_1
  <=> big_i(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f33,plain,
    ( ~ big_h(sK0)
    | spl1_1 ),
    inference(subsumption_resolution,[],[f32,f19]) ).

fof(f19,plain,
    big_f(sK0),
    inference(cnf_transformation,[],[f15]) ).

fof(f32,plain,
    ( ~ big_h(sK0)
    | ~ big_f(sK0)
    | spl1_1 ),
    inference(resolution,[],[f26,f16]) ).

fof(f16,plain,
    ! [X0] :
      ( big_i(X0)
      | ~ big_f(X0)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X0] :
      ( ~ big_h(X0)
      | ~ big_f(X0)
      | big_i(X0) ),
    inference(flattening,[],[f7]) ).

fof(f7,plain,
    ! [X0] :
      ( big_i(X0)
      | ~ big_f(X0)
      | ~ big_h(X0) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f6,plain,
    ! [X0] :
      ( ( big_f(X0)
        & big_h(X0) )
     => big_i(X0) ),
    inference(pure_predicate_removal,[],[f1]) ).

fof(f1,axiom,
    ! [X0] :
      ( ( big_f(X0)
        & ( big_g(X0)
          | big_h(X0) ) )
     => big_i(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_1) ).

fof(f26,plain,
    ( ~ big_i(sK0)
    | spl1_1 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f31,plain,
    ( ~ spl1_1
    | ~ spl1_2 ),
    inference(avatar_split_clause,[],[f22,f28,f24]) ).

fof(f22,plain,
    ( ~ big_h(sK0)
    | ~ big_i(sK0) ),
    inference(resolution,[],[f21,f20]) ).

fof(f20,plain,
    ~ big_j(sK0),
    inference(cnf_transformation,[],[f15]) ).

fof(f21,plain,
    ! [X0] :
      ( big_j(X0)
      | ~ big_i(X0)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X0] :
      ( big_j(X0)
      | ~ big_i(X0)
      | ~ big_h(X0) ),
    inference(flattening,[],[f9]) ).

fof(f9,plain,
    ! [X0] :
      ( big_j(X0)
      | ~ big_i(X0)
      | ~ big_h(X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0] :
      ( ( big_i(X0)
        & big_h(X0) )
     => big_j(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN062+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.14  % 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 : n025.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   : Tue Aug 30 21:35:30 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  % (27235)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (27251)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.53  % (27243)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53  % (27251)First to succeed.
% 0.20/0.53  % (27226)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53  % (27226)Refutation not found, incomplete strategy% (27226)------------------------------
% 0.20/0.53  % (27226)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (27226)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (27226)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53  
% 0.20/0.53  % (27226)Memory used [KB]: 5884
% 0.20/0.53  % (27226)Time elapsed: 0.001 s
% 0.20/0.53  % (27226)------------------------------
% 0.20/0.53  % (27226)------------------------------
% 0.20/0.53  % (27251)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (27251)------------------------------
% 0.20/0.53  % (27251)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (27251)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (27251)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (27251)Memory used [KB]: 5884
% 0.20/0.53  % (27251)Time elapsed: 0.119 s
% 0.20/0.53  % (27251)Instructions burned: 2 (million)
% 0.20/0.53  % (27251)------------------------------
% 0.20/0.53  % (27251)------------------------------
% 0.20/0.53  % (27221)Success in time 0.174 s
%------------------------------------------------------------------------------