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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV379+1 : TPTP v8.2.0. Released v3.3.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 : n029.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 05:55:29 EDT 2024

% Result   : Theorem 0.47s 0.70s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   69 (  11 unt;   0 def)
%            Number of atoms       :  174 (  46 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  170 (  65   ~;  72   |;  16   &)
%                                         (   6 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :   95 (  89   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f192,plain,
    $false,
    inference(avatar_sat_refutation,[],[f150,f163,f174,f177,f190]) ).

fof(f190,plain,
    ~ spl3_1,
    inference(avatar_contradiction_clause,[],[f189]) ).

fof(f189,plain,
    ( $false
    | ~ spl3_1 ),
    inference(subsumption_resolution,[],[f188,f94]) ).

fof(f94,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(flattening,[],[f44]) ).

fof(f44,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(true_and_false_elimination,[],[f28]) ).

fof(f28,axiom,
    ! [X0,X1] :
      ( ok(triple(X0,X1,bad))
    <=> $false ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).

fof(f188,plain,
    ( ok(triple(sK0,create_slb,bad))
    | ~ spl3_1 ),
    inference(forward_demodulation,[],[f181,f99]) ).

fof(f99,plain,
    ! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    inference(cnf_transformation,[],[f34]) ).

fof(f34,axiom,
    ! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).

fof(f181,plain,
    ( ok(findmin_cpq_eff(triple(sK0,create_slb,sK2)))
    | ~ spl3_1 ),
    inference(superposition,[],[f92,f145]) ).

fof(f145,plain,
    ( create_slb = sK1
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f143]) ).

fof(f143,plain,
    ( spl3_1
  <=> create_slb = sK1 ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

fof(f92,plain,
    ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
    inference(cnf_transformation,[],[f86]) ).

fof(f86,plain,
    ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
    & ~ ok(triple(sK0,sK1,sK2)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f55,f85]) ).

fof(f85,plain,
    ( ? [X0,X1,X2] :
        ( ok(findmin_cpq_eff(triple(X0,X1,X2)))
        & ~ ok(triple(X0,X1,X2)) )
   => ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
      & ~ ok(triple(sK0,sK1,sK2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f55,plain,
    ? [X0,X1,X2] :
      ( ok(findmin_cpq_eff(triple(X0,X1,X2)))
      & ~ ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f43,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ~ ok(triple(X0,X1,X2))
       => ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
    inference(negated_conjecture,[],[f42]) ).

fof(f42,conjecture,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l15_co) ).

fof(f177,plain,
    ( spl3_1
    | ~ spl3_3
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f176,f147,f153,f143]) ).

fof(f153,plain,
    ( spl3_3
  <=> strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

fof(f147,plain,
    ( spl3_2
  <=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f176,plain,
    ( ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | create_slb = sK1
    | ~ spl3_2 ),
    inference(subsumption_resolution,[],[f175,f149]) ).

fof(f149,plain,
    ( contains_slb(sK1,findmin_pqp_res(sK0))
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f147]) ).

fof(f175,plain,
    ( ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(subsumption_resolution,[],[f167,f94]) ).

fof(f167,plain,
    ( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(superposition,[],[f164,f97]) ).

fof(f97,plain,
    ! [X2,X0,X1] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(cnf_transformation,[],[f60]) ).

fof(f60,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(flattening,[],[f59]) ).

fof(f59,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(ennf_transformation,[],[f47]) ).

fof(f47,plain,
    ! [X0,X1,X2] :
      ( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
        & contains_slb(X1,findmin_pqp_res(X0))
        & create_slb != X1 )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
    inference(rectify,[],[f36]) ).

fof(f36,axiom,
    ! [X0,X1,X2,X3] :
      ( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
        & contains_slb(X1,findmin_pqp_res(X0))
        & create_slb != X1 )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).

fof(f164,plain,
    ok(findmin_cpq_eff(triple(sK0,sK1,bad))),
    inference(superposition,[],[f92,f137]) ).

fof(f137,plain,
    bad = sK2,
    inference(resolution,[],[f91,f93]) ).

fof(f93,plain,
    ! [X2,X0,X1] :
      ( ok(triple(X0,X1,X2))
      | bad = X2 ),
    inference(cnf_transformation,[],[f56]) ).

fof(f56,plain,
    ! [X0,X1,X2] :
      ( bad = X2
      | ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,axiom,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => bad = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax41) ).

fof(f91,plain,
    ~ ok(triple(sK0,sK1,sK2)),
    inference(cnf_transformation,[],[f86]) ).

fof(f174,plain,
    ( spl3_3
    | spl3_4 ),
    inference(avatar_contradiction_clause,[],[f173]) ).

fof(f173,plain,
    ( $false
    | spl3_3
    | spl3_4 ),
    inference(subsumption_resolution,[],[f172,f170]) ).

fof(f170,plain,
    ( ~ less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | spl3_3
    | spl3_4 ),
    inference(subsumption_resolution,[],[f169,f162]) ).

fof(f162,plain,
    ( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | spl3_4 ),
    inference(avatar_component_clause,[],[f160]) ).

fof(f160,plain,
    ( spl3_4
  <=> less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

fof(f169,plain,
    ( less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | ~ less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | spl3_3 ),
    inference(resolution,[],[f155,f113]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
      | less_than(X1,X0)
      | ~ less_than(X0,X1) ),
    inference(cnf_transformation,[],[f75]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
      | less_than(X1,X0)
      | ~ less_than(X0,X1) ),
    inference(flattening,[],[f74]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
      | less_than(X1,X0)
      | ~ less_than(X0,X1) ),
    inference(ennf_transformation,[],[f52]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ( ~ less_than(X1,X0)
        & less_than(X0,X1) )
     => strictly_less_than(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
    <=> ( ~ less_than(X1,X0)
        & less_than(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).

fof(f155,plain,
    ( ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | spl3_3 ),
    inference(avatar_component_clause,[],[f153]) ).

fof(f172,plain,
    ( less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | spl3_4 ),
    inference(resolution,[],[f162,f115]) ).

fof(f115,plain,
    ! [X0,X1] :
      ( less_than(X1,X0)
      | less_than(X0,X1) ),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( less_than(X1,X0)
      | less_than(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).

fof(f163,plain,
    ( spl3_1
    | ~ spl3_2
    | ~ spl3_4 ),
    inference(avatar_split_clause,[],[f158,f160,f147,f143]) ).

fof(f158,plain,
    ( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(subsumption_resolution,[],[f157,f94]) ).

fof(f157,plain,
    ( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(forward_demodulation,[],[f140,f137]) ).

fof(f140,plain,
    ( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),sK2))
    | ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(superposition,[],[f92,f96]) ).

fof(f96,plain,
    ! [X2,X0,X1] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
      | ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(cnf_transformation,[],[f58]) ).

fof(f58,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
      | ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(flattening,[],[f57]) ).

fof(f57,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
      | ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(ennf_transformation,[],[f46]) ).

fof(f46,plain,
    ! [X0,X1,X2] :
      ( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
        & contains_slb(X1,findmin_pqp_res(X0))
        & create_slb != X1 )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
    inference(rectify,[],[f37]) ).

fof(f37,axiom,
    ! [X0,X1,X2,X3] :
      ( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
        & contains_slb(X1,findmin_pqp_res(X0))
        & create_slb != X1 )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).

fof(f150,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f141,f147,f143]) ).

fof(f141,plain,
    ( contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(subsumption_resolution,[],[f138,f94]) ).

fof(f138,plain,
    ( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | contains_slb(sK1,findmin_pqp_res(sK0))
    | create_slb = sK1 ),
    inference(superposition,[],[f92,f98]) ).

fof(f98,plain,
    ! [X2,X0,X1] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(cnf_transformation,[],[f62]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(flattening,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(ennf_transformation,[],[f48]) ).

fof(f48,plain,
    ! [X0,X1,X2] :
      ( ( ~ contains_slb(X1,findmin_pqp_res(X0))
        & create_slb != X1 )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
    inference(rectify,[],[f35]) ).

fof(f35,axiom,
    ! [X0,X1,X2,X3] :
      ( ( ~ contains_slb(X1,findmin_pqp_res(X0))
        & create_slb != X1 )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SWV379+1 : TPTP v8.2.0. Released v3.3.0.
% 0.11/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.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 07:16:38 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.12/0.34  This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34  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.47/0.69  % (23580)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.47/0.69  % (23580)Refutation not found, incomplete strategy% (23580)------------------------------
% 0.47/0.69  % (23580)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.69  % (23580)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.69  
% 0.47/0.69  % (23580)Memory used [KB]: 1088
% 0.47/0.69  % (23580)Time elapsed: 0.002 s
% 0.47/0.69  % (23580)Instructions burned: 2 (million)
% 0.47/0.69  % (23580)------------------------------
% 0.47/0.69  % (23580)------------------------------
% 0.47/0.69  % (23587)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.47/0.69  % (23587)Refutation not found, incomplete strategy% (23587)------------------------------
% 0.47/0.69  % (23587)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.69  % (23587)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.69  
% 0.47/0.69  % (23587)Memory used [KB]: 1071
% 0.47/0.69  % (23587)Time elapsed: 0.002 s
% 0.47/0.69  % (23587)Instructions burned: 2 (million)
% 0.47/0.69  % (23587)------------------------------
% 0.47/0.69  % (23587)------------------------------
% 0.47/0.69  % (23586)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.47/0.69  % (23583)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.47/0.69  % (23582)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.69  % (23586)Refutation not found, incomplete strategy% (23586)------------------------------
% 0.47/0.69  % (23586)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.69  % (23586)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.69  
% 0.47/0.69  % (23586)Memory used [KB]: 1076
% 0.47/0.69  % (23586)Time elapsed: 0.002 s
% 0.47/0.69  % (23586)Instructions burned: 3 (million)
% 0.47/0.69  % (23583)Refutation not found, incomplete strategy% (23583)------------------------------
% 0.47/0.69  % (23583)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.69  % (23583)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.69  
% 0.47/0.69  % (23583)Memory used [KB]: 1084
% 0.47/0.69  % (23583)Time elapsed: 0.001 s
% 0.47/0.69  % (23583)Instructions burned: 2 (million)
% 0.47/0.69  % (23588)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 (2996ds/55Mi)
% 0.47/0.69  % (23586)------------------------------
% 0.47/0.69  % (23586)------------------------------
% 0.47/0.69  % (23583)------------------------------
% 0.47/0.69  % (23583)------------------------------
% 0.47/0.70  % (23589)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 (2996ds/50Mi)
% 0.47/0.70  % (23581)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.47/0.70  % (23588)Refutation not found, incomplete strategy% (23588)------------------------------
% 0.47/0.70  % (23588)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23588)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23588)Memory used [KB]: 1085
% 0.47/0.70  % (23588)Time elapsed: 0.003 s
% 0.47/0.70  % (23588)Instructions burned: 2 (million)
% 0.47/0.70  % (23588)------------------------------
% 0.47/0.70  % (23588)------------------------------
% 0.47/0.70  % (23584)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.47/0.70  % (23585)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.47/0.70  % (23585)Refutation not found, incomplete strategy% (23585)------------------------------
% 0.47/0.70  % (23585)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23585)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23585)Memory used [KB]: 1077
% 0.47/0.70  % (23585)Time elapsed: 0.001 s
% 0.47/0.70  % (23585)Instructions burned: 2 (million)
% 0.47/0.70  % (23590)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 (2996ds/208Mi)
% 0.47/0.70  % (23589)Refutation not found, incomplete strategy% (23589)------------------------------
% 0.47/0.70  % (23589)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23589)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23589)Memory used [KB]: 1087
% 0.47/0.70  % (23589)Time elapsed: 0.004 s
% 0.47/0.70  % (23589)Instructions burned: 4 (million)
% 0.47/0.70  % (23591)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 (2996ds/52Mi)
% 0.47/0.70  % (23585)------------------------------
% 0.47/0.70  % (23585)------------------------------
% 0.47/0.70  % (23584)Refutation not found, incomplete strategy% (23584)------------------------------
% 0.47/0.70  % (23584)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23589)------------------------------
% 0.47/0.70  % (23589)------------------------------
% 0.47/0.70  % (23584)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23584)Memory used [KB]: 1090
% 0.47/0.70  % (23584)Time elapsed: 0.002 s
% 0.47/0.70  % (23584)Instructions burned: 4 (million)
% 0.47/0.70  % (23584)------------------------------
% 0.47/0.70  % (23584)------------------------------
% 0.47/0.70  % (23590)Refutation not found, incomplete strategy% (23590)------------------------------
% 0.47/0.70  % (23590)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23590)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23590)Memory used [KB]: 1079
% 0.47/0.70  % (23590)Time elapsed: 0.003 s
% 0.47/0.70  % (23592)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 (2996ds/518Mi)
% 0.47/0.70  % (23590)Instructions burned: 3 (million)
% 0.47/0.70  % (23590)------------------------------
% 0.47/0.70  % (23590)------------------------------
% 0.47/0.70  % (23593)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 (2996ds/42Mi)
% 0.47/0.70  % (23594)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 (2996ds/243Mi)
% 0.47/0.70  % (23593)Refutation not found, incomplete strategy% (23593)------------------------------
% 0.47/0.70  % (23593)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23593)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23593)Memory used [KB]: 1090
% 0.47/0.70  % (23593)Time elapsed: 0.002 s
% 0.47/0.70  % (23593)Instructions burned: 4 (million)
% 0.47/0.70  % (23593)------------------------------
% 0.47/0.70  % (23593)------------------------------
% 0.47/0.70  % (23592)First to succeed.
% 0.47/0.70  % (23595)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2996ds/117Mi)
% 0.47/0.70  % (23592)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-23576"
% 0.47/0.70  % (23596)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2996ds/143Mi)
% 0.47/0.70  % (23595)Refutation not found, incomplete strategy% (23595)------------------------------
% 0.47/0.70  % (23595)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23595)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70  
% 0.47/0.70  % (23595)Memory used [KB]: 1074
% 0.47/0.70  % (23595)Time elapsed: 0.002 s
% 0.47/0.70  % (23595)Instructions burned: 2 (million)
% 0.47/0.70  % (23592)Refutation found. Thanks to Tanya!
% 0.47/0.70  % SZS status Theorem for theBenchmark
% 0.47/0.70  % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.70  % (23592)------------------------------
% 0.47/0.70  % (23592)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70  % (23592)Termination reason: Refutation
% 0.47/0.70  
% 0.47/0.70  % (23592)Memory used [KB]: 1127
% 0.47/0.70  % (23592)Time elapsed: 0.006 s
% 0.47/0.70  % (23592)Instructions burned: 8 (million)
% 0.47/0.70  % (23576)Success in time 0.358 s
% 0.47/0.71  % Vampire---4.8 exiting
%------------------------------------------------------------------------------