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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.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 : 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 : Sun May  5 09:09:10 EDT 2024

% Result   : Theorem 0.47s 0.64s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   42 (   2 unt;   0 def)
%            Number of atoms       :  122 (  36 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  130 (  50   ~;  47   |;  18   &)
%                                         (  10 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   67 (  54   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f134,plain,
    $false,
    inference(avatar_sat_refutation,[],[f48,f68,f93,f113,f116,f132,f133]) ).

fof(f133,plain,
    ( ~ spl9_4
    | spl9_5
    | ~ spl9_1 ),
    inference(avatar_split_clause,[],[f121,f41,f64,f59]) ).

fof(f59,plain,
    ( spl9_4
  <=> in(sK6(sK0,sK1),sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

fof(f64,plain,
    ( spl9_5
  <=> in(sK6(sK0,sK1),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).

fof(f41,plain,
    ( spl9_1
  <=> sK6(sK0,sK1) = ordered_pair(sK2(sK6(sK0,sK1)),sK3(sK6(sK0,sK1))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

fof(f121,plain,
    ( in(sK6(sK0,sK1),sK1)
    | ~ in(sK6(sK0,sK1),sK0)
    | ~ spl9_1 ),
    inference(superposition,[],[f16,f43]) ).

fof(f43,plain,
    ( sK6(sK0,sK1) = ordered_pair(sK2(sK6(sK0,sK1)),sK3(sK6(sK0,sK1)))
    | ~ spl9_1 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f16,plain,
    ! [X2,X3] :
      ( in(ordered_pair(X2,X3),sK1)
      | ~ in(ordered_pair(X2,X3),sK0) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ? [X0,X1] :
      ( X0 != X1
      & ! [X2,X3] :
          ( in(ordered_pair(X2,X3),X0)
        <=> in(ordered_pair(X2,X3),X1) )
      & ! [X4] :
          ( ? [X5,X6] : ordered_pair(X5,X6) = X4
          | ~ in(X4,X1) )
      & ! [X7] :
          ( ? [X8,X9] : ordered_pair(X8,X9) = X7
          | ~ in(X7,X0) ) ),
    inference(flattening,[],[f11]) ).

fof(f11,plain,
    ? [X0,X1] :
      ( X0 != X1
      & ! [X2,X3] :
          ( in(ordered_pair(X2,X3),X0)
        <=> in(ordered_pair(X2,X3),X1) )
      & ! [X4] :
          ( ? [X5,X6] : ordered_pair(X5,X6) = X4
          | ~ in(X4,X1) )
      & ! [X7] :
          ( ? [X8,X9] : ordered_pair(X8,X9) = X7
          | ~ in(X7,X0) ) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,plain,
    ~ ! [X0,X1] :
        ( ( ! [X2,X3] :
              ( in(ordered_pair(X2,X3),X0)
            <=> in(ordered_pair(X2,X3),X1) )
          & ! [X4] :
              ~ ( ! [X5,X6] : ordered_pair(X5,X6) != X4
                & in(X4,X1) )
          & ! [X7] :
              ~ ( ! [X8,X9] : ordered_pair(X8,X9) != X7
                & in(X7,X0) ) )
       => X0 = X1 ),
    inference(rectify,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( ! [X2,X3] :
              ( in(ordered_pair(X2,X3),X0)
            <=> in(ordered_pair(X2,X3),X1) )
          & ! [X2] :
              ~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
                & in(X2,X1) )
          & ! [X2] :
              ~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
                & in(X2,X0) ) )
       => X0 = X1 ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X0,X1] :
      ( ( ! [X2,X3] :
            ( in(ordered_pair(X2,X3),X0)
          <=> in(ordered_pair(X2,X3),X1) )
        & ! [X2] :
            ~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
              & in(X2,X1) )
        & ! [X2] :
            ~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
              & in(X2,X0) ) )
     => X0 = X1 ),
    file('/export/starexec/sandbox/tmp/tmp.gbT68jelcG/Vampire---4.8_25717',t112_zfmisc_1) ).

fof(f132,plain,
    ( spl9_4
    | ~ spl9_5
    | ~ spl9_1 ),
    inference(avatar_split_clause,[],[f122,f41,f64,f59]) ).

fof(f122,plain,
    ( ~ in(sK6(sK0,sK1),sK1)
    | in(sK6(sK0,sK1),sK0)
    | ~ spl9_1 ),
    inference(superposition,[],[f15,f43]) ).

fof(f15,plain,
    ! [X2,X3] :
      ( ~ in(ordered_pair(X2,X3),sK1)
      | in(ordered_pair(X2,X3),sK0) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f116,plain,
    ( ~ spl9_5
    | ~ spl9_4 ),
    inference(avatar_split_clause,[],[f100,f59,f64]) ).

fof(f100,plain,
    ( ~ in(sK6(sK0,sK1),sK1)
    | ~ spl9_4 ),
    inference(unit_resulting_resolution,[],[f19,f60,f21]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ~ in(sK6(X0,X1),X0)
      | ~ in(sK6(X0,X1),X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ? [X2] :
          ( in(X2,X0)
        <~> in(X2,X1) ) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
        <=> in(X2,X1) )
     => X0 = X1 ),
    file('/export/starexec/sandbox/tmp/tmp.gbT68jelcG/Vampire---4.8_25717',t2_tarski) ).

fof(f60,plain,
    ( in(sK6(sK0,sK1),sK0)
    | ~ spl9_4 ),
    inference(avatar_component_clause,[],[f59]) ).

fof(f19,plain,
    sK0 != sK1,
    inference(cnf_transformation,[],[f12]) ).

fof(f113,plain,
    ( spl9_1
    | ~ spl9_4 ),
    inference(avatar_split_clause,[],[f105,f59,f41]) ).

fof(f105,plain,
    ( sK6(sK0,sK1) = ordered_pair(sK2(sK6(sK0,sK1)),sK3(sK6(sK0,sK1)))
    | ~ spl9_4 ),
    inference(resolution,[],[f60,f18]) ).

fof(f18,plain,
    ! [X7] :
      ( ~ in(X7,sK0)
      | ordered_pair(sK2(X7),sK3(X7)) = X7 ),
    inference(cnf_transformation,[],[f12]) ).

fof(f93,plain,
    ( spl9_4
    | spl9_5 ),
    inference(avatar_contradiction_clause,[],[f92]) ).

fof(f92,plain,
    ( $false
    | spl9_4
    | spl9_5 ),
    inference(subsumption_resolution,[],[f91,f19]) ).

fof(f91,plain,
    ( sK0 = sK1
    | spl9_4
    | spl9_5 ),
    inference(subsumption_resolution,[],[f88,f65]) ).

fof(f65,plain,
    ( ~ in(sK6(sK0,sK1),sK1)
    | spl9_5 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f88,plain,
    ( in(sK6(sK0,sK1),sK1)
    | sK0 = sK1
    | spl9_4 ),
    inference(resolution,[],[f61,f20]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( in(sK6(X0,X1),X1)
      | in(sK6(X0,X1),X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f13]) ).

fof(f61,plain,
    ( ~ in(sK6(sK0,sK1),sK0)
    | spl9_4 ),
    inference(avatar_component_clause,[],[f59]) ).

fof(f68,plain,
    ( spl9_4
    | ~ spl9_5
    | ~ spl9_2 ),
    inference(avatar_split_clause,[],[f52,f45,f64,f59]) ).

fof(f45,plain,
    ( spl9_2
  <=> sK6(sK0,sK1) = ordered_pair(sK4(sK6(sK0,sK1)),sK5(sK6(sK0,sK1))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).

fof(f52,plain,
    ( ~ in(sK6(sK0,sK1),sK1)
    | in(sK6(sK0,sK1),sK0)
    | ~ spl9_2 ),
    inference(superposition,[],[f15,f47]) ).

fof(f47,plain,
    ( sK6(sK0,sK1) = ordered_pair(sK4(sK6(sK0,sK1)),sK5(sK6(sK0,sK1)))
    | ~ spl9_2 ),
    inference(avatar_component_clause,[],[f45]) ).

fof(f48,plain,
    ( spl9_1
    | spl9_2 ),
    inference(avatar_split_clause,[],[f39,f45,f41]) ).

fof(f39,plain,
    ( sK6(sK0,sK1) = ordered_pair(sK4(sK6(sK0,sK1)),sK5(sK6(sK0,sK1)))
    | sK6(sK0,sK1) = ordered_pair(sK2(sK6(sK0,sK1)),sK3(sK6(sK0,sK1))) ),
    inference(subsumption_resolution,[],[f36,f19]) ).

fof(f36,plain,
    ( sK6(sK0,sK1) = ordered_pair(sK4(sK6(sK0,sK1)),sK5(sK6(sK0,sK1)))
    | sK0 = sK1
    | sK6(sK0,sK1) = ordered_pair(sK2(sK6(sK0,sK1)),sK3(sK6(sK0,sK1))) ),
    inference(resolution,[],[f28,f18]) ).

fof(f28,plain,
    ! [X0] :
      ( in(sK6(X0,sK1),X0)
      | sK6(X0,sK1) = ordered_pair(sK4(sK6(X0,sK1)),sK5(sK6(X0,sK1)))
      | sK1 = X0 ),
    inference(resolution,[],[f17,f20]) ).

fof(f17,plain,
    ! [X4] :
      ( ~ in(X4,sK1)
      | ordered_pair(sK4(X4),sK5(X4)) = X4 ),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.05/0.10  % 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.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit   : 300
% 0.10/0.29  % WCLimit    : 300
% 0.10/0.29  % DateTime   : Fri May  3 16:46:22 EDT 2024
% 0.10/0.29  % CPUTime    : 
% 0.10/0.29  This is a FOF_THM_RFO_SEQ problem
% 0.10/0.29  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.gbT68jelcG/Vampire---4.8_25717
% 0.47/0.64  % (26126)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.47/0.64  % (26122)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.47/0.64  % (26121)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.47/0.64  % (26120)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.47/0.64  % (26125)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.47/0.64  % (26123)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.47/0.64  % (26124)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.47/0.64  % (26127)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.47/0.64  % (26123)Refutation not found, incomplete strategy% (26123)------------------------------
% 0.47/0.64  % (26123)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (26126)First to succeed.
% 0.47/0.64  % (26123)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (26123)Memory used [KB]: 956
% 0.47/0.64  % (26123)Time elapsed: 0.003 s
% 0.47/0.64  % (26123)Instructions burned: 2 (million)
% 0.47/0.64  % (26120)Refutation not found, incomplete strategy% (26120)------------------------------
% 0.47/0.64  % (26120)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (26120)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (26123)------------------------------
% 0.47/0.64  % (26123)------------------------------
% 0.47/0.64  % (26120)Memory used [KB]: 987
% 0.47/0.64  % (26120)Time elapsed: 0.003 s
% 0.47/0.64  % (26120)Instructions burned: 3 (million)
% 0.47/0.64  % (26126)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25968"
% 0.47/0.64  % (26124)Refutation not found, incomplete strategy% (26124)------------------------------
% 0.47/0.64  % (26124)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (26124)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (26127)Refutation not found, incomplete strategy% (26127)------------------------------
% 0.47/0.64  % (26127)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (26127)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.64  
% 0.47/0.64  % (26127)Memory used [KB]: 973
% 0.47/0.64  % (26127)Time elapsed: 0.003 s
% 0.47/0.64  % (26127)Instructions burned: 2 (million)
% 0.47/0.64  % (26124)Memory used [KB]: 975
% 0.47/0.64  % (26124)Time elapsed: 0.003 s
% 0.47/0.64  % (26124)Instructions burned: 3 (million)
% 0.47/0.64  % (26120)------------------------------
% 0.47/0.64  % (26120)------------------------------
% 0.47/0.64  % (26127)------------------------------
% 0.47/0.64  % (26127)------------------------------
% 0.47/0.64  % (26124)------------------------------
% 0.47/0.64  % (26124)------------------------------
% 0.47/0.64  % (26126)Refutation found. Thanks to Tanya!
% 0.47/0.64  % SZS status Theorem for Vampire---4
% 0.47/0.64  % SZS output start Proof for Vampire---4
% See solution above
% 0.47/0.64  % (26126)------------------------------
% 0.47/0.64  % (26126)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64  % (26126)Termination reason: Refutation
% 0.47/0.64  
% 0.47/0.64  % (26126)Memory used [KB]: 1070
% 0.47/0.64  % (26126)Time elapsed: 0.004 s
% 0.47/0.64  % (26126)Instructions burned: 7 (million)
% 0.47/0.64  % (25968)Success in time 0.342 s
% 0.47/0.64  % Vampire---4.8 exiting
%------------------------------------------------------------------------------