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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET908+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.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:52 EDT 2024

% Result   : Theorem 0.47s 0.64s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (   9 unt;   0 def)
%            Number of atoms       :  154 (  52 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  196 (  74   ~;  75   |;  38   &)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   82 (  68   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f88,plain,
    $false,
    inference(resolution,[],[f78,f60]) ).

fof(f60,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f59]) ).

fof(f59,plain,
    ! [X3,X1] :
      ( in(X3,X1)
      | singleton(X3) != X1 ),
    inference(equality_resolution,[],[f42]) ).

fof(f42,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | X0 != X3
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f24]) ).

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

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

fof(f22,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,[],[f21]) ).

fof(f21,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/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

fof(f78,plain,
    ! [X0] : ~ in(X0,singleton(sK0)),
    inference(subsumption_resolution,[],[f73,f62]) ).

fof(f62,plain,
    ! [X2] : ~ in(X2,empty_set),
    inference(equality_resolution,[],[f46]) ).

fof(f46,plain,
    ! [X2,X0] :
      ( ~ in(X2,X0)
      | empty_set != X0 ),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X0] :
      ( ( empty_set = X0
        | in(sK3(X0),X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f26,f27]) ).

fof(f27,plain,
    ! [X0] :
      ( ? [X1] : in(X1,X0)
     => in(sK3(X0),X0) ),
    introduced(choice_axiom,[]) ).

fof(f26,plain,
    ! [X0] :
      ( ( empty_set = X0
        | ? [X1] : in(X1,X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(rectify,[],[f25]) ).

fof(f25,plain,
    ! [X0] :
      ( ( empty_set = X0
        | ? [X1] : in(X1,X0) )
      & ( ! [X1] : ~ in(X1,X0)
        | empty_set != X0 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( empty_set = X0
    <=> ! [X1] : ~ in(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).

fof(f73,plain,
    ! [X0] :
      ( in(X0,empty_set)
      | ~ in(X0,singleton(sK0)) ),
    inference(superposition,[],[f64,f38]) ).

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

fof(f20,plain,
    empty_set = set_union2(singleton(sK0),sK1),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f19]) ).

fof(f19,plain,
    ( ? [X0,X1] : empty_set = set_union2(singleton(X0),X1)
   => empty_set = set_union2(singleton(sK0),sK1) ),
    introduced(choice_axiom,[]) ).

fof(f15,plain,
    ? [X0,X1] : empty_set = set_union2(singleton(X0),X1),
    inference(ennf_transformation,[],[f13]) ).

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

fof(f12,conjecture,
    ! [X0,X1] : empty_set != set_union2(singleton(X0),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t49_zfmisc_1) ).

fof(f64,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_union2(X0,X1))
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f49]) ).

fof(f49,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X0)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ( ( ( ~ in(sK4(X0,X1,X2),X1)
              & ~ in(sK4(X0,X1,X2),X0) )
            | ~ in(sK4(X0,X1,X2),X2) )
          & ( in(sK4(X0,X1,X2),X1)
            | in(sK4(X0,X1,X2),X0)
            | in(sK4(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X1)
                & ~ in(X4,X0) ) )
            & ( in(X4,X1)
              | in(X4,X0)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f31,f32]) ).

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

fof(f31,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ? [X3] :
            ( ( ( ~ in(X3,X1)
                & ~ in(X3,X0) )
              | ~ in(X3,X2) )
            & ( in(X3,X1)
              | in(X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X1)
                & ~ in(X4,X0) ) )
            & ( in(X4,X1)
              | in(X4,X0)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(rectify,[],[f30]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ? [X3] :
            ( ( ( ~ in(X3,X1)
                & ~ in(X3,X0) )
              | ~ in(X3,X2) )
            & ( in(X3,X1)
              | in(X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X1)
                & ~ in(X3,X0) ) )
            & ( in(X3,X1)
              | in(X3,X0)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(flattening,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ? [X3] :
            ( ( ( ~ in(X3,X1)
                & ~ in(X3,X0) )
              | ~ in(X3,X2) )
            & ( in(X3,X1)
              | in(X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X1)
                & ~ in(X3,X0) ) )
            & ( in(X3,X1)
              | in(X3,X0)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( set_union2(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X1)
            | in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SET908+1 : TPTP v8.2.0. Released v3.2.0.
% 0.09/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.31  % Computer : n024.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Mon May 20 12:42:23 EDT 2024
% 0.09/0.31  % CPUTime    : 
% 0.09/0.31  This is a FOF_THM_RFO_SEQ problem
% 0.09/0.31  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.64  % (30683)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.47/0.64  % (30687)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.47/0.64  % (30685)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.47/0.64  % (30689)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.47/0.64  % (30687)First to succeed.
% 0.47/0.64  % (30685)Refutation not found, incomplete strategy% (30685)------------------------------
% 0.47/0.64  % (30685)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (30685)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (30685)Memory used [KB]: 958
% 0.47/0.64  % (30685)Time elapsed: 0.002 s
% 0.47/0.64  % (30685)Instructions burned: 2 (million)
% 0.47/0.64  % (30685)------------------------------
% 0.47/0.64  % (30685)------------------------------
% 0.47/0.64  % (30689)Refutation not found, incomplete strategy% (30689)------------------------------
% 0.47/0.64  % (30689)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (30684)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.64  % (30689)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (30689)Memory used [KB]: 957
% 0.47/0.64  % (30687)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30681"
% 0.47/0.64  % (30689)Time elapsed: 0.003 s
% 0.47/0.64  % (30689)Instructions burned: 3 (million)
% 0.47/0.64  % (30689)------------------------------
% 0.47/0.64  % (30689)------------------------------
% 0.47/0.64  % (30684)Also succeeded, but the first one will report.
% 0.47/0.64  % (30682)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.47/0.64  % (30686)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.47/0.64  % (30686)Refutation not found, incomplete strategy% (30686)------------------------------
% 0.47/0.64  % (30686)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (30686)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (30686)Memory used [KB]: 973
% 0.47/0.64  % (30686)Time elapsed: 0.001 s
% 0.47/0.64  % (30686)Instructions burned: 3 (million)
% 0.47/0.64  % (30690)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.47/0.64  % (30682)Refutation not found, incomplete strategy% (30682)------------------------------
% 0.47/0.64  % (30682)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (30682)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (30682)Memory used [KB]: 1041
% 0.47/0.64  % (30682)Time elapsed: 0.002 s
% 0.47/0.64  % (30682)Instructions burned: 4 (million)
% 0.47/0.64  % (30686)------------------------------
% 0.47/0.64  % (30686)------------------------------
% 0.47/0.64  % (30682)------------------------------
% 0.47/0.64  % (30682)------------------------------
% 0.47/0.64  % (30691)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.47/0.64  % (30687)Refutation found. Thanks to Tanya!
% 0.47/0.64  % SZS status Theorem for theBenchmark
% 0.47/0.64  % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.64  % (30687)------------------------------
% 0.47/0.64  % (30687)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (30687)Termination reason: Refutation
% 0.47/0.64  
% 0.47/0.64  % (30687)Memory used [KB]: 1049
% 0.47/0.64  % (30687)Time elapsed: 0.003 s
% 0.47/0.64  % (30687)Instructions burned: 5 (million)
% 0.47/0.64  % (30681)Success in time 0.328 s
% 0.47/0.64  % Vampire---4.8 exiting
%------------------------------------------------------------------------------