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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET117+1 : TPTP v8.1.2. 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 : n007.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 : Sun May  5 09:04:08 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f269,plain,
    $false,
    inference(resolution,[],[f268,f223]) ).

fof(f223,plain,
    ~ member(sK6,universal_class),
    inference(cnf_transformation,[],[f134]) ).

fof(f134,plain,
    ( ~ member(sK6,universal_class)
    & sK6 = ordered_pair(first(sK6),second(sK6)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f84,f133]) ).

fof(f133,plain,
    ( ? [X0] :
        ( ~ member(X0,universal_class)
        & ordered_pair(first(X0),second(X0)) = X0 )
   => ( ~ member(sK6,universal_class)
      & sK6 = ordered_pair(first(sK6),second(sK6)) ) ),
    introduced(choice_axiom,[]) ).

fof(f84,plain,
    ? [X0] :
      ( ~ member(X0,universal_class)
      & ordered_pair(first(X0),second(X0)) = X0 ),
    inference(ennf_transformation,[],[f45]) ).

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

fof(f44,conjecture,
    ! [X0] :
      ( ordered_pair(first(X0),second(X0)) = X0
     => member(X0,universal_class) ),
    file('/export/starexec/sandbox/tmp/tmp.PoaRMMvNeJ/Vampire---4.8_15764',corollary_1_to_ordered_pairs_are_sets) ).

fof(f268,plain,
    member(sK6,universal_class),
    inference(superposition,[],[f146,f261]) ).

fof(f261,plain,
    sK6 = unordered_pair(unordered_pair(first(sK6),first(sK6)),unordered_pair(first(sK6),unordered_pair(second(sK6),second(sK6)))),
    inference(definition_unfolding,[],[f222,f224]) ).

fof(f224,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
    inference(definition_unfolding,[],[f148,f147,f147]) ).

fof(f147,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/tmp/tmp.PoaRMMvNeJ/Vampire---4.8_15764',singleton_set_defn) ).

fof(f148,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
    file('/export/starexec/sandbox/tmp/tmp.PoaRMMvNeJ/Vampire---4.8_15764',ordered_pair_defn) ).

fof(f222,plain,
    sK6 = ordered_pair(first(sK6),second(sK6)),
    inference(cnf_transformation,[],[f134]) ).

fof(f146,plain,
    ! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
    file('/export/starexec/sandbox/tmp/tmp.PoaRMMvNeJ/Vampire---4.8_15764',unordered_pair) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SET117+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.04/0.14  % 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.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 16:33:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.14/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/tmp/tmp.PoaRMMvNeJ/Vampire---4.8_15764
% 0.60/0.75  % (16155)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 (2996ds/56Mi)
% 0.60/0.76  % (16155)Refutation not found, incomplete strategy% (16155)------------------------------
% 0.60/0.76  % (16155)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76  % (16155)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76  % (16148)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 (2996ds/34Mi)
% 0.60/0.76  
% 0.60/0.76  % (16155)Memory used [KB]: 1035
% 0.60/0.76  % (16155)Time elapsed: 0.002 s
% 0.60/0.76  % (16155)Instructions burned: 2 (million)
% 0.60/0.76  % (16150)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.76  % (16151)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.76  % (16152)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 (2996ds/34Mi)
% 0.60/0.76  % (16153)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.76  % (16154)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 (2996ds/83Mi)
% 0.60/0.76  % (16155)------------------------------
% 0.60/0.76  % (16155)------------------------------
% 0.60/0.76  % (16149)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 (2996ds/51Mi)
% 0.60/0.76  % (16153)Refutation not found, incomplete strategy% (16153)------------------------------
% 0.60/0.76  % (16153)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76  % (16150)Refutation not found, incomplete strategy% (16150)------------------------------
% 0.60/0.76  % (16150)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76  % (16153)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76  
% 0.60/0.76  % (16153)Memory used [KB]: 1042
% 0.60/0.76  % (16153)Time elapsed: 0.003 s
% 0.60/0.76  % (16153)Instructions burned: 2 (million)
% 0.60/0.76  % (16150)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76  
% 0.60/0.76  % (16150)Memory used [KB]: 1052
% 0.60/0.76  % (16150)Time elapsed: 0.003 s
% 0.60/0.76  % (16150)Instructions burned: 3 (million)
% 0.60/0.76  % (16153)------------------------------
% 0.60/0.76  % (16153)------------------------------
% 0.60/0.76  % (16150)------------------------------
% 0.60/0.76  % (16150)------------------------------
% 0.60/0.76  % (16158)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 Vampire---4 for (2995ds/55Mi)
% 0.60/0.76  % (16149)First to succeed.
% 0.60/0.76  % (16149)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16000"
% 0.60/0.76  % (16149)Refutation found. Thanks to Tanya!
% 0.60/0.76  % SZS status Theorem for Vampire---4
% 0.60/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76  % (16149)------------------------------
% 0.60/0.76  % (16149)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76  % (16149)Termination reason: Refutation
% 0.60/0.76  
% 0.60/0.76  % (16149)Memory used [KB]: 1116
% 0.60/0.76  % (16149)Time elapsed: 0.006 s
% 0.60/0.76  % (16149)Instructions burned: 8 (million)
% 0.60/0.76  % (16000)Success in time 0.405 s
% 0.60/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------