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

View Problem - Process Solution

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

% Computer : n020.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:13:12 EDT 2024

% Result   : Theorem 0.11s 0.37s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   38 (   1 unt;   0 def)
%            Number of atoms       :  152 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  180 (  66   ~;  75   |;  20   &)
%                                         (  13 <=>;   5  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   68 (  57   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f159,plain,
    $false,
    inference(avatar_sat_refutation,[],[f24,f25,f150,f158]) ).

fof(f158,plain,
    ( ~ spl3_1
    | spl3_2 ),
    inference(avatar_contradiction_clause,[],[f154]) ).

fof(f154,plain,
    ( $false
    | ~ spl3_1
    | spl3_2 ),
    inference(resolution,[],[f152,f19]) ).

fof(f19,plain,
    ( equalish(sK0,sK1)
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f17,plain,
    ( spl3_1
  <=> equalish(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

fof(f152,plain,
    ( ~ equalish(sK0,sK1)
    | spl3_2 ),
    inference(resolution,[],[f22,f138]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( equalish(X1,X0)
      | ~ equalish(X0,X1) ),
    inference(duplicate_literal_removal,[],[f119]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | equalish(X1,X0)
      | equalish(X1,X0)
      | ~ equalish(X0,X1) ),
    inference(resolution,[],[f114,f53]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ~ a_member_of(sK2(X0,X1),X0)
      | equalish(X0,X1)
      | ~ equalish(X1,X0) ),
    inference(factoring,[],[f27]) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( ~ a_member_of(sK2(X0,X1),X2)
      | ~ a_member_of(sK2(X0,X1),X0)
      | equalish(X0,X1)
      | ~ equalish(X1,X2) ),
    inference(resolution,[],[f13,f11]) ).

fof(f11,plain,
    ! [X2,X3,X5] :
      ( a_member_of(X5,X2)
      | ~ a_member_of(X5,X3)
      | ~ equalish(X2,X3) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ( ~ equalish(sK1,sK0)
      | ~ equalish(sK0,sK1) )
    & ( equalish(sK1,sK0)
      | equalish(sK0,sK1) )
    & ! [X2,X3] :
        ( ( equalish(X2,X3)
          | ( ( ~ a_member_of(sK2(X2,X3),X3)
              | ~ a_member_of(sK2(X2,X3),X2) )
            & ( a_member_of(sK2(X2,X3),X3)
              | a_member_of(sK2(X2,X3),X2) ) ) )
        & ( ! [X5] :
              ( ( a_member_of(X5,X2)
                | ~ a_member_of(X5,X3) )
              & ( a_member_of(X5,X3)
                | ~ a_member_of(X5,X2) ) )
          | ~ equalish(X2,X3) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).

fof(f7,plain,
    ( ? [X0,X1] :
        ( ( ~ equalish(X1,X0)
          | ~ equalish(X0,X1) )
        & ( equalish(X1,X0)
          | equalish(X0,X1) ) )
   => ( ( ~ equalish(sK1,sK0)
        | ~ equalish(sK0,sK1) )
      & ( equalish(sK1,sK0)
        | equalish(sK0,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( ? [X4] :
          ( ( ~ a_member_of(X4,X3)
            | ~ a_member_of(X4,X2) )
          & ( a_member_of(X4,X3)
            | a_member_of(X4,X2) ) )
     => ( ( ~ a_member_of(sK2(X2,X3),X3)
          | ~ a_member_of(sK2(X2,X3),X2) )
        & ( a_member_of(sK2(X2,X3),X3)
          | a_member_of(sK2(X2,X3),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ? [X0,X1] :
        ( ( ~ equalish(X1,X0)
          | ~ equalish(X0,X1) )
        & ( equalish(X1,X0)
          | equalish(X0,X1) ) )
    & ! [X2,X3] :
        ( ( equalish(X2,X3)
          | ? [X4] :
              ( ( ~ a_member_of(X4,X3)
                | ~ a_member_of(X4,X2) )
              & ( a_member_of(X4,X3)
                | a_member_of(X4,X2) ) ) )
        & ( ! [X5] :
              ( ( a_member_of(X5,X2)
                | ~ a_member_of(X5,X3) )
              & ( a_member_of(X5,X3)
                | ~ a_member_of(X5,X2) ) )
          | ~ equalish(X2,X3) ) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ? [X3,X4] :
        ( ( ~ equalish(X4,X3)
          | ~ equalish(X3,X4) )
        & ( equalish(X4,X3)
          | equalish(X3,X4) ) )
    & ! [X0,X1] :
        ( ( equalish(X0,X1)
          | ? [X2] :
              ( ( ~ a_member_of(X2,X1)
                | ~ a_member_of(X2,X0) )
              & ( a_member_of(X2,X1)
                | a_member_of(X2,X0) ) ) )
        & ( ! [X2] :
              ( ( a_member_of(X2,X0)
                | ~ a_member_of(X2,X1) )
              & ( a_member_of(X2,X1)
                | ~ a_member_of(X2,X0) ) )
          | ~ equalish(X0,X1) ) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ? [X3,X4] :
        ( equalish(X3,X4)
      <~> equalish(X4,X3) )
    & ! [X0,X1] :
        ( equalish(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X0)
          <=> a_member_of(X2,X1) ) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ! [X0,X1] :
          ( equalish(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X0)
            <=> a_member_of(X2,X1) ) )
     => ! [X3,X4] :
          ( equalish(X3,X4)
        <=> equalish(X4,X3) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1] :
          ( equalish(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X0)
            <=> a_member_of(X2,X1) ) )
     => ! [X0,X1] :
          ( equalish(X0,X1)
        <=> equalish(X1,X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X0,X1] :
        ( equalish(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X0)
          <=> a_member_of(X2,X1) ) )
   => ! [X0,X1] :
        ( equalish(X0,X1)
      <=> equalish(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f13,plain,
    ! [X2,X3] :
      ( ~ a_member_of(sK2(X2,X3),X3)
      | ~ a_member_of(sK2(X2,X3),X2)
      | equalish(X2,X3) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( a_member_of(sK2(X0,X1),X0)
      | ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    inference(duplicate_literal_removal,[],[f109]) ).

fof(f109,plain,
    ! [X0,X1] :
      ( equalish(X0,X1)
      | ~ equalish(X1,X0)
      | equalish(X0,X1)
      | a_member_of(sK2(X0,X1),X0) ),
    inference(resolution,[],[f104,f12]) ).

fof(f12,plain,
    ! [X2,X3] :
      ( a_member_of(sK2(X2,X3),X3)
      | equalish(X2,X3)
      | a_member_of(sK2(X2,X3),X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ~ a_member_of(sK2(X0,X1),X1)
      | equalish(X0,X1)
      | ~ equalish(X1,X0) ),
    inference(factoring,[],[f31]) ).

fof(f31,plain,
    ! [X2,X0,X1] :
      ( ~ a_member_of(sK2(X0,X1),X2)
      | ~ a_member_of(sK2(X0,X1),X1)
      | equalish(X0,X1)
      | ~ equalish(X2,X0) ),
    inference(resolution,[],[f13,f10]) ).

fof(f10,plain,
    ! [X2,X3,X5] :
      ( a_member_of(X5,X3)
      | ~ a_member_of(X5,X2)
      | ~ equalish(X2,X3) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f22,plain,
    ( ~ equalish(sK1,sK0)
    | spl3_2 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f21,plain,
    ( spl3_2
  <=> equalish(sK1,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f150,plain,
    ( spl3_1
    | ~ spl3_2 ),
    inference(avatar_contradiction_clause,[],[f146]) ).

fof(f146,plain,
    ( $false
    | spl3_1
    | ~ spl3_2 ),
    inference(resolution,[],[f144,f23]) ).

fof(f23,plain,
    ( equalish(sK1,sK0)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f144,plain,
    ( ~ equalish(sK1,sK0)
    | spl3_1 ),
    inference(resolution,[],[f138,f18]) ).

fof(f18,plain,
    ( ~ equalish(sK0,sK1)
    | spl3_1 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f25,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f15,f21,f17]) ).

fof(f15,plain,
    ( ~ equalish(sK1,sK0)
    | ~ equalish(sK0,sK1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f24,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f14,f21,f17]) ).

fof(f14,plain,
    ( equalish(sK1,sK0)
    | equalish(sK0,sK1) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET788+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.35  % Computer : n020.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8042.1875MB
% 0.11/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.35  % CPULimit   : 300
% 0.11/0.35  % WCLimit    : 300
% 0.11/0.35  % DateTime   : Tue Apr 30 01:38:02 EDT 2024
% 0.11/0.35  % CPUTime    : 
% 0.11/0.35  % (17500)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.36  % (17504)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.36  % (17506)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.36  % (17501)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.36  % (17505)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.36  % (17507)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.11/0.36  % (17503)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.11/0.36  % (17502)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.36  TRYING [1]
% 0.11/0.36  TRYING [1]
% 0.11/0.36  TRYING [1,1]
% 0.11/0.36  TRYING [2,1]
% 0.11/0.36  TRYING [2]
% 0.11/0.36  TRYING [2]
% 0.11/0.36  TRYING [1,1]
% 0.11/0.36  TRYING [2,2]
% 0.11/0.36  TRYING [2,1]
% 0.11/0.36  TRYING [3]
% 0.11/0.36  TRYING [3]
% 0.11/0.36  TRYING [2,2]
% 0.11/0.37  TRYING [3,3]
% 0.11/0.37  TRYING [3,3]
% 0.11/0.37  TRYING [4]
% 0.11/0.37  TRYING [4,4]
% 0.11/0.37  TRYING [4]
% 0.11/0.37  % (17503)First to succeed.
% 0.11/0.37  TRYING [4,4]
% 0.11/0.37  TRYING [5]
% 0.11/0.37  TRYING [5,5]
% 0.11/0.37  TRYING [5]
% 0.11/0.37  TRYING [5,5]
% 0.11/0.37  % (17505)Also succeeded, but the first one will report.
% 0.11/0.37  TRYING [6,6]
% 0.11/0.37  TRYING [6]
% 0.11/0.37  TRYING [6]
% 0.11/0.37  TRYING [6,6]
% 0.11/0.37  % (17506)Also succeeded, but the first one will report.
% 0.11/0.37  % (17503)Refutation found. Thanks to Tanya!
% 0.11/0.37  % SZS status Theorem for theBenchmark
% 0.11/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.37  % (17503)------------------------------
% 0.11/0.37  % (17503)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.11/0.37  % (17503)Termination reason: Refutation
% 0.11/0.37  
% 0.11/0.37  % (17503)Memory used [KB]: 775
% 0.11/0.37  % (17503)Time elapsed: 0.005 s
% 0.11/0.37  % (17503)Instructions burned: 6 (million)
% 0.11/0.37  % (17503)------------------------------
% 0.11/0.37  % (17503)------------------------------
% 0.11/0.37  % (17500)Success in time 0.018 s
%------------------------------------------------------------------------------