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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN333+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 : 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:26:15 EDT 2022

% Result   : Theorem 0.20s 0.49s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (   3 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :   82 (  28   ~;  20   |;  27   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   28 (  19   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f18,plain,
    $false,
    inference(unit_resulting_resolution,[],[f13,f8,f8,f13,f11]) ).

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

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

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

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

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

fof(f3,plain,
    ~ ? [X1,X0] :
      ! [X2] :
        ( big_f(X1,X0)
       => ( ( ( big_f(X1,X0)
              & big_g(X1,X0) )
           => ( big_g(X1,X2)
              & big_g(X2,X2) ) )
          & big_f(X2,X2)
          & big_f(X0,X2) ) ),
    inference(rectify,[],[f2]) ).

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

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

fof(f8,plain,
    ! [X0,X1] : big_f(X1,X0),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X0,X1] : big_g(X0,X1),
    inference(unit_resulting_resolution,[],[f8,f8,f10]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
      | ~ big_f(X0,sK0(X0,X1))
      | big_g(X1,X0) ),
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN333+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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 : n011.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:42:10 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  % (11533)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.49  % (11541)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.49  % (11541)First to succeed.
% 0.20/0.49  % (11541)Refutation found. Thanks to Tanya!
% 0.20/0.49  % SZS status Theorem for theBenchmark
% 0.20/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49  % (11541)------------------------------
% 0.20/0.49  % (11541)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49  % (11541)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49  % (11541)Termination reason: Refutation
% 0.20/0.49  
% 0.20/0.49  % (11541)Memory used [KB]: 5884
% 0.20/0.49  % (11541)Time elapsed: 0.081 s
% 0.20/0.49  % (11541)Instructions burned: 1 (million)
% 0.20/0.49  % (11541)------------------------------
% 0.20/0.49  % (11541)------------------------------
% 0.20/0.49  % (11531)Success in time 0.14 s
%------------------------------------------------------------------------------