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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n008.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 : Wed May  1 03:50:11 EDT 2024

% Result   : Theorem 0.59s 0.75s
% Output   : Refutation 0.59s
% 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(f84,plain,
    $false,
    inference(subsumption_resolution,[],[f83,f71]) ).

fof(f71,plain,
    in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),sK0),
    inference(resolution,[],[f67,f56]) ).

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

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

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ( ( in(sK3(X0,X1,X2),X1)
            | ~ in(sK3(X0,X1,X2),X0)
            | ~ in(sK3(X0,X1,X2),X2) )
          & ( ( ~ in(sK3(X0,X1,X2),X1)
              & in(sK3(X0,X1,X2),X0) )
            | in(sK3(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,[sK3])],[f28,f29]) ).

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

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) ) ) )
      & ( ! [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,[],[f27]) ).

fof(f27,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,[],[f26]) ).

fof(f26,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/sandbox/tmp/tmp.P5ZNyVWdys/Vampire---4.8_28423',d4_xboole_0) ).

fof(f67,plain,
    in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),set_difference(sK0,sK2)),
    inference(resolution,[],[f36,f47]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK4(X0,X1),X0) ),
    inference(cnf_transformation,[],[f34]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK4(X0,X1),X1)
          & in(sK4(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f32,f33]) ).

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

fof(f32,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,[],[f31]) ).

fof(f31,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/sandbox/tmp/tmp.P5ZNyVWdys/Vampire---4.8_28423',d3_tarski) ).

fof(f36,plain,
    ~ subset(set_difference(sK0,sK2),set_difference(sK1,sK2)),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ( ~ subset(set_difference(sK0,sK2),set_difference(sK1,sK2))
    & subset(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f24]) ).

fof(f24,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(set_difference(X0,X2),set_difference(X1,X2))
        & subset(X0,X1) )
   => ( ~ subset(set_difference(sK0,sK2),set_difference(sK1,sK2))
      & subset(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,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/sandbox/tmp/tmp.P5ZNyVWdys/Vampire---4.8_28423',t33_xboole_1) ).

fof(f83,plain,
    ~ in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),sK0),
    inference(resolution,[],[f79,f66]) ).

fof(f66,plain,
    ! [X0] :
      ( in(X0,sK1)
      | ~ in(X0,sK0) ),
    inference(resolution,[],[f35,f46]) ).

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

fof(f35,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f25]) ).

fof(f79,plain,
    ~ in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),sK1),
    inference(subsumption_resolution,[],[f78,f72]) ).

fof(f72,plain,
    ~ in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),sK2),
    inference(resolution,[],[f67,f55]) ).

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

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

fof(f78,plain,
    ( in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),sK2)
    | ~ in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),sK1) ),
    inference(resolution,[],[f68,f54]) ).

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

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

fof(f68,plain,
    ~ in(sK4(set_difference(sK0,sK2),set_difference(sK1,sK2)),set_difference(sK1,sK2)),
    inference(resolution,[],[f36,f48]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ in(sK4(X0,X1),X1) ),
    inference(cnf_transformation,[],[f34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.15  % 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.14/0.36  % Computer : n008.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Apr 30 16:10:27 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36  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/tmp/tmp.P5ZNyVWdys/Vampire---4.8_28423
% 0.59/0.75  % (28826)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 (2996ds/56Mi)
% 0.59/0.75  % (28819)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 (2996ds/34Mi)
% 0.59/0.75  % (28820)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 (2996ds/51Mi)
% 0.59/0.75  % (28821)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.75  % (28822)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.75  % (28826)First to succeed.
% 0.59/0.75  % (28823)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 (2996ds/34Mi)
% 0.59/0.75  % (28824)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.75  % (28825)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 (2996ds/83Mi)
% 0.59/0.75  % (28826)Refutation found. Thanks to Tanya!
% 0.59/0.75  % SZS status Theorem for Vampire---4
% 0.59/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75  % (28826)------------------------------
% 0.59/0.75  % (28826)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75  % (28826)Termination reason: Refutation
% 0.59/0.75  
% 0.59/0.75  % (28826)Memory used [KB]: 982
% 0.59/0.75  % (28826)Time elapsed: 0.003 s
% 0.59/0.75  % (28826)Instructions burned: 4 (million)
% 0.59/0.75  % (28826)------------------------------
% 0.59/0.75  % (28826)------------------------------
% 0.59/0.75  % (28671)Success in time 0.383 s
% 0.59/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------