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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET054+1 : TPTP v8.2.0. Bugfixed v5.4.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 : n009.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 03:08:18 EDT 2024

% Result   : Theorem 0.62s 0.80s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   7 unt;   0 def)
%            Number of atoms       :   26 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   27 (  13   ~;   7   |;   5   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   13 (  11   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f69,plain,
    $false,
    inference(subsumption_resolution,[],[f56,f65]) ).

fof(f65,plain,
    ! [X1] : subclass(X1,X1),
    inference(equality_resolution,[],[f57]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f51]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subclass(X1,X0)
        | ~ subclass(X0,X1) )
      & ( ( subclass(X1,X0)
          & subclass(X0,X1) )
        | X0 != X1 ) ),
    inference(flattening,[],[f50]) ).

fof(f50,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subclass(X1,X0)
        | ~ subclass(X0,X1) )
      & ( ( subclass(X1,X0)
          & subclass(X0,X1) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subclass(X1,X0)
        & subclass(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality) ).

fof(f56,plain,
    ~ subclass(sK0,sK0),
    inference(cnf_transformation,[],[f49]) ).

fof(f49,plain,
    ~ subclass(sK0,sK0),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f46,f48]) ).

fof(f48,plain,
    ( ? [X0] : ~ subclass(X0,X0)
   => ~ subclass(sK0,sK0) ),
    introduced(choice_axiom,[]) ).

fof(f46,plain,
    ? [X0] : ~ subclass(X0,X0),
    inference(ennf_transformation,[],[f45]) ).

fof(f45,negated_conjecture,
    ~ ! [X0] : subclass(X0,X0),
    inference(negated_conjecture,[],[f44]) ).

fof(f44,conjecture,
    ! [X0] : subclass(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subclass) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET054+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.14/0.13  % 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.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 13:03:53 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.34  This is a FOF_THM_RFO_SEQ problem
% 0.14/0.34  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.62/0.80  % (12536)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.62/0.80  % (12536)First to succeed.
% 0.62/0.80  % (12536)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12528"
% 0.62/0.80  % (12529)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.62/0.80  % (12531)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.80  % (12532)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.62/0.80  % (12530)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.62/0.80  % (12536)Refutation found. Thanks to Tanya!
% 0.62/0.80  % SZS status Theorem for theBenchmark
% 0.62/0.80  % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.80  % (12536)------------------------------
% 0.62/0.80  % (12536)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80  % (12536)Termination reason: Refutation
% 0.62/0.80  
% 0.62/0.80  % (12536)Memory used [KB]: 1051
% 0.62/0.80  % (12536)Time elapsed: 0.002 s
% 0.62/0.80  % (12536)Instructions burned: 2 (million)
% 0.62/0.80  % (12528)Success in time 0.444 s
% 0.62/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------