↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWW541_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:30:46 PM UTC 2026

% Result   : Theorem 4.54s 1.45s
% Output   : Refutation 5.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   28 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   52 (  32 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   44 (  20   ~;  14   |;   4   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  14 usr;   1 prp; 0-3 aty)
%            Number of functors    :   39 (  39 usr;   6 con; 0-5 aty)
%            Number of variables   :   66 (  56   !;  10   ?;  66   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    a1: $tType ).

tff(type_def_6,type,
    bool: $tType ).

tff(type_def_7,type,
    huffma1450048681e_tree: $tType > $tType ).

tff(type_def_8,type,
    int: $tType ).

tff(type_def_9,type,
    nat: $tType ).

tff(type_def_10,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_1,type,
    huffma675207370phabet: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > fun(X0,bool) ) ).

tff(func_def_2,type,
    huffma1134658180e_cost: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).

tff(func_def_3,type,
    huffma410068972_depth: 
      !>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).

tff(func_def_4,type,
    huffma1352802255e_freq: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > fun(X0,nat) ) ).

tff(func_def_5,type,
    huffma945805758height: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).

tff(func_def_6,type,
    huffma1401021291ibling: 
      !>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > X0 ) ).

tff(func_def_7,type,
    huffma1146269203erNode: 
      !>[X0: $tType] : ( ( nat * huffma1450048681e_tree(X0) * huffma1450048681e_tree(X0) ) > huffma1450048681e_tree(X0) ) ).

tff(func_def_8,type,
    huffma2021818691e_Leaf: 
      !>[X0: $tType] : ( ( nat * X0 ) > huffma1450048681e_tree(X0) ) ).

tff(func_def_9,type,
    huffma107959123e_case: 
      !>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),X1))) * huffma1450048681e_tree(X0) ) > X1 ) ).

tff(func_def_10,type,
    huffma1280178957ee_rec: 
      !>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),fun(X1,fun(X1,X1))))) * huffma1450048681e_tree(X0) ) > X1 ) ).

tff(func_def_11,type,
    if: 
      !>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).

tff(func_def_12,type,
    semiring_1_of_nat: 
      !>[X0: $tType] : ( nat > X0 ) ).

tff(func_def_13,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

tff(func_def_14,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_15,type,
    fFalse: bool ).

tff(func_def_16,type,
    fTrue: bool ).

tff(func_def_17,type,
    a: a1 ).

tff(func_def_18,type,
    t_1: huffma1450048681e_tree(a1) ).

tff(func_def_19,type,
    t_2: huffma1450048681e_tree(a1) ).

tff(func_def_20,type,
    w: nat ).

tff(func_def_21,type,
    sK0: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > X0 ) ).

tff(func_def_22,type,
    sK1: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).

tff(func_def_23,type,
    sK2: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > huffma1450048681e_tree(X0) ) ).

tff(func_def_24,type,
    sK3: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > huffma1450048681e_tree(X0) ) ).

tff(func_def_25,type,
    sK4: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).

tff(func_def_26,type,
    sK5: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > X0 ) ).

tff(func_def_27,type,
    sK6: fun(int,bool) > int ).

tff(func_def_28,type,
    sK7: fun(int,bool) > nat ).

tff(func_def_29,type,
    sK8: fun(int,bool) > nat ).

tff(func_def_30,type,
    sK9: fun(int,bool) > int ).

tff(func_def_31,type,
    sK10: ( nat * fun(nat,bool) ) > nat ).

tff(func_def_32,type,
    sK11: fun(nat,bool) > nat ).

tff(func_def_33,type,
    sK12: fun(nat,nat) > nat ).

tff(func_def_34,type,
    sK13: fun(nat,nat) > nat ).

tff(func_def_35,type,
    sK14: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_36,type,
    sK15: int > nat ).

tff(pred_def_1,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    ord: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    order: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    linorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    preorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    semiring_char_0: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    linordered_semidom: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    huffma1518433673istent: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > $o ) ).

tff(pred_def_10,type,
    huffma1393970616ptimum: 
      !>[X0: $tType] : ( huffma1450048681e_tree(X0) > $o ) ).

tff(pred_def_11,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_12,type,
    ord_less_eq: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_13,type,
    member: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).

tff(pred_def_14,type,
    pp: bool > $o ).

tff(f3,axiom,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: nat,X3: huffma1450048681e_tree(X0),X4: huffma1450048681e_tree(X0),X5: nat,X6: X0] :
      ( ( member(X0,X6,huffma675207370phabet(X0,huffma1146269203erNode(X0,X5,X4,X3)))
       => ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = huffma1401021291ibling(X0,huffma1146269203erNode(X0,X5,X4,X3),X6) ) )
      & ( ~ member(X0,X6,huffma675207370phabet(X0,huffma1146269203erNode(X0,X5,X4,X3)))
       => ( ( member(X0,X6,huffma675207370phabet(X0,X1))
           => ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = huffma1401021291ibling(X0,X1,X6) ) )
          & ( ~ member(X0,X6,huffma675207370phabet(X0,X1))
           => ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = X6 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_sibling_Osimps_I3_J) ).

tff(f19,axiom,
    ! [X0: $tType,X1: X0,X2: nat] : ( huffma945805758height(X0,huffma2021818691e_Leaf(X0,X2,X1)) = zero_zero(nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_18_height_Osimps_I1_J) ).

tff(f32,axiom,
    ! [X0: nat] : ~ ord_less(nat,X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_31_less__not__refl) ).

tff(f36,axiom,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0)] :
      ( ! [X2: nat,X3: X0] : ( X1 != huffma2021818691e_Leaf(X0,X2,X3) )
     => ~ ! [X2: nat,X4: huffma1450048681e_tree(X0),X5: huffma1450048681e_tree(X0)] : ( X1 != huffma1146269203erNode(X0,X2,X4,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_35_tree_Oexhaust) ).

tff(f128,axiom,
    ord_less(nat,zero_zero(nat),huffma945805758height(a1,t_1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f129,axiom,
    member(a1,a,huffma675207370phabet(a1,t_1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(f130,conjecture,
    huffma1401021291ibling(a1,huffma1146269203erNode(a1,w,t_1,t_2),a) = huffma1401021291ibling(a1,t_1,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).

tff(f131,negated_conjecture,
    ( ( ~ huffma1401021291ibling(a1,huffma1146269203erNode(a1,w,t_1,t_2),a) ) = huffma1401021291ibling(a1,t_1,a) ),
    inference(negated_conjecture,[status(cth)],[f130]) ).

tff(f132,plain,
    huffma1401021291ibling(a1,huffma1146269203erNode(a1,w,t_1,t_2),a) != huffma1401021291ibling(a1,t_1,a),
    inference(flattening,[],[f131]) ).

tff(f133,plain,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0)] :
      ( ! [X2: nat,X3: X0] : ( X1 != huffma2021818691e_Leaf(X0,X2,X3) )
     => ~ ! [X4: nat,X5: huffma1450048681e_tree(X0),X6: huffma1450048681e_tree(X0)] : ( huffma1146269203erNode(X0,X4,X5,X6) != X1 ) ),
    inference(rectify,[],[f36]) ).

tff(f151,plain,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: nat,X3: huffma1450048681e_tree(X0),X4: huffma1450048681e_tree(X0),X5: nat,X6: X0] :
      ( ( ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = huffma1401021291ibling(X0,huffma1146269203erNode(X0,X5,X4,X3),X6) )
        | ~ member(X0,X6,huffma675207370phabet(X0,huffma1146269203erNode(X0,X5,X4,X3))) )
      & ( ( ( ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = huffma1401021291ibling(X0,X1,X6) )
            | ~ member(X0,X6,huffma675207370phabet(X0,X1)) )
          & ( ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = X6 )
            | member(X0,X6,huffma675207370phabet(X0,X1)) ) )
        | member(X0,X6,huffma675207370phabet(X0,huffma1146269203erNode(X0,X5,X4,X3))) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f153,plain,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0)] :
      ( ? [X4: nat,X5: huffma1450048681e_tree(X0),X6: huffma1450048681e_tree(X0)] : ( huffma1146269203erNode(X0,X4,X5,X6) = X1 )
      | ? [X2: nat,X3: X0] : ( huffma2021818691e_Leaf(X0,X2,X3) = X1 ) ),
    inference(ennf_transformation,[],[f133]) ).

tff(f179,plain,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0)] :
      ( ? [X2: nat,X3: huffma1450048681e_tree(X0),X4: huffma1450048681e_tree(X0)] : ( huffma1146269203erNode(X0,X2,X3,X4) = X1 )
      | ? [X5: nat,X6: X0] : ( huffma2021818691e_Leaf(X0,X5,X6) = X1 ) ),
    inference(rectify,[],[f153]) ).

tff(f180,plain,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0)] :
      ( ( huffma1146269203erNode(X0,sK1(X0,X1),sK2(X0,X1),sK3(X0,X1)) = X1 )
      | ( huffma2021818691e_Leaf(X0,sK4(X0,X1),sK5(X0,X1)) = X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1)),skolemize(X5,sK4(X0,X1)),skolemize(X6,sK5(X0,X1))],[f179]) ).

tff(f208,plain,
    ord_less(nat,zero_zero(nat),huffma945805758height(a1,t_1)),
    inference(cnf_transformation,[],[f128]) ).

tff(f209,plain,
    member(a1,a,huffma675207370phabet(a1,t_1)),
    inference(cnf_transformation,[],[f129]) ).

tff(f210,plain,
    huffma1401021291ibling(a1,huffma1146269203erNode(a1,w,t_1,t_2),a) != huffma1401021291ibling(a1,t_1,a),
    inference(cnf_transformation,[],[f132]) ).

tff(f211,plain,
    ! [X0: $tType,X2: nat,X1: X0] : ( zero_zero(nat) = huffma945805758height(X0,huffma2021818691e_Leaf(X0,X2,X1)) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f224,plain,
    ! [X0: nat] : ~ ord_less(nat,X0,X0),
    inference(cnf_transformation,[],[f32]) ).

tff(f249,plain,
    ! [X0: $tType,X2: nat,X3: huffma1450048681e_tree(X0),X1: huffma1450048681e_tree(X0),X6: X0,X4: huffma1450048681e_tree(X0),X5: nat] :
      ( ( huffma1401021291ibling(X0,huffma1146269203erNode(X0,X2,huffma1146269203erNode(X0,X5,X4,X3),X1),X6) = huffma1401021291ibling(X0,huffma1146269203erNode(X0,X5,X4,X3),X6) )
      | ~ member(X0,X6,huffma675207370phabet(X0,huffma1146269203erNode(X0,X5,X4,X3))) ),
    inference(cnf_transformation,[],[f151]) ).

tff(f253,plain,
    ! [X0: $tType,X1: huffma1450048681e_tree(X0)] :
      ( ( huffma1146269203erNode(X0,sK1(X0,X1),sK2(X0,X1),sK3(X0,X1)) = X1 )
      | ( huffma2021818691e_Leaf(X0,sK4(X0,X1),sK5(X0,X1)) = X1 ) ),
    inference(cnf_transformation,[],[f180]) ).

tff(f646,plain,
    ! [X1: $tType,X2: nat,X3: huffma1450048681e_tree(X1),X0: huffma1450048681e_tree(X1),X4: X1] :
      ( ( huffma1401021291ibling(X1,huffma1146269203erNode(X1,X2,X0,X3),X4) = huffma1401021291ibling(X1,X0,X4) )
      | ~ member(X1,X4,huffma675207370phabet(X1,X0))
      | ( huffma2021818691e_Leaf(X1,sK4(X1,X0),sK5(X1,X0)) = X0 ) ),
    inference(superposition,[],[f249,f253]) ).

tff(f1557,plain,
    ( ( huffma1401021291ibling(a1,t_1,a) != huffma1401021291ibling(a1,t_1,a) )
    | ~ member(a1,a,huffma675207370phabet(a1,t_1))
    | ( t_1 = huffma2021818691e_Leaf(a1,sK4(a1,t_1),sK5(a1,t_1)) ) ),
    inference(superposition,[],[f210,f646]) ).

tff(f1565,plain,
    ( ~ member(a1,a,huffma675207370phabet(a1,t_1))
    | ( t_1 = huffma2021818691e_Leaf(a1,sK4(a1,t_1),sK5(a1,t_1)) ) ),
    inference(trivial_inequality_removal,[],[f1557]) ).

tff(f1569,plain,
    t_1 = huffma2021818691e_Leaf(a1,sK4(a1,t_1),sK5(a1,t_1)),
    inference(forward_subsumption_resolution,[],[f1565,f209]) ).

tff(f1584,plain,
    zero_zero(nat) = huffma945805758height(a1,t_1),
    inference(superposition,[],[f211,f1569]) ).

tff(f1612,plain,
    ord_less(nat,zero_zero(nat),zero_zero(nat)),
    inference(superposition,[],[f208,f1584]) ).

tff(f1615,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1612,f224]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW541_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.25  % Computer : n001.cluster.edu
% 0.11/0.25  % Model    : x86_64 x86_64
% 0.11/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25  % Memory   : 8046.5625MB
% 0.11/0.25  % OS       : Linux 6.8.0-71-generic
% 0.11/0.25  % CPULimit : 300
% 0.11/0.25  % WCLimit  : 300
% 0.11/0.25  % DateTime : Mon Sep 28 14:24:03 UTC 2026
% 0.11/0.25  % CPUTime  : 
% 0.11/0.25  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.30  Running first-order theorem proving
% 0.25/0.30  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.54/1.45  % (374535)Detected formulas, will run a generic FOF schedule.
% 4.54/1.45  % (374564)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=958032703:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.54/1.45  % (374557)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2672055850:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.54/1.45  % (374566)dis-21_1_sil=8000:lcm=predicate:random_seed=2481518398:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.54/1.45  % (374562)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=303838906:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.54/1.45  % (374562)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.54/1.45  % (374560)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3053251038:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.54/1.45  % (374564)Instruction limit reached! 
% 4.54/1.45  % (374564)------------------------------
% 4.54/1.45  % (374564)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.54/1.45  % (374564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.54/1.45  % (374564)CaDiCaL version: 2.1.3
% 4.54/1.45  % (374564)Termination reason: Instruction limit
% 4.54/1.45  % (374564)Termination phase: Saturation
% 4.54/1.45  % (374564)Time elapsed: 0.068 s
% 4.54/1.45  % (374564)Peak memory usage: 89 MB
% 4.54/1.45  % (374564)Instructions burned: 139 (million)
% 4.54/1.45  % (374563)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2510811535:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.54/1.45  % (374561)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3164129174:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.54/1.45  % (374562)Refutation not found, incomplete strategy
% 4.54/1.45  % (374562)------------------------------
% 4.54/1.45  % (374562)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.54/1.45  % (374562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.54/1.45  % (374562)CaDiCaL version: 2.1.3
% 4.54/1.45  % (374562)Termination reason: Refutation not found, incomplete strategy
% 4.54/1.45  % (374562)Time elapsed: 0.006 s
% 4.54/1.45  % (374562)Peak memory usage: 89 MB
% 4.54/1.45  % (374562)Instructions burned: 4 (million)
% 4.54/1.45  % (374561)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.54/1.45  % (374563)First to succeed.
% 4.54/1.45  % (374566)Instruction limit reached! 
% 4.54/1.45  % (374566)------------------------------
% 4.54/1.45  % (374566)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.54/1.45  % (374566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.54/1.45  % (374566)CaDiCaL version: 2.1.3
% 4.54/1.45  % (374566)Termination reason: Instruction limit
% 4.54/1.45  % (374566)Termination phase: Saturation
% 4.54/1.45  % (374566)Time elapsed: 0.088 s
% 4.54/1.45  % (374566)Peak memory usage: 89 MB
% 4.54/1.45  % (374566)Instructions burned: 129 (million)
% 4.54/1.45  % (374563)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-374535"
% 4.54/1.45  % (374578)lrs+10_1_sil=8000:sp=occurrence:random_seed=4057478250:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.54/1.45  % (374578)Also succeeded, but the first one will report.
% 4.54/1.45  % (374581)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2397083184:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.54/1.45  % (374562)------------------------------
% 4.54/1.45  % (374562)------------------------------
% 4.54/1.45  % Exception at run slice level
% 4.54/1.45  User error: GNN currently only supports monomorphic FOL.
% 4.54/1.45  % (374563)Refutation found. Thanks to Tanya!
% 4.54/1.45  % SZS status Theorem for theBenchmark
% 4.54/1.45  % SZS output start Proof for theBenchmark
% See solution above
% 5.42/1.65  % (374563)------------------------------
% 5.42/1.65  % (374563)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.42/1.65  % (374563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.42/1.65  % (374563)CaDiCaL version: 2.1.3
% 5.42/1.65  % (374563)Termination reason: Refutation
% 5.42/1.65  % (374563)Time elapsed: 0.067 s
% 5.42/1.65  % (374563)Peak memory usage: 88 MB
% 5.42/1.65  % (374563)Instructions burned: 64 (million)
% 5.42/1.65  % (374563)------------------------------
% 5.42/1.65  % (374563)------------------------------
% 5.42/1.65  % (374535)Success in time 0.654 s
% 5.42/1.65  % Vampire exiting
%------------------------------------------------------------------------------