%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR145^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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 07:47:21 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 75 ( 17 unt; 0 typ; 3 def)
% Number of atoms : 327 ( 112 equ; 6 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 253 ( 75 ~; 54 |; 4 &; 112 @)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 19 usr; 9 con; 0-4 aty)
% Number of variables : 144 ( 49 sgn 65 !; 7 ?; 144 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
num: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
husband_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_3,type,
wife_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_4,type,
inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_6,type,
vNOT: $o > $o ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_12,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
sK2: ( $i > $i > $i > $i > $o ) > $i ).
thf(f1,axiom,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(f2,axiom,
! [X0: $i > $i > $o,X1: $i > $i > $o] :
( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
=> ! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
<=> ( X0 @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(f3,axiom,
? [X0: $i] :
~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(f4,axiom,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003) ).
thf(f5,conjecture,
? [X0: $i > $i > $o] :
( ( X0
!= ( ^ [X1: $i,X2: $i] : $true ) )
& ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(f6,negated_conjecture,
~ ? [X0: $i > $i > $o] :
( ( X0
!= ( ^ [X1: $i,X2: $i] : $true ) )
& ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ( inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: $i > $i > $o,X1: $i > $i > $o] :
( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
=> ! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
<=> ( X0 @ X3 @ X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
! [X0: $i > $i > $o,X1: $i > $i > $o] :
( ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
= $true )
=> ! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
= ( X0 @ X3 @ X2 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
? [X0: $i] :
~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X0 ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
? [X0: $i] :
( ( ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X0 ) )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
inference(rectify,[],[f4]) ).
thf(f14,plain,
( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ? [X0: $i > $i > $o] :
( ( X0
!= ( ^ [X1: $i,X2: $i] : $true ) )
& ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
~ ? [X0: $i > $i > $o] :
( ( $true
= ( X0
!= ( ^ [Y0: $i,Y1: $i] : $true ) ) )
& ( ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
= $true ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
! [X0: $i > $i > $o,X1: $i > $i > $o] :
( ! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
= ( X0 @ X3 @ X2 ) )
| ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f18,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( X0
!= ( ^ [Y0: $i,Y1: $i] : $true ) ) )
| ( ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f19,plain,
( $true
= ( ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f12]) ).
thf(f20,plain,
( ( inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f21,plain,
! [X2: $i,X3: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
( ( ( X1 @ X2 @ X3 )
= ( X0 @ X3 @ X2 ) )
| ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f22,plain,
( $true
= ( ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ sK0 ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f23,plain,
( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f24,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( X0
!= ( ^ [Y0: $i,Y1: $i] : $true ) ) )
| ( ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f27,plain,
! [X0: $i > $i > $o] :
( ( $true
= ( X0
= ( ^ [Y0: $i,Y1: $i] : $true ) ) )
| ( ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
!= $true ) ),
inference(not_proxy_clausification,[],[f24]) ).
thf(f28,plain,
! [X0: $i > $i > $o] :
( ( ( X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
!= $true )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= X0 ) ),
inference(equality_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ sK0 )
= $false ),
inference(not_proxy_clausification,[],[f22]) ).
thf(f30,plain,
! [X2: $i,X3: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
( ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
!= $true )
| ( ( X1 @ X2 @ X3 )
= $true )
| ( ( X0 @ X3 @ X2 )
= $false ) ),
inference(iff_proxy_clausification,[],[f21]) ).
thf(f32,plain,
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ lChris_THFTYPE_i
@ lCorina_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 ) ) ) ),
inference(primitive_instantiation,[],[f28]) ).
thf(f33,plain,
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 )
@ lChris_THFTYPE_i
@ lCorina_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 ) ) ) ),
inference(primitive_instantiation,[],[f28]) ).
thf(f41,plain,
( ( $true
!= ( lChris_THFTYPE_i != lCorina_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 ) ) ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f42,plain,
( ( $true
= ( lChris_THFTYPE_i = lCorina_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 ) ) ) ),
inference(not_proxy_clausification,[],[f41]) ).
thf(f43,plain,
( ( lChris_THFTYPE_i = lCorina_THFTYPE_i )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 ) ) ) ),
inference(equality_proxy_clausification,[],[f42]) ).
thf(f44,plain,
( ( $true
!= ( lChris_THFTYPE_i = lCorina_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f45,plain,
( ( lChris_THFTYPE_i != lCorina_THFTYPE_i )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) ) ),
inference(equality_proxy_clausification,[],[f44]) ).
thf(f47,definition,
( spl1_1
<=> ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
thf(f49,plain,
( ( ( ^ [Y0: $i,Y1: $i] : $true )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 ) ) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f51,definition,
( spl1_2
<=> ( lChris_THFTYPE_i = lCorina_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
thf(f54,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f43,f51,f47]) ).
thf(f56,definition,
( spl1_3
<=> ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) ) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
thf(f58,plain,
( ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f59,plain,
( spl1_3
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f45,f51,f56]) ).
thf(f71,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i,Y1: $i] : $true
@ X1 )
= ( (=) @ X1 ) )
| ~ spl1_3 ),
inference(argument_congruence,[],[f58]) ).
thf(f72,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] : $true )
= ( (=) @ X1 ) )
| ~ spl1_3 ),
inference(beta-eta_normalization,[],[f71]) ).
thf(f94,plain,
( ! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] : $true
@ X2 )
= ( X1 = X2 ) )
| ~ spl1_3 ),
inference(argument_congruence,[],[f72]) ).
thf(f96,plain,
( ! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) )
| ( $true
= ( X1 = X2 ) ) )
| ~ spl1_3 ),
inference(iff_proxy_clausification,[],[f94]) ).
thf(f97,plain,
( ! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) )
| ( X1 = X2 ) )
| ~ spl1_3 ),
inference(equality_proxy_clausification,[],[f96]) ).
thf(f98,plain,
( ! [X2: $i,X1: $i] :
( ( $true = $false )
| ( X1 = X2 ) )
| ~ spl1_3 ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
( ! [X2: $i,X1: $i] : ( X1 = X2 )
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f98]) ).
thf(f119,plain,
( ! [X0: $i] :
( $false
= ( husband_THFTYPE_IiioI @ X0 @ sK0 ) )
| ~ spl1_3 ),
inference(constrained_superposition,[],[f29,f99]) ).
thf(f229,plain,
( ! [X0: $i,X1: $i] :
( $false
= ( husband_THFTYPE_IiioI @ X1 @ X0 ) )
| ~ spl1_3 ),
inference(constrained_superposition,[],[f119,f99]) ).
thf(f340,plain,
! [X0: $i,X1: $i] :
( ( $true != $true )
| ( $true
= ( husband_THFTYPE_IiioI @ X0 @ X1 ) )
| ( $false
= ( wife_THFTYPE_IiioI @ X1 @ X0 ) ) ),
inference(constrained_superposition,[],[f30,f20]) ).
thf(f341,plain,
! [X0: $i,X1: $i] :
( ( $true
= ( husband_THFTYPE_IiioI @ X0 @ X1 ) )
| ( $false
= ( wife_THFTYPE_IiioI @ X1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f340]) ).
thf(f343,plain,
( ! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( wife_THFTYPE_IiioI @ X1 @ X0 ) ) )
| ~ spl1_3 ),
inference(forward_demodulation,[],[f341,f229]) ).
thf(f344,plain,
( ! [X0: $i,X1: $i] :
( $false
= ( wife_THFTYPE_IiioI @ X1 @ X0 ) )
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f343]) ).
thf(f346,plain,
( ( $true = $false )
| ~ spl1_3 ),
inference(constrained_superposition,[],[f344,f23]) ).
thf(f375,plain,
( $false
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f346]) ).
thf(f376,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f375]) ).
thf(f429,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i,Y1: $i] : $true
@ X1 )
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 )
@ X1 ) )
| ~ spl1_1 ),
inference(argument_congruence,[],[f49]) ).
thf(f430,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] : $true )
= ( ^ [Y0: $i] : ( X1 != Y0 ) ) )
| ~ spl1_1 ),
inference(beta-eta_normalization,[],[f429]) ).
thf(f447,plain,
( ! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] : $true
@ X2 )
= ( ^ [Y0: $i] : ( X1 != Y0 )
@ X2 ) )
| ~ spl1_1 ),
inference(argument_congruence,[],[f430]) ).
thf(f449,plain,
( ! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) )
| ( $true
= ( ^ [Y0: $i] : ( X1 != Y0 )
@ X2 ) ) )
| ~ spl1_1 ),
inference(iff_proxy_clausification,[],[f447]) ).
thf(f450,plain,
( ! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( X1 != X2 ) ) )
| ~ spl1_1 ),
inference(beta-eta_normalization,[],[f449]) ).
thf(f451,plain,
( ! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( X1 = X2 ) ) )
| ~ spl1_1 ),
inference(not_proxy_clausification,[],[f450]) ).
thf(f452,plain,
( ! [X2: $i,X1: $i] :
( ( $true = $false )
| ( X1 != X2 ) )
| ~ spl1_1 ),
inference(equality_proxy_clausification,[],[f451]) ).
thf(f453,plain,
( ! [X2: $i,X1: $i] : ( X1 != X2 )
| ~ spl1_1 ),
inference(trivial_inequality_removal,[],[f452]) ).
thf(f454,plain,
( $false
| ~ spl1_1 ),
inference(flex-flex_simplification,[],[f453]) ).
thf(f455,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f454]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f54]) ).
cnf(s2,plain,
( ~ spl1_2
| spl1_3 ),
inference(sat_conversion,[],[f59]) ).
cnf(s14,plain,
~ spl1_3,
inference(sat_conversion,[],[f376]) ).
cnf(s15,plain,
~ spl1_1,
inference(sat_conversion,[],[f455]) ).
cnf(s16,plain,
~ spl1_2,
inference(rat,[],[s2,s14]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s1,s16,s15]) ).
thf(f459,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR145^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n003.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 17:58:59 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 Running first-order model finding
% 0.11/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
% 0.22/0.29 % (2848279)Will run a generic schedule for satisfiability detection.
% 0.22/0.29 % (2848296)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3031268489:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.29 % (2848295)% WARNING: option uhcvi not known.
% 0.22/0.29 % (2848295)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1675428719:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.29 % (2848293)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2019054850_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.29 % (2848297)dis+10_1_sil=32000:sp=arity:random_seed=2249148064:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.29 % (2848295)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.29 % (2848299)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1257298298:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.29 % Exception at run slice level% (2848295)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.29
% 0.22/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs% (2848298)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2949171245:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.29
% 0.22/0.29 % (2848300)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=306257977:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.29 % (2848298)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.29 % (2848315)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2380506324:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.22/0.29 % (2848299) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2848279-2848299"...
% 0.22/0.29 % Exception at run slice level
% 0.22/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.29 % (2848299)...printing done.
% 0.22/0.29 % (2848299)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (2848299)------------------------------
% 0.22/0.29 % (2848299)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (2848299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (2848299)CaDiCaL version: 2.1.3
% 0.22/0.29 % (2848299)Termination reason: Refutation
% 0.22/0.29 % (2848299)Time elapsed: 0.021 s
% 0.22/0.29 % (2848299)Peak memory usage: 13 MB
% 0.22/0.29 % (2848299)Instructions burned: 36 (million)
% 0.22/0.29 % (2848279)Success in time 0.058 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------