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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET903+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 : n032.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:38 EDT 2024

% Result   : Theorem 0.08s 0.29s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (   9 unt;   0 def)
%            Number of atoms       :   79 (  67 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   92 (  39   ~;  20   |;  32   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   42 (  36   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f80,plain,
    $false,
    inference(subsumption_resolution,[],[f74,f27]) ).

fof(f27,plain,
    sK2 != sK3,
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ( empty_set != sK3
    & empty_set != sK2
    & sK2 != sK3
    & singleton(sK1) = set_union2(sK2,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f18]) ).

fof(f18,plain,
    ( ? [X0,X1,X2] :
        ( empty_set != X2
        & empty_set != X1
        & X1 != X2
        & singleton(X0) = set_union2(X1,X2) )
   => ( empty_set != sK3
      & empty_set != sK2
      & sK2 != sK3
      & singleton(sK1) = set_union2(sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f10,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ~ ( empty_set != X2
          & empty_set != X1
          & X1 != X2
          & singleton(X0) = set_union2(X1,X2) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0,X1,X2] :
      ~ ( empty_set != X2
        & empty_set != X1
        & X1 != X2
        & singleton(X0) = set_union2(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_zfmisc_1) ).

fof(f74,plain,
    sK2 = sK3,
    inference(superposition,[],[f69,f68]) ).

fof(f68,plain,
    sK3 = singleton(sK1),
    inference(resolution,[],[f67,f36]) ).

fof(f36,plain,
    ! [X2,X0,X1] :
      ( ~ sP0(X0,X1,X2)
      | singleton(X1) = X0 ),
    inference(cnf_transformation,[],[f21]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( ( singleton(X1) = X0
        & singleton(X1) = X2 )
      | ~ sP0(X0,X1,X2) ),
    inference(rectify,[],[f20]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( ( singleton(X0) = X2
        & singleton(X0) = X1 )
      | ~ sP0(X2,X0,X1) ),
    inference(nnf_transformation,[],[f16]) ).

fof(f16,plain,
    ! [X2,X0,X1] :
      ( ( singleton(X0) = X2
        & singleton(X0) = X1 )
      | ~ sP0(X2,X0,X1) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f67,plain,
    sP0(sK3,sK1,sK2),
    inference(equality_resolution,[],[f66]) ).

fof(f66,plain,
    ! [X0] :
      ( singleton(X0) != singleton(sK1)
      | sP0(sK3,X0,sK2) ),
    inference(subsumption_resolution,[],[f65,f29]) ).

fof(f29,plain,
    empty_set != sK3,
    inference(cnf_transformation,[],[f19]) ).

fof(f65,plain,
    ! [X0] :
      ( singleton(X0) != singleton(sK1)
      | sP0(sK3,X0,sK2)
      | empty_set = sK3 ),
    inference(subsumption_resolution,[],[f60,f28]) ).

fof(f28,plain,
    empty_set != sK2,
    inference(cnf_transformation,[],[f19]) ).

fof(f60,plain,
    ! [X0] :
      ( singleton(X0) != singleton(sK1)
      | empty_set = sK2
      | sP0(sK3,X0,sK2)
      | empty_set = sK3 ),
    inference(superposition,[],[f39,f26]) ).

fof(f26,plain,
    singleton(sK1) = set_union2(sK2,sK3),
    inference(cnf_transformation,[],[f19]) ).

fof(f39,plain,
    ! [X2,X0,X1] :
      ( singleton(X0) != set_union2(X1,X2)
      | empty_set = X1
      | sP0(X2,X0,X1)
      | empty_set = X2 ),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( ( empty_set = X2
        & singleton(X0) = X1 )
      | ( singleton(X0) = X2
        & empty_set = X1 )
      | sP0(X2,X0,X1)
      | singleton(X0) != set_union2(X1,X2) ),
    inference(definition_folding,[],[f15,f16]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( ( empty_set = X2
        & singleton(X0) = X1 )
      | ( singleton(X0) = X2
        & empty_set = X1 )
      | ( singleton(X0) = X2
        & singleton(X0) = X1 )
      | singleton(X0) != set_union2(X1,X2) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X1,X2] :
      ~ ( ~ ( empty_set = X2
            & singleton(X0) = X1 )
        & ~ ( singleton(X0) = X2
            & empty_set = X1 )
        & ~ ( singleton(X0) = X2
            & singleton(X0) = X1 )
        & singleton(X0) = set_union2(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t43_zfmisc_1) ).

fof(f69,plain,
    sK2 = singleton(sK1),
    inference(resolution,[],[f67,f35]) ).

fof(f35,plain,
    ! [X2,X0,X1] :
      ( ~ sP0(X0,X1,X2)
      | singleton(X1) = X2 ),
    inference(cnf_transformation,[],[f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem    : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.09  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.08/0.27  % Computer : n032.cluster.edu
% 0.08/0.27  % Model    : x86_64 x86_64
% 0.08/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27  % Memory   : 8042.1875MB
% 0.08/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27  % CPULimit   : 300
% 0.08/0.27  % WCLimit    : 300
% 0.08/0.27  % DateTime   : Fri May  3 16:20:08 EDT 2024
% 0.08/0.27  % CPUTime    : 
% 0.08/0.28  % (18494)Running in auto input_syntax mode. Trying TPTP
% 0.08/0.29  % (18497)WARNING: value z3 for option sas not known
% 0.08/0.29  % (18501)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.08/0.29  % (18497)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.08/0.29  % (18495)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.08/0.29  % (18497)First to succeed.
% 0.08/0.29  % (18496)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.08/0.29  % (18497)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18494"
% 0.08/0.29  % (18497)Refutation found. Thanks to Tanya!
% 0.08/0.29  % SZS status Theorem for theBenchmark
% 0.08/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.29  % (18497)------------------------------
% 0.08/0.29  % (18497)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.08/0.29  % (18497)Termination reason: Refutation
% 0.08/0.29  
% 0.08/0.29  % (18497)Memory used [KB]: 765
% 0.08/0.29  % (18497)Time elapsed: 0.004 s
% 0.08/0.29  % (18497)Instructions burned: 5 (million)
% 0.08/0.29  % (18494)Success in time 0.011 s
%------------------------------------------------------------------------------