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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET955+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 : n003.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:09 EDT 2024

% Result   : Theorem 0.62s 0.76s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (   8 unt;   0 def)
%            Number of atoms       :  190 (  51 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  227 (  80   ~;  82   |;  50   &)
%                                         (   6 <=>;   8  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-3 aty)
%            Number of variables   :  140 ( 104   !;  36   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f144,plain,
    $false,
    inference(subsumption_resolution,[],[f143,f137]) ).

fof(f137,plain,
    in(sK4(sF11,sF10),sF11),
    inference(subsumption_resolution,[],[f136,f48]) ).

fof(f48,plain,
    sF10 != sF11,
    inference(definition_folding,[],[f29,f47,f46]) ).

fof(f46,plain,
    cartesian_product2(sK0,sK1) = sF10,
    introduced(function_definition,[new_symbols(definition,[sF10])]) ).

fof(f47,plain,
    cartesian_product2(sK2,sK3) = sF11,
    introduced(function_definition,[new_symbols(definition,[sF11])]) ).

fof(f29,plain,
    cartesian_product2(sK0,sK1) != cartesian_product2(sK2,sK3),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ( cartesian_product2(sK0,sK1) != cartesian_product2(sK2,sK3)
    & ! [X4,X5] :
        ( ( in(ordered_pair(X4,X5),cartesian_product2(sK0,sK1))
          | ~ in(ordered_pair(X4,X5),cartesian_product2(sK2,sK3)) )
        & ( in(ordered_pair(X4,X5),cartesian_product2(sK2,sK3))
          | ~ in(ordered_pair(X4,X5),cartesian_product2(sK0,sK1)) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f15,f16]) ).

fof(f16,plain,
    ( ? [X0,X1,X2,X3] :
        ( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
        & ! [X4,X5] :
            ( ( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
              | ~ in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) )
            & ( in(ordered_pair(X4,X5),cartesian_product2(X2,X3))
              | ~ in(ordered_pair(X4,X5),cartesian_product2(X0,X1)) ) ) )
   => ( cartesian_product2(sK0,sK1) != cartesian_product2(sK2,sK3)
      & ! [X5,X4] :
          ( ( in(ordered_pair(X4,X5),cartesian_product2(sK0,sK1))
            | ~ in(ordered_pair(X4,X5),cartesian_product2(sK2,sK3)) )
          & ( in(ordered_pair(X4,X5),cartesian_product2(sK2,sK3))
            | ~ in(ordered_pair(X4,X5),cartesian_product2(sK0,sK1)) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f15,plain,
    ? [X0,X1,X2,X3] :
      ( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
      & ! [X4,X5] :
          ( ( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
            | ~ in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) )
          & ( in(ordered_pair(X4,X5),cartesian_product2(X2,X3))
            | ~ in(ordered_pair(X4,X5),cartesian_product2(X0,X1)) ) ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f12,plain,
    ? [X0,X1,X2,X3] :
      ( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
      & ! [X4,X5] :
          ( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
        <=> in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) ) ),
    inference(ennf_transformation,[],[f9]) ).

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

fof(f8,conjecture,
    ! [X0,X1,X2,X3] :
      ( ! [X4,X5] :
          ( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
        <=> in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) )
     => cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.ipyAGKZexV/Vampire---4.8_5630',t108_zfmisc_1) ).

fof(f136,plain,
    ( in(sK4(sF11,sF10),sF11)
    | sF10 = sF11 ),
    inference(factoring,[],[f70]) ).

fof(f70,plain,
    ! [X0] :
      ( in(sK4(X0,sF10),sF11)
      | sF10 = X0
      | in(sK4(X0,sF10),X0) ),
    inference(resolution,[],[f69,f30]) ).

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

fof(f20,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ( ( ~ in(sK4(X0,X1),X1)
          | ~ in(sK4(X0,X1),X0) )
        & ( in(sK4(X0,X1),X1)
          | in(sK4(X0,X1),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f18,f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ~ in(X2,X1)
            | ~ in(X2,X0) )
          & ( in(X2,X1)
            | in(X2,X0) ) )
     => ( ( ~ in(sK4(X0,X1),X1)
          | ~ in(sK4(X0,X1),X0) )
        & ( in(sK4(X0,X1),X1)
          | in(sK4(X0,X1),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ? [X2] :
          ( ( ~ in(X2,X1)
            | ~ in(X2,X0) )
          & ( in(X2,X1)
            | in(X2,X0) ) ) ),
    inference(nnf_transformation,[],[f13]) ).

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

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

fof(f69,plain,
    ! [X0] :
      ( ~ in(X0,sF10)
      | in(X0,sF11) ),
    inference(duplicate_literal_removal,[],[f67]) ).

fof(f67,plain,
    ! [X0] :
      ( ~ in(X0,sF10)
      | in(X0,sF11)
      | ~ in(X0,sF10) ),
    inference(superposition,[],[f61,f46]) ).

fof(f61,plain,
    ! [X2,X0,X1] :
      ( ~ in(X2,cartesian_product2(X0,X1))
      | in(X2,sF11)
      | ~ in(X2,sF10) ),
    inference(superposition,[],[f50,f43]) ).

fof(f43,plain,
    ! [X0,X1,X8] :
      ( ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8
      | ~ in(X8,cartesian_product2(X0,X1)) ),
    inference(equality_resolution,[],[f34]) ).

fof(f34,plain,
    ! [X2,X0,X1,X8] :
      ( ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8
      | ~ in(X8,X2)
      | cartesian_product2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( cartesian_product2(X0,X1) = X2
        | ( ( ! [X4,X5] :
                ( ordered_pair(X4,X5) != sK5(X0,X1,X2)
                | ~ in(X5,X1)
                | ~ in(X4,X0) )
            | ~ in(sK5(X0,X1,X2),X2) )
          & ( ( sK5(X0,X1,X2) = ordered_pair(sK6(X0,X1,X2),sK7(X0,X1,X2))
              & in(sK7(X0,X1,X2),X1)
              & in(sK6(X0,X1,X2),X0) )
            | in(sK5(X0,X1,X2),X2) ) ) )
      & ( ! [X8] :
            ( ( in(X8,X2)
              | ! [X9,X10] :
                  ( ordered_pair(X9,X10) != X8
                  | ~ in(X10,X1)
                  | ~ in(X9,X0) ) )
            & ( ( ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8
                & in(sK9(X0,X1,X8),X1)
                & in(sK8(X0,X1,X8),X0) )
              | ~ in(X8,X2) ) )
        | cartesian_product2(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9])],[f22,f25,f24,f23]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ! [X4,X5] :
                ( ordered_pair(X4,X5) != X3
                | ~ in(X5,X1)
                | ~ in(X4,X0) )
            | ~ in(X3,X2) )
          & ( ? [X6,X7] :
                ( ordered_pair(X6,X7) = X3
                & in(X7,X1)
                & in(X6,X0) )
            | in(X3,X2) ) )
     => ( ( ! [X5,X4] :
              ( ordered_pair(X4,X5) != sK5(X0,X1,X2)
              | ~ in(X5,X1)
              | ~ in(X4,X0) )
          | ~ in(sK5(X0,X1,X2),X2) )
        & ( ? [X7,X6] :
              ( ordered_pair(X6,X7) = sK5(X0,X1,X2)
              & in(X7,X1)
              & in(X6,X0) )
          | in(sK5(X0,X1,X2),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ? [X7,X6] :
          ( ordered_pair(X6,X7) = sK5(X0,X1,X2)
          & in(X7,X1)
          & in(X6,X0) )
     => ( sK5(X0,X1,X2) = ordered_pair(sK6(X0,X1,X2),sK7(X0,X1,X2))
        & in(sK7(X0,X1,X2),X1)
        & in(sK6(X0,X1,X2),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ! [X0,X1,X8] :
      ( ? [X11,X12] :
          ( ordered_pair(X11,X12) = X8
          & in(X12,X1)
          & in(X11,X0) )
     => ( ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8
        & in(sK9(X0,X1,X8),X1)
        & in(sK8(X0,X1,X8),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ( cartesian_product2(X0,X1) = X2
        | ? [X3] :
            ( ( ! [X4,X5] :
                  ( ordered_pair(X4,X5) != X3
                  | ~ in(X5,X1)
                  | ~ in(X4,X0) )
              | ~ in(X3,X2) )
            & ( ? [X6,X7] :
                  ( ordered_pair(X6,X7) = X3
                  & in(X7,X1)
                  & in(X6,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X8] :
            ( ( in(X8,X2)
              | ! [X9,X10] :
                  ( ordered_pair(X9,X10) != X8
                  | ~ in(X10,X1)
                  | ~ in(X9,X0) ) )
            & ( ? [X11,X12] :
                  ( ordered_pair(X11,X12) = X8
                  & in(X12,X1)
                  & in(X11,X0) )
              | ~ in(X8,X2) ) )
        | cartesian_product2(X0,X1) != X2 ) ),
    inference(rectify,[],[f21]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( ( cartesian_product2(X0,X1) = X2
        | ? [X3] :
            ( ( ! [X4,X5] :
                  ( ordered_pair(X4,X5) != X3
                  | ~ in(X5,X1)
                  | ~ in(X4,X0) )
              | ~ in(X3,X2) )
            & ( ? [X4,X5] :
                  ( ordered_pair(X4,X5) = X3
                  & in(X5,X1)
                  & in(X4,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ! [X4,X5] :
                  ( ordered_pair(X4,X5) != X3
                  | ~ in(X5,X1)
                  | ~ in(X4,X0) ) )
            & ( ? [X4,X5] :
                  ( ordered_pair(X4,X5) = X3
                  & in(X5,X1)
                  & in(X4,X0) )
              | ~ in(X3,X2) ) )
        | cartesian_product2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( cartesian_product2(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ? [X4,X5] :
              ( ordered_pair(X4,X5) = X3
              & in(X5,X1)
              & in(X4,X0) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ipyAGKZexV/Vampire---4.8_5630',d2_zfmisc_1) ).

fof(f50,plain,
    ! [X4,X5] :
      ( ~ in(ordered_pair(X4,X5),sF10)
      | in(ordered_pair(X4,X5),sF11) ),
    inference(definition_folding,[],[f27,f46,f47]) ).

fof(f27,plain,
    ! [X4,X5] :
      ( in(ordered_pair(X4,X5),cartesian_product2(sK2,sK3))
      | ~ in(ordered_pair(X4,X5),cartesian_product2(sK0,sK1)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f143,plain,
    ~ in(sK4(sF11,sF10),sF11),
    inference(subsumption_resolution,[],[f140,f48]) ).

fof(f140,plain,
    ( sF10 = sF11
    | ~ in(sK4(sF11,sF10),sF11) ),
    inference(resolution,[],[f138,f31]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ~ in(sK4(X0,X1),X1)
      | X0 = X1
      | ~ in(sK4(X0,X1),X0) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f138,plain,
    in(sK4(sF11,sF10),sF10),
    inference(resolution,[],[f137,f83]) ).

fof(f83,plain,
    ! [X0] :
      ( ~ in(X0,sF11)
      | in(X0,sF10) ),
    inference(duplicate_literal_removal,[],[f82]) ).

fof(f82,plain,
    ! [X0] :
      ( ~ in(X0,sF11)
      | in(X0,sF10)
      | ~ in(X0,sF11) ),
    inference(superposition,[],[f62,f47]) ).

fof(f62,plain,
    ! [X2,X0,X1] :
      ( ~ in(X2,cartesian_product2(X0,X1))
      | in(X2,sF10)
      | ~ in(X2,sF11) ),
    inference(superposition,[],[f49,f43]) ).

fof(f49,plain,
    ! [X4,X5] :
      ( ~ in(ordered_pair(X4,X5),sF11)
      | in(ordered_pair(X4,X5),sF10) ),
    inference(definition_folding,[],[f28,f47,f46]) ).

fof(f28,plain,
    ! [X4,X5] :
      ( in(ordered_pair(X4,X5),cartesian_product2(sK0,sK1))
      | ~ in(ordered_pair(X4,X5),cartesian_product2(sK2,sK3)) ),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET955+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.14/0.15  % 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.36  % Computer : n003.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 16:51:38 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.22/0.36  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.ipyAGKZexV/Vampire---4.8_5630
% 0.57/0.74  % (5975)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.57/0.75  % (5970)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.57/0.75  % (5972)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.57/0.75  % (5971)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.57/0.75  % (5973)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.57/0.75  % (5974)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.57/0.75  % (5975)Refutation not found, incomplete strategy% (5975)------------------------------
% 0.57/0.75  % (5975)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (5975)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (5975)Memory used [KB]: 1059
% 0.57/0.75  % (5975)Time elapsed: 0.004 s
% 0.57/0.75  % (5975)Instructions burned: 7 (million)
% 0.57/0.75  % (5973)Refutation not found, incomplete strategy% (5973)------------------------------
% 0.57/0.75  % (5973)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (5975)------------------------------
% 0.57/0.75  % (5975)------------------------------
% 0.57/0.75  % (5973)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (5973)Memory used [KB]: 1036
% 0.57/0.75  % (5973)Time elapsed: 0.003 s
% 0.57/0.75  % (5973)Instructions burned: 3 (million)
% 0.57/0.75  % (5973)------------------------------
% 0.57/0.75  % (5973)------------------------------
% 0.57/0.75  % (5970)Refutation not found, incomplete strategy% (5970)------------------------------
% 0.57/0.75  % (5970)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (5970)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (5970)Memory used [KB]: 1064
% 0.57/0.75  % (5970)Time elapsed: 0.005 s
% 0.57/0.75  % (5970)Instructions burned: 5 (million)
% 0.57/0.75  % (5970)------------------------------
% 0.57/0.75  % (5970)------------------------------
% 0.57/0.75  % (5977)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.57/0.75  % (5976)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.57/0.75  % (5978)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 (2996ds/55Mi)
% 0.57/0.75  % (5974)Refutation not found, incomplete strategy% (5974)------------------------------
% 0.57/0.75  % (5974)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (5974)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (5974)Memory used [KB]: 1048
% 0.57/0.75  % (5974)Time elapsed: 0.006 s
% 0.57/0.75  % (5974)Instructions burned: 4 (million)
% 0.57/0.75  % (5974)------------------------------
% 0.57/0.75  % (5974)------------------------------
% 0.57/0.75  % (5980)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.57/0.75  % (5979)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 Vampire---4 for (2996ds/50Mi)
% 0.57/0.75  % (5978)Refutation not found, incomplete strategy% (5978)------------------------------
% 0.57/0.75  % (5978)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (5978)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (5978)Memory used [KB]: 1064
% 0.57/0.75  % (5978)Time elapsed: 0.004 s
% 0.57/0.75  % (5978)Instructions burned: 6 (million)
% 0.57/0.75  % (5978)------------------------------
% 0.57/0.75  % (5978)------------------------------
% 0.57/0.76  % (5980)First to succeed.
% 0.57/0.76  % (5981)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 Vampire---4 for (2996ds/52Mi)
% 0.57/0.76  % (5982)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 Vampire---4 for (2996ds/518Mi)
% 0.57/0.76  % (5980)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5874"
% 0.62/0.76  % (5980)Refutation found. Thanks to Tanya!
% 0.62/0.76  % SZS status Theorem for Vampire---4
% 0.62/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.76  % (5980)------------------------------
% 0.62/0.76  % (5980)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.76  % (5980)Termination reason: Refutation
% 0.62/0.76  
% 0.62/0.76  % (5980)Memory used [KB]: 1069
% 0.62/0.76  % (5980)Time elapsed: 0.007 s
% 0.62/0.76  % (5980)Instructions burned: 11 (million)
% 0.62/0.76  % (5874)Success in time 0.388 s
% 0.62/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------