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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN331+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 : n001.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:33 EDT 2022

% Result   : Theorem 0.17s 0.49s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   5 unt;   0 def)
%            Number of atoms       :  107 (   0 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  121 (  33   ~;  29   |;  46   &)
%                                         (   4 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   43 (  33   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f36,plain,
    $false,
    inference(subsumption_resolution,[],[f19,f35]) ).

fof(f35,plain,
    ! [X0,X1] : big_f(X1,X0),
    inference(subsumption_resolution,[],[f18,f32]) ).

fof(f32,plain,
    ! [X0] : big_f(X0,X0),
    inference(factoring,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( big_f(X1,X0)
      | big_f(X0,X1) ),
    inference(resolution,[],[f23,f18]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( big_f(sK0(X0,X1),sK0(X0,X1))
      | big_f(X0,X1) ),
    inference(literal_reordering,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | big_f(sK0(X0,X1),sK0(X0,X1)) ),
    inference(cnf_transformation,[],[f9]) ).

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

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

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

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

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

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

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

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

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

fof(f18,plain,
    ! [X0,X1] :
      ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
      | big_f(X1,X0) ),
    inference(literal_reordering,[],[f10]) ).

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

fof(f19,plain,
    ! [X0,X1] : ~ big_f(sK0(X0,X1),X1),
    inference(literal_reordering,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] : ~ big_f(sK0(X0,X1),X1),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SYN331+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.11/0.33  % Computer : n001.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Tue Aug 30 22:05:47 EDT 2022
% 0.11/0.33  % CPUTime    : 
% 0.17/0.47  % (12155)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.17/0.49  % (12155)First to succeed.
% 0.17/0.49  % (12147)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.17/0.49  % (12155)Refutation found. Thanks to Tanya!
% 0.17/0.49  % SZS status Theorem for theBenchmark
% 0.17/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49  % (12155)------------------------------
% 0.17/0.49  % (12155)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49  % (12155)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49  % (12155)Termination reason: Refutation
% 0.17/0.49  
% 0.17/0.49  % (12155)Memory used [KB]: 5628
% 0.17/0.49  % (12155)Time elapsed: 0.008 s
% 0.17/0.49  % (12155)Instructions burned: 3 (million)
% 0.17/0.49  % (12155)------------------------------
% 0.17/0.49  % (12155)------------------------------
% 0.17/0.49  % (12140)Success in time 0.157 s
%------------------------------------------------------------------------------