%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR136^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:18 AM UTC 2026
% Result : Theorem 0.19s 0.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 63 ( 15 unt; 0 typ; 3 def)
% Number of atoms : 385 ( 101 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 363 ( 84 ~; 62 |; 8 &; 196 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 15 usr; 9 con; 0-4 aty)
% ( 10 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 105 ( 8 sgn 59 !; 4 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
num: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_6,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_7,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_9,type,
vNOT: $o > $o ).
thf(func_def_12,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f1,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).
thf(f2,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).
thf(f3,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002) ).
thf(f9,conjecture,
? [X0: $i > $i > $o] :
( ~ ! [X1: $i,X2: $i] : ( X0 @ X1 @ X2 )
& ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f10,negated_conjecture,
~ ? [X0: $i > $i > $o] :
( ~ ! [X1: $i,X2: $i] : ( X0 @ X1 @ X2 )
& ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
thf(f11,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f1]) ).
thf(f12,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(rectify,[],[f2]) ).
thf(f14,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f3]) ).
thf(f16,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f27,plain,
~ ? [X0: $i > $i > $o] :
( ~ ! [X1: $i,X2: $i] : ( X0 @ X1 @ X2 )
& ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(rectify,[],[f10]) ).
thf(f28,plain,
~ ? [X0: $i > $i > $o] :
( ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) )
& ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
& ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ) ),
inference(fool_elimination,[],[f27]) ).
thf(f29,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[],[f28]) ).
thf(f30,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f31,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f32,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f38,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f41,plain,
! [X0: $i > $i > $o] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(not_proxy_clausification,[],[f38]) ).
thf(f42,plain,
! [X0: $i > $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) )
@ X1 ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(pi_proxy_clausification,[],[f41]) ).
thf(f43,plain,
! [X0: $i > $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( X0 @ Y0 @ X1 ) ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] : ( X0 @ Y0 @ X1 )
@ X2 ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(pi_proxy_clausification,[],[f43]) ).
thf(f45,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( $true
= ( X0 @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false ),
inference(not_proxy_clausification,[],[f31]) ).
thf(f48,plain,
! [X2: $i,X1: $i] :
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 )
@ lSue_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 )
@ lMary_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
= ( ^ [Y0: $i,Y1: $i] : ( Y0 != Y1 )
@ X2
@ X1 ) ) ),
inference(primitive_instantiation,[],[f45]) ).
thf(f62,plain,
! [X2: $i,X1: $i] :
( ( $true
!= ( lSue_THFTYPE_i != lBill_THFTYPE_i ) )
| ( $true
!= ( lMary_THFTYPE_i != lBill_THFTYPE_i ) )
| ( $true
= ( X2 != X1 ) ) ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f63,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( lSue_THFTYPE_i = lBill_THFTYPE_i ) )
| ( $true
!= ( lMary_THFTYPE_i != lBill_THFTYPE_i ) )
| ( $true
= ( X2 != X1 ) ) ),
inference(not_proxy_clausification,[],[f62]) ).
thf(f64,plain,
! [X2: $i,X1: $i] :
( ( lSue_THFTYPE_i = lBill_THFTYPE_i )
| ( $true
!= ( lMary_THFTYPE_i != lBill_THFTYPE_i ) )
| ( $true
= ( X2 != X1 ) ) ),
inference(equality_proxy_clausification,[],[f63]) ).
thf(f65,plain,
! [X2: $i,X1: $i] :
( ( lSue_THFTYPE_i = lBill_THFTYPE_i )
| ( $true
= ( lMary_THFTYPE_i = lBill_THFTYPE_i ) )
| ( $true
= ( X2 != X1 ) ) ),
inference(not_proxy_clausification,[],[f64]) ).
thf(f66,plain,
! [X2: $i,X1: $i] :
( ( lSue_THFTYPE_i = lBill_THFTYPE_i )
| ( lBill_THFTYPE_i = lMary_THFTYPE_i )
| ( $true
= ( X2 != X1 ) ) ),
inference(equality_proxy_clausification,[],[f65]) ).
thf(f67,plain,
! [X2: $i,X1: $i] :
( ( lSue_THFTYPE_i = lBill_THFTYPE_i )
| ( lBill_THFTYPE_i = lMary_THFTYPE_i )
| ( $false
= ( X2 = X1 ) ) ),
inference(not_proxy_clausification,[],[f66]) ).
thf(f68,plain,
! [X2: $i,X1: $i] :
( ( lSue_THFTYPE_i = lBill_THFTYPE_i )
| ( lBill_THFTYPE_i = lMary_THFTYPE_i )
| ( X1 != X2 ) ),
inference(equality_proxy_clausification,[],[f67]) ).
thf(f74,definition,
( spl0_1
<=> ! [X2: $i,X1: $i] : ( X1 != X2 ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f75,plain,
( ! [X2: $i,X1: $i] : ( X1 != X2 )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f77,definition,
( spl0_2
<=> ( lBill_THFTYPE_i = lMary_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f79,plain,
( ( lBill_THFTYPE_i = lMary_THFTYPE_i )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f77]) ).
thf(f81,definition,
( spl0_3
<=> ( lSue_THFTYPE_i = lBill_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f83,plain,
( ( lSue_THFTYPE_i = lBill_THFTYPE_i )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f81]) ).
thf(f84,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f68,f81,f77,f74]) ).
thf(f101,plain,
! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true != $true )
| ( $true
!= ( ^ [Y0: $i,Y1: $i] :
( likes_THFTYPE_IiioI @ ( X0 @ Y0 @ Y1 )
@ ( ^ [Y2: $i,Y3: $i] : Y3
@ Y0
@ Y1 ) )
@ lMary_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
= ( ^ [Y0: $i,Y1: $i] :
( likes_THFTYPE_IiioI @ ( X0 @ Y0 @ Y1 )
@ ( ^ [Y2: $i,Y3: $i] : Y3
@ Y0
@ Y1 ) )
@ X1
@ X2 ) )
| ( lSue_THFTYPE_i
!= ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(constrained_superposition,[],[f45,f30]) ).
thf(f105,plain,
! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true
!= ( ^ [Y0: $i,Y1: $i] :
( likes_THFTYPE_IiioI @ ( X0 @ Y0 @ Y1 )
@ ( ^ [Y2: $i,Y3: $i] : Y3
@ Y0
@ Y1 ) )
@ lMary_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
= ( ^ [Y0: $i,Y1: $i] :
( likes_THFTYPE_IiioI @ ( X0 @ Y0 @ Y1 )
@ ( ^ [Y2: $i,Y3: $i] : Y3
@ Y0
@ Y1 ) )
@ X1
@ X2 ) )
| ( lSue_THFTYPE_i
!= ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(trivial_inequality_removal,[],[f101]) ).
thf(f106,plain,
! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true
!= ( likes_THFTYPE_IiioI @ ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) @ lBill_THFTYPE_i ) )
| ( $true
= ( likes_THFTYPE_IiioI @ ( X0 @ X1 @ X2 ) @ X2 ) )
| ( lSue_THFTYPE_i
!= ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(beta-eta_normalization,[],[f105]) ).
thf(f213,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $false )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f46,f79]) ).
thf(f215,plain,
( ( $true = $false )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f213,f30]) ).
thf(f229,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f215]) ).
thf(f230,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f229]) ).
thf(f249,plain,
( ( $false
= ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i ) )
| ~ spl0_3 ),
inference(forward_demodulation,[],[f46,f83]) ).
thf(f575,plain,
( ! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true
!= ( likes_THFTYPE_IiioI @ ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) @ lBill_THFTYPE_i ) )
| ( lBill_THFTYPE_i
!= ( X0 @ lBill_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( $true
= ( likes_THFTYPE_IiioI @ ( X0 @ X1 @ X2 ) @ X2 ) ) )
| ~ spl0_3 ),
inference(forward_demodulation,[],[f106,f83]) ).
thf(f782,plain,
( ! [X0: $i,X1: $i] :
( ( $true != $true )
| ( lBill_THFTYPE_i
!= ( ^ [Y0: $i,Y1: $i] : Y0
@ lBill_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
= ( likes_THFTYPE_IiioI
@ ( ^ [Y0: $i,Y1: $i] : Y0
@ X0
@ X1 )
@ X1 ) ) )
| ~ spl0_3 ),
inference(constrained_superposition,[],[f575,f32]) ).
thf(f801,plain,
( ! [X0: $i,X1: $i] :
( ( lBill_THFTYPE_i
!= ( ^ [Y0: $i,Y1: $i] : Y0
@ lBill_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
= ( likes_THFTYPE_IiioI
@ ( ^ [Y0: $i,Y1: $i] : Y0
@ X0
@ X1 )
@ X1 ) ) )
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f782]) ).
thf(f802,plain,
( ! [X0: $i,X1: $i] :
( ( lBill_THFTYPE_i != lBill_THFTYPE_i )
| ( $true
= ( likes_THFTYPE_IiioI @ X0 @ X1 ) ) )
| ~ spl0_3 ),
inference(beta-eta_normalization,[],[f801]) ).
thf(f803,plain,
( ! [X0: $i,X1: $i] :
( $true
= ( likes_THFTYPE_IiioI @ X0 @ X1 ) )
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f802]) ).
thf(f943,plain,
( ( $true = $false )
| ~ spl0_3 ),
inference(constrained_superposition,[],[f803,f249]) ).
thf(f959,plain,
( $false
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f943]) ).
thf(f960,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f959]) ).
thf(f961,plain,
( $false
| ~ spl0_1 ),
inference(flex-flex_simplification,[],[f75]) ).
thf(f962,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f961]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f84]) ).
cnf(s4,plain,
~ spl0_2,
inference(sat_conversion,[],[f230]) ).
cnf(s12,plain,
~ spl0_3,
inference(sat_conversion,[],[f960]) ).
cnf(s13,plain,
~ spl0_1,
inference(sat_conversion,[],[f962]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s12,s4,s13]) ).
thf(f963,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR136^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n018.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 17:58:11 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.19/0.29 % (425319)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (425327)dis+10_1_sil=32000:sp=arity:random_seed=2688459975:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.29 % (425325)% WARNING: option uhcvi not known.
% 0.19/0.29 % (425324)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3743348755_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.29 % (425325)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2755001365:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.29 % (425326)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2760775008:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.29 % (425328)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3957234265:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29 % Exception at run slice level% (425325)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.29
% 0.19/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.29 % (425325)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.29 % (425328)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.29 % (425329)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1084772079:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (425330)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1773694996:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.29 % (425327)Instruction limit reached!
% 0.19/0.29 % (425327)------------------------------
% 0.19/0.29 % (425327)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (425327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (425327)CaDiCaL version: 2.1.3
% 0.19/0.29 % (425327)Termination reason: Instruction limit
% 0.19/0.29 % (425327)Termination phase: Saturation
% 0.19/0.29 % (425327)Time elapsed: 0.027 s
% 0.19/0.29 % (425327)Peak memory usage: 12 MB
% 0.19/0.29 % (425327)Instructions burned: 104 (million)
% 0.19/0.29 % (425336)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=777655871:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.29 % Exception at run slice level
% 0.19/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.29 % (425339)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=127524431:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (425325) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-425319-425325"...
% 0.19/0.29 % (425325)...printing done.
% 0.19/0.29 % (425325)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.29 % (425325)------------------------------
% 0.19/0.29 % (425325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (425325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (425325)CaDiCaL version: 2.1.3
% 0.19/0.29 % (425325)Termination reason: Refutation
% 0.19/0.29 % (425325)Time elapsed: 0.037 s
% 0.19/0.29 % (425325)Peak memory usage: 13 MB
% 0.19/0.29 % (425325)Instructions burned: 71 (million)
% 0.19/0.29 % (425319)Success in time 0.078 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------