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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM633+1 : TPTP v8.1.2. Released v4.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 : n023.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:32:37 EDT 2024

% Result   : Theorem 0.62s 0.83s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (   7 unt;   1 typ;   0 def)
%            Number of atoms       :  337 (  23 equ)
%            Maximal formula atoms :   10 (   9 avg)
%            Number of connectives :  159 (  67   ~;  43   |;  37   &)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  211 ( 211 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   22 (  20 usr;  10 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   45 (  35   !;   9   ?;  19   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_14,type,
    sQ28_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f702,plain,
    $false,
    inference(avatar_sat_refutation,[],[f645,f701]) ).

tff(f701,plain,
    ~ spl29_5,
    inference(avatar_contradiction_clause,[],[f700]) ).

tff(f700,plain,
    ( $false
    | ~ spl29_5 ),
    inference(subsumption_resolution,[],[f699,f356]) ).

tff(f356,plain,
    aElementOf0(szDzizrdt0(xd),xT),
    inference(cnf_transformation,[],[f94]) ).

tff(f94,axiom,
    ( isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(szDzizrdt0(xd),xT) ),
    file('/export/starexec/sandbox2/tmp/tmp.izAuTTcXat/Vampire---4.8_25542',m__4854) ).

tff(f699,plain,
    ( ~ aElementOf0(szDzizrdt0(xd),xT)
    | ~ spl29_5 ),
    inference(subsumption_resolution,[],[f698,f635]) ).

tff(f635,plain,
    ( aSubsetOf0(xO,xS)
    | ~ spl29_5 ),
    inference(avatar_component_clause,[],[f634]) ).

tff(f634,plain,
    ( spl29_5
  <=> aSubsetOf0(xO,xS) ),
    introduced(avatar_definition,[new_symbols(naming,[spl29_5])]) ).

tff(f698,plain,
    ( ~ aSubsetOf0(xO,xS)
    | ~ aElementOf0(szDzizrdt0(xd),xT)
    | ~ spl29_5 ),
    inference(subsumption_resolution,[],[f697,f361]) ).

tff(f361,plain,
    isCountable0(xO),
    inference(cnf_transformation,[],[f96]) ).

tff(f96,axiom,
    ( isCountable0(xO)
    & aSet0(xO) ),
    file('/export/starexec/sandbox2/tmp/tmp.izAuTTcXat/Vampire---4.8_25542',m__4908) ).

tff(f697,plain,
    ( ~ isCountable0(xO)
    | ~ aSubsetOf0(xO,xS)
    | ~ aElementOf0(szDzizrdt0(xd),xT)
    | ~ spl29_5 ),
    inference(resolution,[],[f695,f370]) ).

tff(f370,plain,
    ! [X0: $i,X1: $i] :
      ( aElementOf0(sK10(X0,X1),slbdtsldtrb0(X1,xK))
      | ~ isCountable0(X1)
      | ~ aSubsetOf0(X1,xS)
      | ~ aElementOf0(X0,xT) ),
    inference(cnf_transformation,[],[f244]) ).

tff(f244,plain,
    ( ! [X0] :
        ( ! [X1] :
            ( ( ( sdtlpdtrp0(xc,sK10(X0,X1)) != X0 )
              & aElementOf0(sK10(X0,X1),slbdtsldtrb0(X1,xK)) )
            | ~ isCountable0(X1)
            | ~ aSubsetOf0(X1,xS) )
        | ~ aElementOf0(X0,xT) )
    & ! [X3] :
        ( ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X3) )
          & aElementOf0(X3,szDzozmdt0(xc))
          & aSubsetOf0(X3,szNzAzT0)
          & ( slcrc0 != X3 ) )
        | ~ aElementOf0(X3,slbdtsldtrb0(xO,xK)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f242,f243]) ).

tff(f243,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( sdtlpdtrp0(xc,X2) != X0 )
          & aElementOf0(X2,slbdtsldtrb0(X1,xK)) )
     => ( ( sdtlpdtrp0(xc,sK10(X0,X1)) != X0 )
        & aElementOf0(sK10(X0,X1),slbdtsldtrb0(X1,xK)) ) ),
    introduced(choice_axiom,[]) ).

tff(f242,plain,
    ( ! [X0] :
        ( ! [X1] :
            ( ? [X2] :
                ( ( sdtlpdtrp0(xc,X2) != X0 )
                & aElementOf0(X2,slbdtsldtrb0(X1,xK)) )
            | ~ isCountable0(X1)
            | ~ aSubsetOf0(X1,xS) )
        | ~ aElementOf0(X0,xT) )
    & ! [X3] :
        ( ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X3) )
          & aElementOf0(X3,szDzozmdt0(xc))
          & aSubsetOf0(X3,szNzAzT0)
          & ( slcrc0 != X3 ) )
        | ~ aElementOf0(X3,slbdtsldtrb0(xO,xK)) ) ),
    inference(rectify,[],[f132]) ).

tff(f132,plain,
    ( ! [X1] :
        ( ! [X2] :
            ( ? [X3] :
                ( ( sdtlpdtrp0(xc,X3) != X1 )
                & aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
            | ~ isCountable0(X2)
            | ~ aSubsetOf0(X2,xS) )
        | ~ aElementOf0(X1,xT) )
    & ! [X0] :
        ( ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X0) )
          & aElementOf0(X0,szDzozmdt0(xc))
          & aSubsetOf0(X0,szNzAzT0)
          & ( slcrc0 != X0 ) )
        | ~ aElementOf0(X0,slbdtsldtrb0(xO,xK)) ) ),
    inference(ennf_transformation,[],[f101]) ).

tff(f101,plain,
    ~ ( ! [X0] :
          ( aElementOf0(X0,slbdtsldtrb0(xO,xK))
         => ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X0) )
            & aElementOf0(X0,szDzozmdt0(xc))
            & aSubsetOf0(X0,szNzAzT0)
            & ( slcrc0 != X0 ) ) )
     => ? [X1] :
          ( ? [X2] :
              ( ! [X3] :
                  ( aElementOf0(X3,slbdtsldtrb0(X2,xK))
                 => ( sdtlpdtrp0(xc,X3) = X1 ) )
              & isCountable0(X2)
              & aSubsetOf0(X2,xS) )
          & aElementOf0(X1,xT) ) ),
    inference(rectify,[],[f100]) ).

tff(f100,negated_conjecture,
    ~ ( ! [X0] :
          ( aElementOf0(X0,slbdtsldtrb0(xO,xK))
         => ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X0) )
            & aElementOf0(X0,szDzozmdt0(xc))
            & aSubsetOf0(X0,szNzAzT0)
            & ( slcrc0 != X0 ) ) )
     => ? [X0] :
          ( ? [X1] :
              ( ! [X2] :
                  ( aElementOf0(X2,slbdtsldtrb0(X1,xK))
                 => ( sdtlpdtrp0(xc,X2) = X0 ) )
              & isCountable0(X1)
              & aSubsetOf0(X1,xS) )
          & aElementOf0(X0,xT) ) ),
    inference(negated_conjecture,[],[f99]) ).

tff(f99,conjecture,
    ( ! [X0] :
        ( aElementOf0(X0,slbdtsldtrb0(xO,xK))
       => ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X0) )
          & aElementOf0(X0,szDzozmdt0(xc))
          & aSubsetOf0(X0,szNzAzT0)
          & ( slcrc0 != X0 ) ) )
   => ? [X0] :
        ( ? [X1] :
            ( ! [X2] :
                ( aElementOf0(X2,slbdtsldtrb0(X1,xK))
               => ( sdtlpdtrp0(xc,X2) = X0 ) )
            & isCountable0(X1)
            & aSubsetOf0(X1,xS) )
        & aElementOf0(X0,xT) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.izAuTTcXat/Vampire---4.8_25542',m__) ).

tff(f695,plain,
    ( ~ aElementOf0(sK10(szDzizrdt0(xd),xO),slbdtsldtrb0(xO,xK))
    | ~ spl29_5 ),
    inference(subsumption_resolution,[],[f693,f356]) ).

tff(f693,plain,
    ( ~ aElementOf0(szDzizrdt0(xd),xT)
    | ~ aElementOf0(sK10(szDzizrdt0(xd),xO),slbdtsldtrb0(xO,xK))
    | ~ spl29_5 ),
    inference(resolution,[],[f688,f558]) ).

tff(f558,plain,
    ! [X3: $i] :
      ( sQ28_eqProxy($i,szDzizrdt0(xd),sdtlpdtrp0(xc,X3))
      | ~ aElementOf0(X3,slbdtsldtrb0(xO,xK)) ),
    inference(equality_proxy_replacement,[],[f369,f534]) ).

tff(f534,plain,
    ! [X0: $tType,X2: X0,X1: X0] :
      ( sQ28_eqProxy(X0,X1,X2)
    <=> ( X1 = X2 ) ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ28_eqProxy])]) ).

tff(f369,plain,
    ! [X3: $i] :
      ( ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X3) )
      | ~ aElementOf0(X3,slbdtsldtrb0(xO,xK)) ),
    inference(cnf_transformation,[],[f244]) ).

tff(f688,plain,
    ( ! [X0: $i] :
        ( ~ sQ28_eqProxy($i,X0,sdtlpdtrp0(xc,sK10(X0,xO)))
        | ~ aElementOf0(X0,xT) )
    | ~ spl29_5 ),
    inference(subsumption_resolution,[],[f682,f361]) ).

tff(f682,plain,
    ( ! [X0: $i] :
        ( ~ isCountable0(xO)
        | ~ sQ28_eqProxy($i,X0,sdtlpdtrp0(xc,sK10(X0,xO)))
        | ~ aElementOf0(X0,xT) )
    | ~ spl29_5 ),
    inference(resolution,[],[f675,f635]) ).

tff(f675,plain,
    ! [X0: $i,X1: $i] :
      ( ~ aSubsetOf0(X1,xS)
      | ~ isCountable0(X1)
      | ~ sQ28_eqProxy($i,X0,sdtlpdtrp0(xc,sK10(X0,X1)))
      | ~ aElementOf0(X0,xT) ),
    inference(resolution,[],[f610,f557]) ).

tff(f557,plain,
    ! [X0: $i,X1: $i] :
      ( ~ sQ28_eqProxy($i,sdtlpdtrp0(xc,sK10(X0,X1)),X0)
      | ~ isCountable0(X1)
      | ~ aSubsetOf0(X1,xS)
      | ~ aElementOf0(X0,xT) ),
    inference(equality_proxy_replacement,[],[f371,f534]) ).

tff(f371,plain,
    ! [X0: $i,X1: $i] :
      ( ( sdtlpdtrp0(xc,sK10(X0,X1)) != X0 )
      | ~ isCountable0(X1)
      | ~ aSubsetOf0(X1,xS)
      | ~ aElementOf0(X0,xT) ),
    inference(cnf_transformation,[],[f244]) ).

tff(f610,plain,
    ! [X0: $tType,X2: X0,X1: X0] :
      ( sQ28_eqProxy(X0,X2,X1)
      | ~ sQ28_eqProxy(X0,X1,X2) ),
    inference(equality_proxy_axiom,[],[f534]) ).

tff(f645,plain,
    spl29_5,
    inference(avatar_split_clause,[],[f365,f634]) ).

tff(f365,plain,
    aSubsetOf0(xO,xS),
    inference(cnf_transformation,[],[f98]) ).

tff(f98,axiom,
    aSubsetOf0(xO,xS),
    file('/export/starexec/sandbox2/tmp/tmp.izAuTTcXat/Vampire---4.8_25542',m__4998) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : NUM633+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.15  % 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.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Apr 30 17:06:55 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.izAuTTcXat/Vampire---4.8_25542
% 0.62/0.82  % (25783)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.62/0.82  % (25785)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.62/0.82  % (25782)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.62/0.82  % (25780)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.62/0.82  % (25781)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.62/0.82  % (25784)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.62/0.82  % (25786)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.62/0.82  % (25787)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.62/0.83  % (25780)First to succeed.
% 0.62/0.83  % (25782)Also succeeded, but the first one will report.
% 0.62/0.83  % (25780)Refutation found. Thanks to Tanya!
% 0.62/0.83  % SZS status Theorem for Vampire---4
% 0.62/0.83  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.83  % (25780)------------------------------
% 0.62/0.83  % (25780)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.83  % (25780)Termination reason: Refutation
% 0.62/0.83  
% 0.62/0.83  % (25780)Memory used [KB]: 1373
% 0.62/0.83  % (25780)Time elapsed: 0.011 s
% 0.62/0.83  % (25780)Instructions burned: 17 (million)
% 0.62/0.83  % (25780)------------------------------
% 0.62/0.83  % (25780)------------------------------
% 0.62/0.83  % (25705)Success in time 0.45 s
% 0.62/0.83  % Vampire---4.8 exiting
%------------------------------------------------------------------------------