%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU508^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:32:14 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of formulae : 66 ( 31 unt; 0 typ; 2 def)
% Number of atoms : 369 ( 78 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 494 ( 26 ~; 35 |; 9 &; 343 @)
% ( 5 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 17 usr; 9 con; 0-4 aty)
% ( 30 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 121 ( 0 sgn 57 !; 6 ?; 121 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrI: $o ).
thf(func_def_4,type,
dsetconstrER: $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
sK1: $i > $o ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f2,axiom,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f3,conjecture,
( dsetconstrI
=> ( dsetconstrER
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
<=> ( X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setbeta) ).
thf(f4,negated_conjecture,
~ ( dsetconstrI
=> ( dsetconstrER
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
<=> ( X1 @ X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( dsetconstrI
=> ( dsetconstrER
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
<=> ( X1 @ X2 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( dsetconstrI = $true )
=> ( ( dsetconstrER = $true )
=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( X1 @ X2 )
= ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
!= ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( dsetconstrER = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
!= ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( dsetconstrER = $true )
& ( dsetconstrI = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( ( sK1 @ sK2 )
!= ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ) )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ( dsetconstrER = $true )
& ( dsetconstrI = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
thf(f14,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
( ( sK1 @ sK2 )
!= ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f14,f16]) ).
thf(f23,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f24,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ) ) ),
inference(xor_proxy_clausification,[],[f19]) ).
thf(f25,plain,
( ( ( sK1 @ sK2 )
= $false )
| ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) )
= $false ) ),
inference(xor_proxy_clausification,[],[f19]) ).
thf(f26,plain,
( ( ( sK1 @ sK2 )
= $false )
| ( $false
= ( in @ sK2 @ ( dsetconstr @ sK0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( in @ sK2 @ ( dsetconstr @ sK0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f28,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f23]) ).
thf(f29,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f28]) ).
thf(f30,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f29]) ).
thf(f31,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f34,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f36,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f39]) ).
thf(f41,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f40]) ).
thf(f42,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $false
= ( X2 @ X1 ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f41]) ).
thf(f194,definition,
( spl3_5
<=> ( $false
= ( in @ sK2 @ ( dsetconstr @ sK0 @ sK1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
thf(f195,plain,
( ( $false
!= ( in @ sK2 @ ( dsetconstr @ sK0 @ sK1 ) ) )
| spl3_5 ),
inference(avatar_component_clause,[],[f194]) ).
thf(f196,plain,
( ( $false
= ( in @ sK2 @ ( dsetconstr @ sK0 @ sK1 ) ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f194]) ).
thf(f198,definition,
( spl3_6
<=> ( ( sK1 @ sK2 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
thf(f200,plain,
( ( ( sK1 @ sK2 )
= $false )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f198]) ).
thf(f201,plain,
( spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f26,f198,f194]) ).
thf(f202,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK2 ) )
| ~ spl3_5 ),
inference(forward_demodulation,[],[f27,f196]) ).
thf(f203,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f202]) ).
thf(f209,plain,
( ( $true = $false )
| ( ( sK1 @ sK2 )
= $false )
| ( ( in @ sK2 @ sK0 )
= $false )
| ~ spl3_5 ),
inference(constrained_superposition,[],[f196,f42]) ).
thf(f216,plain,
( ( ( sK1 @ sK2 )
= $false )
| ( ( in @ sK2 @ sK0 )
= $false )
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f209]) ).
thf(f219,plain,
( ( $true = $false )
| ( ( in @ sK2 @ sK0 )
= $false )
| ~ spl3_5 ),
inference(forward_demodulation,[],[f216,f203]) ).
thf(f220,plain,
( ( ( in @ sK2 @ sK0 )
= $false )
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f219]) ).
thf(f223,plain,
( ( $true = $false )
| ~ spl3_5 ),
inference(constrained_superposition,[],[f220,f18]) ).
thf(f227,plain,
( $false
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f223]) ).
thf(f228,plain,
~ spl3_5,
inference(avatar_contradiction_clause,[],[f227]) ).
thf(f230,plain,
( ( $false != $false )
| ( $true
= ( sK1 @ sK2 ) )
| spl3_5 ),
inference(constrained_superposition,[],[f195,f34]) ).
thf(f231,plain,
( ( $true
= ( sK1 @ sK2 ) )
| spl3_5 ),
inference(trivial_inequality_removal,[],[f230]) ).
thf(f232,plain,
( ( $true = $false )
| spl3_5
| ~ spl3_6 ),
inference(forward_demodulation,[],[f231,f200]) ).
thf(f233,plain,
( $false
| spl3_5
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f232]) ).
thf(f234,plain,
( spl3_5
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f233]) ).
cnf(s68,plain,
( spl3_5
| spl3_6 ),
inference(sat_conversion,[],[f201]) ).
cnf(s81,plain,
~ spl3_5,
inference(sat_conversion,[],[f228]) ).
cnf(s88,plain,
( spl3_5
| ~ spl3_6 ),
inference(sat_conversion,[],[f234]) ).
cnf(s89,plain,
~ spl3_6,
inference(rat,[],[s88,s81]) ).
cnf(s90,plain,
$false,
inference(rat,[],[s68,s89,s81]) ).
thf(f235,plain,
$false,
inference(avatar_sat_refutation,[],[s90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU508^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17 % Computer : n002.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 13:49:52 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.24 % (1310800)Will run a generic schedule for satisfiability detection.
% 0.09/0.24 % (1310807)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1861049349:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.24 % (1310806)% WARNING: option uhcvi not known.
% 0.09/0.24 % (1310807) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1310800-1310807"...
% 0.09/0.24 % (1310807)...printing done.
% 0.09/0.24 % (1310810)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2791883757:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.24 % (1310806)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=345271741:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.24 % (1310809)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2132989611:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.24 % (1310808)dis+10_1_sil=32000:sp=arity:random_seed=1188625674:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.24 % (1310807)Refutation found. Thanks to Tanya!
% 0.09/0.24 % SZS status Theorem for theBenchmark
% 0.09/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.24 % (1310807)------------------------------
% 0.09/0.24 % (1310807)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24 % (1310807)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24 % (1310807)CaDiCaL version: 2.1.3
% 0.09/0.24 % (1310807)Termination reason: Refutation
% 0.09/0.24 % (1310807)Time elapsed: 0.006 s
% 0.09/0.24 % (1310807)Peak memory usage: 13 MB
% 0.09/0.24 % (1310807)Instructions burned: 16 (million)
% 0.09/0.24 % (1310800)Success in time 0.035 s
% 0.09/0.24 % Vampire exiting
%------------------------------------------------------------------------------