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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET984+1 : TPTP v8.2.0. Released v3.2.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 : n023.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:14:11 EDT 2024

% Result   : Theorem 0.55s 0.74s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   73 (  17 unt;   0 def)
%            Number of atoms       :  181 (  91 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  179 (  71   ~;  76   |;  19   &)
%                                         (   8 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   8 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   88 (  76   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f302,plain,
    $false,
    inference(avatar_sat_refutation,[],[f54,f101,f111,f119,f163,f200,f218,f301]) ).

fof(f301,plain,
    ( spl6_2
    | ~ spl6_8 ),
    inference(avatar_contradiction_clause,[],[f300]) ).

fof(f300,plain,
    ( $false
    | spl6_2
    | ~ spl6_8 ),
    inference(subsumption_resolution,[],[f296,f53]) ).

fof(f53,plain,
    ( ~ subset(sK1,sK3)
    | spl6_2 ),
    inference(avatar_component_clause,[],[f52]) ).

fof(f52,plain,
    ( spl6_2
  <=> subset(sK1,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).

fof(f296,plain,
    ( subset(sK1,sK3)
    | ~ spl6_8 ),
    inference(superposition,[],[f56,f209]) ).

fof(f209,plain,
    ( sK1 = set_intersection2(sK1,sK3)
    | ~ spl6_8 ),
    inference(equality_resolution,[],[f199]) ).

fof(f199,plain,
    ( ! [X0,X1] :
        ( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
        | set_intersection2(sK1,sK3) = X1 )
    | ~ spl6_8 ),
    inference(avatar_component_clause,[],[f198]) ).

fof(f198,plain,
    ( spl6_8
  <=> ! [X0,X1] :
        ( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
        | set_intersection2(sK1,sK3) = X1 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).

fof(f56,plain,
    ! [X0,X1] : subset(set_intersection2(X1,X0),X0),
    inference(superposition,[],[f42,f40]) ).

fof(f40,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f42,plain,
    ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,axiom,
    ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).

fof(f218,plain,
    ( spl6_1
    | ~ spl6_5 ),
    inference(avatar_contradiction_clause,[],[f217]) ).

fof(f217,plain,
    ( $false
    | spl6_1
    | ~ spl6_5 ),
    inference(subsumption_resolution,[],[f216,f50]) ).

fof(f50,plain,
    ( ~ subset(sK0,sK2)
    | spl6_1 ),
    inference(avatar_component_clause,[],[f49]) ).

fof(f49,plain,
    ( spl6_1
  <=> subset(sK0,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).

fof(f216,plain,
    ( subset(sK0,sK2)
    | ~ spl6_5 ),
    inference(superposition,[],[f56,f130]) ).

fof(f130,plain,
    ( sK0 = set_intersection2(sK0,sK2)
    | ~ spl6_5 ),
    inference(equality_resolution,[],[f100]) ).

fof(f100,plain,
    ( ! [X0,X1] :
        ( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
        | set_intersection2(sK0,sK2) = X0 )
    | ~ spl6_5 ),
    inference(avatar_component_clause,[],[f99]) ).

fof(f99,plain,
    ( spl6_5
  <=> ! [X0,X1] :
        ( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
        | set_intersection2(sK0,sK2) = X0 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).

fof(f200,plain,
    ( spl6_6
    | spl6_4
    | spl6_8
    | ~ spl6_5 ),
    inference(avatar_split_clause,[],[f191,f99,f198,f96,f143]) ).

fof(f143,plain,
    ( spl6_6
  <=> empty_set = sK0 ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).

fof(f96,plain,
    ( spl6_4
  <=> empty_set = set_intersection2(sK1,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).

fof(f191,plain,
    ( ! [X0,X1] :
        ( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
        | empty_set = set_intersection2(sK1,sK3)
        | empty_set = sK0
        | set_intersection2(sK1,sK3) = X1 )
    | ~ spl6_5 ),
    inference(superposition,[],[f34,f133]) ).

fof(f133,plain,
    ( cartesian_product2(sK0,sK1) = cartesian_product2(sK0,set_intersection2(sK1,sK3))
    | ~ spl6_5 ),
    inference(backward_demodulation,[],[f84,f130]) ).

fof(f84,plain,
    cartesian_product2(sK0,sK1) = cartesian_product2(set_intersection2(sK0,sK2),set_intersection2(sK1,sK3)),
    inference(superposition,[],[f58,f35]) ).

fof(f35,plain,
    ! [X2,X3,X0,X1] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t123_zfmisc_1) ).

fof(f58,plain,
    cartesian_product2(sK0,sK1) = set_intersection2(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)),
    inference(resolution,[],[f32,f29]) ).

fof(f29,plain,
    subset(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ( ( ~ subset(sK1,sK3)
      | ~ subset(sK0,sK2) )
    & empty_set != cartesian_product2(sK0,sK1)
    & subset(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f17,f21]) ).

fof(f21,plain,
    ( ? [X0,X1,X2,X3] :
        ( ( ~ subset(X1,X3)
          | ~ subset(X0,X2) )
        & empty_set != cartesian_product2(X0,X1)
        & subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) )
   => ( ( ~ subset(sK1,sK3)
        | ~ subset(sK0,sK2) )
      & empty_set != cartesian_product2(sK0,sK1)
      & subset(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
    introduced(choice_axiom,[]) ).

fof(f17,plain,
    ? [X0,X1,X2,X3] :
      ( ( ~ subset(X1,X3)
        | ~ subset(X0,X2) )
      & empty_set != cartesian_product2(X0,X1)
      & subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
    inference(flattening,[],[f16]) ).

fof(f16,plain,
    ? [X0,X1,X2,X3] :
      ( ( ~ subset(X1,X3)
        | ~ subset(X0,X2) )
      & empty_set != cartesian_product2(X0,X1)
      & subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
       => ( ( subset(X1,X3)
            & subset(X0,X2) )
          | empty_set = cartesian_product2(X0,X1) ) ),
    inference(negated_conjecture,[],[f10]) ).

fof(f10,conjecture,
    ! [X0,X1,X2,X3] :
      ( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
     => ( ( subset(X1,X3)
          & subset(X0,X2) )
        | empty_set = cartesian_product2(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t138_zfmisc_1) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | set_intersection2(X0,X1) = X0 ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) = X0
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_intersection2(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).

fof(f34,plain,
    ! [X2,X3,X0,X1] :
      ( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
      | empty_set = X1
      | empty_set = X0
      | X1 = X3 ),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1,X2,X3] :
      ( ( X1 = X3
        & X0 = X2 )
      | empty_set = X1
      | empty_set = X0
      | cartesian_product2(X0,X1) != cartesian_product2(X2,X3) ),
    inference(flattening,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1,X2,X3] :
      ( ( X1 = X3
        & X0 = X2 )
      | empty_set = X1
      | empty_set = X0
      | cartesian_product2(X0,X1) != cartesian_product2(X2,X3) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1,X2,X3] :
      ( cartesian_product2(X0,X1) = cartesian_product2(X2,X3)
     => ( ( X1 = X3
          & X0 = X2 )
        | empty_set = X1
        | empty_set = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t134_zfmisc_1) ).

fof(f163,plain,
    ~ spl6_6,
    inference(avatar_contradiction_clause,[],[f162]) ).

fof(f162,plain,
    ( $false
    | ~ spl6_6 ),
    inference(subsumption_resolution,[],[f152,f47]) ).

fof(f47,plain,
    ! [X1] : empty_set = cartesian_product2(empty_set,X1),
    inference(equality_resolution,[],[f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( empty_set = cartesian_product2(X0,X1)
      | empty_set != X0 ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ( empty_set = cartesian_product2(X0,X1)
        | ( empty_set != X1
          & empty_set != X0 ) )
      & ( empty_set = X1
        | empty_set = X0
        | empty_set != cartesian_product2(X0,X1) ) ),
    inference(flattening,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( empty_set = cartesian_product2(X0,X1)
        | ( empty_set != X1
          & empty_set != X0 ) )
      & ( empty_set = X1
        | empty_set = X0
        | empty_set != cartesian_product2(X0,X1) ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( empty_set = cartesian_product2(X0,X1)
    <=> ( empty_set = X1
        | empty_set = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t113_zfmisc_1) ).

fof(f152,plain,
    ( empty_set != cartesian_product2(empty_set,sK1)
    | ~ spl6_6 ),
    inference(backward_demodulation,[],[f30,f144]) ).

fof(f144,plain,
    ( empty_set = sK0
    | ~ spl6_6 ),
    inference(avatar_component_clause,[],[f143]) ).

fof(f30,plain,
    empty_set != cartesian_product2(sK0,sK1),
    inference(cnf_transformation,[],[f22]) ).

fof(f119,plain,
    ~ spl6_4,
    inference(avatar_contradiction_clause,[],[f118]) ).

fof(f118,plain,
    ( $false
    | ~ spl6_4 ),
    inference(subsumption_resolution,[],[f117,f30]) ).

fof(f117,plain,
    ( empty_set = cartesian_product2(sK0,sK1)
    | ~ spl6_4 ),
    inference(forward_demodulation,[],[f114,f46]) ).

fof(f46,plain,
    ! [X0] : empty_set = cartesian_product2(X0,empty_set),
    inference(equality_resolution,[],[f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( empty_set = cartesian_product2(X0,X1)
      | empty_set != X1 ),
    inference(cnf_transformation,[],[f24]) ).

fof(f114,plain,
    ( cartesian_product2(sK0,sK1) = cartesian_product2(set_intersection2(sK0,sK2),empty_set)
    | ~ spl6_4 ),
    inference(backward_demodulation,[],[f84,f97]) ).

fof(f97,plain,
    ( empty_set = set_intersection2(sK1,sK3)
    | ~ spl6_4 ),
    inference(avatar_component_clause,[],[f96]) ).

fof(f111,plain,
    ~ spl6_3,
    inference(avatar_contradiction_clause,[],[f110]) ).

fof(f110,plain,
    ( $false
    | ~ spl6_3 ),
    inference(subsumption_resolution,[],[f109,f30]) ).

fof(f109,plain,
    ( empty_set = cartesian_product2(sK0,sK1)
    | ~ spl6_3 ),
    inference(forward_demodulation,[],[f106,f47]) ).

fof(f106,plain,
    ( cartesian_product2(sK0,sK1) = cartesian_product2(empty_set,set_intersection2(sK1,sK3))
    | ~ spl6_3 ),
    inference(backward_demodulation,[],[f84,f94]) ).

fof(f94,plain,
    ( empty_set = set_intersection2(sK0,sK2)
    | ~ spl6_3 ),
    inference(avatar_component_clause,[],[f93]) ).

fof(f93,plain,
    ( spl6_3
  <=> empty_set = set_intersection2(sK0,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).

fof(f101,plain,
    ( spl6_3
    | spl6_4
    | spl6_5 ),
    inference(avatar_split_clause,[],[f88,f99,f96,f93]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
      | empty_set = set_intersection2(sK1,sK3)
      | empty_set = set_intersection2(sK0,sK2)
      | set_intersection2(sK0,sK2) = X0 ),
    inference(superposition,[],[f33,f84]) ).

fof(f33,plain,
    ! [X2,X3,X0,X1] :
      ( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
      | empty_set = X1
      | empty_set = X0
      | X0 = X2 ),
    inference(cnf_transformation,[],[f20]) ).

fof(f54,plain,
    ( ~ spl6_1
    | ~ spl6_2 ),
    inference(avatar_split_clause,[],[f31,f52,f49]) ).

fof(f31,plain,
    ( ~ subset(sK1,sK3)
    | ~ subset(sK0,sK2) ),
    inference(cnf_transformation,[],[f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SET984+1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.12  % 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.10/0.31  % Computer : n023.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon May 20 11:56:23 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31  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.55/0.72  % (19221)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.55/0.72  % (19222)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.55/0.72  % (19228)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.55/0.72  % (19226)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.55/0.72  % (19224)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.72  % (19228)Refutation not found, incomplete strategy% (19228)------------------------------
% 0.55/0.72  % (19228)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72  % (19228)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72  
% 0.55/0.72  % (19228)Memory used [KB]: 972
% 0.55/0.72  % (19228)Time elapsed: 0.003 s
% 0.55/0.72  % (19228)Instructions burned: 3 (million)
% 0.55/0.72  % (19221)Refutation not found, incomplete strategy% (19221)------------------------------
% 0.55/0.72  % (19221)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72  % (19221)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72  
% 0.55/0.72  % (19221)Memory used [KB]: 976
% 0.55/0.72  % (19228)------------------------------
% 0.55/0.72  % (19228)------------------------------
% 0.55/0.72  % (19221)Time elapsed: 0.004 s
% 0.55/0.72  % (19221)Instructions burned: 4 (million)
% 0.55/0.72  % (19227)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 theBenchmark for (2996ds/83Mi)
% 0.55/0.72  % (19221)------------------------------
% 0.55/0.72  % (19221)------------------------------
% 0.55/0.72  % (19226)Refutation not found, incomplete strategy% (19226)------------------------------
% 0.55/0.72  % (19226)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72  % (19226)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72  
% 0.55/0.72  % (19226)Memory used [KB]: 970
% 0.55/0.72  % (19226)Time elapsed: 0.003 s
% 0.55/0.72  % (19226)Instructions burned: 2 (million)
% 0.55/0.72  % (19226)------------------------------
% 0.55/0.72  % (19226)------------------------------
% 0.55/0.73  % (19223)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73  % (19225)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 theBenchmark for (2996ds/34Mi)
% 0.55/0.73  % (19225)Refutation not found, incomplete strategy% (19225)------------------------------
% 0.55/0.73  % (19225)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73  % (19225)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73  
% 0.55/0.73  % (19225)Memory used [KB]: 974
% 0.55/0.73  % (19225)Time elapsed: 0.002 s
% 0.55/0.73  % (19225)Instructions burned: 3 (million)
% 0.55/0.73  % (19225)------------------------------
% 0.55/0.73  % (19225)------------------------------
% 0.55/0.73  % (19231)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 (2995ds/208Mi)
% 0.55/0.73  % (19229)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 (2995ds/55Mi)
% 0.55/0.73  % (19230)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.55/0.73  % (19230)Refutation not found, incomplete strategy% (19230)------------------------------
% 0.55/0.73  % (19230)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73  % (19230)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73  
% 0.55/0.73  % (19230)Memory used [KB]: 961
% 0.55/0.73  % (19230)Time elapsed: 0.002 s
% 0.55/0.73  % (19230)Instructions burned: 3 (million)
% 0.55/0.73  % (19232)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.55/0.73  % (19230)------------------------------
% 0.55/0.73  % (19230)------------------------------
% 0.55/0.73  % (19233)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.55/0.74  % (19233)Refutation not found, incomplete strategy% (19233)------------------------------
% 0.55/0.74  % (19233)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (19233)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74  
% 0.55/0.74  % (19233)Memory used [KB]: 975
% 0.55/0.74  % (19233)Time elapsed: 0.003 s
% 0.55/0.74  % (19233)Instructions burned: 3 (million)
% 0.55/0.74  % (19233)------------------------------
% 0.55/0.74  % (19233)------------------------------
% 0.55/0.74  % (19224)Instruction limit reached!
% 0.55/0.74  % (19224)------------------------------
% 0.55/0.74  % (19224)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (19224)Termination reason: Unknown
% 0.55/0.74  % (19224)Termination phase: Saturation
% 0.55/0.74  
% 0.55/0.74  % (19224)Memory used [KB]: 1123
% 0.55/0.74  % (19224)Time elapsed: 0.015 s
% 0.55/0.74  % (19224)Instructions burned: 36 (million)
% 0.55/0.74  % (19224)------------------------------
% 0.55/0.74  % (19224)------------------------------
% 0.55/0.74  % (19235)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.55/0.74  % (19234)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.55/0.74  % (19232)First to succeed.
% 0.55/0.74  % (19234)Refutation not found, incomplete strategy% (19234)------------------------------
% 0.55/0.74  % (19234)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (19234)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74  
% 0.55/0.74  % (19234)Memory used [KB]: 961
% 0.55/0.74  % (19234)Time elapsed: 0.003 s
% 0.55/0.74  % (19234)Instructions burned: 2 (million)
% 0.55/0.74  % (19234)------------------------------
% 0.55/0.74  % (19234)------------------------------
% 0.55/0.74  % (19232)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19220"
% 0.55/0.74  % (19232)Refutation found. Thanks to Tanya!
% 0.55/0.74  % SZS status Theorem for theBenchmark
% 0.55/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74  % (19232)------------------------------
% 0.55/0.74  % (19232)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (19232)Termination reason: Refutation
% 0.55/0.74  
% 0.55/0.74  % (19232)Memory used [KB]: 1104
% 0.55/0.74  % (19232)Time elapsed: 0.013 s
% 0.55/0.74  % (19232)Instructions burned: 21 (million)
% 0.55/0.74  % (19220)Success in time 0.421 s
% 0.55/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------