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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET591+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 : 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 : Sun May  5 09:14:16 EDT 2024

% Result   : Theorem 0.15s 0.33s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   34 (  10 unt;   0 def)
%            Number of atoms       :   97 (  16 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  110 (  47   ~;  32   |;  22   &)
%                                         (   4 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   64 (  57   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f94,plain,
    $false,
    inference(trivial_inequality_removal,[],[f93]) ).

fof(f93,plain,
    sK0 != sK0,
    inference(superposition,[],[f22,f86]) ).

fof(f86,plain,
    empty_set = sK0,
    inference(resolution,[],[f79,f42]) ).

fof(f42,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | empty_set = X0 ),
    inference(resolution,[],[f27,f36]) ).

fof(f36,plain,
    ! [X0] : subset(empty_set,X0),
    inference(resolution,[],[f29,f23]) ).

fof(f23,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : ~ member(X0,empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).

fof(f29,plain,
    ! [X0,X1] :
      ( member(sK2(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK2(X0,X1),X1)
          & member(sK2(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f16,f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ member(X2,X1)
          & member(X2,X0) )
     => ( ~ member(sK2(X0,X1),X1)
        & member(sK2(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f15]) ).

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

fof(f10,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f1]) ).

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

fof(f27,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) )
      & ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 ) ),
    inference(flattening,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) )
      & ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X1,X0)
        & subset(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).

fof(f79,plain,
    ! [X0] : subset(sK0,X0),
    inference(resolution,[],[f74,f29]) ).

fof(f74,plain,
    ! [X0] : ~ member(X0,sK0),
    inference(duplicate_literal_removal,[],[f70]) ).

fof(f70,plain,
    ! [X0] :
      ( ~ member(X0,sK0)
      | ~ member(X0,sK0) ),
    inference(resolution,[],[f49,f21]) ).

fof(f21,plain,
    subset(sK0,difference(sK1,sK0)),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ( empty_set != sK0
    & subset(sK0,difference(sK1,sK0)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11]) ).

fof(f11,plain,
    ( ? [X0,X1] :
        ( empty_set != X0
        & subset(X0,difference(X1,X0)) )
   => ( empty_set != sK0
      & subset(sK0,difference(sK1,sK0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ? [X0,X1] :
      ( empty_set != X0
      & subset(X0,difference(X1,X0)) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,difference(X1,X0))
       => empty_set = X0 ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X0,X1] :
      ( subset(X0,difference(X1,X0))
     => empty_set = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th50) ).

fof(f49,plain,
    ! [X2,X3,X0,X1] :
      ( ~ subset(X1,difference(X2,X3))
      | ~ member(X0,X1)
      | ~ member(X0,X3) ),
    inference(resolution,[],[f28,f32]) ).

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

fof(f20,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,[],[f19]) ).

fof(f19,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,[],[f2]) ).

fof(f2,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(f28,plain,
    ! [X3,X0,X1] :
      ( member(X3,X1)
      | ~ member(X3,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f22,plain,
    empty_set != sK0,
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09  % Problem    : SET591+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.11  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31  % Computer : n012.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Fri May  3 16:41:22 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  % (3116)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32  % (3119)WARNING: value z3 for option sas not known
% 0.15/0.33  % (3123)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.33  % (3118)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.33  % (3117)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.33  % (3122)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.33  % (3120)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.33  % (3121)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.33  % (3119)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.33  TRYING [1]
% 0.15/0.33  TRYING [2]
% 0.15/0.33  TRYING [3]
% 0.15/0.33  TRYING [1]
% 0.15/0.33  TRYING [2]
% 0.15/0.33  % (3123)Also succeeded, but the first one will report.
% 0.15/0.33  % (3122)First to succeed.
% 0.15/0.33  TRYING [4]
% 0.15/0.33  % (3122)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3116"
% 0.15/0.33  % (3122)Refutation found. Thanks to Tanya!
% 0.15/0.33  % SZS status Theorem for theBenchmark
% 0.15/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.33  % (3122)------------------------------
% 0.15/0.33  % (3122)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.33  % (3122)Termination reason: Refutation
% 0.15/0.33  
% 0.15/0.33  % (3122)Memory used [KB]: 771
% 0.15/0.33  % (3122)Time elapsed: 0.005 s
% 0.15/0.33  % (3122)Instructions burned: 5 (million)
% 0.15/0.33  % (3116)Success in time 0.018 s
%------------------------------------------------------------------------------