%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET002^3 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:23:09 AM UTC 2026
% Result : Theorem 0.24s 0.38s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 38 unt; 0 typ; 3 def)
% Number of atoms : 236 ( 49 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 354 ( 16 ~; 13 |; 0 &; 298 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 41 ( 41 >; 0 *; 0 +; 0 <<)
% Number of symbols : 41 ( 37 usr; 8 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 102 ( 0 sgn 12 !; 0 ?; 102 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mworld: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
mrel: mworld > mworld > $o ).
thf(func_def_1,type,
mactual: mworld ).
thf(func_def_2,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_4,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_5,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_6,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_7,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_8,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_9,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(func_def_10,type,
mdia: ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(func_def_12,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(func_def_13,type,
qmltpeq: $i > $i > mworld > $o ).
thf(func_def_14,type,
member: $i > $i > mworld > $o ).
thf(func_def_15,type,
subset: $i > $i > mworld > $o ).
thf(func_def_16,type,
union: $i > $i > $i ).
thf(func_def_17,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_21,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_22,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
vIFF: $o > $o > $o ).
thf(func_def_24,type,
vAND: $o > $o > $o ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(func_def_26,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_27,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_28,type,
vOR: $o > $o > $o ).
thf(func_def_29,type,
vIMP: $o > $o > $o ).
thf(func_def_30,type,
sK0: mworld > mworld ).
thf(func_def_31,type,
sF1: $o ).
thf(func_def_32,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
sK2: $i > $i > $i ).
thf(func_def_36,type,
sK4: $i > $i > $i ).
thf(f1,axiom,
( mlocal
= ( ^ [X0: mworld > $o] : ( X0 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(f5,axiom,
( mimplies
= ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def) ).
thf(f10,axiom,
( mforall_di
= ( ^ [X0: $i > mworld > $o,X1: mworld] :
! [X2: $i] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_di_def) ).
thf(f21,axiom,
( mlocal
@ ( mforall_di
@ ^ [X0: $i] :
( mforall_di
@ ^ [X1: $i] : ( mimplies @ ( subset @ X0 @ X1 ) @ ( qmltpeq @ ( union @ X0 @ X1 ) @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_union) ).
thf(f26,axiom,
( mlocal
@ ( mforall_di
@ ^ [X0: $i] : ( subset @ X0 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
thf(f28,conjecture,
( mlocal
@ ( mforall_di
@ ^ [X0: $i] : ( qmltpeq @ ( union @ X0 @ X0 ) @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idempotency_of_union) ).
thf(f29,negated_conjecture,
~ ( mlocal
@ ( mforall_di
@ ^ [X0: $i] : ( qmltpeq @ ( union @ X0 @ X0 ) @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
thf(f30,plain,
( mlocal
@ ( mforall_di
@ ^ [X0: $i] : ( subset @ X0 @ X0 ) ) ),
inference(rectify,[],[f26]) ).
thf(f31,plain,
( $true
= ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] : ( subset @ Y0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f30]) ).
thf(f56,plain,
( mforall_di
= ( ^ [X0: $i > mworld > $o,X1: mworld] :
! [X2: $i] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f10]) ).
thf(f57,plain,
( mforall_di
= ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f56]) ).
thf(f64,plain,
~ ( mlocal
@ ( mforall_di
@ ^ [X0: $i] : ( qmltpeq @ ( union @ X0 @ X0 ) @ X0 ) ) ),
inference(rectify,[],[f29]) ).
thf(f65,plain,
( $true
!= ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) ) ),
inference(fool_elimination,[],[f64]) ).
thf(f66,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f67,plain,
( mlocal
@ ( mforall_di
@ ^ [X0: $i] :
( mforall_di
@ ^ [X1: $i] : ( mimplies @ ( subset @ X0 @ X1 ) @ ( qmltpeq @ ( union @ X0 @ X1 ) @ X1 ) ) ) ) ),
inference(rectify,[],[f21]) ).
thf(f68,plain,
( ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] :
( mforall_di
@ ^ [Y1: $i] : ( mimplies @ ( subset @ Y0 @ Y1 ) @ ( qmltpeq @ ( union @ Y0 @ Y1 ) @ Y1 ) ) ) ) )
= $true ),
inference(fool_elimination,[],[f67]) ).
thf(f79,plain,
( mimplies
= ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f80,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f79]) ).
thf(f85,plain,
( $true
!= ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) ) ),
inference(flattening,[],[f65]) ).
thf(f96,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f66]) ).
thf(f99,plain,
( mforall_di
= ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f57]) ).
thf(f100,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f80]) ).
thf(f106,plain,
( ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] :
( mforall_di
@ ^ [Y1: $i] : ( mimplies @ ( subset @ Y0 @ Y1 ) @ ( qmltpeq @ ( union @ Y0 @ Y1 ) @ Y1 ) ) ) ) )
= $true ),
inference(cnf_transformation,[],[f68]) ).
thf(f110,plain,
( $true
= ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] : ( subset @ Y0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f113,plain,
( $true
!= ( mlocal
@ ( mforall_di
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f85]) ).
thf(f127,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i] :
( ^ [Y1: $i > mworld > $o,Y2: mworld] :
( !! @ $i
@ ^ [Y3: $i] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: $i] :
( ^ [Y2: mworld > $o,Y3: mworld > $o,Y4: mworld] :
( ( Y2 @ Y4 )
=> ( Y3 @ Y4 ) )
@ ( subset @ Y0 @ Y1 )
@ ( qmltpeq @ ( union @ Y0 @ Y1 ) @ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f106,f96,f99,f99,f100]) ).
thf(f131,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i] : ( subset @ Y0 @ Y0 ) ) )
= $true ),
inference(definition_unfolding,[],[f110,f96,f99]) ).
thf(f133,plain,
( $true
!= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) ) ),
inference(definition_unfolding,[],[f113,f96,f99]) ).
thf(f134,definition,
( sF1
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) ) ),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
thf(f135,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) )
= sF1 ),
inference(reorient_equations,[],[f134]) ).
thf(f136,plain,
$true != sF1,
inference(definition_folding,[],[f133,f135]) ).
thf(f219,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y0 @ Y1 @ mactual )
=> ( qmltpeq @ ( union @ Y0 @ Y1 ) @ Y1 @ mactual ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f127]) ).
thf(f220,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y0 @ Y1 @ mactual )
=> ( qmltpeq @ ( union @ Y0 @ Y1 ) @ Y1 @ mactual ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f219]) ).
thf(f221,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ X1 @ Y0 @ mactual )
=> ( qmltpeq @ ( union @ X1 @ Y0 ) @ Y0 @ mactual ) ) )
= $true ),
inference(beta-eta_normalization,[],[f220]) ).
thf(f222,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ X1 @ Y0 @ mactual )
=> ( qmltpeq @ ( union @ X1 @ Y0 ) @ Y0 @ mactual ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f221]) ).
thf(f223,plain,
! [X2: $i,X1: $i] :
( ( ( subset @ X1 @ X2 @ mactual )
=> ( qmltpeq @ ( union @ X1 @ X2 ) @ X2 @ mactual ) )
= $true ),
inference(beta-eta_normalization,[],[f222]) ).
thf(f224,plain,
! [X2: $i,X1: $i] :
( ( ( qmltpeq @ ( union @ X1 @ X2 ) @ X2 @ mactual )
= $true )
| ( ( subset @ X1 @ X2 @ mactual )
= $false ) ),
inference(imp_proxy_clausification,[],[f223]) ).
thf(f243,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( subset @ Y0 @ Y0 @ mactual ) )
= $true ),
inference(beta-eta_normalization,[],[f131]) ).
thf(f244,plain,
! [X1: $i] :
( ( ^ [Y0: $i] : ( subset @ Y0 @ Y0 @ mactual )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f243]) ).
thf(f245,plain,
! [X1: $i] :
( ( subset @ X1 @ X1 @ mactual )
= $true ),
inference(beta-eta_normalization,[],[f244]) ).
thf(f247,plain,
( ( $false
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: $i > mworld > $o,Y1: mworld] :
( !! @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 ) ) ) )
| ( $true = sF1 ) ),
inference(iff_proxy_clausification,[],[f135]) ).
thf(f248,plain,
( ( $true = sF1 )
| ( ( !! @ $i
@ ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 @ mactual ) )
= $false ) ),
inference(beta-eta_normalization,[],[f247]) ).
thf(f249,plain,
( ( ( ^ [Y0: $i] : ( qmltpeq @ ( union @ Y0 @ Y0 ) @ Y0 @ mactual )
@ sK3 )
= $false )
| ( $true = sF1 ) ),
inference(sigma_proxy_clausification,[],[f248]) ).
thf(f250,plain,
( ( $true = sF1 )
| ( $false
= ( qmltpeq @ ( union @ sK3 @ sK3 ) @ sK3 @ mactual ) ) ),
inference(beta-eta_normalization,[],[f249]) ).
thf(f287,definition,
( spl5_1
<=> ( $false
= ( qmltpeq @ ( union @ sK3 @ sK3 ) @ sK3 @ mactual ) ) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
thf(f289,plain,
( ( $false
= ( qmltpeq @ ( union @ sK3 @ sK3 ) @ sK3 @ mactual ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f287]) ).
thf(f291,definition,
( spl5_2
<=> ( $true = sF1 ) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
thf(f294,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f250,f291,f287]) ).
thf(f303,plain,
~ spl5_2,
inference(avatar_split_clause,[],[f136,f291]) ).
thf(f325,plain,
( ( $false = $true )
| ( ( subset @ sK3 @ sK3 @ mactual )
= $false )
| ~ spl5_1 ),
inference(constrained_superposition,[],[f289,f224]) ).
thf(f327,plain,
( ( ( subset @ sK3 @ sK3 @ mactual )
= $false )
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f325]) ).
thf(f331,plain,
( ( $false = $true )
| ~ spl5_1 ),
inference(forward_demodulation,[],[f327,f245]) ).
thf(f332,plain,
( $false
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f331]) ).
thf(f333,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f332]) ).
cnf(s1,plain,
( spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f294]) ).
cnf(s3,plain,
~ spl5_2,
inference(sat_conversion,[],[f303]) ).
cnf(s6,plain,
~ spl5_1,
inference(sat_conversion,[],[f333]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s3,s6]) ).
thf(f334,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET002^3 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n011.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 13:35:46 UTC 2026
% 0.08/0.22 % CPUTime :
% 0.08/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.28 Running higher-order theorem proving
% 0.24/0.30 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.38 % (95073)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.38 % (95082)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=27392706:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.24/0.38 % (95084)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.38 % (95084)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.24/0.38 % (95083)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2712981676:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.24/0.38 % (95081)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=2372150994: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.24/0.38 % (95078)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=324146982:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.24/0.38 % (95082)Instruction limit reached!
% 0.24/0.38 % (95082)------------------------------
% 0.24/0.38 % (95082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.38 % (95082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.38 % (95082)CaDiCaL version: 2.1.3
% 0.24/0.38 % (95082)Termination reason: Instruction limit
% 0.24/0.38 % (95082)Termination phase: Saturation
% 0.24/0.38 % (95082)Time elapsed: 0.013 s
% 0.24/0.38 % (95082)Peak memory usage: 12 MB
% 0.24/0.38 % (95082)Instructions burned: 25 (million)
% 0.24/0.38 % (95079)lrs+10_16_si=on:nwc=1.5:random_seed=1138103661:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.24/0.38 % (95080)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=85941656:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.24/0.38 % (95084)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=4172097713:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.24/0.38 % (95080)Instruction limit reached!
% 0.24/0.38 % (95080)------------------------------
% 0.24/0.38 % (95080)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.38 % (95080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.38 % (95080)CaDiCaL version: 2.1.3
% 0.24/0.38 % (95080)Termination reason: Instruction limit
% 0.24/0.38 % (95080)Termination phase: Property scanning
% 0.24/0.38 % (95080)Time elapsed: 0.005 s
% 0.24/0.38 % (95080)Peak memory usage: 10 MB
% 0.24/0.38 % (95080)Instructions burned: 6 (million)
% 0.24/0.38 % (95079)Instruction limit reached!
% 0.24/0.38 % (95079)------------------------------
% 0.24/0.38 % (95079)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.38 % (95079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.38 % (95079)CaDiCaL version: 2.1.3
% 0.24/0.38 % (95079)Termination reason: Instruction limit
% 0.24/0.38 % (95079)Termination phase: Saturation
% 0.24/0.38 % (95079)Time elapsed: 0.015 s
% 0.24/0.38 % (95079)Peak memory usage: 12 MB
% 0.24/0.38 % (95079)Instructions burned: 19 (million)
% 0.24/0.38 % (95091)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2468286533:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.24/0.38 % (95091)Instruction limit reached!
% 0.24/0.38 % (95091)------------------------------
% 0.24/0.38 % (95091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.38 % (95091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.38 % (95091)CaDiCaL version: 2.1.3
% 0.24/0.38 % (95091)Termination reason: Instruction limit
% 0.24/0.38 % (95091)Termination phase: Property scanning
% 0.24/0.38 % (95091)Time elapsed: 0.001 s
% 0.24/0.38 % (95091)Peak memory usage: 10 MB
% 0.24/0.38 % (95091)Instructions burned: 3 (million)
% 0.24/0.38 % (95084) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-95073-95084"...
% 0.24/0.38 % (95078) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-95073-95078"...
% 0.24/0.38 % (95083) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-95073-95083"...
% 0.24/0.38 % (95084)...printing done.
% 0.24/0.38 % (95078)...printing done.
% 0.24/0.38 % (95083)...printing done.
% 0.24/0.38 % (95084)Refutation found. Thanks to Tanya!
% 0.24/0.38 % SZS status Theorem for theBenchmark
% 0.24/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.38 % (95084)------------------------------
% 0.24/0.38 % (95084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.38 % (95084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.38 % (95084)CaDiCaL version: 2.1.3
% 0.24/0.38 % (95084)Termination reason: Refutation
% 0.24/0.38 % (95084)Time elapsed: 0.025 s
% 0.24/0.38 % (95084)Peak memory usage: 13 MB
% 0.24/0.38 % (95084)Instructions burned: 28 (million)
% 0.24/0.38 % (95073)Success in time 0.074 s
% 0.24/0.38 % Vampire exiting
%------------------------------------------------------------------------------