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

View Problem - Process Solution

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

% Computer : n016.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:19:42 EDT 2024

% Result   : Theorem 0.21s 0.37s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   49 (  37 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   59 (  27   ~;  12   |;  17   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   22 (  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,plain,
    $false,
    inference(unit_resulting_resolution,[],[f21,f22,f34,f25]) ).

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

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

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

fof(f2,axiom,
    ! [X0,X1] :
      ( subset(X0,singleton(X1))
    <=> ( singleton(X1) = X0
        | empty_set = X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).

fof(f34,plain,
    subset(sK0,singleton(sK1)),
    inference(unit_resulting_resolution,[],[f20,f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( empty_set != set_difference(X0,X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ( empty_set = set_difference(X0,X1)
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | empty_set != set_difference(X0,X1) ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( empty_set = set_difference(X0,X1)
    <=> subset(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).

fof(f20,plain,
    empty_set = set_difference(sK0,singleton(sK1)),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ( sK0 != singleton(sK1)
    & empty_set != sK0
    & empty_set = set_difference(sK0,singleton(sK1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f11]) ).

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

fof(f10,plain,
    ? [X0,X1] :
      ( singleton(X1) != X0
      & empty_set != X0
      & empty_set = set_difference(X0,singleton(X1)) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X0,X1] :
        ~ ( singleton(X1) != X0
          & empty_set != X0
          & empty_set = set_difference(X0,singleton(X1)) ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X0,X1] :
      ~ ( singleton(X1) != X0
        & empty_set != X0
        & empty_set = set_difference(X0,singleton(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t66_zfmisc_1) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET923+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 17:04:38 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  % (25019)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37  % (25022)WARNING: value z3 for option sas not known
% 0.21/0.37  % (25020)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.37  % (25022)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.21/0.37  % (25023)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.37  % (25024)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.21/0.37  % (25021)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.37  % (25025)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.21/0.37  % (25026)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.21/0.37  TRYING [1]
% 0.21/0.37  TRYING [2]
% 0.21/0.37  TRYING [3]
% 0.21/0.37  TRYING [1]
% 0.21/0.37  % (25026)First to succeed.
% 0.21/0.37  % (25025)Also succeeded, but the first one will report.
% 0.21/0.37  TRYING [2]
% 0.21/0.37  TRYING [4]
% 0.21/0.37  % (25024)Also succeeded, but the first one will report.
% 0.21/0.37  % (25026)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25019"
% 0.21/0.37  % (25022)Also succeeded, but the first one will report.
% 0.21/0.37  TRYING [1]
% 0.21/0.37  % (25026)Refutation found. Thanks to Tanya!
% 0.21/0.37  % SZS status Theorem for theBenchmark
% 0.21/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.37  % (25026)------------------------------
% 0.21/0.37  % (25026)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.37  % (25026)Termination reason: Refutation
% 0.21/0.37  
% 0.21/0.37  % (25026)Memory used [KB]: 744
% 0.21/0.37  % (25026)Time elapsed: 0.004 s
% 0.21/0.37  % (25026)Instructions burned: 3 (million)
% 0.21/0.37  % (25019)Success in time 0.02 s
%------------------------------------------------------------------------------