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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN321+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 : n025.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 : Sun May  5 12:09:37 EDT 2024

% Result   : Theorem 0.14s 0.37s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   18 (   4 unt;   0 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :    8 (   4 avg)
%            Number of connectives :   87 (  29   ~;  24   |;  16   &)
%                                         (   3 <=>;  13  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    9 (   6 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; 1-1 aty)
%            Number of variables   :   75 (  62   !;  13   ?)

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

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

fof(f12,plain,
    ! [X1,X4] :
      ( ~ big_g(X4,X4)
      | big_f(X4,X1) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ( ~ big_g(X0,sK0(X0))
        | ~ big_f(X0,X1) )
      & ( ! [X3] : big_g(X0,X3)
        | big_f(X0,X1) )
      & ! [X4] :
          ( big_f(X4,X1)
          | ~ big_g(X4,X4) )
      & ( ! [X5] : big_g(X0,X5)
        | ! [X6] : ~ big_f(X0,X6) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).

fof(f9,plain,
    ! [X0] :
      ( ? [X2] : ~ big_g(X0,X2)
     => ~ big_g(X0,sK0(X0)) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

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

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

fof(f15,plain,
    ! [X3,X0] : big_g(X0,X3),
    inference(subsumption_resolution,[],[f13,f11]) ).

fof(f11,plain,
    ! [X0,X6,X5] :
      ( ~ big_f(X0,X6)
      | big_g(X0,X5) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f13,plain,
    ! [X3,X0,X1] :
      ( big_g(X0,X3)
      | big_f(X0,X1) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f18,plain,
    ! [X0,X1] : ~ big_f(X0,X1),
    inference(subsumption_resolution,[],[f14,f15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN321+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n025.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   : Fri May  3 17:35:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  % (28096)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (28097)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37  % (28098)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37  % (28099)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  % (28100)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  % (28101)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37  % (28102)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37  % (28103)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.37  TRYING [1]
% 0.14/0.37  TRYING [1,1]
% 0.14/0.37  TRYING [1,1]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [2,1]
% 0.14/0.37  TRYING [2,1]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  % (28102)Also succeeded, but the first one will report.
% 0.14/0.37  % (28101)First to succeed.
% 0.14/0.37  % (28097)Also succeeded, but the first one will report.
% 0.14/0.37  % (28103)Also succeeded, but the first one will report.
% 0.14/0.37  Cannot enumerate next child to try in an incomplete setup
% 0.14/0.37  Cannot enumerate next child to try in an incomplete setup
% 0.14/0.37  % (28098)Refutation not found, incomplete strategy% (28098)------------------------------
% 0.14/0.37  % (28098)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37  % (28100)Refutation not found, incomplete strategy% (28100)------------------------------
% 0.14/0.37  % (28100)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37  % (28098)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37  % (28100)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  % (28098)Memory used [KB]: 724
% 0.14/0.37  % (28100)Memory used [KB]: 724
% 0.14/0.37  % (28100)Time elapsed: 0.003 s
% 0.14/0.37  % (28098)Time elapsed: 0.003 s
% 0.14/0.37  % (28100)Instructions burned: 2 (million)
% 0.14/0.37  % (28098)Instructions burned: 2 (million)
% 0.14/0.37  % (28099)Also succeeded, but the first one will report.
% 0.14/0.37  % (28100)------------------------------
% 0.14/0.37  % (28100)------------------------------
% 0.14/0.37  % (28098)------------------------------
% 0.14/0.37  % (28098)------------------------------
% 0.14/0.37  % (28101)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28096"
% 0.14/0.37  % (28101)Refutation found. Thanks to Tanya!
% 0.14/0.37  % SZS status Theorem for theBenchmark
% 0.14/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37  % (28101)------------------------------
% 0.14/0.37  % (28101)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37  % (28101)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (28101)Memory used [KB]: 743
% 0.14/0.37  % (28101)Time elapsed: 0.003 s
% 0.14/0.37  % (28101)Instructions burned: 3 (million)
% 0.14/0.37  % (28096)Success in time 0.018 s
%------------------------------------------------------------------------------