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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUN069+2 : 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 : n032.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:11 EDT 2024

% Result   : Theorem 0.51s 0.67s
% Output   : Refutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   67 (  26 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   79 (  34   ~;  18   |;  24   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   40 (  29   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f62,plain,
    $false,
    inference(resolution,[],[f61,f47]) ).

fof(f47,plain,
    ! [X0] : r2(X0,sK4(X0)),
    inference(equality_resolution,[],[f39]) ).

fof(f39,plain,
    ! [X2,X0] :
      ( r2(X0,X2)
      | sK4(X0) != X2 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0,X2] :
      ( ( sK4(X0) = X2
        & r2(X0,X2) )
      | ( sK4(X0) != X2
        & ~ r2(X0,X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f18,f25]) ).

fof(f25,plain,
    ! [X0] :
      ( ? [X1] :
        ! [X2] :
          ( ( X1 = X2
            & r2(X0,X2) )
          | ( X1 != X2
            & ~ r2(X0,X2) ) )
     => ! [X2] :
          ( ( sK4(X0) = X2
            & r2(X0,X2) )
          | ( sK4(X0) != X2
            & ~ r2(X0,X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( X1 = X2
        & r2(X0,X2) )
      | ( X1 != X2
        & ~ r2(X0,X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X2] :
    ? [X3] :
    ! [X4] :
      ( ( X3 = X4
        & r2(X2,X4) )
      | ( X3 != X4
        & ~ r2(X2,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f61,plain,
    ! [X0] : ~ r2(sK3,X0),
    inference(resolution,[],[f59,f44]) ).

fof(f44,plain,
    r1(sK3),
    inference(equality_resolution,[],[f34]) ).

fof(f34,plain,
    ! [X1] :
      ( r1(X1)
      | sK3 != X1 ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X1] :
      ( ( sK3 = X1
        & r1(X1) )
      | ( sK3 != X1
        & ~ r1(X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f1,f23]) ).

fof(f23,plain,
    ( ? [X0] :
      ! [X1] :
        ( ( X0 = X1
          & r1(X1) )
        | ( X0 != X1
          & ~ r1(X1) ) )
   => ! [X1] :
        ( ( sK3 = X1
          & r1(X1) )
        | ( sK3 != X1
          & ~ r1(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f1,axiom,
    ? [X0] :
    ! [X1] :
      ( ( X0 = X1
        & r1(X1) )
      | ( X0 != X1
        & ~ r1(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ~ r1(X1)
      | ~ r2(X1,X0) ),
    inference(subsumption_resolution,[],[f49,f58]) ).

fof(f58,plain,
    ! [X0] : sQ5_eqProxy(X0,X0),
    inference(equality_proxy_axiom,[],[f48]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( sQ5_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ~ r2(X1,X0)
      | ~ r1(X1)
      | ~ sQ5_eqProxy(X0,X0) ),
    inference(equality_proxy_replacement,[],[f27,f48]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ r2(X1,X0)
      | ~ r1(X1)
      | X0 != X0 ),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ r2(X1,X0)
          | ~ r1(X1) )
      | X0 != X0 ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ~ ? [X0] :
        ( ? [X1] :
            ( r2(X1,X0)
            & r1(X1) )
        & X0 = X0 ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ? [X38] :
        ( ? [X21] :
            ( r2(X21,X38)
            & r1(X21) )
        & X38 = X38 ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ? [X38] :
      ( ? [X21] :
          ( r2(X21,X38)
          & r1(X21) )
      & X38 = X38 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneeqone) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : NUN069+2 : TPTP v8.2.0. Released v7.3.0.
% 0.03/0.12  % 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.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Sat May 18 14:56:22 EDT 2024
% 0.16/0.31  % CPUTime    : 
% 0.16/0.31  This is a FOF_THM_RFO_SEQ problem
% 0.16/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/benchmark/theBenchmark.p
% 0.51/0.67  % (17555)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 (2996ds/56Mi)
% 0.51/0.67  % (17550)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.67  % (17548)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 (2996ds/34Mi)
% 0.51/0.67  % (17551)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.51/0.67  % (17549)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 (2996ds/51Mi)
% 0.51/0.67  % (17551)Also succeeded, but the first one will report.
% 0.51/0.67  % (17555)First to succeed.
% 0.51/0.67  % (17555)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17547"
% 0.51/0.67  % (17550)Also succeeded, but the first one will report.
% 0.51/0.67  % (17555)Refutation found. Thanks to Tanya!
% 0.51/0.67  % SZS status Theorem for theBenchmark
% 0.51/0.67  % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.67  % (17555)------------------------------
% 0.51/0.67  % (17555)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.67  % (17555)Termination reason: Refutation
% 0.51/0.67  
% 0.51/0.67  % (17555)Memory used [KB]: 995
% 0.51/0.67  % (17555)Time elapsed: 0.003 s
% 0.51/0.67  % (17555)Instructions burned: 3 (million)
% 0.51/0.67  % (17547)Success in time 0.344 s
% 0.51/0.67  % Vampire---4.8 exiting
%------------------------------------------------------------------------------