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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUN089+1 : TPTP v8.2.0. Released v7.3.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 : 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 : Tue May 21 02:17:23 EDT 2024

% Result   : Theorem 0.61s 0.80s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   76 (  29   ~;  19   |;  24   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   39 (  23   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f95,plain,
    $false,
    inference(subsumption_resolution,[],[f92,f47]) ).

fof(f47,plain,
    id(sK1,sK0),
    inference(cnf_transformation,[],[f36]) ).

fof(f36,plain,
    ( r1(sK1)
    & id(sK1,sK0)
    & r2(sK2,sK0)
    & r2(sK3,sK2)
    & r1(sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f31,f35,f34,f33,f32]) ).

fof(f32,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( r1(X1)
            & id(X1,X0) )
        & ? [X2] :
            ( r2(X2,X0)
            & ? [X3] :
                ( r2(X3,X2)
                & r1(X3) ) ) )
   => ( ? [X1] :
          ( r1(X1)
          & id(X1,sK0) )
      & ? [X2] :
          ( r2(X2,sK0)
          & ? [X3] :
              ( r2(X3,X2)
              & r1(X3) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f33,plain,
    ( ? [X1] :
        ( r1(X1)
        & id(X1,sK0) )
   => ( r1(sK1)
      & id(sK1,sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f34,plain,
    ( ? [X2] :
        ( r2(X2,sK0)
        & ? [X3] :
            ( r2(X3,X2)
            & r1(X3) ) )
   => ( r2(sK2,sK0)
      & ? [X3] :
          ( r2(X3,sK2)
          & r1(X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f35,plain,
    ( ? [X3] :
        ( r2(X3,sK2)
        & r1(X3) )
   => ( r2(sK3,sK2)
      & r1(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f31,plain,
    ? [X0] :
      ( ? [X1] :
          ( r1(X1)
          & id(X1,X0) )
      & ? [X2] :
          ( r2(X2,X0)
          & ? [X3] :
              ( r2(X3,X2)
              & r1(X3) ) ) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,plain,
    ~ ! [X0] :
        ( ! [X1] :
            ( ~ r1(X1)
            | ~ id(X1,X0) )
        | ! [X2] :
            ( ~ r2(X2,X0)
            | ! [X3] :
                ( ~ r2(X3,X2)
                | ~ r1(X3) ) ) ),
    inference(rectify,[],[f20]) ).

fof(f20,negated_conjecture,
    ~ ! [X62] :
        ( ! [X39] :
            ( ~ r1(X39)
            | ~ id(X39,X62) )
        | ! [X45] :
            ( ~ r2(X45,X62)
            | ! [X46] :
                ( ~ r2(X46,X45)
                | ~ r1(X46) ) ) ),
    inference(negated_conjecture,[],[f19]) ).

fof(f19,conjecture,
    ! [X62] :
      ( ! [X39] :
          ( ~ r1(X39)
          | ~ id(X39,X62) )
      | ! [X45] :
          ( ~ r2(X45,X62)
          | ! [X46] :
              ( ~ r2(X46,X45)
              | ~ r1(X46) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerounidtwo) ).

fof(f92,plain,
    ~ id(sK1,sK0),
    inference(resolution,[],[f77,f46]) ).

fof(f46,plain,
    r2(sK2,sK0),
    inference(cnf_transformation,[],[f36]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ~ id(sK1,X1) ),
    inference(resolution,[],[f48,f52]) ).

fof(f52,plain,
    ! [X2,X0,X1] :
      ( ~ r1(X2)
      | ~ r2(X0,X1)
      | ~ id(X2,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ! [X2] :
          ( ~ r1(X2)
          | ~ id(X2,X1) ) ),
    inference(rectify,[],[f18]) ).

fof(f18,axiom,
    ! [X64,X65] :
      ( ~ r2(X64,X65)
      | ! [X66] :
          ( ~ r1(X66)
          | ~ id(X66,X65) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).

fof(f48,plain,
    r1(sK1),
    inference(cnf_transformation,[],[f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : NUN089+1 : TPTP v8.2.0. Released v7.3.0.
% 0.12/0.14  % 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.15/0.35  % Computer : n024.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sat May 18 14:50:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_NEQ problem
% 0.15/0.35  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/benchmark/theBenchmark.p
% 0.61/0.80  % (17112)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.61/0.80  % (17105)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 theBenchmark for (2995ds/34Mi)
% 0.61/0.80  % (17106)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 theBenchmark for (2995ds/51Mi)
% 0.61/0.80  % (17107)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.80  % (17109)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 theBenchmark for (2995ds/34Mi)
% 0.61/0.80  % (17110)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.61/0.80  % (17108)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.80  % (17112)First to succeed.
% 0.61/0.80  % (17111)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 theBenchmark for (2995ds/83Mi)
% 0.61/0.80  % (17112)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16926"
% 0.61/0.80  % (17112)Refutation found. Thanks to Tanya!
% 0.61/0.80  % SZS status Theorem for theBenchmark
% 0.61/0.80  % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.80  % (17112)------------------------------
% 0.61/0.80  % (17112)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80  % (17112)Termination reason: Refutation
% 0.61/0.80  
% 0.61/0.80  % (17112)Memory used [KB]: 1066
% 0.61/0.80  % (17112)Time elapsed: 0.002 s
% 0.61/0.80  % (17112)Instructions burned: 4 (million)
% 0.61/0.80  % (16926)Success in time 0.436 s
% 0.61/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------