TSTP Solution File: SET873+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET873+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n011.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 May 21 03:13:46 EDT 2024

% Result   : Theorem 0.52s 0.74s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (  10 unt;   0 def)
%            Number of atoms       :   96 (  45 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  100 (  40   ~;  36   |;  15   &)
%                                         (   4 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   46 (  39   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f115,plain,
    $false,
    inference(avatar_sat_refutation,[],[f101,f111,f114]) ).

fof(f114,plain,
    spl5_6,
    inference(avatar_contradiction_clause,[],[f113]) ).

fof(f113,plain,
    ( $false
    | spl5_6 ),
    inference(resolution,[],[f100,f42]) ).

fof(f42,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0] : subset(X0,X0),
    inference(rectify,[],[f10]) ).

fof(f10,axiom,
    ! [X0,X1] : subset(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(f100,plain,
    ( ~ subset(singleton(sK3),singleton(sK3))
    | spl5_6 ),
    inference(avatar_component_clause,[],[f98]) ).

fof(f98,plain,
    ( spl5_6
  <=> subset(singleton(sK3),singleton(sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).

fof(f111,plain,
    ~ spl5_5,
    inference(avatar_contradiction_clause,[],[f110]) ).

fof(f110,plain,
    ( $false
    | ~ spl5_5 ),
    inference(trivial_inequality_removal,[],[f109]) ).

fof(f109,plain,
    ( sK3 != sK3
    | ~ spl5_5 ),
    inference(superposition,[],[f44,f102]) ).

fof(f102,plain,
    ( sK3 = sK4
    | ~ spl5_5 ),
    inference(resolution,[],[f96,f47]) ).

fof(f47,plain,
    ! [X3,X0] :
      ( ~ in(X3,singleton(X0))
      | X0 = X3 ),
    inference(equality_resolution,[],[f32]) ).

fof(f32,plain,
    ! [X3,X0,X1] :
      ( X0 = X3
      | ~ in(X3,X1)
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( singleton(X0) = X1
        | ( ( sK0(X0,X1) != X0
            | ~ in(sK0(X0,X1),X1) )
          & ( sK0(X0,X1) = X0
            | in(sK0(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f21,f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( X0 != X2
            | ~ in(X2,X1) )
          & ( X0 = X2
            | in(X2,X1) ) )
     => ( ( sK0(X0,X1) != X0
          | ~ in(sK0(X0,X1),X1) )
        & ( sK0(X0,X1) = X0
          | in(sK0(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f3,axiom,
    ! [X0,X1] :
      ( singleton(X0) = X1
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X0 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

fof(f96,plain,
    ( in(sK4,singleton(sK3))
    | ~ spl5_5 ),
    inference(avatar_component_clause,[],[f94]) ).

fof(f94,plain,
    ( spl5_5
  <=> in(sK4,singleton(sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).

fof(f44,plain,
    sK3 != sK4,
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    ( sK3 != sK4
    & singleton(sK3) = set_union2(singleton(sK3),singleton(sK4)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f19,f28]) ).

fof(f28,plain,
    ( ? [X0,X1] :
        ( X0 != X1
        & singleton(X0) = set_union2(singleton(X0),singleton(X1)) )
   => ( sK3 != sK4
      & singleton(sK3) = set_union2(singleton(sK3),singleton(sK4)) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f12,negated_conjecture,
    ~ ! [X0,X1] :
        ( singleton(X0) = set_union2(singleton(X0),singleton(X1))
       => X0 = X1 ),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X0,X1] :
      ( singleton(X0) = set_union2(singleton(X0),singleton(X1))
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_zfmisc_1) ).

fof(f101,plain,
    ( spl5_5
    | ~ spl5_6 ),
    inference(avatar_split_clause,[],[f89,f98,f94]) ).

fof(f89,plain,
    ( ~ subset(singleton(sK3),singleton(sK3))
    | in(sK4,singleton(sK3)) ),
    inference(superposition,[],[f70,f43]) ).

fof(f43,plain,
    singleton(sK3) = set_union2(singleton(sK3),singleton(sK4)),
    inference(cnf_transformation,[],[f29]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( ~ subset(set_union2(X1,singleton(X0)),X1)
      | in(X0,X1) ),
    inference(superposition,[],[f39,f31]) ).

fof(f31,plain,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ subset(set_union2(singleton(X0),X1),X1)
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | ~ subset(set_union2(singleton(X0),X1),X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( subset(set_union2(singleton(X0),X1),X1)
     => in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SET873+1 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 11:19:23 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.73  % (4036)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.73  % (4036)Refutation not found, incomplete strategy% (4036)------------------------------
% 0.52/0.73  % (4036)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73  % (4036)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.73  
% 0.52/0.73  % (4036)Memory used [KB]: 955
% 0.52/0.73  % (4036)Time elapsed: 0.002 s
% 0.52/0.73  % (4036)Instructions burned: 2 (million)
% 0.52/0.73  % (4030)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.52/0.73  % (4032)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.73  % (4031)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.52/0.73  % (4036)------------------------------
% 0.52/0.73  % (4036)------------------------------
% 0.52/0.73  % (4030)Refutation not found, incomplete strategy% (4030)------------------------------
% 0.52/0.73  % (4030)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73  % (4030)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.73  
% 0.52/0.73  % (4030)Memory used [KB]: 972
% 0.52/0.73  % (4030)Time elapsed: 0.003 s
% 0.52/0.73  % (4030)Instructions burned: 3 (million)
% 0.52/0.73  % (4030)------------------------------
% 0.52/0.73  % (4030)------------------------------
% 0.52/0.73  % (4031)First to succeed.
% 0.52/0.73  % (4038)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.52/0.73  % (4039)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.52/0.73  % (4038)Refutation not found, incomplete strategy% (4038)------------------------------
% 0.52/0.73  % (4038)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73  % (4038)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.73  
% 0.52/0.73  % (4038)Memory used [KB]: 967
% 0.52/0.73  % (4031)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4029"
% 0.52/0.73  % (4038)Time elapsed: 0.002 s
% 0.52/0.73  % (4038)Instructions burned: 2 (million)
% 0.52/0.73  % (4038)------------------------------
% 0.52/0.73  % (4038)------------------------------
% 0.52/0.73  % (4032)Also succeeded, but the first one will report.
% 0.52/0.74  % (4031)Refutation found. Thanks to Tanya!
% 0.52/0.74  % SZS status Theorem for theBenchmark
% 0.52/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.74  % (4031)------------------------------
% 0.52/0.74  % (4031)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74  % (4031)Termination reason: Refutation
% 0.52/0.74  
% 0.52/0.74  % (4031)Memory used [KB]: 1004
% 0.52/0.74  % (4031)Time elapsed: 0.005 s
% 0.52/0.74  % (4031)Instructions burned: 5 (million)
% 0.52/0.74  % (4029)Success in time 0.385 s
% 0.52/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------