TSTP Solution File: SEU746_8 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU746_8 : TPTP v8.1.2. Released v8.0.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 : 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 : Wed May  1 03:54:45 EDT 2024

% Result   : Theorem 0.57s 0.73s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   26 (   7 unt;   1 typ;   0 def)
%            Number of atoms       :  285 (  34 equ)
%            Maximal formula atoms :   18 (  11 avg)
%            Number of connectives :  171 (  42   ~;  34   |;  51   &)
%                                         (   1 <=>;  43  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  173 ( 140 fml;  33 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (   9 usr;   8 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   66 (  41   !;  25   ?;  17   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_7,type,
    sK3: $o ).

tff(f36,plain,
    $false,
    inference(unit_resulting_resolution,[],[f27,f28,f22,f29]) ).

tff(f29,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ~ in(X2,binunion(X0,X1))
      | in(X2,X0)
      | in(X2,X1) ),
    inference(subsumption_resolution,[],[f26,f18]) ).

tff(f18,plain,
    binunionE,
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ( ( $true != sK3 )
    & ( ( $true = sK3 )
      | ~ in(sK4,sK2) )
    & ( ( $true = sK3 )
      | ~ in(sK4,sK1) )
    & in(sK4,binunion(sK1,sK2))
    & in(sK4,sK0)
    & in(sK2,powerset(sK0))
    & in(sK1,powerset(sK0))
    & binunionE ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f11,f16,f15,f14]) ).

tff(f14,plain,
    ( ? [X0,X1] :
        ( ? [X2] :
            ( ? [X3: $o,X4] :
                ( ( $true != (X3) )
                & ( ( $true = (X3) )
                  | ~ in(X4,X2) )
                & ( ( $true = (X3) )
                  | ~ in(X4,X1) )
                & in(X4,binunion(X1,X2))
                & in(X4,X0) )
            & in(X2,powerset(X0)) )
        & in(X1,powerset(X0)) )
   => ( ? [X2] :
          ( ? [X4,X3: $o] :
              ( ( $true != (X3) )
              & ( ( $true = (X3) )
                | ~ in(X4,X2) )
              & ( ( $true = (X3) )
                | ~ in(X4,sK1) )
              & in(X4,binunion(sK1,X2))
              & in(X4,sK0) )
          & in(X2,powerset(sK0)) )
      & in(sK1,powerset(sK0)) ) ),
    introduced(choice_axiom,[]) ).

tff(f15,plain,
    ( ? [X2] :
        ( ? [X4,X3: $o] :
            ( ( $true != (X3) )
            & ( ( $true = (X3) )
              | ~ in(X4,X2) )
            & ( ( $true = (X3) )
              | ~ in(X4,sK1) )
            & in(X4,binunion(sK1,X2))
            & in(X4,sK0) )
        & in(X2,powerset(sK0)) )
   => ( ? [X4,X3: $o] :
          ( ( $true != (X3) )
          & ( ( $true = (X3) )
            | ~ in(X4,sK2) )
          & ( ( $true = (X3) )
            | ~ in(X4,sK1) )
          & in(X4,binunion(sK1,sK2))
          & in(X4,sK0) )
      & in(sK2,powerset(sK0)) ) ),
    introduced(choice_axiom,[]) ).

tff(f16,plain,
    ( ? [X4,X3: $o] :
        ( ( $true != (X3) )
        & ( ( $true = (X3) )
          | ~ in(X4,sK2) )
        & ( ( $true = (X3) )
          | ~ in(X4,sK1) )
        & in(X4,binunion(sK1,sK2))
        & in(X4,sK0) )
   => ( ( $true != sK3 )
      & ( ( $true = sK3 )
        | ~ in(sK4,sK2) )
      & ( ( $true = sK3 )
        | ~ in(sK4,sK1) )
      & in(sK4,binunion(sK1,sK2))
      & in(sK4,sK0) ) ),
    introduced(choice_axiom,[]) ).

tff(f11,plain,
    ( ? [X0,X1] :
        ( ? [X2] :
            ( ? [X3: $o,X4] :
                ( ( $true != (X3) )
                & ( ( $true = (X3) )
                  | ~ in(X4,X2) )
                & ( ( $true = (X3) )
                  | ~ in(X4,X1) )
                & in(X4,binunion(X1,X2))
                & in(X4,X0) )
            & in(X2,powerset(X0)) )
        & in(X1,powerset(X0)) )
    & binunionE ),
    inference(flattening,[],[f10]) ).

tff(f10,plain,
    ( ? [X0,X1] :
        ( ? [X2] :
            ( ? [X3: $o,X4] :
                ( ( $true != (X3) )
                & ( ( $true = (X3) )
                  | ~ in(X4,X2) )
                & ( ( $true = (X3) )
                  | ~ in(X4,X1) )
                & in(X4,binunion(X1,X2))
                & in(X4,X0) )
            & in(X2,powerset(X0)) )
        & in(X1,powerset(X0)) )
    & binunionE ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,plain,
    ~ ( binunionE
     => ! [X0,X1] :
          ( in(X1,powerset(X0))
         => ! [X2] :
              ( in(X2,powerset(X0))
             => ! [X3: $o,X4] :
                  ( in(X4,X0)
                 => ( in(X4,binunion(X1,X2))
                   => ( ( in(X4,X1)
                       => ( $true = (X3) ) )
                     => ( ( in(X4,X2)
                         => ( $true = (X3) ) )
                       => ( $true = (X3) ) ) ) ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

tff(f7,plain,
    ~ ( binunionE
     => ! [X0,X1] :
          ( in(X1,powerset(X0))
         => ! [X2] :
              ( in(X2,powerset(X0))
             => ! [X3: $o,X4] :
                  ( in(X4,X0)
                 => ( in(X4,binunion(X1,X2))
                   => ( ( in(X4,X1)
                       => (X3) )
                     => ( ( in(X4,X2)
                         => (X3) )
                       => (X3) ) ) ) ) ) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,negated_conjecture,
    ~ ( binunionE
     => ! [X0,X3] :
          ( in(X3,powerset(X0))
         => ! [X4] :
              ( in(X4,powerset(X0))
             => ! [X5: $o,X2] :
                  ( in(X2,X0)
                 => ( in(X2,binunion(X3,X4))
                   => ( ( in(X2,X3)
                       => (X5) )
                     => ( ( in(X2,X4)
                         => (X5) )
                       => (X5) ) ) ) ) ) ) ),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    ( binunionE
   => ! [X0,X3] :
        ( in(X3,powerset(X0))
       => ! [X4] :
            ( in(X4,powerset(X0))
           => ! [X5: $o,X2] :
                ( in(X2,X0)
               => ( in(X2,binunion(X3,X4))
                 => ( ( in(X2,X3)
                     => (X5) )
                   => ( ( in(X2,X4)
                       => (X5) )
                     => (X5) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.moUPhZLqTV/Vampire---4.8_31337',binunionTE) ).

tff(f26,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( in(X2,X1)
      | in(X2,X0)
      | ~ in(X2,binunion(X0,X1))
      | ~ binunionE ),
    inference(cnf_transformation,[],[f13]) ).

tff(f13,plain,
    ( ! [X0,X1,X2] :
        ( in(X2,X1)
        | in(X2,X0)
        | ~ in(X2,binunion(X0,X1)) )
    | ~ binunionE ),
    inference(flattening,[],[f12]) ).

tff(f12,plain,
    ( ! [X0,X1,X2] :
        ( in(X2,X1)
        | in(X2,X0)
        | ~ in(X2,binunion(X0,X1)) )
    | ~ binunionE ),
    inference(ennf_transformation,[],[f9]) ).

tff(f9,plain,
    ( binunionE
   => ! [X0,X1,X2] :
        ( in(X2,binunion(X0,X1))
       => ( in(X2,X1)
          | in(X2,X0) ) ) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

tff(f6,plain,
    ( binunionE
  <=> ! [X0,X1,X2] :
        ( in(X2,binunion(X0,X1))
       => ( in(X2,X1)
          | in(X2,X0) ) ) ),
    inference(fool_elimination,[],[f1]) ).

tff(f1,axiom,
    ( binunionE
    = ( ! [X0,X1,X2] :
          ( in(X2,binunion(X0,X1))
         => ( in(X2,X1)
            | in(X2,X0) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.moUPhZLqTV/Vampire---4.8_31337',binunionE) ).

tff(f22,plain,
    in(sK4,binunion(sK1,sK2)),
    inference(cnf_transformation,[],[f17]) ).

tff(f28,plain,
    ~ in(sK4,sK1),
    inference(subsumption_resolution,[],[f23,f25]) ).

tff(f25,plain,
    $true != sK3,
    inference(cnf_transformation,[],[f17]) ).

tff(f23,plain,
    ( ( $true = sK3 )
    | ~ in(sK4,sK1) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f27,plain,
    ~ in(sK4,sK2),
    inference(subsumption_resolution,[],[f24,f25]) ).

tff(f24,plain,
    ( ( $true = sK3 )
    | ~ in(sK4,sK2) ),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SEU746_8 : TPTP v8.1.2. Released v8.0.0.
% 0.06/0.14  % 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.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Apr 30 16:07:06 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TX0_THM_EQU_NAR problem
% 0.13/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.moUPhZLqTV/Vampire---4.8_31337
% 0.57/0.73  % (31806)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.57/0.73  % (31806)Refutation not found, incomplete strategy% (31806)------------------------------
% 0.57/0.73  % (31806)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.73  % (31806)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.73  
% 0.57/0.73  % (31806)Memory used [KB]: 949
% 0.57/0.73  % (31806)Time elapsed: 0.002 s
% 0.57/0.73  % (31806)Instructions burned: 2 (million)
% 0.57/0.73  % (31806)------------------------------
% 0.57/0.73  % (31806)------------------------------
% 0.57/0.73  % (31802)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.57/0.73  % (31803)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.57/0.73  % (31801)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.57/0.73  % (31804)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.57/0.73  % (31805)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.57/0.73  % (31807)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.57/0.73  % (31803)First to succeed.
% 0.57/0.73  % (31807)Also succeeded, but the first one will report.
% 0.57/0.73  % (31800)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.57/0.73  % (31802)Also succeeded, but the first one will report.
% 0.57/0.73  % (31803)Refutation found. Thanks to Tanya!
% 0.57/0.73  % SZS status Theorem for Vampire---4
% 0.57/0.73  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.73  % (31803)------------------------------
% 0.57/0.73  % (31803)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.73  % (31803)Termination reason: Refutation
% 0.57/0.73  
% 0.57/0.73  % (31803)Memory used [KB]: 963
% 0.57/0.73  % (31803)Time elapsed: 0.004 s
% 0.57/0.73  % (31803)Instructions burned: 4 (million)
% 0.57/0.73  % (31803)------------------------------
% 0.57/0.73  % (31803)------------------------------
% 0.57/0.73  % (31626)Success in time 0.373 s
% 0.57/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------