%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV459^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:39:32 AM UTC 2026
% Result : Theorem 1.59s 0.52s
% Output : Refutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 155 ( 42 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 286 ( 11 ~; 13 |; 5 &; 247 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 46 ( 42 usr; 4 con; 0-4 aty)
% ( 3 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 89 ( 4 ^; 82 !; 3 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/SUBSET':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/DELETE':
!>[X0: $tType] : ( ( X0 > $o ) > X0 > X0 > $o ) ).
thf(func_def_4,type,
vAND: $o > $o > $o ).
thf(func_def_5,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_6,type,
vNOT: $o > $o ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vIMP: $o > $o > $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_13,type,
sK1: sK0 ).
thf(func_def_14,type,
sK2: sK0 > $o ).
thf(func_def_15,type,
sK3:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_16,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
sK4:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > sK0 > $o ) > ( X0 > sK0 > sK0 ) > sK0 ) ).
thf(func_def_18,type,
sK5:
!>[X0: $tType] : ( ( X0 > sK0 > $o ) > ( X0 > $o ) > sK0 ) ).
thf(func_def_19,type,
sK6: ( $o > sK0 > $o ) > sK0 ).
thf(func_def_20,type,
sK7: ( $o > sK0 > $o ) > $o > sK0 ).
thf(func_def_22,type,
sK9: ( $o > sK0 > sK0 ) > sK0 ).
thf(func_def_23,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_25,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_26,type,
sK10: ( $o > sK0 > sK0 > $o ) > sK0 ).
thf(func_def_27,type,
sK11: ( $o > sK0 > sK0 ) > sK0 ).
thf(func_def_28,type,
sK12: ( $o > sK0 > sK0 > $o ) > sK0 ).
thf(func_def_29,type,
sK13:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > sK0 > sK0 > $o ) > ( X0 > sK0 > sK0 ) > sK0 ) ).
thf(func_def_30,type,
sK14:
!>[X0: $tType] : ( ( X0 > sK0 > sK0 ) > ( X0 > $o ) > sK0 ) ).
thf(func_def_31,type,
sK15: ( sK0 > $o ) > sK0 ).
thf(func_def_32,type,
sK16:
!>[X0: $tType] : ( ( $o > X0 > sK0 > $o ) > X0 ) ).
thf(func_def_33,type,
sK17:
!>[X0: $tType] : ( ( $o > X0 > sK0 > $o ) > sK0 ) ).
thf(func_def_34,type,
sK18:
!>[X0: $tType] : ( ( X0 > sK0 > sK0 > $o ) > ( X0 > sK0 > sK0 ) > ( X0 > $o ) > sK0 ) ).
thf(func_def_35,type,
sK19: ( $o > sK0 > sK0 ) > ( $o > $o ) > ( $o > sK0 > sK0 > $o ) > sK0 ).
thf(func_def_36,type,
sK20:
!>[X0: $tType] : ( ( $o > X0 > sK0 > $o ) > X0 ) ).
thf(func_def_37,type,
sK21:
!>[X0: $tType] : ( ( $o > X0 > sK0 > sK0 > $o ) > X0 ) ).
thf(func_def_38,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
sK22:
!>[X0: $tType] : ( ( $o > X0 > sK0 > sK0 ) > X0 ) ).
thf(func_def_40,type,
sK23: sK0 > sK0 ).
thf(func_def_41,type,
sK24:
!>[X0: $tType] : ( ( $o > X0 > sK0 > sK0 ) > sK0 ) ).
thf(func_def_42,type,
sK25:
!>[X0: $tType] : ( ( $o > X0 > sK0 > sK0 > $o ) > sK0 ) ).
thf(func_def_43,type,
sK26:
!>[X0: $tType] : ( ( $o > X0 > sK0 > sK0 > $o ) > sK0 ) ).
thf(func_def_44,type,
sK27:
!>[X0: $tType] : ( ( $o > X0 > sK0 > $o ) > sK0 ) ).
thf(f2,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( X2 != X3 ) )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_DELETE_') ).
thf(f3,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
=> ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_') ).
thf(f4,conjecture,
! [X0: $tType,X1: X0,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/DELETE_SUBSET_') ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X1: X0,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( X2 != X3 ) )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
=> ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
~ ! [X0: $tType,X1: X0,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 ),
inference(rectify,[],[f5]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: X0,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 )
= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
? [X0: $tType,X1: X0,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 )
!= $true ),
inference(ennf_transformation,[],[f11]) ).
thf(f13,plain,
( $true
!= ( 'const/sets/SUBSET' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK2 @ sK1 ) @ sK2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
thf(f15,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f16,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f17,plain,
( $true
!= ( 'const/sets/SUBSET' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK2 @ sK1 ) @ sK2 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f20,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) )
= $false ) ),
inference(iff_proxy_clausification,[],[f16]) ).
thf(f25,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( $false
= ( ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) )
@ ( sK3 @ X0 @ X1 @ X2 ) ) ) ),
inference(sigma_proxy_clausification,[],[f20]) ).
thf(f26,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( $false
= ( ( 'const/sets/IN' @ X0 @ ( sK3 @ X0 @ X1 @ X2 ) @ X1 )
=> ( 'const/sets/IN' @ X0 @ ( sK3 @ X0 @ X1 @ X2 ) @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $false
= ( 'const/sets/IN' @ X0 @ ( sK3 @ X0 @ X1 @ X2 ) @ X2 ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK3 @ X0 @ X1 @ X2 ) @ X1 ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f26]) ).
thf(f30,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) )
= $true ) ),
inference(iff_proxy_clausification,[],[f15]) ).
thf(f32,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) ),
inference(and_proxy_clausification,[],[f30]) ).
thf(f233,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0 > $o] :
( ( $true = $false )
| ( $true
= ( 'const/sets/IN' @ X0 @ ( sK3 @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X3 ) @ X1 ) )
| ( $true
= ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X3 ) ) ),
inference(constrained_superposition,[],[f32,f28]) ).
thf(f248,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0 > $o] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK3 @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X3 ) @ X1 ) )
| ( $true
= ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f233]) ).
thf(f712,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( $true = $false )
| ( $true
= ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X1 ) ) ),
inference(constrained_superposition,[],[f27,f248]) ).
thf(f713,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( $true = $false )
| ( $true
= ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f712]) ).
thf(f714,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( $true
= ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X2 ) @ X1 ) ),
inference(trivial_inequality_removal,[],[f713]) ).
thf(f733,plain,
$false,
inference(backward_subsumption_resolution,[],[f17,f714]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV459^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.18 % Computer : n010.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 15:49:19 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.59/0.52 % (3030762)Will run a generic schedule for satisfiability detection.
% 1.59/0.52 % (3030772)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=656664418:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 1.59/0.52 % (3030768)% WARNING: option uhcvi not known.
% 1.59/0.52 % (3030769)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3288195498:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 1.59/0.52 % (3030767)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1948567088_3000 on theBenchmark for (3000ds/0Mi)
% 1.59/0.52 % (3030768)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3966564342:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 1.59/0.52 % (3030770)dis+10_1_sil=32000:sp=arity:random_seed=81347017:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 1.59/0.52 % Exception at run slice level% (3030768)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.59/0.52
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030773)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3219737648:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 1.59/0.52 % (3030768)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.59/0.52 % (3030771)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3780669486:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 1.59/0.52 % (3030771)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.59/0.52 % (3030781)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=175908841:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.59/0.52 % Exception at run slice level
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030772)Instruction limit reached!
% 1.59/0.52 % (3030772)------------------------------
% 1.59/0.52 % (3030772)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030772)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030772)Termination reason: Instruction limit
% 1.59/0.52 % (3030772)Termination phase: Saturation
% 1.59/0.52 % (3030772)Time elapsed: 0.038 s
% 1.59/0.52 % (3030772)Peak memory usage: 12 MB
% 1.59/0.52 % (3030772)Instructions burned: 134 (million)
% 1.59/0.52 % (3030784)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=2983484757:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.59/0.52 % (3030784)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.59/0.52 % (3030784)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.59/0.52 % (3030783)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3306515694:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.59/0.52 % (3030770)Instruction limit reached!
% 1.59/0.52 % (3030770)------------------------------
% 1.59/0.52 % (3030770)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030770)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030770)Termination reason: Instruction limit
% 1.59/0.52 % (3030770)Termination phase: Saturation
% 1.59/0.52 % (3030770)Time elapsed: 0.054 s
% 1.59/0.52 % (3030770)Peak memory usage: 12 MB
% 1.59/0.52 % (3030770)Instructions burned: 103 (million)
% 1.59/0.52 % (3030771)Instruction limit reached!
% 1.59/0.52 % (3030771)------------------------------
% 1.59/0.52 % (3030771)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030771)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030771)Termination reason: Instruction limit
% 1.59/0.52 % (3030771)Termination phase: Saturation
% 1.59/0.52 % (3030771)Time elapsed: 0.062 s
% 1.59/0.52 % (3030771)Peak memory usage: 12 MB
% 1.59/0.52 % (3030771)Instructions burned: 116 (million)
% 1.59/0.52 % (3030787)ott-21_1_sil=16000:fs=off:random_seed=1869809340:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 1.59/0.52 % (3030788)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4197587604:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 1.59/0.52 % (3030773)Instruction limit reached!
% 1.59/0.52 % (3030773)------------------------------
% 1.59/0.52 % (3030773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030773)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030773)Termination reason: Instruction limit
% 1.59/0.52 % (3030773)Termination phase: Saturation
% 1.59/0.52 % (3030773)Time elapsed: 0.084 s
% 1.59/0.52 % (3030773)Peak memory usage: 13 MB
% 1.59/0.52 % (3030773)Instructions burned: 160 (million)
% 1.59/0.52 % (3030791)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=717551543:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.59/0.52 % Exception at run slice level
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030783)Instruction limit reached!
% 1.59/0.52 % (3030783)------------------------------
% 1.59/0.52 % (3030783)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030783)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030783)Termination reason: Instruction limit
% 1.59/0.52 % (3030783)Termination phase: Saturation
% 1.59/0.52 % (3030783)Time elapsed: 0.074 s
% 1.59/0.52 % (3030783)Peak memory usage: 12 MB
% 1.59/0.52 % (3030783)Instructions burned: 132 (million)
% 1.59/0.52 % (3030793)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1946312129:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.59/0.52 % (3030794)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1231405719:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.59/0.52 % Exception at run slice level
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030797)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=1768256192: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.59/0.52 % (3030797)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.59/0.52 % (3030787)Instruction limit reached!
% 1.59/0.52 % (3030787)------------------------------
% 1.59/0.52 % (3030787)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030787)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030787)Termination reason: Instruction limit
% 1.59/0.52 % (3030787)Termination phase: Saturation
% 1.59/0.52 % (3030787)Time elapsed: 0.092 s
% 1.59/0.52 % (3030787)Peak memory usage: 12 MB
% 1.59/0.52 % (3030787)Instructions burned: 181 (million)
% 1.59/0.52 % (3030799)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3847440386:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 1.59/0.52 % (3030799)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.59/0.52 % (3030784)Instruction limit reached!
% 1.59/0.52 % (3030784)------------------------------
% 1.59/0.52 % (3030784)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030784)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030784)Termination reason: Instruction limit
% 1.59/0.52 % (3030784)Termination phase: Saturation
% 1.59/0.52 % (3030784)Time elapsed: 0.178 s
% 1.59/0.52 % (3030784)Peak memory usage: 14 MB
% 1.59/0.52 % (3030784)Instructions burned: 687 (million)
% 1.59/0.52 % (3030801)fmb+10_1_sil=64000:random_seed=3810786441:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 1.59/0.52 % (3030801)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 1.59/0.52 % Exception at run slice level
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030803)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=949262767:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 1.59/0.52 % Exception at run slice level
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030805)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1512929060:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 1.59/0.52 % Exception at run slice level
% 1.59/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.59/0.52 % (3030797) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3030762-3030797"...
% 1.59/0.52 % (3030797)...printing done.
% 1.59/0.52 % (3030797)Refutation found. Thanks to Tanya!
% 1.59/0.52 % SZS status Theorem for theBenchmark
% 1.59/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.59/0.52 % (3030797)------------------------------
% 1.59/0.52 % (3030797)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.59/0.52 % (3030797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.59/0.52 % (3030797)CaDiCaL version: 2.1.3
% 1.59/0.52 % (3030797)Termination reason: Refutation
% 1.59/0.52 % (3030797)Time elapsed: 0.115 s
% 1.59/0.52 % (3030797)Peak memory usage: 15 MB
% 1.59/0.52 % (3030797)Instructions burned: 214 (million)
% 1.59/0.52 % (3030762)Success in time 0.293 s
% 1.59/0.52 % Vampire exiting
%------------------------------------------------------------------------------