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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN326+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 : n022.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:31 EDT 2022

% Result   : Theorem 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :   18 (   5 avg)
%            Number of connectives :   81 (  21   ~;  13   |;  30   &)
%                                         (   0 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   23 (  15   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,plain,
    $false,
    inference(subsumption_resolution,[],[f16,f15]) ).

fof(f15,plain,
    ! [X0] : ~ big_g(X0),
    inference(resolution,[],[f14,f7]) ).

fof(f7,plain,
    ! [X0] :
      ( big_h(sK1(X0))
      | ~ big_g(X0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ! [X0] :
      ( big_f(X0,sK0(X0))
      & ( big_f(X0,X0)
        | ( big_f(sK0(X0),sK1(X0))
          & big_g(sK0(X0))
          & ~ big_h(X0) ) )
      & ~ big_f(sK1(X0),sK1(X0))
      & ( big_h(sK1(X0))
        | ( big_f(sK1(X0),X0)
          & ~ big_g(X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).

fof(f5,plain,
    ! [X0] :
      ( ? [X1,X2] :
          ( big_f(X0,X1)
          & ( big_f(X0,X0)
            | ( big_f(X1,X2)
              & big_g(X1)
              & ~ big_h(X0) ) )
          & ~ big_f(X2,X2)
          & ( big_h(X2)
            | ( big_f(X2,X0)
              & ~ big_g(X0) ) ) )
     => ( big_f(X0,sK0(X0))
        & ( big_f(X0,X0)
          | ( big_f(sK0(X0),sK1(X0))
            & big_g(sK0(X0))
            & ~ big_h(X0) ) )
        & ~ big_f(sK1(X0),sK1(X0))
        & ( big_h(sK1(X0))
          | ( big_f(sK1(X0),X0)
            & ~ big_g(X0) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f4,plain,
    ! [X0] :
    ? [X1,X2] :
      ( big_f(X0,X1)
      & ( big_f(X0,X0)
        | ( big_f(X1,X2)
          & big_g(X1)
          & ~ big_h(X0) ) )
      & ~ big_f(X2,X2)
      & ( big_h(X2)
        | ( big_f(X2,X0)
          & ~ big_g(X0) ) ) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ! [X0] :
    ? [X2,X1] :
      ( ~ big_f(X2,X2)
      & big_f(X0,X1)
      & ( big_h(X2)
        | ( big_f(X2,X0)
          & ~ big_g(X0) ) )
      & ( big_f(X0,X0)
        | ( ~ big_h(X0)
          & big_g(X1)
          & big_f(X1,X2) ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ? [X0] :
      ! [X2,X1] :
        ( ( ( big_f(X1,X2)
           => ( big_g(X1)
             => big_h(X0) ) )
         => big_f(X0,X0) )
       => ( ( ( big_f(X2,X0)
             => big_g(X0) )
           => big_h(X2) )
         => ( big_f(X0,X1)
           => big_f(X2,X2) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ? [X0] :
    ! [X2,X1] :
      ( ( ( big_f(X1,X2)
         => ( big_g(X1)
           => big_h(X0) ) )
       => big_f(X0,X0) )
     => ( ( ( big_f(X2,X0)
           => big_g(X0) )
         => big_h(X2) )
       => ( big_f(X0,X1)
         => big_f(X2,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_1) ).

fof(f14,plain,
    ! [X0] : ~ big_h(sK1(X0)),
    inference(resolution,[],[f10,f9]) ).

fof(f9,plain,
    ! [X0] : ~ big_f(sK1(X0),sK1(X0)),
    inference(cnf_transformation,[],[f6]) ).

fof(f10,plain,
    ! [X0] :
      ( big_f(X0,X0)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f16,plain,
    ! [X0] : big_g(sK0(sK1(X0))),
    inference(resolution,[],[f11,f9]) ).

fof(f11,plain,
    ! [X0] :
      ( big_f(X0,X0)
      | big_g(sK0(X0)) ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN326+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_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n022.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 21:44:10 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.48  % (2782)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.48  % (2782)First to succeed.
% 0.19/0.48  % (2782)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (2782)------------------------------
% 0.19/0.48  % (2782)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (2782)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (2782)Termination reason: Refutation
% 0.19/0.48  
% 0.19/0.48  % (2782)Memory used [KB]: 5373
% 0.19/0.48  % (2782)Time elapsed: 0.090 s
% 0.19/0.48  % (2782)Instructions burned: 1 (million)
% 0.19/0.48  % (2782)------------------------------
% 0.19/0.48  % (2782)------------------------------
% 0.19/0.48  % (2769)Success in time 0.14 s
%------------------------------------------------------------------------------