%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET611^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:21 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 79 ( 7 unt; 0 typ; 5 def)
% Number of atoms : 389 ( 93 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 386 ( 89 ~; 105 |; 44 &; 138 @)
% ( 9 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 9 con; 0-4 aty)
% Number of variables : 77 ( 18 sgn 18 !; 4 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vAND: $o > $o > $o ).
thf(func_def_2,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_6,type,
vNOT: $o > $o ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_10,type,
sK3: a ).
thf(func_def_11,type,
sK4: a ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X2: a] : $false ) )
<=> ( X0
= ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_84_pme) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X2: a] : $false ) )
<=> ( X0
= ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= ( ^ [X3: a] : $false ) )
<=> ( X1
= ( ^ [X4: a] :
( ( X1 @ X4 )
& ~ ( X0 @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X1: a > $o,X0: a > $o] :
( ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
<=> ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= X1 ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= X1 )
<~> ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
!= X1 ) )
& ( ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= X1 ) ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f7,plain,
( ( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
!= sK1 ) )
& ( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= sK1 )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
!= sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,definition,
( spl2_1
<=> ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f14,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f15,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f17,definition,
( spl2_2
<=> ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f18,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= sK1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f19,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
!= sK1 )
| spl2_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f20,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f9,f17,f13]) ).
thf(f21,plain,
( spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f8,f13,f17]) ).
thf(f22,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK3 )
!= ( ^ [Y0: a] : $false
@ sK3 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f15]) ).
thf(f23,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK3 )
= $true )
| ( ( ^ [Y0: a] : $false
@ sK3 )
= $true )
| spl2_1 ),
inference(xor_proxy_clausification,[],[f22]) ).
thf(f27,plain,
( ( $true = $false )
| ( $true
= ( ( sK1 @ sK3 )
& ( sK0 @ sK3 ) ) )
| spl2_1 ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f28,plain,
( ( $true = $false )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(and_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK3 ) )
| spl2_1 ),
inference(and_proxy_clausification,[],[f27]) ).
thf(f30,plain,
( ( $true
= ( sK1 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f31,plain,
( ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f32,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f18]) ).
thf(f34,plain,
( ! [X1: a] :
( ( $true
= ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f32]) ).
thf(f35,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $true
= ( ~ ( sK0 @ X1 )
& ( sK1 @ X1 ) ) ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f37,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( ( ~ ( sK0 @ X1 ) )
= $true ) )
| ~ spl2_2 ),
inference(and_proxy_clausification,[],[f35]) ).
thf(f38,plain,
( ! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_2 ),
inference(not_proxy_clausification,[],[f37]) ).
thf(f43,plain,
( ( $true = $false )
| ( $false
= ( sK1 @ sK3 ) )
| spl2_1
| ~ spl2_2 ),
inference(constrained_superposition,[],[f31,f38]) ).
thf(f45,plain,
( ( $false
= ( sK1 @ sK3 ) )
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f49,plain,
( ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(forward_demodulation,[],[f45,f30]) ).
thf(f50,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f51,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f52,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f14]) ).
thf(f53,plain,
( ! [X1: a] :
( ( ( ^ [Y0: a] : $false
@ X1 )
= $true )
| ( $false
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 ) ) )
| ~ spl2_1 ),
inference(iff_proxy_clausification,[],[f52]) ).
thf(f58,plain,
( ! [X1: a] :
( ( $false
= ( ( sK1 @ X1 )
& ( sK0 @ X1 ) ) )
| ( $true = $false ) )
| ~ spl2_1 ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f59,plain,
( ! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( $true = $false )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_1 ),
inference(and_proxy_clausification,[],[f58]) ).
thf(f60,plain,
( ! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f61,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK4 )
!= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f19]) ).
thf(f62,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK4 )
= $true )
| ( $true
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f61]) ).
thf(f63,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK4 )
= $false )
| ( $false
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f61]) ).
thf(f64,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( $false
= ( ~ ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f63]) ).
thf(f65,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( $false
= ( ~ ( sK0 @ sK4 ) ) )
| ( $false
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(and_proxy_clausification,[],[f64]) ).
thf(f66,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(not_proxy_clausification,[],[f65]) ).
thf(f67,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f66]) ).
thf(f68,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( ~ ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f62]) ).
thf(f69,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(and_proxy_clausification,[],[f68]) ).
thf(f72,plain,
( ( $true
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f69]) ).
thf(f74,definition,
( spl2_3
<=> ( $false
= ( sK1 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f76,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f78,definition,
( spl2_4
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f80,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f81,plain,
( spl2_3
| spl2_4
| spl2_2 ),
inference(avatar_split_clause,[],[f67,f17,f78,f74]) ).
thf(f83,definition,
( spl2_5
<=> ( $true
= ( sK1 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f85,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f83]) ).
thf(f91,plain,
( spl2_5
| spl2_2 ),
inference(avatar_split_clause,[],[f72,f17,f83]) ).
thf(f92,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( $true = $false )
| ~ spl2_1
| ~ spl2_4 ),
inference(constrained_superposition,[],[f80,f60]) ).
thf(f95,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ~ spl2_1
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f99,plain,
( ( $true = $false )
| ~ spl2_1
| ~ spl2_4
| ~ spl2_5 ),
inference(forward_demodulation,[],[f95,f85]) ).
thf(f100,plain,
( $false
| ~ spl2_1
| ~ spl2_4
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f99]) ).
thf(f101,plain,
( ~ spl2_1
| ~ spl2_4
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f100]) ).
thf(f102,plain,
( ( $true = $false )
| ~ spl2_3
| ~ spl2_5 ),
inference(forward_demodulation,[],[f76,f85]) ).
thf(f103,plain,
( $false
| ~ spl2_3
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f102]) ).
thf(f104,plain,
( ~ spl2_3
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f103]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f20]) ).
cnf(s2,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f21]) ).
cnf(s4,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f51]) ).
cnf(s5,plain,
( spl2_2
| spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f81]) ).
cnf(s7,plain,
( spl2_2
| spl2_5 ),
inference(sat_conversion,[],[f91]) ).
cnf(s9,plain,
( ~ spl2_1
| ~ spl2_4
| ~ spl2_5 ),
inference(sat_conversion,[],[f101]) ).
cnf(s10,plain,
( ~ spl2_3
| ~ spl2_5 ),
inference(sat_conversion,[],[f104]) ).
cnf(s11,plain,
spl2_1,
inference(rat,[],[s2,s4]) ).
cnf(s12,plain,
~ spl2_2,
inference(rat,[],[s1,s11]) ).
cnf(s13,plain,
spl2_5,
inference(rat,[],[s7,s12]) ).
cnf(s14,plain,
~ spl2_3,
inference(rat,[],[s10,s13]) ).
cnf(s15,plain,
~ spl2_4,
inference(rat,[],[s9,s11,s13]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s5,s12,s14,s15]) ).
thf(f105,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET611^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n006.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:38:54 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 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.20/0.28 % (721717)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (721724)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1234755442:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (721724)Refutation not found, incomplete strategy
% 0.20/0.28 % (721724)------------------------------
% 0.20/0.28 % (721724)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (721724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (721724)CaDiCaL version: 2.1.3
% 0.20/0.28 % (721724)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (721724)Time elapsed: 0.001 s
% 0.20/0.28 % (721724)Peak memory usage: 12 MB
% 0.20/0.28 % (721724)Instructions burned: 1 (million)
% 0.20/0.28 % (721724)------------------------------
% 0.20/0.28 % (721724)------------------------------
% 0.20/0.28 % (721728)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.28 % (721728)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.20/0.28 % (721722)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2270738917:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (721723)lrs+10_16_si=on:nwc=1.5:random_seed=382545833:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (721726)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3566633671:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (721725)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=4121872375: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.20/0.28 % (721728)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=459441878:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.28 % (721722) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-721717-721722"...
% 0.20/0.28 % (721723) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-721717-721723"...
% 0.20/0.28 % (721725) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-721717-721725"...
% 0.20/0.28 % (721728) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-721717-721728"...
% 0.20/0.28 % (721722)...printing done.
% 0.20/0.28 % (721726) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-721717-721726"...
% 0.20/0.28 % (721722)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (721722)------------------------------
% 0.20/0.28 % (721722)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (721722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (721722)CaDiCaL version: 2.1.3
% 0.20/0.28 % (721722)Termination reason: Refutation
% 0.20/0.28 % (721722)Time elapsed: 0.004 s
% 0.20/0.28 % (721722)Peak memory usage: 13 MB
% 0.20/0.28 % (721722)Instructions burned: 5 (million)
% 0.20/0.28 % (721717)Success in time 0.038 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------