↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM924_1 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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 12:26:05 PM UTC 2026

% Result   : Theorem 0.34s 0.50s
% Output   : Refutation 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   79 (  45 unt;   0 typ;   2 def)
%            Number of atoms       :  123 (  29 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   86 (  42   ~;  34   |;   3   &)
%                                         (   5 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   3 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   9 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  36   !;   0   ?;  36   :)

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

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

tff(func_def_0,type,
    one_one_int: int ).

tff(func_def_1,type,
    one_one_nat: nat ).

tff(func_def_2,type,
    plus_plus_int: ( int * int ) > int ).

tff(func_def_3,type,
    plus_plus_nat: ( nat * nat ) > nat ).

tff(func_def_4,type,
    times_times_int: ( int * int ) > int ).

tff(func_def_5,type,
    times_times_nat: ( nat * nat ) > nat ).

tff(func_def_6,type,
    zero_zero_int: int ).

tff(func_def_7,type,
    zero_zero_nat: nat ).

tff(func_def_8,type,
    bit0: int > int ).

tff(func_def_9,type,
    bit1: int > int ).

tff(func_def_10,type,
    pls: int ).

tff(func_def_11,type,
    number_number_of_int: int > int ).

tff(func_def_12,type,
    number_number_of_nat: int > nat ).

tff(func_def_13,type,
    power_power_int: ( int * nat ) > int ).

tff(func_def_14,type,
    power_power_nat: ( nat * nat ) > nat ).

tff(func_def_15,type,
    m: int ).

tff(func_def_16,type,
    s: int ).

tff(func_def_17,type,
    t: int ).

tff(func_def_18,type,
    sK0: int ).

tff(pred_def_1,type,
    zprime: int > $o ).

tff(pred_def_2,type,
    ord_less_int: ( int * int ) > $o ).

tff(pred_def_3,type,
    ord_less_nat: ( nat * nat ) > $o ).

tff(pred_def_4,type,
    ord_less_eq_int: ( int * int ) > $o ).

tff(pred_def_5,type,
    ord_less_eq_nat: ( nat * nat ) > $o ).

tff(pred_def_6,type,
    twoSqu1431725154sum2sq: int > $o ).

tff(f3,axiom,
    ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).

tff(f4,axiom,
    plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).

tff(f24,axiom,
    ! [X0: int] : ord_less_eq_int(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zle__refl) ).

tff(f25,axiom,
    ! [X0: int] : ( number_number_of_int(X0) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).

tff(f26,axiom,
    ! [X0: int,X1: int] : ( times_times_int(X0,X1) = times_times_int(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_zmult__commute) ).

tff(f33,axiom,
    ! [X0: int,X1: int] :
      ( ord_less_eq_int(X0,X1)
     => ( ord_less_eq_int(X1,X0)
       => ( X0 = X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_32_zle__antisym) ).

tff(f64,axiom,
    ! [X0: int] :
      ( ord_less_eq_int(number_number_of_int(X0),one_one_int)
    <=> ord_less_eq_int(X0,bit1(pls)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_63_le__special_I4_J) ).

tff(f67,axiom,
    ! [X0: int] : ( times_times_int(pls,X0) = pls ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_66_mult__Pls) ).

tff(f76,axiom,
    ! [X0: int] :
      ( ord_less_int(pls,bit1(X0))
    <=> ord_less_eq_int(pls,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_75_rel__simps_I5_J) ).

tff(f82,axiom,
    ! [X0: int] :
      ( ord_less_eq_int(one_one_int,X0)
    <=> ord_less_int(zero_zero_int,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_81_int__one__le__iff__zero__less) ).

tff(f105,axiom,
    ! [X0: int,X1: int] : ( plus_plus_int(X0,X1) = plus_plus_int(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_104_zadd__commute) ).

tff(f106,axiom,
    zero_zero_int = number_number_of_int(pls),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_105_zero__is__num__zero) ).

tff(f107,conjecture,
    ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(f108,negated_conjecture,
    ~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
    inference(negated_conjecture,[status(cth)],[f107]) ).

tff(f109,plain,
    ~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
    inference(flattening,[],[f108]) ).

tff(f116,plain,
    ! [X0: int,X1: int] :
      ( ( X0 = X1 )
      | ~ ord_less_eq_int(X1,X0)
      | ~ ord_less_eq_int(X0,X1) ),
    inference(ennf_transformation,[],[f33]) ).

tff(f117,plain,
    ! [X0: int,X1: int] :
      ( ( X0 = X1 )
      | ~ ord_less_eq_int(X1,X0)
      | ~ ord_less_eq_int(X0,X1) ),
    inference(flattening,[],[f116]) ).

tff(f162,plain,
    ! [X0: int] :
      ( ( ord_less_eq_int(number_number_of_int(X0),one_one_int)
        | ~ ord_less_eq_int(X0,bit1(pls)) )
      & ( ord_less_eq_int(X0,bit1(pls))
        | ~ ord_less_eq_int(number_number_of_int(X0),one_one_int) ) ),
    inference(nnf_transformation,[],[f64]) ).

tff(f166,plain,
    ! [X0: int] :
      ( ( ord_less_int(pls,bit1(X0))
        | ~ ord_less_eq_int(pls,X0) )
      & ( ord_less_eq_int(pls,X0)
        | ~ ord_less_int(pls,bit1(X0)) ) ),
    inference(nnf_transformation,[],[f76]) ).

tff(f173,plain,
    ! [X0: int] :
      ( ( ord_less_eq_int(one_one_int,X0)
        | ~ ord_less_int(zero_zero_int,X0) )
      & ( ord_less_int(zero_zero_int,X0)
        | ~ ord_less_eq_int(one_one_int,X0) ) ),
    inference(nnf_transformation,[],[f82]) ).

tff(f185,plain,
    ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
    inference(cnf_transformation,[],[f3]) ).

tff(f186,plain,
    times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),
    inference(cnf_transformation,[],[f4]) ).

tff(f210,plain,
    ! [X0: int] : ord_less_eq_int(X0,X0),
    inference(cnf_transformation,[],[f24]) ).

tff(f211,plain,
    ! [X0: int] : ( number_number_of_int(X0) = X0 ),
    inference(cnf_transformation,[],[f25]) ).

tff(f212,plain,
    ! [X0: int,X1: int] : ( times_times_int(X0,X1) = times_times_int(X1,X0) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f221,plain,
    ! [X0: int,X1: int] :
      ( ~ ord_less_eq_int(X1,X0)
      | ( X0 = X1 )
      | ~ ord_less_eq_int(X0,X1) ),
    inference(cnf_transformation,[],[f117]) ).

tff(f273,plain,
    ! [X0: int] :
      ( ord_less_eq_int(number_number_of_int(X0),one_one_int)
      | ~ ord_less_eq_int(X0,bit1(pls)) ),
    inference(cnf_transformation,[],[f162]) ).

tff(f277,plain,
    ! [X0: int] : ( pls = times_times_int(pls,X0) ),
    inference(cnf_transformation,[],[f67]) ).

tff(f289,plain,
    ! [X0: int] :
      ( ord_less_int(pls,bit1(X0))
      | ~ ord_less_eq_int(pls,X0) ),
    inference(cnf_transformation,[],[f166]) ).

tff(f303,plain,
    ! [X0: int] :
      ( ~ ord_less_int(zero_zero_int,X0)
      | ord_less_eq_int(one_one_int,X0) ),
    inference(cnf_transformation,[],[f173]) ).

tff(f337,plain,
    ! [X0: int,X1: int] : ( plus_plus_int(X0,X1) = plus_plus_int(X1,X0) ),
    inference(cnf_transformation,[],[f105]) ).

tff(f338,plain,
    zero_zero_int = number_number_of_int(pls),
    inference(cnf_transformation,[],[f106]) ).

tff(f339,plain,
    ~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
    inference(cnf_transformation,[],[f109]) ).

tff(f367,plain,
    zero_zero_int = pls,
    inference(forward_demodulation,[],[f338,f211]) ).

tff(f370,plain,
    ! [X0: int] : ( zero_zero_int = times_times_int(zero_zero_int,X0) ),
    inference(forward_demodulation,[],[f277,f367]) ).

tff(f431,plain,
    ! [X0: int] :
      ( ord_less_int(zero_zero_int,bit1(X0))
      | ~ ord_less_eq_int(pls,X0) ),
    inference(forward_demodulation,[],[f289,f367]) ).

tff(f432,plain,
    ! [X0: int] :
      ( ord_less_int(zero_zero_int,bit1(X0))
      | ~ ord_less_eq_int(zero_zero_int,X0) ),
    inference(forward_demodulation,[],[f431,f367]) ).

tff(f435,plain,
    ~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),zero_zero_int),
    inference(superposition,[],[f339,f337]) ).

tff(f437,plain,
    ~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))),zero_zero_int),
    inference(forward_demodulation,[],[f435,f367]) ).

tff(f462,definition,
    ( spl1_5
  <=> ord_less_int(zero_zero_int,bit1(zero_zero_int)) ),
    introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).

tff(f463,plain,
    ( ~ ord_less_int(zero_zero_int,bit1(zero_zero_int))
    | spl1_5 ),
    inference(avatar_component_clause,[],[f462]) ).

tff(f464,plain,
    ( ord_less_int(zero_zero_int,bit1(zero_zero_int))
    | ~ spl1_5 ),
    inference(avatar_component_clause,[],[f462]) ).

tff(f494,plain,
    ( ~ ord_less_eq_int(zero_zero_int,zero_zero_int)
    | spl1_5 ),
    inference(resolution,[],[f432,f463]) ).

tff(f498,plain,
    ( $false
    | spl1_5 ),
    inference(forward_subsumption_resolution,[],[f494,f210]) ).

tff(f499,plain,
    spl1_5,
    inference(avatar_contradiction_clause,[],[f498]) ).

tff(f502,plain,
    ( ord_less_eq_int(one_one_int,bit1(zero_zero_int))
    | ~ spl1_5 ),
    inference(resolution,[],[f464,f303]) ).

tff(f551,plain,
    ! [X0: int] :
      ( ord_less_eq_int(X0,one_one_int)
      | ~ ord_less_eq_int(X0,bit1(pls)) ),
    inference(forward_demodulation,[],[f273,f211]) ).

tff(f552,plain,
    ! [X0: int] :
      ( ~ ord_less_eq_int(X0,bit1(zero_zero_int))
      | ord_less_eq_int(X0,one_one_int) ),
    inference(forward_demodulation,[],[f551,f367]) ).

tff(f554,plain,
    ord_less_eq_int(bit1(zero_zero_int),one_one_int),
    inference(resolution,[],[f552,f210]) ).

tff(f844,plain,
    ( ( one_one_int = bit1(zero_zero_int) )
    | ~ ord_less_eq_int(one_one_int,bit1(zero_zero_int)) ),
    inference(resolution,[],[f221,f554]) ).

tff(f850,plain,
    ( ( one_one_int = bit1(zero_zero_int) )
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f844,f502]) ).

tff(f905,definition,
    ( spl1_18
  <=> ( one_one_int = bit1(zero_zero_int) ) ),
    introduced(definition,[new_symbols(definition,[spl1_18])],[avatar_definition]) ).

tff(f907,plain,
    ( ( one_one_int = bit1(zero_zero_int) )
    | ~ spl1_18 ),
    inference(avatar_component_clause,[],[f905]) ).

tff(f946,plain,
    ( spl1_18
    | ~ spl1_5 ),
    inference(avatar_split_clause,[],[f850,f462,f905]) ).

tff(f961,plain,
    ( ~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))),zero_zero_int)
    | ~ spl1_18 ),
    inference(superposition,[],[f437,f907]) ).

tff(f2214,plain,
    times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t) = plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),
    inference(forward_demodulation,[],[f186,f337]) ).

tff(f2215,plain,
    plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m),one_one_int),t),
    inference(forward_demodulation,[],[f2214,f367]) ).

tff(f2216,plain,
    plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m),one_one_int)),
    inference(forward_demodulation,[],[f2215,f212]) ).

tff(f2217,plain,
    plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m))),
    inference(forward_demodulation,[],[f2216,f337]) ).

tff(f2218,plain,
    plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(zero_zero_int))))))),
    inference(forward_demodulation,[],[f2217,f212]) ).

tff(f2219,plain,
    plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(zero_zero_int)))))),
    inference(forward_demodulation,[],[f2218,f211]) ).

tff(f2220,plain,
    ( ( plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(one_one_int))))) )
    | ~ spl1_18 ),
    inference(forward_demodulation,[],[f2219,f907]) ).

tff(f2259,plain,
    ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(zero_zero_int,plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int))),
    inference(forward_demodulation,[],[f185,f212]) ).

tff(f2260,plain,
    ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),zero_zero_int),
    inference(forward_demodulation,[],[f2259,f370]) ).

tff(f2261,plain,
    ord_less_int(times_times_int(t,plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)),zero_zero_int),
    inference(forward_demodulation,[],[f2260,f212]) ).

tff(f2262,plain,
    ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m))),zero_zero_int),
    inference(forward_demodulation,[],[f2261,f337]) ).

tff(f2263,plain,
    ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls))))))),zero_zero_int),
    inference(forward_demodulation,[],[f2262,f212]) ).

tff(f2264,plain,
    ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))),zero_zero_int),
    inference(forward_demodulation,[],[f2263,f211]) ).

tff(f2265,plain,
    ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(zero_zero_int)))))),zero_zero_int),
    inference(forward_demodulation,[],[f2264,f367]) ).

tff(f2266,plain,
    ( ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(one_one_int))))),zero_zero_int)
    | ~ spl1_18 ),
    inference(forward_demodulation,[],[f2265,f907]) ).

tff(f2267,plain,
    ( ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))),zero_zero_int)
    | ~ spl1_18 ),
    inference(forward_demodulation,[],[f2266,f2220]) ).

tff(f2268,plain,
    ( $false
    | ~ spl1_18 ),
    inference(forward_subsumption_resolution,[],[f2267,f961]) ).

tff(f2269,plain,
    ~ spl1_18,
    inference(avatar_contradiction_clause,[],[f2268]) ).

cnf(s5,plain,
    spl1_5,
    inference(sat_conversion,[],[f499]) ).

cnf(s16,plain,
    ( ~ spl1_5
    | spl1_18 ),
    inference(sat_conversion,[],[f946]) ).

cnf(s116,plain,
    ~ spl1_18,
    inference(sat_conversion,[],[f2269]) ).

cnf(s117,plain,
    ~ spl1_5,
    inference(rat,[],[s16,s116]) ).

cnf(s119,plain,
    $false,
    inference(rat,[],[s5,s117]) ).

tff(f2270,plain,
    $false,
    inference(avatar_sat_refutation,[],[s119]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM924_1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n014.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 21:40:31 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.34/0.50  % (1195269)Will run a generic schedule for satisfiability detection.
% 0.34/0.50  % (1195276)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=665104700:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.34/0.50  % (1195274)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1021545467_2999 on theBenchmark for (2999ds/0Mi)
% 0.34/0.50  % (1195278)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3565073818:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.34/0.50  % (1195280)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2649867719:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.34/0.50  % (1195279)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1437674314:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.34/0.50  % (1195277)dis+10_1_sil=32000:sp=arity:random_seed=2448459126:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.34/0.50  % (1195275)% WARNING: option uhcvi not known.
% 0.34/0.50  % (1195275)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3434599520:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.34/0.50  % TRYING [1,1]
% 0.34/0.50  % TRYING [2,1]
% 0.34/0.50  % TRYING [3,1]
% 0.34/0.50  % TRYING [3,2]
% 0.34/0.50  % (1195277) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1195269-1195277"...
% 0.34/0.50  % (1195277)...printing done.
% 0.34/0.50  % (1195277)Refutation found. Thanks to Tanya!
% 0.34/0.50  % SZS status Theorem for theBenchmark
% 0.34/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.34/0.50  % (1195277)------------------------------
% 0.34/0.50  % (1195277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.50  % (1195277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.50  % (1195277)CaDiCaL version: 2.1.3
% 0.34/0.50  % (1195277)Termination reason: Refutation
% 0.34/0.50  % (1195277)Time elapsed: 0.047 s
% 0.34/0.50  % (1195277)Peak memory usage: 13 MB
% 0.34/0.50  % (1195277)Instructions burned: 72 (million)
% 0.34/0.50  % (1195269)Success in time 0.089 s
% 0.34/0.50  % Vampire exiting
%------------------------------------------------------------------------------