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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n021.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:04:21 EDT 2024

% Result   : Theorem 0.23s 0.43s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (  14 unt;   0 def)
%            Number of atoms       :   89 (  45 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   81 (  25   ~;  21   |;  29   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   44 (  35   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1318,plain,
    $false,
    inference(subsumption_resolution,[],[f1304,f1201]) ).

fof(f1201,plain,
    sK0 != sK1,
    inference(superposition,[],[f140,f1198]) ).

fof(f1198,plain,
    sK0 = sK2,
    inference(subsumption_resolution,[],[f1181,f140]) ).

fof(f1181,plain,
    ( sK0 = sK2
    | sK1 = sK2 ),
    inference(resolution,[],[f208,f294]) ).

fof(f294,plain,
    member(sK2,unordered_pair(sK0,sK1)),
    inference(subsumption_resolution,[],[f292,f138]) ).

fof(f138,plain,
    member(sK2,universal_class),
    inference(cnf_transformation,[],[f88]) ).

fof(f88,plain,
    ( sK1 != sK2
    & unordered_pair(sK0,sK1) = unordered_pair(sK0,sK2)
    & member(sK2,universal_class)
    & member(sK1,universal_class) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f73,f87]) ).

fof(f87,plain,
    ( ? [X0,X1,X2] :
        ( X1 != X2
        & unordered_pair(X0,X1) = unordered_pair(X0,X2)
        & member(X2,universal_class)
        & member(X1,universal_class) )
   => ( sK1 != sK2
      & unordered_pair(sK0,sK1) = unordered_pair(sK0,sK2)
      & member(sK2,universal_class)
      & member(sK1,universal_class) ) ),
    introduced(choice_axiom,[]) ).

fof(f73,plain,
    ? [X0,X1,X2] :
      ( X1 != X2
      & unordered_pair(X0,X1) = unordered_pair(X0,X2)
      & member(X2,universal_class)
      & member(X1,universal_class) ),
    inference(flattening,[],[f72]) ).

fof(f72,plain,
    ? [X0,X1,X2] :
      ( X1 != X2
      & unordered_pair(X0,X1) = unordered_pair(X0,X2)
      & member(X2,universal_class)
      & member(X1,universal_class) ),
    inference(ennf_transformation,[],[f46]) ).

fof(f46,plain,
    ~ ! [X0,X1,X2] :
        ( ( unordered_pair(X0,X1) = unordered_pair(X0,X2)
          & member(X2,universal_class)
          & member(X1,universal_class) )
       => X1 = X2 ),
    inference(rectify,[],[f45]) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1,X4] :
        ( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
          & member(X4,universal_class)
          & member(X1,universal_class) )
       => X1 = X4 ),
    inference(negated_conjecture,[],[f44]) ).

fof(f44,conjecture,
    ! [X0,X1,X4] :
      ( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
        & member(X4,universal_class)
        & member(X1,universal_class) )
     => X1 = X4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation) ).

fof(f292,plain,
    ( member(sK2,unordered_pair(sK0,sK1))
    | ~ member(sK2,universal_class) ),
    inference(superposition,[],[f232,f139]) ).

fof(f139,plain,
    unordered_pair(sK0,sK1) = unordered_pair(sK0,sK2),
    inference(cnf_transformation,[],[f88]) ).

fof(f232,plain,
    ! [X2,X1] :
      ( member(X2,unordered_pair(X1,X2))
      | ~ member(X2,universal_class) ),
    inference(equality_resolution,[],[f210]) ).

fof(f210,plain,
    ! [X2,X0,X1] :
      ( member(X0,unordered_pair(X1,X2))
      | X0 != X2
      | ~ member(X0,universal_class) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f124,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,unordered_pair(X1,X2))
        | ( X0 != X2
          & X0 != X1 )
        | ~ member(X0,universal_class) )
      & ( ( ( X0 = X2
            | X0 = X1 )
          & member(X0,universal_class) )
        | ~ member(X0,unordered_pair(X1,X2)) ) ),
    inference(flattening,[],[f123]) ).

fof(f123,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,unordered_pair(X1,X2))
        | ( X0 != X2
          & X0 != X1 )
        | ~ member(X0,universal_class) )
      & ( ( ( X0 = X2
            | X0 = X1 )
          & member(X0,universal_class) )
        | ~ member(X0,unordered_pair(X1,X2)) ) ),
    inference(nnf_transformation,[],[f65]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( member(X0,unordered_pair(X1,X2))
    <=> ( ( X0 = X2
          | X0 = X1 )
        & member(X0,universal_class) ) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( member(X2,unordered_pair(X0,X1))
    <=> ( ( X1 = X2
          | X0 = X2 )
        & member(X2,universal_class) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).

fof(f208,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,unordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    inference(cnf_transformation,[],[f124]) ).

fof(f140,plain,
    sK1 != sK2,
    inference(cnf_transformation,[],[f88]) ).

fof(f1304,plain,
    sK0 = sK1,
    inference(resolution,[],[f1197,f1239]) ).

fof(f1239,plain,
    member(sK1,singleton(sK0)),
    inference(subsumption_resolution,[],[f1228,f137]) ).

fof(f137,plain,
    member(sK1,universal_class),
    inference(cnf_transformation,[],[f88]) ).

fof(f1228,plain,
    ( member(sK1,singleton(sK0))
    | ~ member(sK1,universal_class) ),
    inference(superposition,[],[f232,f1213]) ).

fof(f1213,plain,
    unordered_pair(sK0,sK1) = singleton(sK0),
    inference(forward_demodulation,[],[f1200,f146]) ).

fof(f146,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set_defn) ).

fof(f1200,plain,
    unordered_pair(sK0,sK1) = unordered_pair(sK0,sK0),
    inference(superposition,[],[f139,f1198]) ).

fof(f1197,plain,
    ! [X0,X1] :
      ( ~ member(X1,singleton(X0))
      | X0 = X1 ),
    inference(duplicate_literal_removal,[],[f1195]) ).

fof(f1195,plain,
    ! [X0,X1] :
      ( ~ member(X1,singleton(X0))
      | X0 = X1
      | X0 = X1 ),
    inference(superposition,[],[f208,f146]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.08/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 01:30:11 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.37  % (29920)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (29923)WARNING: value z3 for option sas not known
% 0.15/0.39  % (29921)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39  % (29924)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39  % (29922)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39  % (29923)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.39  % (29925)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.39  % (29926)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.39  % (29927)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.23/0.41  TRYING [1]
% 0.23/0.41  TRYING [1]
% 0.23/0.41  TRYING [2]
% 0.23/0.41  TRYING [2]
% 0.23/0.42  TRYING [1]
% 0.23/0.42  TRYING [2]
% 0.23/0.42  TRYING [3]
% 0.23/0.42  % (29923)First to succeed.
% 0.23/0.43  % (29923)Refutation found. Thanks to Tanya!
% 0.23/0.43  % SZS status Theorem for theBenchmark
% 0.23/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.43  % (29923)------------------------------
% 0.23/0.43  % (29923)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.23/0.43  % (29923)Termination reason: Refutation
% 0.23/0.43  
% 0.23/0.43  % (29923)Memory used [KB]: 1368
% 0.23/0.43  % (29923)Time elapsed: 0.042 s
% 0.23/0.43  % (29923)Instructions burned: 62 (million)
% 0.23/0.43  % (29923)------------------------------
% 0.23/0.43  % (29923)------------------------------
% 0.23/0.43  % (29920)Success in time 0.059 s
%------------------------------------------------------------------------------