TSTP Solution File: LAT382+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LAT382+3 : 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 : n013.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 07:25:13 EDT 2024

% Result   : Theorem 0.58s 0.78s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   46 (  18 unt;   1 typ;   0 def)
%            Number of atoms       :  386 (   9 equ)
%            Maximal formula atoms :   22 (   8 avg)
%            Number of connectives :  198 (  64   ~;  51   |;  62   &)
%                                         (   3 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  207 ( 207 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   17 (  15 usr;   7 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   48 (  43   !;   4   ?;  12   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

tff(f178,plain,
    $false,
    inference(avatar_sat_refutation,[],[f126,f151,f177]) ).

tff(f177,plain,
    ( ~ spl6_4
    | ~ spl6_2 ),
    inference(avatar_split_clause,[],[f176,f120,f135]) ).

tff(f135,plain,
    ( spl6_4
  <=> sdtlseqdt0(xu,xv) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).

tff(f120,plain,
    ( spl6_2
  <=> sdtlseqdt0(xv,xu) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).

tff(f176,plain,
    ( ~ sdtlseqdt0(xu,xv)
    | ~ spl6_2 ),
    inference(subsumption_resolution,[],[f175,f105]) ).

tff(f105,plain,
    aElement0(xu),
    inference(subsumption_resolution,[],[f102,f54]) ).

tff(f54,plain,
    aSet0(xT),
    inference(cnf_transformation,[],[f15]) ).

tff(f15,axiom,
    aSet0(xT),
    file('/export/starexec/sandbox2/tmp/tmp.p57sW2Wwxg/Vampire---4.8_26930',m__773) ).

tff(f102,plain,
    ( aElement0(xu)
    | ~ aSet0(xT) ),
    inference(resolution,[],[f79,f58]) ).

tff(f58,plain,
    aElementOf0(xu,xT),
    inference(cnf_transformation,[],[f38]) ).

tff(f38,plain,
    ( aInfimumOfIn0(xv,xS,xT)
    & ! [X0] :
        ( sdtlseqdt0(X0,xv)
        | ( ~ aLowerBoundOfIn0(X0,xS,xT)
          & ( ( ~ sdtlseqdt0(X0,sK0(X0))
              & aElementOf0(sK0(X0),xS) )
            | ~ aElementOf0(X0,xT) ) ) )
    & aLowerBoundOfIn0(xv,xS,xT)
    & ! [X2] :
        ( sdtlseqdt0(xv,X2)
        | ~ aElementOf0(X2,xS) )
    & aElementOf0(xv,xT)
    & aElementOf0(xv,xT)
    & aInfimumOfIn0(xu,xS,xT)
    & ! [X3] :
        ( sdtlseqdt0(X3,xu)
        | ( ~ aLowerBoundOfIn0(X3,xS,xT)
          & ( ( ~ sdtlseqdt0(X3,sK1(X3))
              & aElementOf0(sK1(X3),xS) )
            | ~ aElementOf0(X3,xT) ) ) )
    & aLowerBoundOfIn0(xu,xS,xT)
    & ! [X5] :
        ( sdtlseqdt0(xu,X5)
        | ~ aElementOf0(X5,xS) )
    & aElementOf0(xu,xT)
    & aElementOf0(xu,xT) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f37,f36]) ).

tff(f36,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ sdtlseqdt0(X0,X1)
          & aElementOf0(X1,xS) )
     => ( ~ sdtlseqdt0(X0,sK0(X0))
        & aElementOf0(sK0(X0),xS) ) ),
    introduced(choice_axiom,[]) ).

tff(f37,plain,
    ! [X3] :
      ( ? [X4] :
          ( ~ sdtlseqdt0(X3,X4)
          & aElementOf0(X4,xS) )
     => ( ~ sdtlseqdt0(X3,sK1(X3))
        & aElementOf0(sK1(X3),xS) ) ),
    introduced(choice_axiom,[]) ).

tff(f26,plain,
    ( aInfimumOfIn0(xv,xS,xT)
    & ! [X0] :
        ( sdtlseqdt0(X0,xv)
        | ( ~ aLowerBoundOfIn0(X0,xS,xT)
          & ( ? [X1] :
                ( ~ sdtlseqdt0(X0,X1)
                & aElementOf0(X1,xS) )
            | ~ aElementOf0(X0,xT) ) ) )
    & aLowerBoundOfIn0(xv,xS,xT)
    & ! [X2] :
        ( sdtlseqdt0(xv,X2)
        | ~ aElementOf0(X2,xS) )
    & aElementOf0(xv,xT)
    & aElementOf0(xv,xT)
    & aInfimumOfIn0(xu,xS,xT)
    & ! [X3] :
        ( sdtlseqdt0(X3,xu)
        | ( ~ aLowerBoundOfIn0(X3,xS,xT)
          & ( ? [X4] :
                ( ~ sdtlseqdt0(X3,X4)
                & aElementOf0(X4,xS) )
            | ~ aElementOf0(X3,xT) ) ) )
    & aLowerBoundOfIn0(xu,xS,xT)
    & ! [X5] :
        ( sdtlseqdt0(xu,X5)
        | ~ aElementOf0(X5,xS) )
    & aElementOf0(xu,xT)
    & aElementOf0(xu,xT) ),
    inference(ennf_transformation,[],[f20]) ).

tff(f20,plain,
    ( aInfimumOfIn0(xv,xS,xT)
    & ! [X0] :
        ( ( aLowerBoundOfIn0(X0,xS,xT)
          | ( ! [X1] :
                ( aElementOf0(X1,xS)
               => sdtlseqdt0(X0,X1) )
            & aElementOf0(X0,xT) ) )
       => sdtlseqdt0(X0,xv) )
    & aLowerBoundOfIn0(xv,xS,xT)
    & ! [X2] :
        ( aElementOf0(X2,xS)
       => sdtlseqdt0(xv,X2) )
    & aElementOf0(xv,xT)
    & aElementOf0(xv,xT)
    & aInfimumOfIn0(xu,xS,xT)
    & ! [X3] :
        ( ( aLowerBoundOfIn0(X3,xS,xT)
          | ( ! [X4] :
                ( aElementOf0(X4,xS)
               => sdtlseqdt0(X3,X4) )
            & aElementOf0(X3,xT) ) )
       => sdtlseqdt0(X3,xu) )
    & aLowerBoundOfIn0(xu,xS,xT)
    & ! [X5] :
        ( aElementOf0(X5,xS)
       => sdtlseqdt0(xu,X5) )
    & aElementOf0(xu,xT)
    & aElementOf0(xu,xT) ),
    inference(rectify,[],[f17]) ).

tff(f17,axiom,
    ( aInfimumOfIn0(xv,xS,xT)
    & ! [X0] :
        ( ( aLowerBoundOfIn0(X0,xS,xT)
          | ( ! [X1] :
                ( aElementOf0(X1,xS)
               => sdtlseqdt0(X0,X1) )
            & aElementOf0(X0,xT) ) )
       => sdtlseqdt0(X0,xv) )
    & aLowerBoundOfIn0(xv,xS,xT)
    & ! [X0] :
        ( aElementOf0(X0,xS)
       => sdtlseqdt0(xv,X0) )
    & aElementOf0(xv,xT)
    & aElementOf0(xv,xT)
    & aInfimumOfIn0(xu,xS,xT)
    & ! [X0] :
        ( ( aLowerBoundOfIn0(X0,xS,xT)
          | ( ! [X1] :
                ( aElementOf0(X1,xS)
               => sdtlseqdt0(X0,X1) )
            & aElementOf0(X0,xT) ) )
       => sdtlseqdt0(X0,xu) )
    & aLowerBoundOfIn0(xu,xS,xT)
    & ! [X0] :
        ( aElementOf0(X0,xS)
       => sdtlseqdt0(xu,X0) )
    & aElementOf0(xu,xT)
    & aElementOf0(xu,xT) ),
    file('/export/starexec/sandbox2/tmp/tmp.p57sW2Wwxg/Vampire---4.8_26930',m__792) ).

tff(f79,plain,
    ! [X0: $i,X1: $i] :
      ( ~ aElementOf0(X1,X0)
      | aElement0(X1)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f28]) ).

tff(f28,plain,
    ! [X0] :
      ( ! [X1] :
          ( aElement0(X1)
          | ~ aElementOf0(X1,X0) )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ! [X1] :
          ( aElementOf0(X1,X0)
         => aElement0(X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.p57sW2Wwxg/Vampire---4.8_26930',mEOfElem) ).

tff(f175,plain,
    ( ~ sdtlseqdt0(xu,xv)
    | ~ aElement0(xu)
    | ~ spl6_2 ),
    inference(subsumption_resolution,[],[f174,f106]) ).

tff(f106,plain,
    aElement0(xv),
    inference(subsumption_resolution,[],[f103,f54]) ).

tff(f103,plain,
    ( aElement0(xv)
    | ~ aSet0(xT) ),
    inference(resolution,[],[f79,f66]) ).

tff(f66,plain,
    aElementOf0(xv,xT),
    inference(cnf_transformation,[],[f38]) ).

tff(f174,plain,
    ( ~ sdtlseqdt0(xu,xv)
    | ~ aElement0(xv)
    | ~ aElement0(xu)
    | ~ spl6_2 ),
    inference(subsumption_resolution,[],[f173,f122]) ).

tff(f122,plain,
    ( sdtlseqdt0(xv,xu)
    | ~ spl6_2 ),
    inference(avatar_component_clause,[],[f120]) ).

tff(f173,plain,
    ( ~ sdtlseqdt0(xv,xu)
    | ~ sdtlseqdt0(xu,xv)
    | ~ aElement0(xv)
    | ~ aElement0(xu) ),
    inference(resolution,[],[f94,f93]) ).

tff(f93,plain,
    ~ sQ5_eqProxy($i,xu,xv),
    inference(equality_proxy_replacement,[],[f74,f92]) ).

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

tff(f74,plain,
    xu != xv,
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    xu != xv,
    inference(flattening,[],[f19]) ).

tff(f19,negated_conjecture,
    ( ~ xu = xv ),
    inference(negated_conjecture,[],[f18]) ).

tff(f18,conjecture,
    xu = xv,
    file('/export/starexec/sandbox2/tmp/tmp.p57sW2Wwxg/Vampire---4.8_26930',m__) ).

tff(f94,plain,
    ! [X0: $i,X1: $i] :
      ( sQ5_eqProxy($i,X0,X1)
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | ~ aElement0(X1)
      | ~ aElement0(X0) ),
    inference(equality_proxy_replacement,[],[f85,f92]) ).

tff(f85,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | ~ aElement0(X1)
      | ~ aElement0(X0) ),
    inference(cnf_transformation,[],[f33]) ).

tff(f33,plain,
    ! [X0,X1] :
      ( ( X0 = X1 )
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | ~ aElement0(X1)
      | ~ aElement0(X0) ),
    inference(flattening,[],[f32]) ).

tff(f32,plain,
    ! [X0,X1] :
      ( ( X0 = X1 )
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | ~ aElement0(X1)
      | ~ aElement0(X0) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,axiom,
    ! [X0,X1] :
      ( ( aElement0(X1)
        & aElement0(X0) )
     => ( ( sdtlseqdt0(X1,X0)
          & sdtlseqdt0(X0,X1) )
       => ( X0 = X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.p57sW2Wwxg/Vampire---4.8_26930',mASymm) ).

tff(f151,plain,
    spl6_4,
    inference(avatar_split_clause,[],[f99,f135]) ).

tff(f99,plain,
    sdtlseqdt0(xu,xv),
    inference(resolution,[],[f72,f61]) ).

tff(f61,plain,
    aLowerBoundOfIn0(xu,xS,xT),
    inference(cnf_transformation,[],[f38]) ).

tff(f72,plain,
    ! [X0: $i] :
      ( ~ aLowerBoundOfIn0(X0,xS,xT)
      | sdtlseqdt0(X0,xv) ),
    inference(cnf_transformation,[],[f38]) ).

tff(f126,plain,
    spl6_2,
    inference(avatar_split_clause,[],[f98,f120]) ).

tff(f98,plain,
    sdtlseqdt0(xv,xu),
    inference(resolution,[],[f64,f69]) ).

tff(f69,plain,
    aLowerBoundOfIn0(xv,xS,xT),
    inference(cnf_transformation,[],[f38]) ).

tff(f64,plain,
    ! [X3: $i] :
      ( ~ aLowerBoundOfIn0(X3,xS,xT)
      | sdtlseqdt0(X3,xu) ),
    inference(cnf_transformation,[],[f38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : LAT382+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.13/0.36  % Computer : n013.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Fri May  3 12:12:49 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.13/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.37  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.p57sW2Wwxg/Vampire---4.8_26930
% 0.58/0.78  % (27038)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.58/0.78  % (27041)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.58/0.78  % (27040)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.58/0.78  % (27042)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.58/0.78  % (27039)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.58/0.78  % (27044)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.58/0.78  % (27045)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.58/0.78  % (27038)First to succeed.
% 0.58/0.78  % (27041)Refutation not found, incomplete strategy% (27041)------------------------------
% 0.58/0.78  % (27041)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.78  % (27041)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.78  
% 0.58/0.78  % (27041)Memory used [KB]: 1044
% 0.58/0.78  % (27041)Time elapsed: 0.003 s
% 0.58/0.78  % (27041)Instructions burned: 4 (million)
% 0.58/0.78  % (27041)------------------------------
% 0.58/0.78  % (27041)------------------------------
% 0.58/0.78  % (27045)Also succeeded, but the first one will report.
% 0.58/0.78  % (27043)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.58/0.78  % (27038)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27037"
% 0.58/0.78  % (27038)Refutation found. Thanks to Tanya!
% 0.58/0.78  % SZS status Theorem for Vampire---4
% 0.58/0.78  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.79  % (27038)------------------------------
% 0.58/0.79  % (27038)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.79  % (27038)Termination reason: Refutation
% 0.58/0.79  
% 0.58/0.79  % (27038)Memory used [KB]: 1063
% 0.58/0.79  % (27038)Time elapsed: 0.004 s
% 0.58/0.79  % (27038)Instructions burned: 6 (million)
% 0.58/0.79  % (27037)Success in time 0.403 s
% 0.58/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------