TSTP Solution File: RNG087+2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : RNG087+2 : 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/sandbox/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 : Wed May  1 03:41:47 EDT 2024

% Result   : Theorem 0.59s 0.81s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   76 (  16 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   68 (  16   ~;  12   |;  36   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   20 (   4   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f198,plain,
    $false,
    inference(avatar_sat_refutation,[],[f193,f195,f197]) ).

fof(f197,plain,
    spl12_5,
    inference(avatar_contradiction_clause,[],[f196]) ).

fof(f196,plain,
    ( $false
    | spl12_5 ),
    inference(resolution,[],[f192,f147]) ).

fof(f147,plain,
    aElementOf0(sK9,xJ),
    inference(cnf_transformation,[],[f86]) ).

fof(f86,plain,
    ( aElement0(xz)
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & xy = sdtpldt0(sK8,sK9)
    & aElementOf0(sK9,xJ)
    & aElementOf0(sK8,xI)
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & xx = sdtpldt0(sK10,sK11)
    & aElementOf0(sK11,xJ)
    & aElementOf0(sK10,xI) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f35,f85,f84]) ).

fof(f84,plain,
    ( ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xy
        & aElementOf0(X1,xJ)
        & aElementOf0(X0,xI) )
   => ( xy = sdtpldt0(sK8,sK9)
      & aElementOf0(sK9,xJ)
      & aElementOf0(sK8,xI) ) ),
    introduced(choice_axiom,[]) ).

fof(f85,plain,
    ( ? [X2,X3] :
        ( xx = sdtpldt0(X2,X3)
        & aElementOf0(X3,xJ)
        & aElementOf0(X2,xI) )
   => ( xx = sdtpldt0(sK10,sK11)
      & aElementOf0(sK11,xJ)
      & aElementOf0(sK10,xI) ) ),
    introduced(choice_axiom,[]) ).

fof(f35,plain,
    ( aElement0(xz)
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xy
        & aElementOf0(X1,xJ)
        & aElementOf0(X0,xI) )
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & ? [X2,X3] :
        ( xx = sdtpldt0(X2,X3)
        & aElementOf0(X3,xJ)
        & aElementOf0(X2,xI) ) ),
    inference(rectify,[],[f26]) ).

fof(f26,axiom,
    ( aElement0(xz)
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xy
        & aElementOf0(X1,xJ)
        & aElementOf0(X0,xI) )
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xx
        & aElementOf0(X1,xJ)
        & aElementOf0(X0,xI) ) ),
    file('/export/starexec/sandbox/tmp/tmp.mtZ2pTm42O/Vampire---4.8_18435',m__901) ).

fof(f192,plain,
    ( ~ aElementOf0(sK9,xJ)
    | spl12_5 ),
    inference(avatar_component_clause,[],[f190]) ).

fof(f190,plain,
    ( spl12_5
  <=> aElementOf0(sK9,xJ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).

fof(f195,plain,
    spl12_4,
    inference(avatar_contradiction_clause,[],[f194]) ).

fof(f194,plain,
    ( $false
    | spl12_4 ),
    inference(resolution,[],[f188,f146]) ).

fof(f146,plain,
    aElementOf0(sK8,xI),
    inference(cnf_transformation,[],[f86]) ).

fof(f188,plain,
    ( ~ aElementOf0(sK8,xI)
    | spl12_4 ),
    inference(avatar_component_clause,[],[f186]) ).

fof(f186,plain,
    ( spl12_4
  <=> aElementOf0(sK8,xI) ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).

fof(f193,plain,
    ( ~ spl12_4
    | ~ spl12_5 ),
    inference(avatar_split_clause,[],[f184,f190,f186]) ).

fof(f184,plain,
    ( ~ aElementOf0(sK9,xJ)
    | ~ aElementOf0(sK8,xI) ),
    inference(trivial_inequality_removal,[],[f183]) ).

fof(f183,plain,
    ( xy != xy
    | ~ aElementOf0(sK9,xJ)
    | ~ aElementOf0(sK8,xI) ),
    inference(superposition,[],[f154,f148]) ).

fof(f148,plain,
    xy = sdtpldt0(sK8,sK9),
    inference(cnf_transformation,[],[f86]) ).

fof(f154,plain,
    ! [X0,X1] :
      ( sdtpldt0(X0,X1) != xy
      | ~ aElementOf0(X1,xJ)
      | ~ aElementOf0(X0,xI) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( sdtpldt0(X0,X1) != xy
      | ~ aElementOf0(X1,xJ)
      | ~ aElementOf0(X0,xI) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,negated_conjecture,
    ~ ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xy
        & aElementOf0(X1,xJ)
        & aElementOf0(X0,xI) ),
    inference(negated_conjecture,[],[f28]) ).

fof(f28,conjecture,
    ? [X0,X1] :
      ( sdtpldt0(X0,X1) = xy
      & aElementOf0(X1,xJ)
      & aElementOf0(X0,xI) ),
    file('/export/starexec/sandbox/tmp/tmp.mtZ2pTm42O/Vampire---4.8_18435',m__) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : RNG087+2 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12  % 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.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Apr 30 17:27:34 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33  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.mtZ2pTm42O/Vampire---4.8_18435
% 0.59/0.81  % (18550)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.59/0.81  % (18549)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.59/0.81  % (18548)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.59/0.81  % (18546)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.59/0.81  % (18551)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.59/0.81  % (18547)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.59/0.81  % (18552)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.59/0.81  % (18553)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.59/0.81  % (18547)First to succeed.
% 0.59/0.81  % (18546)Also succeeded, but the first one will report.
% 0.59/0.81  % (18553)Refutation not found, incomplete strategy% (18553)------------------------------
% 0.59/0.81  % (18553)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.81  % (18553)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.81  
% 0.59/0.81  % (18553)Memory used [KB]: 1084
% 0.59/0.81  % (18553)Time elapsed: 0.006 s
% 0.59/0.81  % (18553)Instructions burned: 6 (million)
% 0.59/0.81  % (18553)------------------------------
% 0.59/0.81  % (18553)------------------------------
% 0.59/0.81  % (18550)Also succeeded, but the first one will report.
% 0.59/0.81  % (18547)Refutation found. Thanks to Tanya!
% 0.59/0.81  % SZS status Theorem for Vampire---4
% 0.59/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.82  % (18547)------------------------------
% 0.59/0.82  % (18547)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.82  % (18547)Termination reason: Refutation
% 0.59/0.82  
% 0.59/0.82  % (18547)Memory used [KB]: 1097
% 0.59/0.82  % (18547)Time elapsed: 0.006 s
% 0.59/0.82  % (18547)Instructions burned: 7 (million)
% 0.59/0.82  % (18547)------------------------------
% 0.59/0.82  % (18547)------------------------------
% 0.59/0.82  % (18543)Success in time 0.48 s
% 0.59/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------