%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM945_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 : n009.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:17:40 PM UTC 2026
% Result : Theorem 0.16s 1.51s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 18 unt; 0 typ; 3 def)
% Number of atoms : 65 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 26 ~; 18 |; 0 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 5 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn 22 !; 3 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
real: $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
bit0: int > int ).
tff(func_def_4,type,
bit1: int > int ).
tff(func_def_5,type,
min: int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_9,type,
legendre: ( int * int ) > int ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
m: int ).
tff(func_def_13,type,
sK0: ( int * int ) > int ).
tff(func_def_14,type,
sK1: ( int * int * int ) > int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zcong: ( int * int * int ) > $o ).
tff(pred_def_10,type,
zprime: int > $o ).
tff(pred_def_11,type,
quadRes: ( int * int ) > $o ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(pred_def_14,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f1,axiom,
quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__096QuadRes_A_I4_A_K_Am_A_L_A1_J_A_N1_096) ).
tff(f57,axiom,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_56_Bit0__def) ).
tff(f66,axiom,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_65_Bit1__def) ).
tff(f86,axiom,
! [X0: int,X1: int] :
( quadRes(X1,X0)
<=> ? [X2: int] : zcong(power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))),X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_QuadRes__def) ).
tff(f122,axiom,
! [X0: int] :
( zcong(power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
=> thesis ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f123,conjecture,
thesis,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f124,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f123]) ).
tff(f125,plain,
~ thesis,
inference(flattening,[],[f124]) ).
tff(f126,plain,
! [X0: int,X1: int] :
( quadRes(X1,X0)
=> ? [X2: int] : zcong(power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))),X0,X1) ),
inference(unused_predicate_definition_removal,[],[f86]) ).
tff(f169,plain,
! [X0: int,X1: int] :
( ? [X2: int] : zcong(power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))),X0,X1)
| ~ quadRes(X1,X0) ),
inference(ennf_transformation,[],[f126]) ).
tff(f178,plain,
! [X0: int] :
( thesis
| ~ zcong(power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))) ),
inference(ennf_transformation,[],[f122]) ).
tff(f189,plain,
! [X0: int,X1: int] :
( zcong(power_power(int,sK0(X0,X1),number_number_of(nat,bit0(bit1(pls)))),X0,X1)
| ~ quadRes(X1,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f169]) ).
tff(f193,plain,
quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)),
inference(cnf_transformation,[],[f1]) ).
tff(f257,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(cnf_transformation,[],[f57]) ).
tff(f266,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
inference(cnf_transformation,[],[f66]) ).
tff(f291,plain,
! [X0: int,X1: int] :
( zcong(power_power(int,sK0(X0,X1),number_number_of(nat,bit0(bit1(pls)))),X0,X1)
| ~ quadRes(X1,X0) ),
inference(cnf_transformation,[],[f189]) ).
tff(f328,plain,
! [X0: int] :
( thesis
| ~ zcong(power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))) ),
inference(cnf_transformation,[],[f178]) ).
tff(f329,plain,
~ thesis,
inference(cnf_transformation,[],[f125]) ).
tff(f330,plain,
quadRes(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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),number_number_of(int,min)),
inference(definition_unfolding,[],[f193,f257,f257,f266]) ).
tff(f393,plain,
! [X0: int,X1: int] :
( ~ quadRes(X1,X0)
| zcong(power_power(int,sK0(X0,X1),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),X0,X1) ),
inference(definition_unfolding,[],[f291,f257,f266]) ).
tff(f397,plain,
! [X0: int] :
( thesis
| ~ zcong(power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),number_number_of(int,min),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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))) ),
inference(definition_unfolding,[],[f328,f257,f266,f257,f257,f266]) ).
tff(f519,definition,
( spl3_1
<=> ! [X0: int] : ~ zcong(power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),number_number_of(int,min),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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
tff(f520,plain,
( ! [X0: int] : ~ zcong(power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),number_number_of(int,min),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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f519]) ).
tff(f522,definition,
( spl3_2
<=> thesis ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
tff(f523,plain,
( thesis
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f522]) ).
tff(f524,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f397,f522,f519]) ).
tff(f526,definition,
( spl3_3
<=> quadRes(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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),number_number_of(int,min)) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
tff(f527,plain,
( quadRes(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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),number_number_of(int,min))
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f526]) ).
tff(f532,plain,
spl3_3,
inference(avatar_split_clause,[],[f330,f526]) ).
tff(f533,plain,
( $false
| ~ spl3_2 ),
inference(resolution,[],[f523,f329]) ).
tff(f534,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f533]) ).
tff(f609,plain,
( zcong(power_power(int,sK0(number_number_of(int,min),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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),number_number_of(int,min),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),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)))
| ~ spl3_3 ),
inference(resolution,[],[f393,f527]) ).
tff(f610,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(resolution,[],[f609,f520]) ).
tff(f611,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f610]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f524]) ).
cnf(s3,plain,
spl3_3,
inference(sat_conversion,[],[f532]) ).
cnf(s4,plain,
~ spl3_2,
inference(sat_conversion,[],[f534]) ).
cnf(s8,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(sat_conversion,[],[f611]) ).
cnf(s10,plain,
~ spl3_1,
inference(rat,[],[s8,s3]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s4,s10]) ).
tff(f612,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM945_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.40 % Computer : n009.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 21:47:30 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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
% 2.31/1.31 % (2428952)Detected formulas, will run a generic FOF schedule.
% 2.31/1.31 % (2428958)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=1916429271:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.31/1.31 % (2428959)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=719176484:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.31/1.31 % (2428962)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=385516073:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.31/1.31 % (2428959)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.31/1.31 % (2428957)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=2508126706:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.31/1.31 % (2428961)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1269926792:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.31/1.31 % (2428960)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3884800150:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.31/1.31 % (2428960)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.31/1.31 % (2428963)dis-21_1_sil=8000:lcm=predicate:random_seed=407943994: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)
% 2.31/1.31 % (2428963)First to succeed.
% 2.31/1.31 % (2428963)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2428952"
% 2.31/1.31 % (2428960)Instruction limit reached!
% 2.31/1.31 % (2428960)------------------------------
% 2.31/1.31 % (2428960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.31 % (2428960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.31 % (2428960)CaDiCaL version: 2.1.3
% 2.31/1.31 % (2428960)Termination reason: Instruction limit
% 2.31/1.31 % (2428960)Termination phase: Saturation
% 2.31/1.31 % (2428960)Time elapsed: 0.066 s
% 2.31/1.31 % (2428960)Peak memory usage: 89 MB
% 2.31/1.31 % (2428960)Instructions burned: 110 (million)
% 2.31/1.31 % (2428961)Instruction limit reached!
% 2.31/1.31 % (2428961)------------------------------
% 2.31/1.31 % (2428961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.31 % (2428961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.31 % (2428961)CaDiCaL version: 2.1.3
% 2.31/1.31 % (2428961)Termination reason: Instruction limit
% 2.31/1.31 % (2428961)Termination phase: Saturation
% 2.31/1.31 % (2428961)Time elapsed: 0.067 s
% 2.31/1.31 % (2428961)Peak memory usage: 88 MB
% 2.31/1.31 % (2428961)Instructions burned: 119 (million)
% 2.31/1.31 % (2428962)Instruction limit reached!
% 2.31/1.31 % (2428962)------------------------------
% 2.31/1.31 % (2428962)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.31 % (2428962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.31 % (2428962)CaDiCaL version: 2.1.3
% 2.31/1.31 % (2428962)Termination reason: Instruction limit
% 2.31/1.31 % (2428962)Termination phase: Saturation
% 2.31/1.31 % (2428962)Time elapsed: 0.084 s
% 2.31/1.31 % (2428962)Peak memory usage: 90 MB
% 2.31/1.31 % (2428962)Instructions burned: 140 (million)
% 2.31/1.31 % (2428958)Aborted by signal SIGSEGV on /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.31/1.31 % (2428958)------------------------------
% 2.31/1.31 % (2428958)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.31 % (2428958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.31 % (2428958)CaDiCaL version: 2.1.3
% 2.31/1.31 % (2428958)Termination reason: Unknown
% 2.31/1.31 % (2428958)Termination phase: Saturation
% 2.31/1.31 % (2428958)Time elapsed: 0.200 s
% 2.31/1.31 % (2428958)Peak memory usage: 114 MB
% 2.31/1.31 % (2428958)Instructions burned: 545 (million)
% 2.31/1.31 % (2428971)lrs+10_1_sil=8000:sp=occurrence:random_seed=2798170779:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.31/1.31 % (2428973)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2885233477:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 0.16/1.51 % (2428972)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3043738285:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.16/1.51 % (2428972)Refutation not found, incomplete strategy
% 0.16/1.51 % (2428972)------------------------------
% 0.16/1.51 % (2428972)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.51 % (2428972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.51 % (2428972)CaDiCaL version: 2.1.3
% 0.16/1.51 % (2428972)Termination reason: Refutation not found, incomplete strategy
% 0.16/1.51 % (2428972)Time elapsed: 0.001 s
% 0.16/1.51 % (2428972)Peak memory usage: 87 MB
% 0.16/1.51 % (2428972)Instructions burned: 1 (million)
% 0.16/1.51 % (2428974)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=798543802:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 0.16/1.51 % (2428974)Also succeeded, but the first one will report.
% 0.16/1.51 % (2428963)Refutation found. Thanks to Tanya!
% 0.16/1.51 % SZS status Theorem for theBenchmark
% 0.16/1.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.51 % (2428963)------------------------------
% 0.16/1.51 % (2428963)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.51 % (2428963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.51 % (2428963)CaDiCaL version: 2.1.3
% 0.16/1.51 % (2428963)Termination reason: Refutation
% 0.16/1.51 % (2428963)Time elapsed: 0.010 s
% 0.16/1.51 % (2428963)Peak memory usage: 89 MB
% 0.16/1.51 % (2428963)Instructions burned: 16 (million)
% 0.16/1.51 % (2428963)------------------------------
% 0.16/1.51 % (2428963)------------------------------
% 0.16/1.51 % (2428952)Success in time 0.434 s
% 0.16/1.51 % Vampire exiting
%------------------------------------------------------------------------------