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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN352+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:39 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   3 unt;   0 def)
%            Number of atoms       :  177 (   0 equ)
%            Maximal formula atoms :   30 (  10 avg)
%            Number of connectives :  219 (  59   ~;  80   |;  58   &)
%                                         (   4 <=>;  14  =>;   0  <=;   4 <~>)
%            Maximal formula depth :   14 (   9 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (  34   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f33,plain,
    $false,
    inference(resolution,[],[f30,f29]) ).

fof(f29,plain,
    ! [X0] : ~ big_f(X0,X0),
    inference(subsumption_resolution,[],[f18,f13]) ).

fof(f13,plain,
    ! [X2,X3] :
      ( ~ big_f(X3,sK2(X2,X3))
      | ~ big_f(X3,X2)
      | ~ big_f(X2,sK2(X2,X3)) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X2,X3] :
      ( ( ( ( ~ big_f(X3,sK2(X2,X3))
            | ~ big_f(sK1,sK2(X2,X3)) )
          & ( big_f(X3,sK2(X2,X3))
            | big_f(sK1,sK2(X2,X3)) )
          & big_f(X3,X2) )
        | big_f(sK2(X2,X3),sK2(X2,X3)) )
      & ( big_f(X2,sK2(X2,X3))
        | ~ big_f(X3,X2)
        | big_f(sK1,sK2(X2,X3)) )
      & ( ( ( ~ big_f(X3,sK2(X2,X3))
            | ~ big_f(X2,sK2(X2,X3)) )
          & ( big_f(X3,sK2(X2,X3))
            | big_f(X2,sK2(X2,X3)) ) )
        | ~ big_f(X3,X2) )
      & big_f(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8]) ).

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

fof(f9,plain,
    ! [X2,X3] :
      ( ? [X4] :
          ( ( ( ( ~ big_f(X3,X4)
                | ~ big_f(sK1,X4) )
              & ( big_f(X3,X4)
                | big_f(sK1,X4) )
              & big_f(X3,X2) )
            | big_f(X4,X4) )
          & ( big_f(X2,X4)
            | ~ big_f(X3,X2)
            | big_f(sK1,X4) )
          & ( ( ( ~ big_f(X3,X4)
                | ~ big_f(X2,X4) )
              & ( big_f(X3,X4)
                | big_f(X2,X4) ) )
            | ~ big_f(X3,X2) )
          & big_f(sK0,sK1) )
     => ( ( ( ( ~ big_f(X3,sK2(X2,X3))
              | ~ big_f(sK1,sK2(X2,X3)) )
            & ( big_f(X3,sK2(X2,X3))
              | big_f(sK1,sK2(X2,X3)) )
            & big_f(X3,X2) )
          | big_f(sK2(X2,X3),sK2(X2,X3)) )
        & ( big_f(X2,sK2(X2,X3))
          | ~ big_f(X3,X2)
          | big_f(sK1,sK2(X2,X3)) )
        & ( ( ( ~ big_f(X3,sK2(X2,X3))
              | ~ big_f(X2,sK2(X2,X3)) )
            & ( big_f(X3,sK2(X2,X3))
              | big_f(X2,sK2(X2,X3)) ) )
          | ~ big_f(X3,X2) )
        & big_f(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ? [X0,X1] :
    ! [X2,X3] :
    ? [X4] :
      ( ( ( ( ~ big_f(X3,X4)
            | ~ big_f(X1,X4) )
          & ( big_f(X3,X4)
            | big_f(X1,X4) )
          & big_f(X3,X2) )
        | big_f(X4,X4) )
      & ( big_f(X2,X4)
        | ~ big_f(X3,X2)
        | big_f(X1,X4) )
      & ( ( ( ~ big_f(X3,X4)
            | ~ big_f(X2,X4) )
          & ( big_f(X3,X4)
            | big_f(X2,X4) ) )
        | ~ big_f(X3,X2) )
      & big_f(X0,X1) ),
    inference(rectify,[],[f6]) ).

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

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

fof(f4,plain,
    ? [X0,X1] :
    ! [X3,X2] :
    ? [X4] :
      ( ( ( ( big_f(X1,X4)
          <~> big_f(X2,X4) )
          & big_f(X2,X3) )
        | big_f(X4,X4) )
      & ( big_f(X3,X4)
        | ~ big_f(X2,X3)
        | big_f(X1,X4) )
      & ( ( big_f(X3,X4)
        <~> big_f(X2,X4) )
        | ~ big_f(X2,X3) )
      & big_f(X0,X1) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ? [X0,X1] :
    ! [X2,X3] :
    ? [X4] :
      ( ( ( big_f(X3,X4)
        <~> big_f(X2,X4) )
        | ~ big_f(X2,X3) )
      & ( ( ( big_f(X1,X4)
          <~> big_f(X2,X4) )
          & big_f(X2,X3) )
        | big_f(X4,X4) )
      & ( big_f(X1,X4)
        | big_f(X3,X4)
        | ~ big_f(X2,X3) )
      & big_f(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

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

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

fof(f18,plain,
    ! [X0] :
      ( ~ big_f(X0,X0)
      | big_f(X0,sK2(X0,X0)) ),
    inference(factoring,[],[f12]) ).

fof(f12,plain,
    ! [X2,X3] :
      ( big_f(X3,sK2(X2,X3))
      | big_f(X2,sK2(X2,X3))
      | ~ big_f(X3,X2) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f30,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(resolution,[],[f29,f15]) ).

fof(f15,plain,
    ! [X2,X3] :
      ( big_f(sK2(X2,X3),sK2(X2,X3))
      | big_f(X3,X2) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN352+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 21:44:40 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.55  % (19540)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.56  % (19547)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 (2999ds/75Mi)
% 0.20/0.56  % (19556)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.56  % (19555)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 (2999ds/467Mi)
% 0.20/0.56  % (19548)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.56  % (19539)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56  % (19540)Instruction limit reached!
% 0.20/0.56  % (19540)------------------------------
% 0.20/0.56  % (19540)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (19540)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (19540)Termination reason: Unknown
% 0.20/0.56  % (19540)Termination phase: Blocked clause elimination
% 0.20/0.56  
% 0.20/0.56  % (19540)Memory used [KB]: 895
% 0.20/0.56  % (19540)Time elapsed: 0.004 s
% 0.20/0.56  % (19540)Instructions burned: 2 (million)
% 0.20/0.56  % (19540)------------------------------
% 0.20/0.56  % (19540)------------------------------
% 0.20/0.56  % (19539)First to succeed.
% 0.20/0.57  % (19548)Also succeeded, but the first one will report.
% 0.20/0.57  % (19557)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.57  % (19539)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (19539)------------------------------
% 0.20/0.57  % (19539)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (19539)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (19539)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (19539)Memory used [KB]: 5373
% 0.20/0.57  % (19539)Time elapsed: 0.124 s
% 0.20/0.57  % (19539)Instructions burned: 1 (million)
% 0.20/0.57  % (19539)------------------------------
% 0.20/0.57  % (19539)------------------------------
% 0.20/0.57  % (19531)Success in time 0.212 s
%------------------------------------------------------------------------------