↑ 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  : NUM926_2 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

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

% Result   : Theorem 4.14s 1.09s
% Output   : Refutation 4.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  34 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   57 (  30   ~;  22   |;   0   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            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    :   44 (  44 usr;  20 con; 0-3 aty)
%            Number of variables   :   48 (  36   !;  12   ?;  48   :)

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

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

tff(type_def_7,type,
    real: $tType ).

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

tff(func_def_0,type,
    minus_minus_int: ( int * int ) > int ).

tff(func_def_1,type,
    minus_minus_nat: ( nat * nat ) > nat ).

tff(func_def_2,type,
    minus_minus_real: ( real * real ) > real ).

tff(func_def_3,type,
    one_one_int: int ).

tff(func_def_4,type,
    one_one_nat: nat ).

tff(func_def_5,type,
    one_one_real: real ).

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

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

tff(func_def_8,type,
    plus_plus_real: ( real * real ) > real ).

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

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

tff(func_def_11,type,
    times_times_real: ( real * real ) > real ).

tff(func_def_12,type,
    zero_zero_int: int ).

tff(func_def_13,type,
    zero_zero_nat: nat ).

tff(func_def_14,type,
    zero_zero_real: real ).

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

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

tff(func_def_17,type,
    min: int ).

tff(func_def_18,type,
    pls: int ).

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

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

tff(func_def_21,type,
    number267125858f_real: int > real ).

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

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

tff(func_def_24,type,
    power_power_real: ( real * nat ) > real ).

tff(func_def_25,type,
    product_Pair_int_int: ( int * int ) > product_prod_int_int ).

tff(func_def_26,type,
    legendre: ( int * int ) > int ).

tff(func_def_27,type,
    twoSqu2107342101sum2sq: product_prod_int_int > int ).

tff(func_def_28,type,
    m: int ).

tff(func_def_29,type,
    s1: int ).

tff(func_def_30,type,
    s: int ).

tff(func_def_31,type,
    t: int ).

tff(func_def_32,type,
    sK0: int ).

tff(func_def_33,type,
    sK1: int ).

tff(func_def_34,type,
    sK2: int ).

tff(func_def_35,type,
    sK3: int ).

tff(func_def_36,type,
    sK4: int ).

tff(func_def_37,type,
    sK5: int ).

tff(func_def_38,type,
    sK6: int ).

tff(func_def_39,type,
    sK7: int > int ).

tff(func_def_40,type,
    sK8: int ).

tff(func_def_41,type,
    sK10: ( int * int * int ) > int ).

tff(func_def_42,type,
    sK11: ( int * int ) > int ).

tff(func_def_43,type,
    sK12: ( real * nat ) > real ).

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

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

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

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

tff(pred_def_5,type,
    ord_less_real: ( real * real ) > $o ).

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

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

tff(pred_def_8,type,
    ord_less_eq_real: ( real * real ) > $o ).

tff(pred_def_9,type,
    quadRes: ( int * int ) > $o ).

tff(pred_def_10,type,
    dvd_dvd_int: ( int * int ) > $o ).

tff(pred_def_11,type,
    dvd_dvd_nat: ( nat * nat ) > $o ).

tff(pred_def_12,type,
    dvd_dvd_real: ( real * real ) > $o ).

tff(pred_def_13,type,
    twoSqu512355103sum2sq: int > $o ).

tff(pred_def_14,type,
    sP9: ( int * int ) > $o ).

tff(f1,axiom,
    ord_less_eq_int(one_one_int,t),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).

tff(f2,axiom,
    ( ( t = one_one_int )
   => ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).

tff(f3,axiom,
    ( ord_less_int(one_one_int,t)
   => ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).

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

tff(f51,axiom,
    ! [X0: int,X1: int] :
      ( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
    <=> ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_50_le__number__of__eq__not__less) ).

tff(f143,axiom,
    ! [X0: int] : ( number_number_of_int(X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_142_number__of__is__id) ).

tff(f205,axiom,
    ! [X0: int] : ( bit0(X0) = plus_plus_int(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_204_Bit0__def) ).

tff(f252,axiom,
    ! [X0: int] : ( bit1(X0) = plus_plus_int(plus_plus_int(one_one_int,X0),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_251_Bit1__def) ).

tff(f357,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_356_Pls__def) ).

tff(f699,conjecture,
    ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f700,negated_conjecture,
    ~ ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
    inference(negated_conjecture,[status(cth)],[f699]) ).

tff(f701,plain,
    ( ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
    | ( one_one_int != t ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f702,plain,
    ( ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
    | ~ ord_less_int(one_one_int,t) ),
    inference(ennf_transformation,[],[f3]) ).

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

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

tff(f1046,plain,
    ! [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
    inference(ennf_transformation,[],[f700]) ).

tff(f1047,plain,
    ord_less_eq_int(one_one_int,t),
    inference(cnf_transformation,[],[f1]) ).

tff(f1048,plain,
    ( ( one_one_int != t )
    | ( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ) ),
    inference(cnf_transformation,[],[f701]) ).

tff(f1049,plain,
    ( ~ ord_less_int(one_one_int,t)
    | ( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ) ),
    inference(cnf_transformation,[],[f702]) ).

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

tff(f1101,plain,
    ! [X0: int,X1: int] :
      ( ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
      | ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
    inference(cnf_transformation,[],[f51]) ).

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

tff(f1315,plain,
    ! [X0: int] : ( bit0(X0) = plus_plus_int(X0,X0) ),
    inference(cnf_transformation,[],[f205]) ).

tff(f1362,plain,
    ! [X0: int] : ( bit1(X0) = plus_plus_int(plus_plus_int(one_one_int,X0),X0) ),
    inference(cnf_transformation,[],[f252]) ).

tff(f1491,plain,
    pls = zero_zero_int,
    inference(cnf_transformation,[],[f357]) ).

tff(f1975,plain,
    ! [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
    inference(cnf_transformation,[],[f1046]) ).

tff(f1976,plain,
    ( ( one_one_int != t )
    | ( plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),power_power_int(sK1,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int))))) ) ),
    inference(definition_unfolding,[],[f1048,f1315,f1315,f1362,f1491,f1315,f1362,f1491,f1315,f1362,f1491]) ).

tff(f1977,plain,
    ( ~ ord_less_int(one_one_int,t)
    | ( plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),power_power_int(sK3,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int))))) ) ),
    inference(definition_unfolding,[],[f1049,f1315,f1315,f1362,f1491,f1315,f1362,f1491,f1315,f1362,f1491]) ).

tff(f2332,plain,
    ! [X0: int,X1: int] : ( plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),m),one_one_int) != plus_plus_int(power_power_int(X0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),power_power_int(X1,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int))))) ),
    inference(definition_unfolding,[],[f1975,f1315,f1362,f1491,f1315,f1362,f1491,f1315,f1315,f1362,f1491]) ).

tff(f2442,plain,
    ~ ord_less_eq_int(one_one_int,t),
    inference(consistent_polarity_flipping,[],[f1047]) ).

tff(f2443,plain,
    ( ord_less_int(one_one_int,t)
    | ( plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))),power_power_int(sK3,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int))))) ) ),
    inference(consistent_polarity_flipping,[],[f1977]) ).

tff(f2453,plain,
    ! [X0: int,X1: int] :
      ( ord_less_eq_int(X0,X1)
      | ord_less_eq_int(X1,X0)
      | ( X0 = X1 ) ),
    inference(consistent_polarity_flipping,[],[f1089]) ).

tff(f2459,plain,
    ! [X0: int,X1: int] :
      ( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
      | ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
    inference(consistent_polarity_flipping,[],[f1101]) ).

tff(f3042,plain,
    ! [X0: int,X1: int] :
      ( ~ ord_less_int(number_number_of_int(X1),X0)
      | ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
    inference(forward_demodulation,[],[f2459,f1219]) ).

tff(f3073,plain,
    ord_less_int(one_one_int,t),
    inference(forward_subsumption_resolution,[],[f2443,f2332]) ).

tff(f3074,plain,
    one_one_int != t,
    inference(forward_subsumption_resolution,[],[f1976,f2332]) ).

tff(f3172,plain,
    ! [X0: int,X1: int] :
      ( ~ ord_less_int(X1,X0)
      | ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
    inference(forward_demodulation,[],[f3042,f1219]) ).

tff(f3258,plain,
    ! [X0: int,X1: int] :
      ( ~ ord_less_eq_int(number_number_of_int(X0),X1)
      | ~ ord_less_int(X1,X0) ),
    inference(forward_demodulation,[],[f3172,f1219]) ).

tff(f3330,plain,
    ! [X0: int,X1: int] :
      ( ~ ord_less_int(X1,X0)
      | ~ ord_less_eq_int(X0,X1) ),
    inference(forward_demodulation,[],[f3258,f1219]) ).

tff(f3925,plain,
    ~ ord_less_eq_int(t,one_one_int),
    inference(resolution,[],[f3330,f3073]) ).

tff(f3940,plain,
    ( ord_less_eq_int(t,one_one_int)
    | ( one_one_int = t ) ),
    inference(resolution,[],[f2453,f2442]) ).

tff(f3974,plain,
    one_one_int = t,
    inference(forward_subsumption_resolution,[],[f3940,f3925]) ).

tff(f3979,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3974,f3074]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM926_2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n026.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 21:46:42 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.14/1.09  % (3238929)Will run a generic schedule for satisfiability detection.
% 4.14/1.09  % (3238939)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=605723252:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.14/1.09  % (3238935)% WARNING: option uhcvi not known.
% 4.14/1.09  % (3238934)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=90940164_2999 on theBenchmark for (2999ds/0Mi)
% 4.14/1.09  % (3238935)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=647309260:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.14/1.09  % (3238937)dis+10_1_sil=32000:sp=arity:random_seed=2624358487:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.14/1.09  % (3238936)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1945856649:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.14/1.09  % (3238938)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1408048606:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.14/1.09  % (3238940)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3404989876:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.14/1.09  % (3238939)Instruction limit reached! 
% 4.14/1.09  % (3238939)------------------------------
% 4.14/1.09  % (3238939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238939)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238939)Termination reason: Instruction limit
% 4.14/1.09  % (3238939)Termination phase: Saturation
% 4.14/1.09  % (3238939)Time elapsed: 0.037 s
% 4.14/1.09  % (3238939)Peak memory usage: 13 MB
% 4.14/1.09  % (3238939)Instructions burned: 134 (million)
% 4.14/1.09  % (3238948)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1577355277:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.14/1.09  % (3238938)Instruction limit reached! 
% 4.14/1.09  % (3238938)------------------------------
% 4.14/1.09  % (3238938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238938)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238938)Termination reason: Instruction limit
% 4.14/1.09  % (3238938)Termination phase: Saturation
% 4.14/1.09  % (3238938)Time elapsed: 0.060 s
% 4.14/1.09  % (3238938)Peak memory usage: 14 MB
% 4.14/1.09  % (3238938)Instructions burned: 117 (million)
% 4.14/1.09  % (3238937)Instruction limit reached! 
% 4.14/1.09  % (3238937)------------------------------
% 4.14/1.09  % (3238937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238937)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238937)Termination reason: Instruction limit
% 4.14/1.09  % (3238937)Termination phase: Saturation
% 4.14/1.09  % (3238937)Time elapsed: 0.061 s
% 4.14/1.09  % (3238937)Peak memory usage: 13 MB
% 4.14/1.09  % (3238937)Instructions burned: 103 (million)
% 4.14/1.09  % (3238950)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3297012392:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.14/1.09  % (3238951)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=4114139318:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.14/1.09  % (3238940)Instruction limit reached! 
% 4.14/1.09  % (3238940)------------------------------
% 4.14/1.09  % (3238940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238940)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238940)Termination reason: Instruction limit
% 4.14/1.09  % (3238940)Termination phase: Saturation
% 4.14/1.09  % (3238940)Time elapsed: 0.089 s
% 4.14/1.09  % (3238940)Peak memory usage: 14 MB
% 4.14/1.09  % (3238940)Instructions burned: 159 (million)
% 4.14/1.09  % (3238954)ott-21_1_sil=16000:fs=off:random_seed=1173320343:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.14/1.09  % TRYING [1]
% 4.14/1.09  % (3238950)Instruction limit reached! 
% 4.14/1.09  % (3238950)------------------------------
% 4.14/1.09  % (3238950)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238950)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238950)Termination reason: Instruction limit
% 4.14/1.09  % (3238950)Termination phase: Saturation
% 4.14/1.09  % (3238950)Time elapsed: 0.074 s
% 4.14/1.09  % (3238950)Peak memory usage: 14 MB
% 4.14/1.09  % (3238950)Instructions burned: 132 (million)
% 4.14/1.09  % TRYING [2]
% 4.14/1.09  % (3238956)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3571080020:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 4.14/1.09  % TRYING [3]
% 4.14/1.09  % (3238954)Instruction limit reached! 
% 4.14/1.09  % (3238954)------------------------------
% 4.14/1.09  % (3238954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238954)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238954)Termination reason: Instruction limit
% 4.14/1.09  % (3238954)Termination phase: Saturation
% 4.14/1.09  % (3238954)Time elapsed: 0.086 s
% 4.14/1.09  % (3238954)Peak memory usage: 13 MB
% 4.14/1.09  % (3238954)Instructions burned: 180 (million)
% 4.14/1.09  % (3238948)Instruction limit reached! 
% 4.14/1.09  % (3238948)------------------------------
% 4.14/1.09  % (3238948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238948)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238948)Termination reason: Instruction limit
% 4.14/1.09  % (3238948)Termination phase: Finite model building constraint generation
% 4.14/1.09  % (3238948)Time elapsed: 0.163 s
% 4.14/1.09  % (3238948)Peak memory usage: 25 MB
% 4.14/1.09  % (3238948)Instructions burned: 717 (million)
% 4.14/1.09  % (3238958)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=62191874:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.14/1.09  % (3238959)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2405712889:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 4.14/1.09  % TRYING [1,1,1,1]
% 4.14/1.09  % TRYING [1,1,2,1]
% 4.14/1.09  % TRYING [1,1,3,1]
% 4.14/1.09  % TRYING [1,1,4,1]
% 4.14/1.09  % TRYING [1,1,1,1]
% 4.14/1.09  % TRYING [1,2,4,1]
% 4.14/1.09  % TRYING [1,1,2,1]
% 4.14/1.09  % (3238956)Instruction limit reached! 
% 4.14/1.09  % (3238956)------------------------------
% 4.14/1.09  % (3238956)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238956)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238956)Termination reason: Instruction limit
% 4.14/1.09  % (3238956)Termination phase: Saturation
% 4.14/1.09  % (3238956)Time elapsed: 0.321 s
% 4.14/1.09  % (3238956)Peak memory usage: 15 MB
% 4.14/1.09  % (3238956)Instructions burned: 478 (million)
% 4.14/1.09  % (3238951)Instruction limit reached! 
% 4.14/1.09  % (3238951)------------------------------
% 4.14/1.09  % (3238951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238951)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238951)Termination reason: Instruction limit
% 4.14/1.09  % (3238951)Termination phase: Saturation
% 4.14/1.09  % (3238951)Time elapsed: 0.427 s
% 4.14/1.09  % (3238951)Peak memory usage: 18 MB
% 4.14/1.09  % (3238951)Instructions burned: 684 (million)
% 4.14/1.09  % TRYING [1,1,3,1]
% 4.14/1.09  % (3238962)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2198230499:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 4.14/1.09  % (3238963)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2568248196:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 4.14/1.09  % (3238959)Instruction limit reached! 
% 4.14/1.09  % (3238959)------------------------------
% 4.14/1.09  % (3238959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238959)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238959)Termination reason: Instruction limit
% 4.14/1.09  % (3238959)Termination phase: Saturation
% 4.14/1.09  % (3238959)Time elapsed: 0.368 s
% 4.14/1.09  % (3238959)Peak memory usage: 22 MB
% 4.14/1.09  % (3238959)Instructions burned: 1180 (million)
% 4.14/1.09  % (3238963) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3238929-3238963"...
% 4.14/1.09  % (3238963)...printing done.
% 4.14/1.09  % (3238963)Refutation found. Thanks to Tanya!
% 4.14/1.09  % SZS status Theorem for theBenchmark
% 4.14/1.09  % SZS output start Proof for theBenchmark
% See solution above
% 4.14/1.09  % (3238963)------------------------------
% 4.14/1.09  % (3238963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.14/1.09  % (3238963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.14/1.09  % (3238963)CaDiCaL version: 2.1.3
% 4.14/1.09  % (3238963)Termination reason: Refutation
% 4.14/1.09  % (3238963)Time elapsed: 0.062 s
% 4.14/1.09  % (3238963)Peak memory usage: 15 MB
% 4.14/1.09  % (3238963)Instructions burned: 108 (million)
% 4.14/1.09  % (3238929)Success in time 0.652 s
% 4.14/1.09  % Vampire exiting
%------------------------------------------------------------------------------