%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU806^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 : n008.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:33:29 AM UTC 2026
% Result : Theorem 1.78s 0.54s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 407 ( 108 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 532 ( 21 ~; 22 |; 38 &; 372 @)
% ( 0 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 22 usr; 10 con; 0-4 aty)
% ( 19 !!; 24 ??; 0 @@+; 0 @@-)
% Number of variables : 131 ( 52 ^; 71 !; 8 ?; 131 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
setadjoin: $i > $i > $i ).
thf(func_def_3,type,
foundationAx: $o ).
thf(func_def_5,type,
setadjoinIL: $o ).
thf(func_def_6,type,
uniqinunit: $o ).
thf(func_def_7,type,
in__Cong: $o ).
thf(func_def_8,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
vIMP: $o > $o > $o ).
thf(func_def_10,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
vAND: $o > $o > $o ).
thf(func_def_15,type,
vNOT: $o > $o ).
thf(func_def_16,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_18,type,
vIFF: $o > $o > $o ).
thf(func_def_19,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
sK1: $i > $i ).
thf(f1,axiom,
( foundationAx
= ( ! [X0: $i] :
( ? [X1: $i] : ( in @ X1 @ X0 )
=> ? [X2: $i] :
( ~ ? [X1: $i] :
( ( in @ X1 @ X0 )
& ( in @ X1 @ X2 ) )
& ( in @ X2 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',foundationAx) ).
thf(f2,axiom,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f3,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(f5,conjecture,
( foundationAx
=> ( setadjoinIL
=> ( uniqinunit
=> ( in__Cong
=> ! [X0: $i] :
~ ( in @ X0 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinself) ).
thf(f6,negated_conjecture,
~ ( foundationAx
=> ( setadjoinIL
=> ( uniqinunit
=> ( in__Cong
=> ! [X0: $i] :
~ ( in @ X0 @ X0 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( foundationAx
= ( ! [X0: $i] :
( ? [X1: $i] : ( in @ X1 @ X0 )
=> ? [X2: $i] :
( ~ ? [X3: $i] :
( ( in @ X3 @ X0 )
& ( in @ X3 @ X2 ) )
& ( in @ X2 @ X0 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( foundationAx
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ Y0 ) )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( in @ Y2 @ Y0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f15,plain,
~ ( foundationAx
=> ( setadjoinIL
=> ( uniqinunit
=> ( in__Cong
=> ! [X0: $i] :
~ ( in @ X0 @ X0 ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
~ ( ( foundationAx = $true )
=> ( ( setadjoinIL = $true )
=> ( ( uniqinunit = $true )
=> ( ( in__Cong = $true )
=> ! [X0: $i] :
( ( in @ X0 @ X0 )
!= $true ) ) ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
~ ( ( foundationAx = $true )
=> ( ( setadjoinIL = $true )
=> ( ( uniqinunit = $true )
=> ( ( in__Cong = $true )
=> ! [X0: $i] :
( ( in @ X0 @ X0 )
!= $true ) ) ) ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
( ? [X0: $i] :
( ( in @ X0 @ X0 )
= $true )
& ( in__Cong = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true )
& ( foundationAx = $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f19,plain,
( ? [X0: $i] :
( ( in @ X0 @ X0 )
= $true )
& ( in__Cong = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true )
& ( foundationAx = $true ) ),
inference(flattening,[],[f18]) ).
thf(f20,plain,
( ( $true
= ( in @ sK0 @ sK0 ) )
& ( in__Cong = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true )
& ( foundationAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f19]) ).
thf(f21,plain,
( foundationAx
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ Y0 ) )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( in @ Y2 @ Y0 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f22,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f23,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f25,plain,
foundationAx = $true,
inference(cnf_transformation,[],[f20]) ).
thf(f26,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f20]) ).
thf(f27,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f20]) ).
thf(f29,plain,
( $true
= ( in @ sK0 @ sK0 ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f32,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ Y0 ) )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( in @ Y2 @ Y0 ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f21,f25]) ).
thf(f33,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f22,f26]) ).
thf(f34,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f23,f27]) ).
thf(f51,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f34]) ).
thf(f52,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f51]) ).
thf(f53,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f52]) ).
thf(f54,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f54]) ).
thf(f56,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f33]) ).
thf(f58,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f57]) ).
thf(f59,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f58]) ).
thf(f60,plain,
! [X2: $i,X1: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f59]) ).
thf(f61,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ Y0 ) )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( in @ Y2 @ Y0 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f62,plain,
! [X1: $i] :
( $true
= ( ( ?? @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ X1 ) )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ~ ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( in @ Y1 @ X1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f61]) ).
thf(f63,plain,
! [X1: $i] :
( ( $false
= ( ?? @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ X1 ) ) )
| ( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ~ ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( in @ Y1 @ X1 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f62]) ).
thf(f64,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : ( in @ Y0 @ X1 )
@ X2 ) )
| ( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ~ ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( in @ Y1 @ X1 ) ) ) ) ) ) ),
inference(pi_proxy_clausification,[],[f63]) ).
thf(f65,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : ( in @ Y0 @ X1 )
@ X2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ~ ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( in @ Y1 @ X1 ) ) ) )
@ ( sK1 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f64]) ).
thf(f66,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ X1 ) )
| ( $true
= ( ( in @ ( sK1 @ X1 ) @ X1 )
& ~ ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( sK1 @ X1 ) )
& ( in @ Y0 @ X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f65]) ).
thf(f67,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ X1 ) )
| ( $true
= ( ~ ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( sK1 @ X1 ) )
& ( in @ Y0 @ X1 ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f66]) ).
thf(f68,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ X1 ) )
| ( $true
= ( in @ ( sK1 @ X1 ) @ X1 ) ) ),
inference(and_proxy_clausification,[],[f66]) ).
thf(f69,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ X1 ) )
| ( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( sK1 @ X1 ) )
& ( in @ Y0 @ X1 ) ) ) ) ),
inference(not_proxy_clausification,[],[f67]) ).
thf(f70,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X2 @ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( sK1 @ X1 ) )
& ( in @ Y0 @ X1 ) )
@ X3 ) ) ),
inference(pi_proxy_clausification,[],[f69]) ).
thf(f71,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X2 @ X1 ) )
| ( $false
= ( ( in @ X3 @ ( sK1 @ X1 ) )
& ( in @ X3 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f70]) ).
thf(f72,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X3 @ ( sK1 @ X1 ) ) )
| ( $false
= ( in @ X2 @ X1 ) )
| ( ( in @ X3 @ X1 )
= $false ) ),
inference(and_proxy_clausification,[],[f71]) ).
thf(f74,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( ( sK1 @ ( setadjoin @ X0 @ emptyset ) )
= X0 )
| ( $false
= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) ) ),
inference(constrained_superposition,[],[f56,f68]) ).
thf(f76,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( ( sK1 @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f129,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X2 @ ( sK1 @ ( setadjoin @ X0 @ X1 ) ) ) )
| ( $false
= ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(constrained_superposition,[],[f60,f72]) ).
thf(f134,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( sK1 @ ( setadjoin @ X0 @ X1 ) ) ) )
| ( $false
= ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f334,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( sK1 @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ),
inference(constrained_superposition,[],[f60,f76]) ).
thf(f345,plain,
! [X0: $i] :
( ( sK1 @ ( setadjoin @ X0 @ emptyset ) )
= X0 ),
inference(trivial_inequality_removal,[],[f334]) ).
thf(f431,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( ( in @ X1 @ X0 )
= $false ) ),
inference(constrained_superposition,[],[f134,f345]) ).
thf(f2672,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( in @ X0 @ X0 )
= $false ) ),
inference(constrained_superposition,[],[f60,f431]) ).
thf(f2697,plain,
! [X0: $i] :
( ( in @ X0 @ X0 )
= $false ),
inference(trivial_inequality_removal,[],[f2672]) ).
thf(f2932,plain,
$true = $false,
inference(constrained_superposition,[],[f29,f2697]) ).
thf(f2949,plain,
$false,
inference(trivial_inequality_removal,[],[f2932]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU806^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n008.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 14:33:24 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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
% 1.78/0.54 % (3245165)Will run a generic schedule for satisfiability detection.
% 1.78/0.54 % (3245172)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1033867468:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.78/0.54 % (3245171)% WARNING: option uhcvi not known.
% 1.78/0.54 % (3245173)dis+10_1_sil=32000:sp=arity:random_seed=2281621705:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.78/0.54 % (3245170)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1499478442_2999 on theBenchmark for (2999ds/0Mi)
% 1.78/0.54 % (3245171)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1917003695:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.78/0.54 % (3245174)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2594868144:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.78/0.54 % (3245175)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2571168926:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.78/0.54 % (3245176)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3987429158:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.78/0.54 % (3245171)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.78/0.54 % Exception at run slice level
% 1.78/0.54 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.78/0.54 % (3245174)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.78/0.54 % (3245171)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.78/0.54 % (3245184)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=85766236:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.78/0.54 % Exception at run slice level
% 1.78/0.54 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.78/0.54 % (3245186)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3691867706:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.78/0.54 % (3245173)Instruction limit reached!
% 1.78/0.54 % (3245173)------------------------------
% 1.78/0.54 % (3245173)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.54 % (3245173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.54 % (3245173)CaDiCaL version: 2.1.3
% 1.78/0.54 % (3245173)Termination reason: Instruction limit
% 1.78/0.54 % (3245173)Termination phase: Saturation
% 1.78/0.54 % (3245173)Time elapsed: 0.052 s
% 1.78/0.54 % (3245173)Peak memory usage: 12 MB
% 1.78/0.54 % (3245173)Instructions burned: 105 (million)
% 1.78/0.54 % (3245174)Instruction limit reached!
% 1.78/0.54 % (3245174)------------------------------
% 1.78/0.54 % (3245174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.54 % (3245174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.54 % (3245174)CaDiCaL version: 2.1.3
% 1.78/0.54 % (3245174)Termination reason: Instruction limit
% 1.78/0.54 % (3245174)Termination phase: Saturation
% 1.78/0.54 % (3245174)Time elapsed: 0.059 s
% 1.78/0.54 % (3245174)Peak memory usage: 12 MB
% 1.78/0.54 % (3245174)Instructions burned: 120 (million)
% 1.78/0.54 % (3245175)Instruction limit reached!
% 1.78/0.54 % (3245175)------------------------------
% 1.78/0.54 % (3245175)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.54 % (3245175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.54 % (3245175)CaDiCaL version: 2.1.3
% 1.78/0.54 % (3245175)Termination reason: Instruction limit
% 1.78/0.54 % (3245175)Termination phase: Saturation
% 1.78/0.54 % (3245175)Time elapsed: 0.068 s
% 1.78/0.54 % (3245175)Peak memory usage: 12 MB
% 1.78/0.54 % (3245175)Instructions burned: 141 (million)
% 1.78/0.54 % (3245176)Instruction limit reached!
% 1.78/0.54 % (3245176)------------------------------
% 1.78/0.54 % (3245176)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.54 % (3245176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.54 % (3245176)CaDiCaL version: 2.1.3
% 1.78/0.54 % (3245176)Termination reason: Instruction limit
% 1.78/0.54 % (3245176)Termination phase: Saturation
% 1.78/0.54 % (3245176)Time elapsed: 0.070 s
% 1.78/0.54 % (3245176)Peak memory usage: 12 MB
% 1.78/0.54 % (3245176)Instructions burned: 161 (million)
% 1.78/0.54 % (3245188)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3607983563:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.78/0.54 % (3245188)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.78/0.54 % (3245188)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.78/0.54 % (3245189)ott-21_1_sil=16000:fs=off:random_seed=1361706850:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.78/0.54 % (3245190)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=257096374:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.78/0.54 % (3245191)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2265778497:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.78/0.54 % Exception at run slice level
% 1.78/0.54 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.78/0.54 % (3245186)Instruction limit reached!
% 1.78/0.54 % (3245186)------------------------------
% 1.78/0.54 % (3245186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.54 % (3245186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.54 % (3245186)CaDiCaL version: 2.1.3
% 1.78/0.54 % (3245186)Termination reason: Instruction limit
% 1.78/0.54 % (3245186)Termination phase: Saturation
% 1.78/0.54 % (3245186)Time elapsed: 0.063 s
% 1.78/0.54 % (3245186)Peak memory usage: 12 MB
% 1.78/0.54 % (3245186)Instructions burned: 131 (million)
% 1.78/0.54 % (3245196)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1403860671:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.78/0.54 % (3245197)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1859012880:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.78/0.54 % Exception at run slice level
% 1.78/0.54 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.78/0.54 % (3245205)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1209337934:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 1.78/0.54 % (3245205)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.78/0.54 % (3245189)Instruction limit reached!
% 1.78/0.54 % (3245189)------------------------------
% 1.78/0.54 % (3245189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.54 % (3245189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.54 % (3245189)CaDiCaL version: 2.1.3
% 1.78/0.54 % (3245189)Termination reason: Instruction limit
% 1.78/0.54 % (3245189)Termination phase: Saturation
% 1.78/0.54 % (3245189)Time elapsed: 0.085 s
% 1.78/0.54 % (3245189)Peak memory usage: 12 MB
% 1.78/0.54 % (3245189)Instructions burned: 181 (million)
% 1.78/0.54 % (3245221)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1150730785:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 1.78/0.54 % (3245221)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.78/0.54 % (3245171) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3245165-3245171"...
% 1.78/0.54 % (3245171)...printing done.
% 1.78/0.54 % (3245171)Refutation found. Thanks to Tanya!
% 1.78/0.54 % SZS status Theorem for theBenchmark
% 1.78/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.78/0.55 % (3245171)------------------------------
% 1.78/0.55 % (3245171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.78/0.55 % (3245171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.78/0.55 % (3245171)CaDiCaL version: 2.1.3
% 1.78/0.55 % (3245171)Termination reason: Refutation
% 1.78/0.55 % (3245171)Time elapsed: 0.259 s
% 1.78/0.55 % (3245171)Peak memory usage: 13 MB
% 1.78/0.55 % (3245171)Instructions burned: 604 (million)
% 1.78/0.55 % (3245165)Success in time 0.301 s
% 1.78/0.55 % Vampire exiting
%------------------------------------------------------------------------------