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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN365+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 : n011.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:42 EDT 2022

% Result   : Theorem 0.22s 0.50s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   6 unt;   0 def)
%            Number of atoms       :   93 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :  108 (  36   ~;  22   |;  36   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   43 (  29   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,plain,
    $false,
    inference(subsumption_resolution,[],[f20,f14]) ).

fof(f14,plain,
    big_p(sK0),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X1] :
        ( ~ big_r(sK0,X1)
        | ~ big_p(X1) )
    & big_p(sK0)
    & ! [X2] :
        ( ( big_r(X2,g(h(sK1(X2))))
          & big_p(sK1(X2)) )
        | ~ big_p(X2) )
    & ! [X4] :
        ( ( big_p(g(X4))
          & big_p(h(X4)) )
        | ~ big_p(X4) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

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

fof(f8,plain,
    ! [X2] :
      ( ? [X3] :
          ( ( big_r(X2,g(h(X3)))
            & big_p(X3) )
          | ~ big_p(X2) )
     => ( ( big_r(X2,g(h(sK1(X2))))
          & big_p(sK1(X2)) )
        | ~ big_p(X2) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ? [X0] :
        ( ! [X1] :
            ( ~ big_r(X0,X1)
            | ~ big_p(X1) )
        & big_p(X0) )
    & ! [X2] :
      ? [X3] :
        ( ( big_r(X2,g(h(X3)))
          & big_p(X3) )
        | ~ big_p(X2) )
    & ! [X4] :
        ( ( big_p(g(X4))
          & big_p(h(X4)) )
        | ~ big_p(X4) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ big_r(X3,X4)
            | ~ big_p(X4) )
        & big_p(X3) )
    & ! [X1] :
      ? [X2] :
        ( ( big_r(X1,g(h(X2)))
          & big_p(X2) )
        | ~ big_p(X1) )
    & ! [X0] :
        ( ( big_p(g(X0))
          & big_p(h(X0)) )
        | ~ big_p(X0) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ big_r(X3,X4)
            | ~ big_p(X4) )
        & big_p(X3) )
    & ! [X0] :
        ( ( big_p(g(X0))
          & big_p(h(X0)) )
        | ~ big_p(X0) )
    & ! [X1] :
      ? [X2] :
        ( ( big_r(X1,g(h(X2)))
          & big_p(X2) )
        | ~ big_p(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0] :
            ( big_p(X0)
           => ( big_p(g(X0))
              & big_p(h(X0)) ) )
        & ! [X1] :
          ? [X2] :
            ( big_p(X1)
           => ( big_r(X1,g(h(X2)))
              & big_p(X2) ) ) )
     => ! [X3] :
          ( big_p(X3)
         => ? [X4] :
              ( big_p(X4)
              & big_r(X3,X4) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X2] :
            ( big_p(X2)
           => ( big_p(g(X2))
              & big_p(h(X2)) ) )
        & ! [X0] :
          ? [X1] :
            ( big_p(X0)
           => ( big_r(X0,g(h(X1)))
              & big_p(X1) ) ) )
     => ! [X0] :
          ( big_p(X0)
         => ? [X1] :
              ( big_p(X1)
              & big_r(X0,X1) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X2] :
          ( big_p(X2)
         => ( big_p(g(X2))
            & big_p(h(X2)) ) )
      & ! [X0] :
        ? [X1] :
          ( big_p(X0)
         => ( big_r(X0,g(h(X1)))
            & big_p(X1) ) ) )
   => ! [X0] :
        ( big_p(X0)
       => ? [X1] :
            ( big_p(X1)
            & big_r(X0,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2116) ).

fof(f20,plain,
    ~ big_p(sK0),
    inference(resolution,[],[f19,f12]) ).

fof(f12,plain,
    ! [X2] :
      ( big_p(sK1(X2))
      | ~ big_p(X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f19,plain,
    ~ big_p(sK1(sK0)),
    inference(resolution,[],[f18,f10]) ).

fof(f10,plain,
    ! [X4] :
      ( big_p(h(X4))
      | ~ big_p(X4) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f18,plain,
    ~ big_p(h(sK1(sK0))),
    inference(resolution,[],[f17,f11]) ).

fof(f11,plain,
    ! [X4] :
      ( big_p(g(X4))
      | ~ big_p(X4) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f17,plain,
    ~ big_p(g(h(sK1(sK0)))),
    inference(subsumption_resolution,[],[f16,f14]) ).

fof(f16,plain,
    ( ~ big_p(g(h(sK1(sK0))))
    | ~ big_p(sK0) ),
    inference(resolution,[],[f13,f15]) ).

fof(f15,plain,
    ! [X1] :
      ( ~ big_r(sK0,X1)
      | ~ big_p(X1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f13,plain,
    ! [X2] :
      ( big_r(X2,g(h(sK1(X2))))
      | ~ big_p(X2) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN365+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.36  % Computer : n011.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Aug 30 21:45:55 EDT 2022
% 0.14/0.36  % CPUTime    : 
% 0.22/0.49  % (25652)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.22/0.49  % (25644)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.22/0.50  % (25636)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.22/0.50  % (25644)First to succeed.
% 0.22/0.50  % (25652)Also succeeded, but the first one will report.
% 0.22/0.50  % (25644)Refutation found. Thanks to Tanya!
% 0.22/0.50  % SZS status Theorem for theBenchmark
% 0.22/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.50  % (25644)------------------------------
% 0.22/0.50  % (25644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.50  % (25644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.50  % (25644)Termination reason: Refutation
% 0.22/0.50  
% 0.22/0.50  % (25644)Memory used [KB]: 895
% 0.22/0.50  % (25644)Time elapsed: 0.098 s
% 0.22/0.50  % (25644)Instructions burned: 2 (million)
% 0.22/0.50  % (25644)------------------------------
% 0.22/0.50  % (25644)------------------------------
% 0.22/0.50  % (25626)Success in time 0.134 s
%------------------------------------------------------------------------------