TSTP Solution File: SET853-2 by Vampire---4.8

View Problem - Process Solution

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

% Computer : n021.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:13:39 EDT 2024

% Result   : Unsatisfiable 0.73s 0.90s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   51 (  10 unt;   0 def)
%            Number of atoms       :  142 (  15 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  156 (  65   ~;  85   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,plain,
    $false,
    inference(avatar_sat_refutation,[],[f27,f57,f71,f74,f80,f90,f95]) ).

fof(f95,plain,
    ( spl0_7
    | spl0_8 ),
    inference(avatar_split_clause,[],[f94,f64,f61]) ).

fof(f61,plain,
    ( spl0_7
  <=> ! [X0] :
        ( c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a))) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).

fof(f64,plain,
    ( spl0_8
  <=> c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).

fof(f94,plain,
    ( ! [X0] :
        ( c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
    | spl0_8 ),
    inference(subsumption_resolution,[],[f93,f1]) ).

fof(f1,axiom,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f93,plain,
    ( ! [X0] :
        ( c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
    | spl0_8 ),
    inference(resolution,[],[f66,f9]) ).

fof(f9,axiom,
    ! [X3,X6,X4,X5] :
      ( c_in(c_Zorn_OTFin__linear__lemma1__1(X5,X4,X3),c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3)))
      | c_lessequals(X6,X4,tc_set(tc_set(X3)))
      | c_lessequals(c_Zorn_Osucc(X5,X4,X3),X6,tc_set(tc_set(X3)))
      | ~ c_in(X6,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3)))
      | ~ c_in(X4,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_0) ).

fof(f66,plain,
    ( ~ c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | spl0_8 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f90,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f89]) ).

fof(f89,plain,
    ( $false
    | ~ spl0_6 ),
    inference(subsumption_resolution,[],[f85,f8]) ).

fof(f8,axiom,
    ! [X2,X3] : c_lessequals(X2,X2,tc_set(X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

fof(f85,plain,
    ( ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a)))
    | ~ spl0_6 ),
    inference(superposition,[],[f5,f56]) ).

fof(f56,plain,
    ( v_x = v_xa
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f54]) ).

fof(f54,plain,
    ( spl0_6
  <=> v_x = v_xa ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).

fof(f5,axiom,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f80,plain,
    ( spl0_2
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f77,f61,f24]) ).

fof(f24,plain,
    ( spl0_2
  <=> c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f77,plain,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | ~ spl0_7 ),
    inference(subsumption_resolution,[],[f76,f2]) ).

fof(f2,axiom,
    c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f76,plain,
    ( ~ c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | ~ spl0_7 ),
    inference(resolution,[],[f62,f15]) ).

fof(f15,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))),
    inference(subsumption_resolution,[],[f14,f4]) ).

fof(f4,axiom,
    v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f14,plain,
    ( v_xa = c_Zorn_Osucc(v_S,v_x,t_a)
    | ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f3,f7]) ).

fof(f7,axiom,
    ! [X2,X3,X1] :
      ( ~ c_lessequals(X2,X1,tc_set(X3))
      | X1 = X2
      | ~ c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

fof(f3,axiom,
    c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f62,plain,
    ( ! [X0] :
        ( c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | c_lessequals(X0,v_x,tc_set(tc_set(t_a))) )
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f61]) ).

fof(f74,plain,
    ( spl0_7
    | spl0_9 ),
    inference(avatar_split_clause,[],[f73,f68,f61]) ).

fof(f68,plain,
    ( spl0_9
  <=> c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).

fof(f73,plain,
    ( ! [X0] :
        ( c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
    | spl0_9 ),
    inference(subsumption_resolution,[],[f72,f1]) ).

fof(f72,plain,
    ( ! [X0] :
        ( c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
    | spl0_9 ),
    inference(resolution,[],[f70,f10]) ).

fof(f10,axiom,
    ! [X3,X6,X4,X5] :
      ( c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X5,X4,X3),X4,tc_set(tc_set(X3)))
      | c_lessequals(c_Zorn_Osucc(X5,X4,X3),X6,tc_set(tc_set(X3)))
      | c_lessequals(X6,X4,tc_set(tc_set(X3)))
      | ~ c_in(X6,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3)))
      | ~ c_in(X4,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).

fof(f70,plain,
    ( ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
    | spl0_9 ),
    inference(avatar_component_clause,[],[f68]) ).

fof(f71,plain,
    ( spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | spl0_1 ),
    inference(avatar_split_clause,[],[f59,f20,f68,f64,f61]) ).

fof(f20,plain,
    ( spl0_1
  <=> v_x = c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f59,plain,
    ( ! [X0] :
        ( ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
        | ~ c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
    | spl0_1 ),
    inference(subsumption_resolution,[],[f58,f1]) ).

fof(f58,plain,
    ( ! [X0] :
        ( ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
        | ~ c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
        | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
        | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
        | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
    | spl0_1 ),
    inference(subsumption_resolution,[],[f50,f22]) ).

fof(f22,plain,
    ( v_x != c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f50,plain,
    ! [X0] :
      ( ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
      | v_x = c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)
      | ~ c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
      | c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X0,tc_set(tc_set(t_a)))
      | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
      | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f6,f12]) ).

fof(f12,axiom,
    ! [X3,X6,X4,X5] :
      ( ~ c_lessequals(c_Zorn_Osucc(X5,c_Zorn_OTFin__linear__lemma1__1(X5,X4,X3),X3),X4,tc_set(tc_set(X3)))
      | c_lessequals(X6,X4,tc_set(tc_set(X3)))
      | c_lessequals(c_Zorn_Osucc(X5,X4,X3),X6,tc_set(tc_set(X3)))
      | ~ c_in(X6,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3)))
      | ~ c_in(X4,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).

fof(f6,axiom,
    ! [X0] :
      ( c_lessequals(c_Zorn_Osucc(v_S,X0,t_a),v_x,tc_set(tc_set(t_a)))
      | ~ c_lessequals(X0,v_x,tc_set(tc_set(t_a)))
      | v_x = X0
      | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

fof(f57,plain,
    ( spl0_6
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f52,f24,f54]) ).

fof(f52,plain,
    ( ~ c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | v_x = v_xa ),
    inference(subsumption_resolution,[],[f49,f2]) ).

fof(f49,plain,
    ( ~ c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | v_x = v_xa
    | ~ c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f6,f29]) ).

fof(f29,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))),
    inference(resolution,[],[f5,f13]) ).

fof(f13,axiom,
    ! [X3,X8,X7,X5] :
      ( c_lessequals(X7,c_Zorn_Osucc(X5,X8,X3),tc_set(tc_set(X3)))
      | ~ c_lessequals(X7,X8,tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).

fof(f27,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f18,f24,f20]) ).

fof(f18,plain,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | v_x != c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) ),
    inference(subsumption_resolution,[],[f17,f1]) ).

fof(f17,plain,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | v_x != c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)
    | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(subsumption_resolution,[],[f16,f2]) ).

fof(f16,plain,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | v_x != c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)
    | ~ c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f15,f11]) ).

fof(f11,axiom,
    ! [X3,X6,X4,X5] :
      ( c_lessequals(c_Zorn_Osucc(X5,X4,X3),X6,tc_set(tc_set(X3)))
      | c_lessequals(X6,X4,tc_set(tc_set(X3)))
      | c_Zorn_OTFin__linear__lemma1__1(X5,X4,X3) != X4
      | ~ c_in(X6,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3)))
      | ~ c_in(X4,c_Zorn_OTFin(X5,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET853-2 : TPTP v8.2.0. Released v3.2.0.
% 0.12/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.36  % Computer : n021.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   : Mon May 20 11:12:38 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.14/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/benchmark/theBenchmark.p
% 0.70/0.90  % (17092)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 (2994ds/34Mi)
% 0.70/0.90  % (17094)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.70/0.90  % (17095)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.70/0.90  % (17093)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 (2994ds/51Mi)
% 0.70/0.90  % (17096)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 (2994ds/34Mi)
% 0.70/0.90  % (17097)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.70/0.90  % (17098)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 (2994ds/83Mi)
% 0.70/0.90  % (17099)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 (2994ds/56Mi)
% 0.70/0.90  % (17096)Refutation not found, incomplete strategy% (17096)------------------------------
% 0.70/0.90  % (17096)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.90  % (17096)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.90  
% 0.70/0.90  % (17096)Memory used [KB]: 1058
% 0.70/0.90  % (17096)Time elapsed: 0.004 s
% 0.70/0.90  % (17096)Instructions burned: 5 (million)
% 0.70/0.90  % (17099)Refutation not found, incomplete strategy% (17099)------------------------------
% 0.70/0.90  % (17099)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.90  % (17097)First to succeed.
% 0.70/0.90  % (17096)------------------------------
% 0.70/0.90  % (17096)------------------------------
% 0.70/0.90  % (17099)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.90  
% 0.70/0.90  % (17099)Memory used [KB]: 982
% 0.70/0.90  % (17099)Time elapsed: 0.004 s
% 0.70/0.90  % (17099)Instructions burned: 4 (million)
% 0.73/0.90  % (17099)------------------------------
% 0.73/0.90  % (17099)------------------------------
% 0.73/0.90  % (17097)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-17091"
% 0.73/0.90  % (17094)Also succeeded, but the first one will report.
% 0.73/0.90  % (17098)Also succeeded, but the first one will report.
% 0.73/0.90  % (17097)Refutation found. Thanks to Tanya!
% 0.73/0.90  % SZS status Unsatisfiable for theBenchmark
% 0.73/0.90  % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90  % (17097)------------------------------
% 0.73/0.90  % (17097)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90  % (17097)Termination reason: Refutation
% 0.73/0.90  
% 0.73/0.90  % (17097)Memory used [KB]: 1071
% 0.73/0.90  % (17097)Time elapsed: 0.005 s
% 0.73/0.90  % (17097)Instructions burned: 6 (million)
% 0.73/0.90  % (17091)Success in time 0.53 s
% 0.73/0.90  % Vampire---4.8 exiting
%------------------------------------------------------------------------------