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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN052+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 : n019.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:20 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   28 (   1 unt;   0 def)
%            Number of atoms       :   87 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   96 (  37   ~;  33   |;  13   &)
%                                         (   9 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   6 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   25 (  21   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,plain,
    $false,
    inference(avatar_sat_refutation,[],[f20,f25,f29,f30,f32,f34]) ).

fof(f34,plain,
    ( ~ spl1_1
    | ~ spl1_4 ),
    inference(avatar_contradiction_clause,[],[f33]) ).

fof(f33,plain,
    ( $false
    | ~ spl1_1
    | ~ spl1_4 ),
    inference(subsumption_resolution,[],[f15,f28]) ).

fof(f28,plain,
    ( ! [X0] : big_f(X0)
    | ~ spl1_4 ),
    inference(avatar_component_clause,[],[f27]) ).

fof(f27,plain,
    ( spl1_4
  <=> ! [X0] : big_f(X0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).

fof(f15,plain,
    ( ! [X0] : ~ big_f(X0)
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f14]) ).

fof(f14,plain,
    ( spl1_1
  <=> ! [X0] : ~ big_f(X0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f32,plain,
    ( spl1_3
    | ~ spl1_4 ),
    inference(avatar_contradiction_clause,[],[f31]) ).

fof(f31,plain,
    ( $false
    | spl1_3
    | ~ spl1_4 ),
    inference(subsumption_resolution,[],[f24,f28]) ).

fof(f24,plain,
    ( ~ big_f(sK0)
    | spl1_3 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f22,plain,
    ( spl1_3
  <=> big_f(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).

fof(f30,plain,
    ( spl1_4
    | spl1_2 ),
    inference(avatar_split_clause,[],[f9,f17,f27]) ).

fof(f17,plain,
    ( spl1_2
  <=> p ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f9,plain,
    ! [X2] :
      ( p
      | big_f(X2) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ! [X0] :
        ( ( big_f(X0)
          | ~ p )
        & ( p
          | ~ big_f(X0) ) )
    & ( ~ big_f(sK0)
      | ~ p )
    & ( ! [X2] : big_f(X2)
      | p ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f7,plain,
    ( ? [X1] : ~ big_f(X1)
   => ~ big_f(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ( big_f(X0)
          | ~ p )
        & ( p
          | ~ big_f(X0) ) )
    & ( ? [X1] : ~ big_f(X1)
      | ~ p )
    & ( ! [X2] : big_f(X2)
      | p ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X0] :
        ( ( big_f(X0)
          | ~ p )
        & ( p
          | ~ big_f(X0) ) )
    & ( ? [X1] : ~ big_f(X1)
      | ~ p )
    & ( ! [X1] : big_f(X1)
      | p ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ! [X0] :
        ( ( big_f(X0)
          | ~ p )
        & ( p
          | ~ big_f(X0) ) )
    & ( ? [X1] : ~ big_f(X1)
      | ~ p )
    & ( ! [X1] : big_f(X1)
      | p ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,plain,
    ( ! [X0] :
        ( big_f(X0)
      <=> p )
    & ( p
    <~> ! [X1] : big_f(X1) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( big_f(X0)
        <=> p )
     => ( p
      <=> ! [X1] : big_f(X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X0] :
        ( big_f(X0)
      <=> p )
   => ( p
    <=> ! [X1] : big_f(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel22) ).

fof(f29,plain,
    ( ~ spl1_2
    | spl1_4 ),
    inference(avatar_split_clause,[],[f12,f27,f17]) ).

fof(f12,plain,
    ! [X0] :
      ( big_f(X0)
      | ~ p ),
    inference(cnf_transformation,[],[f8]) ).

fof(f25,plain,
    ( ~ spl1_2
    | ~ spl1_3 ),
    inference(avatar_split_clause,[],[f10,f22,f17]) ).

fof(f10,plain,
    ( ~ big_f(sK0)
    | ~ p ),
    inference(cnf_transformation,[],[f8]) ).

fof(f20,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f11,f17,f14]) ).

fof(f11,plain,
    ! [X0] :
      ( p
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN052+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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 : n019.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   : Tue Aug 30 21:27:50 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (16670)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50  % (16671)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50  % (16671)First to succeed.
% 0.19/0.50  % (16671)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (16671)------------------------------
% 0.19/0.50  % (16671)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (16671)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (16671)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (16671)Memory used [KB]: 5884
% 0.19/0.50  % (16671)Time elapsed: 0.002 s
% 0.19/0.50  % (16671)Instructions burned: 1 (million)
% 0.19/0.50  % (16671)------------------------------
% 0.19/0.50  % (16671)------------------------------
% 0.19/0.50  % (16667)Success in time 0.153 s
%------------------------------------------------------------------------------