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

View Problem - Process Solution

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

% Computer : n027.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 : Wed May  1 03:44:11 EDT 2024

% Result   : Theorem 0.55s 0.74s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :   65 (  33 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   58 (  19   ~;  14   |;  19   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (  19   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f117,plain,
    $false,
    inference(avatar_sat_refutation,[],[f82,f114,f116]) ).

fof(f116,plain,
    spl4_2,
    inference(avatar_split_clause,[],[f115,f79]) ).

fof(f79,plain,
    ( spl4_2
  <=> sK0 = first(sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f115,plain,
    sK0 = first(sK2),
    inference(forward_demodulation,[],[f96,f58]) ).

fof(f58,plain,
    sK2 = ordered_pair(sK0,sK1),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ? [X0,X1,X2] :
      ( ( second(X2) != X1
        | first(X2) != X0 )
      & ordered_pair(X0,X1) = X2
      & member(X1,universal_class)
      & member(X0,universal_class) ),
    inference(flattening,[],[f49]) ).

fof(f49,plain,
    ? [X0,X1,X2] :
      ( ( second(X2) != X1
        | first(X2) != X0 )
      & ordered_pair(X0,X1) = X2
      & member(X1,universal_class)
      & member(X0,universal_class) ),
    inference(ennf_transformation,[],[f46]) ).

fof(f46,plain,
    ~ ! [X0,X1,X2] :
        ( ( ordered_pair(X0,X1) = X2
          & member(X1,universal_class)
          & member(X0,universal_class) )
       => ( second(X2) = X1
          & first(X2) = X0 ) ),
    inference(rectify,[],[f45]) ).

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

fof(f44,conjecture,
    ! [X2,X3,X0] :
      ( ( ordered_pair(X2,X3) = X0
        & member(X3,universal_class)
        & member(X2,universal_class) )
     => ( second(X0) = X3
        & first(X0) = X2 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.nLjunLYdub/Vampire---4.8_15796',unique_1st_and_2nd_in_pair_of_sets1) ).

fof(f96,plain,
    sK0 = first(ordered_pair(sK0,sK1)),
    inference(unit_resulting_resolution,[],[f56,f57,f66]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( ~ member(X1,universal_class)
      | ~ member(X0,universal_class)
      | first(ordered_pair(X0,X1)) = X0 ),
    inference(cnf_transformation,[],[f53]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ( second(ordered_pair(X0,X1)) = X1
        & first(ordered_pair(X0,X1)) = X0 )
      | ~ member(X1,universal_class)
      | ~ member(X0,universal_class) ),
    inference(flattening,[],[f52]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ( second(ordered_pair(X0,X1)) = X1
        & first(ordered_pair(X0,X1)) = X0 )
      | ~ member(X1,universal_class)
      | ~ member(X0,universal_class) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ( member(X1,universal_class)
        & member(X0,universal_class) )
     => ( second(ordered_pair(X0,X1)) = X1
        & first(ordered_pair(X0,X1)) = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.nLjunLYdub/Vampire---4.8_15796',first_second) ).

fof(f57,plain,
    member(sK1,universal_class),
    inference(cnf_transformation,[],[f50]) ).

fof(f56,plain,
    member(sK0,universal_class),
    inference(cnf_transformation,[],[f50]) ).

fof(f114,plain,
    spl4_1,
    inference(avatar_contradiction_clause,[],[f113]) ).

fof(f113,plain,
    ( $false
    | spl4_1 ),
    inference(subsumption_resolution,[],[f112,f77]) ).

fof(f77,plain,
    ( sK1 != second(sK2)
    | spl4_1 ),
    inference(avatar_component_clause,[],[f75]) ).

fof(f75,plain,
    ( spl4_1
  <=> sK1 = second(sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f112,plain,
    sK1 = second(sK2),
    inference(forward_demodulation,[],[f100,f58]) ).

fof(f100,plain,
    sK1 = second(ordered_pair(sK0,sK1)),
    inference(unit_resulting_resolution,[],[f56,f57,f67]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ~ member(X1,universal_class)
      | ~ member(X0,universal_class)
      | second(ordered_pair(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f53]) ).

fof(f82,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f55,f79,f75]) ).

fof(f55,plain,
    ( sK0 != first(sK2)
    | sK1 != second(sK2) ),
    inference(cnf_transformation,[],[f50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.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.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Apr 30 17:46:33 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.nLjunLYdub/Vampire---4.8_15796
% 0.55/0.73  % (16005)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.55/0.73  % (16004)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.55/0.74  % (16005)Refutation not found, incomplete strategy% (16005)------------------------------
% 0.55/0.74  % (16005)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74  % (16005)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74  
% 0.55/0.74  % (16005)Memory used [KB]: 1042
% 0.55/0.74  % (16005)Time elapsed: 0.002 s
% 0.55/0.74  % (16005)Instructions burned: 2 (million)
% 0.55/0.74  % (16005)------------------------------
% 0.55/0.74  % (16005)------------------------------
% 0.55/0.74  % (15997)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.55/0.74  % (15998)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.55/0.74  % (16001)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.55/0.74  % (16002)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.55/0.74  % (15999)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.55/0.74  % (16003)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.55/0.74  % (16004)First to succeed.
% 0.55/0.74  % (16004)Refutation found. Thanks to Tanya!
% 0.55/0.74  % SZS status Theorem for Vampire---4
% 0.55/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.74  % (16004)------------------------------
% 0.55/0.74  % (16004)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74  % (16004)Termination reason: Refutation
% 0.55/0.74  
% 0.55/0.74  % (16004)Memory used [KB]: 1070
% 0.55/0.74  % (16004)Time elapsed: 0.003 s
% 0.55/0.74  % (16004)Instructions burned: 4 (million)
% 0.55/0.74  % (16004)------------------------------
% 0.55/0.74  % (16004)------------------------------
% 0.55/0.74  % (15947)Success in time 0.381 s
% 0.55/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------