%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU510^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 : Wed Sep 30 08:29:52 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 53 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 459 ( 147 equ; 0 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 395 ( 61 ~; 48 |; 31 &; 225 @)
% ( 5 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 11 con; 0-4 aty)
% Number of variables : 116 ( 26 ^; 71 !; 19 ?; 116 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_3,type,
dsetconstrI: $o ).
thf(func_def_5,type,
emptysetE: $o ).
thf(func_def_6,type,
nonempty: $i > $o ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(func_def_13,type,
sK0: $i > $o ).
thf(func_def_17,type,
sK4: $o ).
thf(func_def_19,type,
sK6: $i > $o ).
thf(f1,axiom,
( dsetconstrI
= ( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f2,axiom,
! [X0: $i] :
( ( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 )
= emptysetE ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE) ).
thf(f3,axiom,
( ( ^ [X0: $i] : ( X0 != emptyset ) )
= nonempty ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonempty) ).
thf(f4,conjecture,
( dsetconstrI
=> ( emptysetE
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonemptyI) ).
thf(f5,negated_conjecture,
~ ( dsetconstrI
=> ( emptysetE
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
~ ( dsetconstrI
=> ( emptysetE
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
~ ( ( dsetconstrI = $true )
=> ( ( emptysetE = $true )
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( ( X1 @ X2 )
= $true )
=> ( $true
= ( nonempty
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: $i] :
( ( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 )
= emptysetE ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( ! [X0: $i] :
( ( ( in @ X0 @ emptyset )
= $true )
=> ! [X1: $o] : ( $true = X1 ) )
<=> ( emptysetE = $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( dsetconstrI
= ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( in @ X0 @ X1 )
=> ( ( X2 @ X0 )
=> ( in @ X0
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X2 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f11,plain,
( ! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
= ( in @ X0 @ X1 ) )
=> ( ( ( X2 @ X0 )
= $true )
=> ( $true
= ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) ) ) )
<=> ( dsetconstrI = $true ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f13,plain,
( ? [X0: $i,X1: $i > $o,X2: $i] :
( ( $true
!= ( nonempty
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ( ( X1 @ X2 )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( emptysetE = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f14,plain,
( ( dsetconstrI = $true )
& ( emptysetE = $true )
& ? [X1: $i > $o,X2: $i,X0: $i] :
( ( $true
!= ( nonempty
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ( ( in @ X2 @ X0 )
= $true )
& ( ( X1 @ X2 )
= $true ) ) ),
inference(flattening,[],[f13]) ).
thf(f15,plain,
( ! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
= ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( ( X2 @ X0 )
!= $true )
| ( $true
!= ( in @ X0 @ X1 ) ) )
<=> ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f16,plain,
( ( dsetconstrI = $true )
<=> ! [X0: $i,X2: $i > $o,X1: $i] :
( ( ( X2 @ X0 )
!= $true )
| ( $true
= ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
!= ( in @ X0 @ X1 ) ) ) ),
inference(flattening,[],[f15]) ).
thf(f17,plain,
( ( emptysetE = $true )
<=> ! [X0: $i] :
( ! [X1: $o] : ( $true = X1 )
| ( ( in @ X0 @ emptyset )
!= $true ) ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f18,plain,
( ( dsetconstrI = $true )
& ( emptysetE = $true )
& ? [X0: $i > $o,X1: $i,X2: $i] :
( ( ( nonempty
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
!= $true )
& ( $true
= ( in @ X1 @ X2 ) )
& ( ( X0 @ X1 )
= $true ) ) ),
inference(rectify,[],[f14]) ).
thf(f19,plain,
( ( dsetconstrI = $true )
& ( emptysetE = $true )
& ( ( nonempty
@ ( dsetconstr @ sK2
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) )
!= $true )
& ( ( in @ sK1 @ sK2 )
= $true )
& ( ( sK0 @ sK1 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f18]) ).
thf(f20,plain,
( ( ( emptysetE = $true )
| ? [X0: $i] :
( ? [X1: $o] : ( $true != X1 )
& ( ( in @ X0 @ emptyset )
= $true ) ) )
& ( ! [X0: $i] :
( ! [X1: $o] : ( $true = X1 )
| ( ( in @ X0 @ emptyset )
!= $true ) )
| ( emptysetE != $true ) ) ),
inference(nnf_transformation,[],[f17]) ).
thf(f21,plain,
( ( ( emptysetE = $true )
| ? [X0: $i] :
( ? [X1: $o] : ( $true != X1 )
& ( ( in @ X0 @ emptyset )
= $true ) ) )
& ( ! [X2: $i] :
( ! [X3: $o] : ( $true = X3 )
| ( ( in @ X2 @ emptyset )
!= $true ) )
| ( emptysetE != $true ) ) ),
inference(rectify,[],[f20]) ).
thf(f22,plain,
( ( ( emptysetE = $true )
| ( ( sK4 != $true )
& ( $true
= ( in @ sK3 @ emptyset ) ) ) )
& ( ! [X2: $i] :
( ! [X3: $o] : ( $true = X3 )
| ( ( in @ X2 @ emptyset )
!= $true ) )
| ( emptysetE != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f21]) ).
thf(f23,plain,
( ( ( dsetconstrI = $true )
| ? [X0: $i,X2: $i > $o,X1: $i] :
( ( ( X2 @ X0 )
= $true )
& ( $true
!= ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
& ( $true
= ( in @ X0 @ X1 ) ) ) )
& ( ! [X0: $i,X2: $i > $o,X1: $i] :
( ( ( X2 @ X0 )
!= $true )
| ( $true
= ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
!= ( in @ X0 @ X1 ) ) )
| ( dsetconstrI != $true ) ) ),
inference(nnf_transformation,[],[f16]) ).
thf(f24,plain,
( ( ( dsetconstrI = $true )
| ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X0 )
= $true )
& ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
!= $true )
& ( ( in @ X0 @ X2 )
= $true ) ) )
& ( ! [X3: $i,X4: $i > $o,X5: $i] :
( ( $true
!= ( X4 @ X3 ) )
| ( ( in @ X3
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
= $true )
| ( $true
!= ( in @ X3 @ X5 ) ) )
| ( dsetconstrI != $true ) ) ),
inference(rectify,[],[f23]) ).
thf(f25,plain,
( ( ( dsetconstrI = $true )
| ( ( ( sK6 @ sK5 )
= $true )
& ( $true
!= ( in @ sK5
@ ( dsetconstr @ sK7
@ ^ [Y0: $i] : ( sK6 @ Y0 ) ) ) )
& ( ( in @ sK5 @ sK7 )
= $true ) ) )
& ( ! [X3: $i,X4: $i > $o,X5: $i] :
( ( $true
!= ( X4 @ X3 ) )
| ( ( in @ X3
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
= $true )
| ( $true
!= ( in @ X3 @ X5 ) ) )
| ( dsetconstrI != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f24]) ).
thf(f26,plain,
( ( sK0 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f27,plain,
( ( in @ sK1 @ sK2 )
= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f28,plain,
( ( nonempty
@ ( dsetconstr @ sK2
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) )
!= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f29,plain,
emptysetE = $true,
inference(cnf_transformation,[],[f19]) ).
thf(f30,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f19]) ).
thf(f31,plain,
! [X2: $i,X3: $o] :
( ( emptysetE != $true )
| ( ( in @ X2 @ emptyset )
!= $true )
| ( $true = X3 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f34,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( $true
!= ( in @ X3 @ X5 ) )
| ( dsetconstrI != $true )
| ( ( in @ X3
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
= $true )
| ( $true
!= ( X4 @ X3 ) ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f38,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f40,plain,
( ( nonempty @ ( dsetconstr @ sK2 @ sK0 ) )
!= $true ),
inference(beta-eta_normalization,[],[f28]) ).
thf(f41,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( $true
!= ( in @ X3 @ X5 ) )
| ( dsetconstrI != $true )
| ( $true
!= ( X4 @ X3 ) )
| ( ( in @ X3 @ ( dsetconstr @ X5 @ X4 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f45,plain,
! [X2: $i,X3: $o] :
( ( ( in @ X2 @ emptyset )
!= $true )
| ( $true = X3 ) ),
inference(forward_subsumption_resolution,[],[f31,f29]) ).
thf(f46,plain,
! [X1: $i] :
( ( ^ [Y0: $i] : ( emptyset != Y0 )
@ X1 )
= ( nonempty @ X1 ) ),
inference(argument_congruence,[],[f38]) ).
thf(f48,plain,
! [X1: $i] :
( ( $true
= ( nonempty @ X1 ) )
| ( ( ^ [Y0: $i] : ( emptyset != Y0 )
@ X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f46]) ).
thf(f49,plain,
! [X1: $i] :
( ( ( emptyset != X1 )
= $false )
| ( $true
= ( nonempty @ X1 ) ) ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f50,plain,
! [X1: $i] :
( ( $true
= ( nonempty @ X1 ) )
| ( ( emptyset = X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f49]) ).
thf(f51,plain,
! [X1: $i] :
( ( $true
= ( nonempty @ X1 ) )
| ( emptyset = X1 ) ),
inference(equality_proxy_clausification,[],[f50]) ).
thf(f55,plain,
( ( emptyset
= ( dsetconstr @ sK2 @ sK0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f40,f51]) ).
thf(f56,plain,
( emptyset
= ( dsetconstr @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f57,plain,
( ( nonempty @ emptyset )
!= $true ),
inference(superposition,[],[f40,f56]) ).
thf(f63,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X3 @ ( dsetconstr @ X5 @ X4 ) )
= $true )
| ( $true
!= ( in @ X3 @ X5 ) )
| ( $true
!= ( X4 @ X3 ) ) ),
inference(forward_subsumption_resolution,[],[f41,f30]) ).
thf(f64,plain,
! [X0: $i] :
( ( ( in @ X0 @ sK2 )
!= $true )
| ( $true
!= ( sK0 @ X0 ) )
| ( ( in @ X0 @ emptyset )
= $true ) ),
inference(superposition,[],[f63,f56]) ).
thf(f65,plain,
( ( $true
= ( in @ sK1 @ emptyset ) )
| ( $true != $true )
| ( ( sK0 @ sK1 )
!= $true ) ),
inference(superposition,[],[f64,f27]) ).
thf(f66,plain,
( ( $true
= ( in @ sK1 @ emptyset ) )
| ( ( sK0 @ sK1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f67,plain,
( $true
= ( in @ sK1 @ emptyset ) ),
inference(forward_subsumption_resolution,[],[f66,f26]) ).
thf(f68,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $true != $true ) ),
inference(superposition,[],[f45,f67]) ).
thf(f69,plain,
! [X0: $o] : ( $true = X0 ),
inference(trivial_inequality_removal,[],[f68]) ).
thf(f76,plain,
$true != $true,
inference(superposition,[],[f57,f69]) ).
thf(f77,plain,
$false,
inference(trivial_inequality_removal,[],[f76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU510^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n013.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:46:37 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.28 % (2138068)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (2138073)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=695032666:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (2138073)Refutation not found, incomplete strategy
% 0.21/0.28 % (2138073)------------------------------
% 0.21/0.28 % (2138073)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2138073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2138073)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2138073)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (2138073)Time elapsed: 0.001 s
% 0.21/0.28 % (2138073)Peak memory usage: 12 MB
% 0.21/0.28 % (2138073)Instructions burned: 2 (million)
% 0.21/0.28 % (2138073)------------------------------
% 0.21/0.28 % (2138073)------------------------------
% 0.21/0.28 % (2138079)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.28 % (2138079)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.28 % (2138075)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2541018329:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (2138077)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1173917811:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (2138074)lrs+10_16_si=on:nwc=1.5:random_seed=3615119767:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (2138076)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2278568495:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.28 % (2138078)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=930072949:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (2138079)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1814521866:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (2138075)Refutation not found, incomplete strategy
% 0.21/0.28 % (2138075)------------------------------
% 0.21/0.28 % (2138075)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2138075)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2138075)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2138075)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (2138075)Time elapsed: 0.002 s
% 0.21/0.28 % (2138075)Peak memory usage: 12 MB
% 0.21/0.28 % (2138075)Instructions burned: 2 (million)
% 0.21/0.28 % (2138075)------------------------------
% 0.21/0.28 % (2138075)------------------------------
% 0.21/0.28 % (2138074)Refutation not found, incomplete strategy
% 0.21/0.28 % (2138074)------------------------------
% 0.21/0.28 % (2138074)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2138074)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2138074)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2138074)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (2138074)Time elapsed: 0.002 s
% 0.21/0.28 % (2138074)Peak memory usage: 12 MB
% 0.21/0.28 % (2138074)Instructions burned: 2 (million)
% 0.21/0.28 % (2138077) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2138068-2138077"...
% 0.21/0.28 % (2138074)------------------------------
% 0.21/0.28 % (2138074)------------------------------
% 0.21/0.28 % (2138078) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2138068-2138078"...
% 0.21/0.28 % (2138076) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2138068-2138076"...
% 0.21/0.28 % (2138081)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=774504214:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.28 % (2138077)...printing done.
% 0.21/0.28 % (2138079) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2138068-2138079"...
% 0.21/0.28 % (2138077)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (2138077)------------------------------
% 0.21/0.28 % (2138077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2138077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2138077)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2138077)Termination reason: Refutation
% 0.21/0.28 % (2138077)Time elapsed: 0.004 s
% 0.21/0.28 % (2138077)Peak memory usage: 12 MB
% 0.21/0.28 % (2138077)Instructions burned: 6 (million)
% 0.21/0.28 % (2138068)Success in time 0.029 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------