TSTP Solution File: SET631+3 by Vampire-SAT---4.8

View Problem - Process Solution

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

% Computer : n024.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 15:08:58 EDT 2024

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (   8 unt;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   78 (  30   ~;  23   |;  18   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   55 (  45   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f50,plain,
    $false,
    inference(subsumption_resolution,[],[f49,f17]) ).

fof(f17,plain,
    ~ intersect(sK0,sK1),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ~ intersect(sK0,sK1)
    & intersect(sK0,difference(sK1,sK2)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8]) ).

fof(f8,plain,
    ( ? [X0,X1,X2] :
        ( ~ intersect(X0,X1)
        & intersect(X0,difference(X1,X2)) )
   => ( ~ intersect(sK0,sK1)
      & intersect(sK0,difference(sK1,sK2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ? [X0,X1,X2] :
      ( ~ intersect(X0,X1)
      & intersect(X0,difference(X1,X2)) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( intersect(X0,difference(X1,X2))
       => intersect(X0,X1) ),
    inference(negated_conjecture,[],[f4]) ).

fof(f4,conjecture,
    ! [X0,X1,X2] :
      ( intersect(X0,difference(X1,X2))
     => intersect(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th113) ).

fof(f49,plain,
    intersect(sK0,sK1),
    inference(resolution,[],[f43,f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | intersect(X1,X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( intersect(X1,X0)
      | ~ intersect(X0,X1) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( intersect(X0,X1)
     => intersect(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_intersect) ).

fof(f43,plain,
    intersect(sK1,sK0),
    inference(resolution,[],[f35,f32]) ).

fof(f32,plain,
    member(sK3(sK0,difference(sK1,sK2)),sK1),
    inference(resolution,[],[f22,f29]) ).

fof(f29,plain,
    member(sK3(sK0,difference(sK1,sK2)),difference(sK1,sK2)),
    inference(resolution,[],[f20,f16]) ).

fof(f16,plain,
    intersect(sK0,difference(sK1,sK2)),
    inference(cnf_transformation,[],[f9]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | member(sK3(X0,X1),X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
      & ( ( member(sK3(X0,X1),X1)
          & member(sK3(X0,X1),X0) )
        | ~ intersect(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f11,f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( member(X3,X1)
          & member(X3,X0) )
     => ( member(sK3(X0,X1),X1)
        & member(sK3(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
      & ( ? [X3] :
            ( member(X3,X1)
            & member(X3,X0) )
        | ~ intersect(X0,X1) ) ),
    inference(rectify,[],[f10]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
      & ( ? [X2] :
            ( member(X2,X1)
            & member(X2,X0) )
        | ~ intersect(X0,X1) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( intersect(X0,X1)
    <=> ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

fof(f22,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( ~ member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(flattening,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( ~ member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(nnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,difference(X0,X1))
    <=> ( ~ member(X2,X1)
        & member(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).

fof(f35,plain,
    ! [X0] :
      ( ~ member(sK3(sK0,difference(sK1,sK2)),X0)
      | intersect(X0,sK0) ),
    inference(resolution,[],[f21,f27]) ).

fof(f27,plain,
    member(sK3(sK0,difference(sK1,sK2)),sK0),
    inference(resolution,[],[f19,f16]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | member(sK3(X0,X1),X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f21,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,X1)
      | intersect(X0,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.31  % Problem    : SET631+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/0.33  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.54  % Computer : n024.cluster.edu
% 0.14/0.54  % Model    : x86_64 x86_64
% 0.14/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.54  % Memory   : 8042.1875MB
% 0.14/0.54  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.54  % CPULimit   : 300
% 0.14/0.54  % WCLimit    : 300
% 0.14/0.54  % DateTime   : Tue Apr 30 01:09:07 EDT 2024
% 0.17/0.54  % CPUTime    : 
% 0.17/0.54  % (969)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.56  % (971)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.56  % (974)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.20/0.56  % (976)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.20/0.56  % (973)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.20/0.56  % (975)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.20/0.56  % (970)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.56  % (972)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.20/0.56  TRYING [1,1]
% 0.20/0.56  TRYING [1]
% 0.20/0.56  TRYING [2,1]
% 0.20/0.56  TRYING [1]
% 0.20/0.56  % (974)First to succeed.
% 0.20/0.56  TRYING [2]
% 0.20/0.56  TRYING [1,1]
% 0.20/0.56  TRYING [2]
% 0.20/0.56  TRYING [2,1]
% 0.20/0.56  TRYING [3,1]
% 0.20/0.56  TRYING [3]
% 0.20/0.56  % (975)Also succeeded, but the first one will report.
% 0.20/0.56  TRYING [3]
% 0.20/0.56  TRYING [3,1]
% 0.20/0.56  TRYING [2,2]
% 0.20/0.56  % (974)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Theorem for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (974)------------------------------
% 0.20/0.56  % (974)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.56  % (974)Termination reason: Refutation
% 0.20/0.56  
% 0.20/0.56  % (974)Memory used [KB]: 748
% 0.20/0.56  % (974)Time elapsed: 0.003 s
% 0.20/0.56  % (974)Instructions burned: 3 (million)
% 0.20/0.56  % (974)------------------------------
% 0.20/0.56  % (974)------------------------------
% 0.20/0.56  % (969)Success in time 0.019 s
%------------------------------------------------------------------------------