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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU132+1 : TPTP v8.1.2. Released v3.3.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 : n022.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:20:23 EDT 2024

% Result   : Theorem 0.72s 0.88s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   37 (   9 unt;   0 def)
%            Number of atoms       :  149 (  12 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  185 (  73   ~;  65   |;  37   &)
%                                         (   4 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   88 (  75   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f121,plain,
    $false,
    inference(subsumption_resolution,[],[f117,f86]) ).

fof(f86,plain,
    in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),sK4),
    inference(resolution,[],[f74,f62]) ).

fof(f62,plain,
    ! [X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,set_difference(X0,X1)) ),
    inference(equality_resolution,[],[f43]) ).

fof(f43,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f32]) ).

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

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

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(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_difference(X0,X1) != X2 ) ),
    inference(rectify,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(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_difference(X0,X1) != X2 ) ),
    inference(flattening,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(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_difference(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( set_difference(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( ~ in(X3,X1)
            & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pmSHzFlsJW/Vampire---4.8_19314',d4_xboole_0) ).

fof(f74,plain,
    in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),set_difference(sK4,sK6)),
    inference(resolution,[],[f54,f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK0(X0,X1),X1)
          & in(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).

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

fof(f25,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pmSHzFlsJW/Vampire---4.8_19314',d3_tarski) ).

fof(f54,plain,
    ~ subset(set_difference(sK4,sK6),set_difference(sK5,sK6)),
    inference(cnf_transformation,[],[f38]) ).

fof(f38,plain,
    ( ~ subset(set_difference(sK4,sK6),set_difference(sK5,sK6))
    & subset(sK4,sK5) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f20,f37]) ).

fof(f37,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(set_difference(X0,X2),set_difference(X1,X2))
        & subset(X0,X1) )
   => ( ~ subset(set_difference(sK4,sK6),set_difference(sK5,sK6))
      & subset(sK4,sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ? [X0,X1,X2] :
      ( ~ subset(set_difference(X0,X2),set_difference(X1,X2))
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( subset(X0,X1)
       => subset(set_difference(X0,X2),set_difference(X1,X2)) ),
    inference(negated_conjecture,[],[f10]) ).

fof(f10,conjecture,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset(set_difference(X0,X2),set_difference(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.pmSHzFlsJW/Vampire---4.8_19314',t33_xboole_1) ).

fof(f117,plain,
    ~ in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),sK4),
    inference(resolution,[],[f104,f73]) ).

fof(f73,plain,
    ! [X0] :
      ( in(X0,sK5)
      | ~ in(X0,sK4) ),
    inference(resolution,[],[f53,f40]) ).

fof(f40,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | ~ in(X3,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f53,plain,
    subset(sK4,sK5),
    inference(cnf_transformation,[],[f38]) ).

fof(f104,plain,
    ~ in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),sK5),
    inference(subsumption_resolution,[],[f100,f87]) ).

fof(f87,plain,
    ~ in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),sK6),
    inference(resolution,[],[f74,f61]) ).

fof(f61,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,X1)
      | ~ in(X4,set_difference(X0,X1)) ),
    inference(equality_resolution,[],[f44]) ).

fof(f44,plain,
    ! [X2,X0,X1,X4] :
      ( ~ in(X4,X1)
      | ~ in(X4,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f32]) ).

fof(f100,plain,
    ( in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),sK6)
    | ~ in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),sK5) ),
    inference(resolution,[],[f75,f60]) ).

fof(f60,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_difference(X0,X1))
      | in(X4,X1)
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f45]) ).

fof(f45,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | in(X4,X1)
      | ~ in(X4,X0)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f32]) ).

fof(f75,plain,
    ~ in(sK0(set_difference(sK4,sK6),set_difference(sK5,sK6)),set_difference(sK5,sK6)),
    inference(resolution,[],[f54,f42]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ in(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14  % 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.15/0.35  % Computer : n022.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 10:53:27 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.21/0.36  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/tmp/tmp.pmSHzFlsJW/Vampire---4.8_19314
% 0.68/0.87  % (19547)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.68/0.87  % (19545)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 Vampire---4 for (2994ds/51Mi)
% 0.68/0.87  % (19544)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 Vampire---4 for (2994ds/34Mi)
% 0.68/0.87  % (19546)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.68/0.87  % (19548)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 Vampire---4 for (2994ds/34Mi)
% 0.68/0.87  % (19549)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.68/0.87  % (19550)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2994ds/83Mi)
% 0.68/0.87  % (19551)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2994ds/56Mi)
% 0.68/0.87  % (19551)Also succeeded, but the first one will report.
% 0.68/0.87  % (19548)First to succeed.
% 0.68/0.87  % (19549)Refutation not found, incomplete strategy% (19549)------------------------------
% 0.68/0.87  % (19549)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.87  % (19549)Termination reason: Refutation not found, incomplete strategy
% 0.68/0.87  
% 0.68/0.87  % (19549)Memory used [KB]: 976
% 0.68/0.88  % (19549)Time elapsed: 0.003 s
% 0.68/0.88  % (19549)Instructions burned: 3 (million)
% 0.68/0.88  % (19549)------------------------------
% 0.68/0.88  % (19549)------------------------------
% 0.72/0.88  % (19547)Also succeeded, but the first one will report.
% 0.72/0.88  % (19548)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19523"
% 0.72/0.88  % (19548)Refutation found. Thanks to Tanya!
% 0.72/0.88  % SZS status Theorem for Vampire---4
% 0.72/0.88  % SZS output start Proof for Vampire---4
% See solution above
% 0.72/0.88  % (19548)------------------------------
% 0.72/0.88  % (19548)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.88  % (19548)Termination reason: Refutation
% 0.72/0.88  
% 0.72/0.88  % (19548)Memory used [KB]: 1051
% 0.72/0.88  % (19548)Time elapsed: 0.004 s
% 0.72/0.88  % (19548)Instructions burned: 5 (million)
% 0.72/0.88  % (19523)Success in time 0.515 s
% 0.72/0.88  % Vampire---4.8 exiting
%------------------------------------------------------------------------------