%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET611^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:23:42 AM UTC 2026
% Result : Theorem 0.07s 0.17s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 85 ( 17 unt; 0 typ; 4 def)
% Number of atoms : 476 ( 105 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 387 ( 74 ~; 100 |; 38 &; 168 @)
% ( 6 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 37 ( 34 usr; 8 con; 0-4 aty)
% Number of variables : 87 ( 14 sgn 14 !; 4 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_20,type,
vOR: $o > $o > $o ).
thf(func_def_21,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_22,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_23,type,
vAND: $o > $o > $o ).
thf(func_def_24,type,
vNOT: $o > $o ).
thf(func_def_25,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_26,type,
vIMP: $o > $o > $o ).
thf(func_def_27,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(f3,axiom,
( emptyset
= ( ^ [X0: $i] : $false ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',emptyset) ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',intersection) ).
thf(f9,axiom,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',setminus) ).
thf(f15,conjecture,
! [X0: $i > $o,X1: $i > $o] :
( ( ( intersection @ X0 @ X1 )
= emptyset )
<=> ( ( setminus @ X0 @ X1 )
= X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X1: $i > $o] :
( ( ( intersection @ X0 @ X1 )
= emptyset )
<=> ( ( setminus @ X0 @ X1 )
= X0 ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f19,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(fool_elimination,[],[f3]) ).
thf(f26,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f27,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f26]) ).
thf(f28,plain,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f29,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f39,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( ( intersection @ X0 @ X1 )
= emptyset )
<~> ( ( setminus @ X0 @ X1 )
= X0 ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f40,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( ( ( setminus @ X0 @ X1 )
!= X0 )
| ( emptyset
!= ( intersection @ X0 @ X1 ) ) )
& ( ( ( setminus @ X0 @ X1 )
= X0 )
| ( ( intersection @ X0 @ X1 )
= emptyset ) ) ),
inference(nnf_transformation,[],[f39]) ).
thf(f41,plain,
( ( ( sK0
!= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
!= ( intersection @ sK0 @ sK1 ) ) )
& ( ( sK0
= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
= ( intersection @ sK0 @ sK1 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f40]) ).
thf(f44,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f49,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f50,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f56,plain,
( ( sK0
= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
= ( intersection @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f57,plain,
( ( sK0
!= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
!= ( intersection @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f61,plain,
( ( sK0
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) )
| ( ( ^ [Y0: $i] : $false )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f57,f50,f44,f49]) ).
thf(f62,plain,
( ( sK0
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) )
| ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f56,f50,f44,f49]) ).
thf(f63,plain,
( ( sK0
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f62]) ).
thf(f64,plain,
( ( sK0
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: $i] : $false )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f61]) ).
thf(f66,definition,
( spl2_1
<=> ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f67,plain,
( ( ( ^ [Y0: $i] : $false )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f68,plain,
( ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f70,definition,
( spl2_2
<=> ( sK0
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f71,plain,
( ( sK0
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
| spl2_2 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f72,plain,
( ( sK0
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f73,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f63,f70,f66]) ).
thf(f74,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f64,f70,f66]) ).
thf(f75,plain,
( ( ( ^ [Y0: $i] : $false
@ sK3 )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK3 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f67]) ).
thf(f76,plain,
( ( $true
= ( ^ [Y0: $i] : $false
@ sK3 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK3 ) )
| spl2_1 ),
inference(xor_proxy_clausification,[],[f75]) ).
thf(f80,plain,
( ( $false = $true )
| ( $true
= ( ( sK0 @ sK3 )
& ( sK1 @ sK3 ) ) )
| spl2_1 ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f81,plain,
( ( $false = $true )
| ( $true
= ( sK1 @ sK3 ) )
| spl2_1 ),
inference(and_proxy_clausification,[],[f80]) ).
thf(f82,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(and_proxy_clausification,[],[f80]) ).
thf(f83,plain,
( ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f84,plain,
( ( $true
= ( sK1 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f85,plain,
( ! [X1: $i] :
( ( sK0 @ X1 )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f72]) ).
thf(f87,plain,
( ! [X1: $i] :
( ( $false
= ( sK0 @ X1 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ X1 ) ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f85]) ).
thf(f88,plain,
( ! [X1: $i] :
( ( $false
= ( sK0 @ X1 ) )
| ( $true
= ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) ) ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f87]) ).
thf(f89,plain,
( ! [X1: $i] :
( ( $false
= ( sK0 @ X1 ) )
| ( $true
= ( ~ ( sK1 @ X1 ) ) ) )
| ~ spl2_2 ),
inference(and_proxy_clausification,[],[f88]) ).
thf(f91,plain,
( ! [X1: $i] :
( ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(not_proxy_clausification,[],[f89]) ).
thf(f104,plain,
( ( $false = $true )
| ( $false
= ( sK0 @ sK3 ) )
| spl2_1
| ~ spl2_2 ),
inference(constrained_superposition,[],[f84,f91]) ).
thf(f105,plain,
( ( $false
= ( sK0 @ sK3 ) )
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f109,plain,
( ( $false = $true )
| spl2_1
| ~ spl2_2 ),
inference(constrained_superposition,[],[f105,f83]) ).
thf(f113,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f109]) ).
thf(f114,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f113]) ).
thf(f116,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] : $false
@ X1 )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f68]) ).
thf(f117,plain,
( ! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] : $false
@ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) ) )
| ~ spl2_1 ),
inference(iff_proxy_clausification,[],[f116]) ).
thf(f122,plain,
( ! [X1: $i] :
( ( $false = $true )
| ( $false
= ( ( sK0 @ X1 )
& ( sK1 @ X1 ) ) ) )
| ~ spl2_1 ),
inference(beta-eta_normalization,[],[f117]) ).
thf(f123,plain,
( ! [X1: $i] :
( ( $false = $true )
| ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_1 ),
inference(and_proxy_clausification,[],[f122]) ).
thf(f124,plain,
( ! [X1: $i] :
( ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f125,plain,
( ( ( sK0 @ sK4 )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK4 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f71]) ).
thf(f126,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK4 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f125]) ).
thf(f127,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK4 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f125]) ).
thf(f128,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f127]) ).
thf(f129,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( ~ ( sK1 @ sK4 ) ) )
| ( $false
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(and_proxy_clausification,[],[f128]) ).
thf(f130,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $false
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(not_proxy_clausification,[],[f129]) ).
thf(f131,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f130]) ).
thf(f132,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f126]) ).
thf(f134,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(and_proxy_clausification,[],[f132]) ).
thf(f135,plain,
( ( $true
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f134]) ).
thf(f138,definition,
( spl2_3
<=> ( $true
= ( sK1 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f140,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f138]) ).
thf(f142,definition,
( spl2_4
<=> ( $false
= ( sK0 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f144,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f142]) ).
thf(f145,plain,
( spl2_3
| spl2_4
| spl2_2 ),
inference(avatar_split_clause,[],[f131,f70,f142,f138]) ).
thf(f150,plain,
( ( $false = $true )
| spl2_2
| ~ spl2_4 ),
inference(constrained_superposition,[],[f135,f144]) ).
thf(f154,plain,
( $false
| spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f150]) ).
thf(f155,plain,
( spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f154]) ).
thf(f158,plain,
( ( $false = $true )
| ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(constrained_superposition,[],[f124,f140]) ).
thf(f159,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f158]) ).
thf(f161,plain,
( spl2_4
| ~ spl2_1
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f159,f138,f66,f142]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f73]) ).
cnf(s2,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f74]) ).
cnf(s4,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f114]) ).
cnf(s5,plain,
( spl2_2
| spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f145]) ).
cnf(s7,plain,
( spl2_2
| ~ spl2_4 ),
inference(sat_conversion,[],[f155]) ).
cnf(s8,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f161]) ).
cnf(s10,plain,
spl2_1,
inference(rat,[],[s1,s4]) ).
cnf(s11,plain,
~ spl2_2,
inference(rat,[],[s2,s10]) ).
cnf(s12,plain,
~ spl2_4,
inference(rat,[],[s7,s11]) ).
cnf(s13,plain,
spl2_3,
inference(rat,[],[s5,s11,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s8,s10,s12,s13]) ).
thf(f162,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET611^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:38:49 UTC 2026
% 0.07/0.11 % CPUTime :
% 0.07/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.13 Running first-order model finding
% 0.07/0.13 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.07/0.17 % (112626)Will run a generic schedule for satisfiability detection.
% 0.07/0.17 % (112632)% WARNING: option uhcvi not known.
% 0.07/0.17 % (112632)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4066281991:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.17 % (112636)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3662551227:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.17 % (112634)dis+10_1_sil=32000:sp=arity:random_seed=2090513341:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.17 % (112635)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=867462417:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.17 % (112631)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=242334276_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.17 % (112632)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.17 % (112635)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.17 % (112632)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.17 % Exception at run slice level
% 0.07/0.17 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.07/0.17 % (112636) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-112626-112636"...
% 0.07/0.17 % (112635) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-112626-112635"...
% 0.07/0.17 % (112634) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-112626-112634"...
% 0.07/0.17 % (112632) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-112626-112632"...
% 0.07/0.17 % (112636)...printing done.
% 0.07/0.17 % (112635)...printing done.
% 0.07/0.17 % (112634)...printing done.
% 0.07/0.17 % (112632)...printing done.
% 0.07/0.17 % (112636)Refutation found. Thanks to Tanya!
% 0.07/0.17 % SZS status Theorem for theBenchmark
% 0.07/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.17 % (112636)------------------------------
% 0.07/0.17 % (112636)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.17 % (112636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.17 % (112636)CaDiCaL version: 2.1.3
% 0.07/0.17 % (112636)Termination reason: Refutation
% 0.07/0.17 % (112636)Time elapsed: 0.003 s
% 0.07/0.17 % (112636)Peak memory usage: 12 MB
% 0.07/0.17 % (112636)Instructions burned: 8 (million)
% 0.07/0.17 % (112626)Success in time 0.033 s
% 0.07/0.17 % Vampire exiting
%------------------------------------------------------------------------------