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

View Problem - Process Solution

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

% Computer : n027.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:37:43 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (   3 unt;   0 def)
%            Number of atoms       :  129 (   0 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  155 (  53   ~;  65   |;  19   &)
%                                         (  11 <=>;   6  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   84 (  58   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f47,plain,
    $false,
    inference(subsumption_resolution,[],[f46,f34]) ).

fof(f34,plain,
    ! [X5] : big_p(X5),
    inference(subsumption_resolution,[],[f33,f22]) ).

fof(f22,plain,
    ! [X11,X8,X9] :
      ( ~ big_p(X9)
      | big_p(X8)
      | big_p(X11) ),
    inference(subsumption_resolution,[],[f15,f14]) ).

fof(f14,plain,
    ! [X11,X8,X9] :
      ( ~ big_p(X11)
      | big_p(sK5)
      | ~ big_p(X9)
      | big_p(X8) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ( ( ( ( ~ big_p(sK0)
          | ! [X1] : ~ big_p(X1) )
        & ( ! [X2] : big_p(X2)
          | big_p(sK1) ) )
      | ! [X4] :
          ( ( ~ big_p(X4)
            | ~ big_p(sK2(X4)) )
          & ( big_p(X4)
            | big_p(sK2(X4)) ) ) )
    & ( ( ( big_p(sK3)
          | ~ big_p(sK4) )
        & ( ! [X8] : big_p(X8)
          | ! [X9] : ~ big_p(X9) ) )
      | ! [X11] :
          ( ( big_p(X11)
            | ~ big_p(sK5) )
          & ( big_p(sK5)
            | ~ 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] : ~ big_p(X0)
   => ~ big_p(sK0) ),
    introduced(choice_axiom,[]) ).

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

fof(f9,plain,
    ! [X4] :
      ( ? [X5] :
          ( ( ~ big_p(X4)
            | ~ big_p(X5) )
          & ( big_p(X4)
            | big_p(X5) ) )
     => ( ( ~ big_p(X4)
          | ~ big_p(sK2(X4)) )
        & ( big_p(X4)
          | big_p(sK2(X4)) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ( ? [X6] : big_p(X6)
   => big_p(sK3) ),
    introduced(choice_axiom,[]) ).

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

fof(f12,plain,
    ( ? [X10] :
      ! [X11] :
        ( ( big_p(X11)
          | ~ big_p(X10) )
        & ( big_p(X10)
          | ~ big_p(X11) ) )
   => ! [X11] :
        ( ( big_p(X11)
          | ~ big_p(sK5) )
        & ( big_p(sK5)
          | ~ big_p(X11) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

fof(f15,plain,
    ! [X11,X8,X9] :
      ( ~ big_p(X9)
      | big_p(X11)
      | big_p(X8)
      | ~ big_p(sK5) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f33,plain,
    ! [X5] :
      ( big_p(sK1)
      | big_p(X5) ),
    inference(subsumption_resolution,[],[f32,f22]) ).

fof(f32,plain,
    ! [X6,X5] :
      ( big_p(X6)
      | big_p(X5)
      | big_p(sK1) ),
    inference(subsumption_resolution,[],[f31,f22]) ).

fof(f31,plain,
    ! [X6,X7,X5] :
      ( big_p(X7)
      | big_p(X6)
      | big_p(sK1)
      | big_p(X5) ),
    inference(subsumption_resolution,[],[f24,f22]) ).

fof(f24,plain,
    ! [X6,X7,X4,X5] :
      ( big_p(X4)
      | big_p(X6)
      | big_p(X5)
      | big_p(sK1)
      | big_p(X7) ),
    inference(resolution,[],[f18,f22]) ).

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

fof(f46,plain,
    ! [X5] : ~ big_p(X5),
    inference(subsumption_resolution,[],[f45,f34]) ).

fof(f45,plain,
    ! [X4,X5] :
      ( ~ big_p(X4)
      | ~ big_p(X5) ),
    inference(subsumption_resolution,[],[f42,f34]) ).

fof(f42,plain,
    ! [X4,X5] :
      ( ~ big_p(sK2(X5))
      | ~ big_p(X5)
      | ~ big_p(X4) ),
    inference(resolution,[],[f34,f21]) ).

fof(f21,plain,
    ! [X1,X4] :
      ( ~ big_p(sK0)
      | ~ big_p(X1)
      | ~ big_p(sK2(X4))
      | ~ big_p(X4) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n027.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   : Tue Aug 30 22:04:31 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.49  % (5068)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.19/0.49  % (5068)First to succeed.
% 0.19/0.50  % (5068)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  % (5068)------------------------------
% 0.19/0.50  % (5068)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (5068)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (5068)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (5068)Memory used [KB]: 895
% 0.19/0.50  % (5068)Time elapsed: 0.116 s
% 0.19/0.50  % (5068)Instructions burned: 1 (million)
% 0.19/0.50  % (5068)------------------------------
% 0.19/0.50  % (5068)------------------------------
% 0.19/0.50  % (5065)Success in time 0.158 s
%------------------------------------------------------------------------------