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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN374+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 : n008.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:26:25 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   52 (   1 unt;   0 def)
%            Number of atoms       :  194 (   0 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  228 (  86   ~;  97   |;  19   &)
%                                         (  19 <=>;   6  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   9 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   77 (  51   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f77,plain,
    $false,
    inference(avatar_sat_refutation,[],[f40,f45,f58,f60,f61,f63,f65,f67,f69,f72,f76]) ).

fof(f76,plain,
    ( spl6_1
    | ~ spl6_5
    | ~ spl6_9 ),
    inference(avatar_split_clause,[],[f75,f56,f38,f23]) ).

fof(f23,plain,
    ( spl6_1
  <=> ! [X4] : big_p(X4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).

fof(f38,plain,
    ( spl6_5
  <=> ! [X3] : ~ big_p(X3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).

fof(f56,plain,
    ( spl6_9
  <=> ! [X0] :
        ( big_p(X0)
        | big_p(sK0(X0)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_9])]) ).

fof(f75,plain,
    ( ! [X1] : big_p(X1)
    | ~ spl6_5
    | ~ spl6_9 ),
    inference(resolution,[],[f57,f39]) ).

fof(f39,plain,
    ( ! [X3] : ~ big_p(X3)
    | ~ spl6_5 ),
    inference(avatar_component_clause,[],[f38]) ).

fof(f57,plain,
    ( ! [X0] :
        ( big_p(sK0(X0))
        | big_p(X0) )
    | ~ spl6_9 ),
    inference(avatar_component_clause,[],[f56]) ).

fof(f72,plain,
    ( ~ spl6_5
    | ~ spl6_7 ),
    inference(avatar_contradiction_clause,[],[f71]) ).

fof(f71,plain,
    ( $false
    | ~ spl6_5
    | ~ spl6_7 ),
    inference(resolution,[],[f39,f48]) ).

fof(f48,plain,
    ( big_p(sK5)
    | ~ spl6_7 ),
    inference(avatar_component_clause,[],[f47]) ).

fof(f47,plain,
    ( spl6_7
  <=> big_p(sK5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).

fof(f69,plain,
    ( spl6_5
    | ~ spl6_1
    | ~ spl6_3 ),
    inference(avatar_split_clause,[],[f68,f30,f23,f38]) ).

fof(f30,plain,
    ( spl6_3
  <=> ! [X0] :
        ( ~ big_p(X0)
        | ~ big_p(sK0(X0)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).

fof(f68,plain,
    ( ! [X0] : ~ big_p(X0)
    | ~ spl6_1
    | ~ spl6_3 ),
    inference(resolution,[],[f31,f24]) ).

fof(f24,plain,
    ( ! [X4] : big_p(X4)
    | ~ spl6_1 ),
    inference(avatar_component_clause,[],[f23]) ).

fof(f31,plain,
    ( ! [X0] :
        ( ~ big_p(sK0(X0))
        | ~ big_p(X0) )
    | ~ spl6_3 ),
    inference(avatar_component_clause,[],[f30]) ).

fof(f67,plain,
    ( ~ spl6_1
    | spl6_7 ),
    inference(avatar_contradiction_clause,[],[f66]) ).

fof(f66,plain,
    ( $false
    | ~ spl6_1
    | spl6_7 ),
    inference(resolution,[],[f49,f24]) ).

fof(f49,plain,
    ( ~ big_p(sK5)
    | spl6_7 ),
    inference(avatar_component_clause,[],[f47]) ).

fof(f65,plain,
    ( ~ spl6_1
    | spl6_4 ),
    inference(avatar_contradiction_clause,[],[f64]) ).

fof(f64,plain,
    ( $false
    | ~ spl6_1
    | spl6_4 ),
    inference(resolution,[],[f36,f24]) ).

fof(f36,plain,
    ( ~ big_p(sK1)
    | spl6_4 ),
    inference(avatar_component_clause,[],[f34]) ).

fof(f34,plain,
    ( spl6_4
  <=> big_p(sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).

fof(f63,plain,
    ( ~ spl6_2
    | ~ spl6_5 ),
    inference(avatar_contradiction_clause,[],[f62]) ).

fof(f62,plain,
    ( $false
    | ~ spl6_2
    | ~ spl6_5 ),
    inference(resolution,[],[f39,f28]) ).

fof(f28,plain,
    ( big_p(sK2)
    | ~ spl6_2 ),
    inference(avatar_component_clause,[],[f26]) ).

fof(f26,plain,
    ( spl6_2
  <=> big_p(sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).

fof(f61,plain,
    ( spl6_5
    | spl6_1
    | spl6_1
    | ~ spl6_6 ),
    inference(avatar_split_clause,[],[f14,f42,f23,f23,f38]) ).

fof(f42,plain,
    ( spl6_6
  <=> big_p(sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).

fof(f14,plain,
    ! [X10,X11,X7] :
      ( ~ big_p(sK3)
      | big_p(X10)
      | big_p(X7)
      | ~ big_p(X11) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ( ( ! [X0] :
          ( ( ~ big_p(sK0(X0))
            | ~ big_p(X0) )
          & ( big_p(sK0(X0))
            | big_p(X0) ) )
      | ( ( ~ big_p(sK1)
          | ! [X3] : ~ big_p(X3) )
        & ( ! [X4] : big_p(X4)
          | big_p(sK2) ) ) )
    & ( ! [X7] :
          ( ( big_p(sK3)
            | ~ big_p(X7) )
          & ( big_p(X7)
            | ~ big_p(sK3) ) )
      | ( ( big_p(sK4)
          | ~ big_p(sK5) )
        & ( ! [X10] : big_p(X10)
          | ! [X11] : ~ big_p(X11) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f12,f11,f10,f9,f8,f7]) ).

fof(f7,plain,
    ! [X0] :
      ( ? [X1] :
          ( ( ~ big_p(X1)
            | ~ big_p(X0) )
          & ( big_p(X1)
            | big_p(X0) ) )
     => ( ( ~ big_p(sK0(X0))
          | ~ big_p(X0) )
        & ( big_p(sK0(X0))
          | big_p(X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ? [X2] : ~ big_p(X2)
   => ~ big_p(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X5] : big_p(X5)
   => big_p(sK2) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ( ? [X6] :
      ! [X7] :
        ( ( big_p(X6)
          | ~ big_p(X7) )
        & ( big_p(X7)
          | ~ big_p(X6) ) )
   => ! [X7] :
        ( ( big_p(sK3)
          | ~ big_p(X7) )
        & ( big_p(X7)
          | ~ big_p(sK3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ( ? [X8] : big_p(X8)
   => big_p(sK4) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ( ? [X9] : ~ big_p(X9)
   => ~ big_p(sK5) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ( ! [X0] :
        ? [X1] :
          ( ( ~ big_p(X1)
            | ~ big_p(X0) )
          & ( big_p(X1)
            | big_p(X0) ) )
      | ( ( ? [X2] : ~ big_p(X2)
          | ! [X3] : ~ big_p(X3) )
        & ( ! [X4] : big_p(X4)
          | ? [X5] : big_p(X5) ) ) )
    & ( ? [X6] :
        ! [X7] :
          ( ( big_p(X6)
            | ~ big_p(X7) )
          & ( big_p(X7)
            | ~ big_p(X6) ) )
      | ( ( ? [X8] : big_p(X8)
          | ? [X9] : ~ big_p(X9) )
        & ( ! [X10] : big_p(X10)
          | ! [X11] : ~ big_p(X11) ) ) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ( ! [X2] :
        ? [X3] :
          ( ( ~ big_p(X3)
            | ~ big_p(X2) )
          & ( big_p(X3)
            | big_p(X2) ) )
      | ( ( ? [X0] : ~ big_p(X0)
          | ! [X1] : ~ big_p(X1) )
        & ( ! [X0] : big_p(X0)
          | ? [X1] : big_p(X1) ) ) )
    & ( ? [X2] :
        ! [X3] :
          ( ( big_p(X2)
            | ~ big_p(X3) )
          & ( big_p(X3)
            | ~ big_p(X2) ) )
      | ( ( ? [X1] : big_p(X1)
          | ? [X0] : ~ big_p(X0) )
        & ( ! [X0] : big_p(X0)
          | ! [X1] : ~ big_p(X1) ) ) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ( ? [X1] : big_p(X1)
    <=> ! [X0] : big_p(X0) )
  <~> ? [X2] :
      ! [X3] :
        ( big_p(X2)
      <=> big_p(X3) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ? [X1] : big_p(X1)
      <=> ! [X0] : big_p(X0) )
    <=> ? [X2] :
        ! [X3] :
          ( big_p(X2)
        <=> big_p(X3) ) ),
    inference(rectify,[],[f2]) ).

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

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

fof(f60,plain,
    ( spl6_2
    | spl6_9
    | spl6_1 ),
    inference(avatar_split_clause,[],[f18,f23,f56,f26]) ).

fof(f18,plain,
    ! [X0,X4] :
      ( big_p(X4)
      | big_p(X0)
      | big_p(sK2)
      | big_p(sK0(X0)) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f58,plain,
    ( spl6_5
    | ~ spl6_4
    | spl6_9 ),
    inference(avatar_split_clause,[],[f19,f56,f34,f38]) ).

fof(f19,plain,
    ! [X3,X0] :
      ( big_p(X0)
      | big_p(sK0(X0))
      | ~ big_p(sK1)
      | ~ big_p(X3) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f45,plain,
    ( spl6_5
    | spl6_1
    | spl6_6
    | spl6_5 ),
    inference(avatar_split_clause,[],[f16,f38,f42,f23,f38]) ).

fof(f16,plain,
    ! [X10,X11,X7] :
      ( ~ big_p(X7)
      | big_p(sK3)
      | big_p(X10)
      | ~ big_p(X11) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f40,plain,
    ( ~ spl6_4
    | spl6_5
    | spl6_3 ),
    inference(avatar_split_clause,[],[f21,f30,f38,f34]) ).

fof(f21,plain,
    ! [X3,X0] :
      ( ~ big_p(X0)
      | ~ big_p(sK0(X0))
      | ~ big_p(X3)
      | ~ big_p(sK1) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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.13/0.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 21:52:40 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.19/0.48  % (15851)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.19/0.49  % (15860)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.49  % (15867)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.19/0.49  % (15852)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.49  % (15860)First to succeed.
% 0.19/0.49  % (15852)Also succeeded, but the first one will report.
% 0.19/0.49  % (15860)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (15860)------------------------------
% 0.19/0.49  % (15860)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (15860)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (15860)Termination reason: Refutation
% 0.19/0.49  
% 0.19/0.49  % (15860)Memory used [KB]: 5884
% 0.19/0.49  % (15860)Time elapsed: 0.054 s
% 0.19/0.49  % (15860)Instructions burned: 2 (million)
% 0.19/0.49  % (15860)------------------------------
% 0.19/0.49  % (15860)------------------------------
% 0.19/0.49  % (15837)Success in time 0.154 s
%------------------------------------------------------------------------------