TSTP Solution File: SYN331+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN331+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n012.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 : Tue Apr 30 18:02:53 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   3 unt;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  106 (  27   ~;  26   |;  40   &)
%                                         (   4 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   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   :   37 (  28   !;   9   ?)

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

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

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

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

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

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

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

fof(f3,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ~ big_f(X2,X1)
      & ~ big_f(X2,X0)
      & ( big_f(X2,X2)
        | big_f(X1,X0) )
      & ( big_f(X0,X1)
      <=> big_f(X2,X2) )
      & 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(X0,X1)
            <=> big_f(X2,X2) )
           => ( ( big_f(X2,X2)
                | big_f(X1,X0) )
             => ( big_f(X2,X1)
                | big_f(X2,X0) ) ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

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

fof(f21,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(duplicate_literal_removal,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | big_f(X0,X1) ),
    inference(resolution,[],[f19,f12]) ).

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

fof(f19,plain,
    ! [X0,X1] :
      ( big_f(sK0(X0,X1),sK0(X0,X1))
      | big_f(X0,X1) ),
    inference(resolution,[],[f16,f12]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( big_f(X1,X0)
      | big_f(X0,X1) ),
    inference(resolution,[],[f13,f12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN331+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Apr 30 01:42:12 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (10114)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (10115)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37  % (10116)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37  % (10118)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37  % (10117)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.14/0.37  % (10119)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37  % (10120)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37  % (10121)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  % (10117)First to succeed.
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [4]
% 0.14/0.38  TRYING [4]
% 0.14/0.38  TRYING [4]
% 0.14/0.38  % (10119)Also succeeded, but the first one will report.
% 0.14/0.38  TRYING [4]
% 0.14/0.38  % (10120)Also succeeded, but the first one will report.
% 0.14/0.38  % (10117)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (10117)------------------------------
% 0.14/0.38  % (10117)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38  % (10117)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (10117)Memory used [KB]: 747
% 0.14/0.38  % (10117)Time elapsed: 0.003 s
% 0.14/0.38  % (10117)Instructions burned: 3 (million)
% 0.14/0.38  % (10117)------------------------------
% 0.14/0.38  % (10117)------------------------------
% 0.14/0.38  % (10114)Success in time 0.018 s
%------------------------------------------------------------------------------