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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET024+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n020.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:07:54 EDT 2024

% Result   : Theorem 0.57s 0.73s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   48 (  15 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   49 (  19   ~;  13   |;  12   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (  21   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f229,plain,
    $false,
    inference(subsumption_resolution,[],[f228,f118]) ).

fof(f118,plain,
    member(sK0,universal_class),
    inference(cnf_transformation,[],[f77]) ).

fof(f77,plain,
    ( ~ member(sK0,singleton(sK0))
    & member(sK0,universal_class) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f66,f76]) ).

fof(f76,plain,
    ( ? [X0] :
        ( ~ member(X0,singleton(X0))
        & member(X0,universal_class) )
   => ( ~ member(sK0,singleton(sK0))
      & member(sK0,universal_class) ) ),
    introduced(choice_axiom,[]) ).

fof(f66,plain,
    ? [X0] :
      ( ~ member(X0,singleton(X0))
      & member(X0,universal_class) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f45,negated_conjecture,
    ~ ! [X0] :
        ( member(X0,universal_class)
       => member(X0,singleton(X0)) ),
    inference(negated_conjecture,[],[f44]) ).

fof(f44,conjecture,
    ! [X0] :
      ( member(X0,universal_class)
     => member(X0,singleton(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_in_its_singleton) ).

fof(f228,plain,
    ~ member(sK0,universal_class),
    inference(resolution,[],[f219,f194]) ).

fof(f194,plain,
    ~ member(sK0,unordered_pair(sK0,sK0)),
    inference(definition_unfolding,[],[f119,f129]) ).

fof(f129,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).

fof(f119,plain,
    ~ member(sK0,singleton(sK0)),
    inference(cnf_transformation,[],[f77]) ).

fof(f219,plain,
    ! [X2,X1] :
      ( member(X2,unordered_pair(X1,X2))
      | ~ member(X2,universal_class) ),
    inference(equality_resolution,[],[f166]) ).

fof(f166,plain,
    ! [X2,X0,X1] :
      ( member(X0,unordered_pair(X1,X2))
      | X0 != X2
      | ~ member(X0,universal_class) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f101,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,unordered_pair(X1,X2))
        | ( X0 != X2
          & X0 != X1 )
        | ~ member(X0,universal_class) )
      & ( ( ( X0 = X2
            | X0 = X1 )
          & member(X0,universal_class) )
        | ~ member(X0,unordered_pair(X1,X2)) ) ),
    inference(flattening,[],[f100]) ).

fof(f100,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,unordered_pair(X1,X2))
        | ( X0 != X2
          & X0 != X1 )
        | ~ member(X0,universal_class) )
      & ( ( ( X0 = X2
            | X0 = X1 )
          & member(X0,universal_class) )
        | ~ member(X0,unordered_pair(X1,X2)) ) ),
    inference(nnf_transformation,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1,X2] :
      ( member(X0,unordered_pair(X1,X2))
    <=> ( ( X0 = X2
          | X0 = X1 )
        & member(X0,universal_class) ) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( member(X2,unordered_pair(X0,X1))
    <=> ( ( X1 = X2
          | X0 = X2 )
        & member(X2,universal_class) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET024+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.03/0.13  % 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.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 12:04:37 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35  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/benchmark/theBenchmark.p
% 0.51/0.72  % (1951)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.51/0.72  % (1951)Refutation not found, incomplete strategy% (1951)------------------------------
% 0.51/0.72  % (1951)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.72  % (1951)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.72  
% 0.51/0.72  % (1951)Memory used [KB]: 1042
% 0.51/0.72  % (1951)Time elapsed: 0.002 s
% 0.51/0.72  % (1951)Instructions burned: 2 (million)
% 0.51/0.72  % (1951)------------------------------
% 0.51/0.72  % (1951)------------------------------
% 0.51/0.72  % (1946)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.72  % (1948)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.72  % (1947)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.72  % (1953)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.73  % (1953)Refutation not found, incomplete strategy% (1953)------------------------------
% 0.51/0.73  % (1953)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (1953)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (1953)Memory used [KB]: 1042
% 0.51/0.73  % (1953)Time elapsed: 0.001 s
% 0.51/0.73  % (1953)Instructions burned: 2 (million)
% 0.51/0.73  % (1946)Refutation not found, incomplete strategy% (1946)------------------------------
% 0.51/0.73  % (1946)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (1946)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (1946)Memory used [KB]: 1074
% 0.51/0.73  % (1946)Time elapsed: 0.004 s
% 0.51/0.73  % (1946)Instructions burned: 5 (million)
% 0.51/0.73  % (1954)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.51/0.73  % (1953)------------------------------
% 0.51/0.73  % (1953)------------------------------
% 0.51/0.73  % (1946)------------------------------
% 0.51/0.73  % (1946)------------------------------
% 0.51/0.73  % (1954)Refutation not found, incomplete strategy% (1954)------------------------------
% 0.51/0.73  % (1954)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (1954)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (1954)Memory used [KB]: 1042
% 0.51/0.73  % (1954)Time elapsed: 0.002 s
% 0.51/0.73  % (1954)Instructions burned: 2 (million)
% 0.51/0.73  % (1954)------------------------------
% 0.51/0.73  % (1954)------------------------------
% 0.57/0.73  % (1948)First to succeed.
% 0.57/0.73  % (1948)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1945"
% 0.57/0.73  % (1956)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.57/0.73  % (1948)Refutation found. Thanks to Tanya!
% 0.57/0.73  % SZS status Theorem for theBenchmark
% 0.57/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.73  % (1948)------------------------------
% 0.57/0.73  % (1948)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73  % (1948)Termination reason: Refutation
% 0.57/0.73  
% 0.57/0.73  % (1948)Memory used [KB]: 1167
% 0.57/0.73  % (1948)Time elapsed: 0.006 s
% 0.57/0.73  % (1948)Instructions burned: 9 (million)
% 0.57/0.73  % (1945)Success in time 0.376 s
% 0.57/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------