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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN346+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 : n020.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:19 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   3 unt;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :   12 (   5 avg)
%            Number of connectives :   95 (  37   ~;  20   |;  30   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   8 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   52 (  30   !;  22   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,plain,
    $false,
    inference(resolution,[],[f14,f13]) ).

fof(f13,plain,
    ! [X2,X1] : big_f(X1,sK2(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

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

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

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

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

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

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

fof(f3,plain,
    ~ ! [X0] :
      ? [X3,X2] :
      ! [X4,X5] :
        ( big_f(X0,X4)
       => ( big_f(X2,X5)
         => ( ( big_f(X2,X4)
              & big_f(X3,X4) )
            | ( big_f(X0,X5)
              & big_f(X3,X5) ) ) ) ),
    inference(rectify,[],[f2]) ).

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

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

fof(f14,plain,
    ! [X0] : ~ big_f(X0,sK2(sK0,X0)),
    inference(resolution,[],[f10,f13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN346+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_uns --cores 0 -t %d %s
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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:48:30 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (7946)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.49  % (7930)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.49  % (7930)First to succeed.
% 0.19/0.49  % (7944)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.50  % (7930)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (7930)------------------------------
% 0.19/0.50  % (7930)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (7930)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (7930)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (7930)Memory used [KB]: 5884
% 0.19/0.50  % (7930)Time elapsed: 0.104 s
% 0.19/0.50  % (7930)Instructions burned: 2 (million)
% 0.19/0.50  % (7930)------------------------------
% 0.19/0.50  % (7930)------------------------------
% 0.19/0.50  % (7923)Success in time 0.152 s
%------------------------------------------------------------------------------