TSTP Solution File: SEU523_8 by Vampire---4.8

View Problem - Process Solution

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

% Computer : n016.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:24:39 EDT 2024

% Result   : Theorem 0.60s 0.80s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (   7 unt;   2 typ;   0 def)
%            Number of atoms       :  223 (  20 equ)
%            Maximal formula atoms :   10 (   6 avg)
%            Number of connectives :  159 (  60   ~;  42   |;  27   &)
%                                         (   6 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  119 (  97 fml;  22 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   71 (  53   !;  18   ?;  20   :)

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

tff(pred_def_3,type,
    sQ4_eqProxy: ( $o * $o ) > $o ).

tff(f53,plain,
    $false,
    inference(subsumption_resolution,[],[f52,f23]) ).

tff(f23,plain,
    setunionAx,
    inference(cnf_transformation,[],[f19]) ).

tff(f19,plain,
    ( ( $true != sK3 )
    & ! [X3] :
        ( ( $true = sK3 )
        | ~ in(X3,sK1)
        | ~ in(sK2,X3) )
    & in(sK2,setunion(sK1))
    & setunionAx ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f18,f17]) ).

tff(f17,plain,
    ( ? [X0,X1] :
        ( ? [X2: $o] :
            ( ( $true != (X2) )
            & ! [X3] :
                ( ( $true = (X2) )
                | ~ in(X3,X0)
                | ~ in(X1,X3) ) )
        & in(X1,setunion(X0)) )
   => ( ? [X2: $o] :
          ( ( $true != (X2) )
          & ! [X3] :
              ( ( $true = (X2) )
              | ~ in(X3,sK1)
              | ~ in(sK2,X3) ) )
      & in(sK2,setunion(sK1)) ) ),
    introduced(choice_axiom,[]) ).

tff(f18,plain,
    ( ? [X2: $o] :
        ( ( $true != (X2) )
        & ! [X3] :
            ( ( $true = (X2) )
            | ~ in(X3,sK1)
            | ~ in(sK2,X3) ) )
   => ( ( $true != sK3 )
      & ! [X3] :
          ( ( $true = sK3 )
          | ~ in(X3,sK1)
          | ~ in(sK2,X3) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f12,plain,
    ( ? [X0,X1] :
        ( ? [X2: $o] :
            ( ( $true != (X2) )
            & ! [X3] :
                ( ( $true = (X2) )
                | ~ in(X3,X0)
                | ~ in(X1,X3) ) )
        & in(X1,setunion(X0)) )
    & setunionAx ),
    inference(flattening,[],[f11]) ).

tff(f11,plain,
    ( ? [X0,X1] :
        ( ? [X2: $o] :
            ( ( $true != (X2) )
            & ! [X3] :
                ( ( $true = (X2) )
                | ~ in(X3,X0)
                | ~ in(X1,X3) ) )
        & in(X1,setunion(X0)) )
    & setunionAx ),
    inference(ennf_transformation,[],[f8]) ).

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

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

tff(f3,negated_conjecture,
    ~ ( setunionAx
     => ! [X0,X1] :
          ( in(X1,setunion(X0))
         => ! [X3: $o] :
              ( ! [X2] :
                  ( in(X1,X2)
                 => ( in(X2,X0)
                   => (X3) ) )
             => (X3) ) ) ),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    ( setunionAx
   => ! [X0,X1] :
        ( in(X1,setunion(X0))
       => ! [X3: $o] :
            ( ! [X2] :
                ( in(X1,X2)
               => ( in(X2,X0)
                 => (X3) ) )
           => (X3) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.l6XQLW0Mtm/Vampire---4.8_2798',setunionE) ).

tff(f52,plain,
    ~ setunionAx,
    inference(subsumption_resolution,[],[f51,f24]) ).

tff(f24,plain,
    in(sK2,setunion(sK1)),
    inference(cnf_transformation,[],[f19]) ).

tff(f51,plain,
    ( ~ in(sK2,setunion(sK1))
    | ~ setunionAx ),
    inference(duplicate_literal_removal,[],[f50]) ).

tff(f50,plain,
    ( ~ in(sK2,setunion(sK1))
    | ~ in(sK2,setunion(sK1))
    | ~ setunionAx ),
    inference(resolution,[],[f49,f21]) ).

tff(f21,plain,
    ! [X0: $i,X1: $i] :
      ( in(sK0(X0,X1),X0)
      | ~ in(X1,setunion(X0))
      | ~ setunionAx ),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ( ! [X0,X1] :
        ( ( in(X1,setunion(X0))
          | ! [X2] :
              ( ~ in(X2,X0)
              | ~ in(X1,X2) ) )
        & ( ( in(sK0(X0,X1),X0)
            & in(X1,sK0(X0,X1)) )
          | ~ in(X1,setunion(X0)) ) )
    | ~ setunionAx ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).

tff(f15,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( in(X3,X0)
          & in(X1,X3) )
     => ( in(sK0(X0,X1),X0)
        & in(X1,sK0(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

tff(f14,plain,
    ( ! [X0,X1] :
        ( ( in(X1,setunion(X0))
          | ! [X2] :
              ( ~ in(X2,X0)
              | ~ in(X1,X2) ) )
        & ( ? [X3] :
              ( in(X3,X0)
              & in(X1,X3) )
          | ~ in(X1,setunion(X0)) ) )
    | ~ setunionAx ),
    inference(rectify,[],[f13]) ).

tff(f13,plain,
    ( ! [X0,X1] :
        ( ( in(X1,setunion(X0))
          | ! [X2] :
              ( ~ in(X2,X0)
              | ~ in(X1,X2) ) )
        & ( ? [X2] :
              ( in(X2,X0)
              & in(X1,X2) )
          | ~ in(X1,setunion(X0)) ) )
    | ~ setunionAx ),
    inference(nnf_transformation,[],[f10]) ).

tff(f10,plain,
    ( ! [X0,X1] :
        ( in(X1,setunion(X0))
      <=> ? [X2] :
            ( in(X2,X0)
            & in(X1,X2) ) )
    | ~ setunionAx ),
    inference(ennf_transformation,[],[f9]) ).

tff(f9,plain,
    ( setunionAx
   => ! [X0,X1] :
        ( in(X1,setunion(X0))
      <=> ? [X2] :
            ( in(X2,X0)
            & in(X1,X2) ) ) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

tff(f6,plain,
    ( setunionAx
  <=> ! [X0,X1] :
        ( in(X1,setunion(X0))
      <=> ? [X2] :
            ( in(X2,X0)
            & in(X1,X2) ) ) ),
    inference(fool_elimination,[],[f1]) ).

tff(f1,axiom,
    ( setunionAx
    = ( ! [X0,X1] :
          ( in(X1,setunion(X0))
        <=> ? [X2] :
              ( in(X2,X0)
              & in(X1,X2) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.l6XQLW0Mtm/Vampire---4.8_2798',setunionAx) ).

tff(f49,plain,
    ! [X0: $i] :
      ( ~ in(sK0(X0,sK2),sK1)
      | ~ in(sK2,setunion(X0)) ),
    inference(subsumption_resolution,[],[f47,f23]) ).

tff(f47,plain,
    ! [X0: $i] :
      ( ~ in(sK0(X0,sK2),sK1)
      | ~ in(sK2,setunion(X0))
      | ~ setunionAx ),
    inference(resolution,[],[f34,f20]) ).

tff(f20,plain,
    ! [X0: $i,X1: $i] :
      ( in(X1,sK0(X0,X1))
      | ~ in(X1,setunion(X0))
      | ~ setunionAx ),
    inference(cnf_transformation,[],[f16]) ).

tff(f34,plain,
    ! [X3: $i] :
      ( ~ in(sK2,X3)
      | ~ in(X3,sK1) ),
    inference(subsumption_resolution,[],[f31,f30]) ).

tff(f30,plain,
    ~ sQ4_eqProxy($true,sK3),
    inference(equality_proxy_replacement,[],[f26,f27]) ).

tff(f27,plain,
    ! [X0: $o,X1: $o] :
      ( sQ4_eqProxy((X0),(X1))
    <=> ( (X0) = (X1) ) ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).

tff(f26,plain,
    $true != sK3,
    inference(cnf_transformation,[],[f19]) ).

tff(f31,plain,
    ! [X3: $i] :
      ( sQ4_eqProxy($true,sK3)
      | ~ in(X3,sK1)
      | ~ in(sK2,X3) ),
    inference(equality_proxy_replacement,[],[f25,f27]) ).

tff(f25,plain,
    ! [X3: $i] :
      ( ( $true = sK3 )
      | ~ in(X3,sK1)
      | ~ in(sK2,X3) ),
    inference(cnf_transformation,[],[f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SEU523_8 : TPTP v8.1.2. Released v8.0.0.
% 0.02/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.10/0.31  % Computer : n016.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Fri May  3 11:51:30 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  This is a TX0_THM_EQU_NAR problem
% 0.10/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/tmp/tmp.l6XQLW0Mtm/Vampire---4.8_2798
% 0.60/0.80  % (2918)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.80  % (2913)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 (2995ds/34Mi)
% 0.60/0.80  % (2917)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 (2995ds/34Mi)
% 0.60/0.80  % (2915)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.80  % (2916)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.80  % (2914)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 (2995ds/51Mi)
% 0.60/0.80  % (2919)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 (2995ds/83Mi)
% 0.60/0.80  % (2920)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 (2995ds/56Mi)
% 0.60/0.80  % (2919)Refutation not found, incomplete strategy% (2919)------------------------------
% 0.60/0.80  % (2919)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80  % (2919)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.80  
% 0.60/0.80  % (2919)Memory used [KB]: 949
% 0.60/0.80  % (2919)Time elapsed: 0.003 s
% 0.60/0.80  % (2919)Instructions burned: 2 (million)
% 0.60/0.80  % (2917)First to succeed.
% 0.60/0.80  % (2916)Also succeeded, but the first one will report.
% 0.60/0.80  % (2915)Also succeeded, but the first one will report.
% 0.60/0.80  % (2920)Also succeeded, but the first one will report.
% 0.60/0.80  % (2919)------------------------------
% 0.60/0.80  % (2919)------------------------------
% 0.60/0.80  % (2913)Also succeeded, but the first one will report.
% 0.60/0.80  % (2917)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2907"
% 0.60/0.80  % (2914)Also succeeded, but the first one will report.
% 0.60/0.80  % (2918)Also succeeded, but the first one will report.
% 0.60/0.80  % (2917)Refutation found. Thanks to Tanya!
% 0.60/0.80  % SZS status Theorem for Vampire---4
% 0.60/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80  % (2917)------------------------------
% 0.60/0.80  % (2917)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80  % (2917)Termination reason: Refutation
% 0.60/0.80  
% 0.60/0.80  % (2917)Memory used [KB]: 979
% 0.60/0.80  % (2917)Time elapsed: 0.004 s
% 0.60/0.80  % (2917)Instructions burned: 3 (million)
% 0.60/0.80  % (2907)Success in time 0.481 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------