%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV231^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:11 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 96 ( 13 unt; 0 typ; 9 def)
% Number of atoms : 543 ( 164 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 414 ( 80 ~; 146 |; 11 &; 137 @)
% ( 9 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 42 ( 42 >; 0 *; 0 +; 0 <<)
% Number of symbols : 32 ( 28 usr; 15 con; 0-4 aty)
% ( 11 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 53 ( 0 sgn 21 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
y: a > $o ).
thf(func_def_1,type,
x: a > $o ).
thf(func_def_3,type,
vAND: $o > $o > $o ).
thf(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_6,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
vIMP: $o > $o > $o ).
thf(func_def_8,type,
vOR: $o > $o > $o ).
thf(func_def_9,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_14,type,
sK0: a ).
thf(func_def_15,type,
sK1: a > $o ).
thf(func_def_17,type,
sK3: ( a > $o ) > a ).
thf(func_def_18,type,
sK4: ( a > $o ) > a ).
thf(func_def_19,type,
sK5: ( a > $o ) > a ).
thf(func_def_20,type,
sK6: a ).
thf(func_def_21,type,
sK7: a ).
thf(f1,conjecture,
( ( ^ [X0: a] :
( ( y @ X0 )
& ( x @ X0 ) ) )
= ( ^ [X0: a] :
! [X1: a > $o] :
( ( ( X1 = y )
| ( X1 = x ) )
=> ( X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5201_pme) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a] :
( ( y @ X0 )
& ( x @ X0 ) ) )
!= ( ^ [X0: a] :
! [X1: a > $o] :
( ( ( X1 = y )
| ( X1 = x ) )
=> ( X1 @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( ( ^ [X0: a] :
( ( y @ X0 )
& ( x @ X0 ) ) )
!= ( ^ [X1: a] :
! [X2: a > $o] :
( ( ( y = X2 )
| ( x = X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
& ( y @ Y0 ) ) )
!= ( ^ [Y0: a] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
& ( y @ Y0 ) ) )
!= ( ^ [Y0: a] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
& ( y @ Y0 ) ) )
!= ( ^ [Y0: a] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f16,plain,
( ( ^ [Y0: a] :
( ( x @ Y0 )
& ( y @ Y0 ) )
@ sK0 )
!= ( ^ [Y0: a] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
=> ( Y1 @ Y0 ) ) )
@ sK0 ) ),
inference(negative_extensionality,[],[f6]) ).
thf(f17,plain,
( ( $true
= ( ^ [Y0: a] :
( ( x @ Y0 )
& ( y @ Y0 ) )
@ sK0 ) )
| ( $true
= ( ^ [Y0: a] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
=> ( Y1 @ Y0 ) ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f18,plain,
( ( $false
= ( ^ [Y0: a] :
( ( x @ Y0 )
& ( y @ Y0 ) )
@ sK0 ) )
| ( $false
= ( ^ [Y0: a] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( x = Y1 )
| ( y = Y1 ) )
=> ( Y1 @ Y0 ) ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f19,plain,
( ( $false
= ( ( x @ sK0 )
& ( y @ sK0 ) ) )
| ( $false
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f18]) ).
thf(f20,plain,
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) ) ) )
| ( $false
= ( x @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f19]) ).
thf(f21,plain,
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) )
@ sK1 ) )
| ( $false
= ( x @ sK0 ) ) ),
inference(sigma_proxy_clausification,[],[f20]) ).
thf(f22,plain,
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( ( ( x = sK1 )
| ( y = sK1 ) )
=> ( sK1 @ sK0 ) ) )
| ( $false
= ( x @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
( ( $false
= ( y @ sK0 ) )
| ( $false
= ( sK1 @ sK0 ) )
| ( $false
= ( x @ sK0 ) ) ),
inference(imp_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( ( $false
= ( y @ sK0 ) )
| ( $true
= ( ( x = sK1 )
| ( y = sK1 ) ) )
| ( $false
= ( x @ sK0 ) ) ),
inference(imp_proxy_clausification,[],[f22]) ).
thf(f25,plain,
( ( $false
= ( y @ sK0 ) )
| ( $true
= ( y = sK1 ) )
| ( $false
= ( x @ sK0 ) )
| ( $true
= ( x = sK1 ) ) ),
inference(or_proxy_clausification,[],[f24]) ).
thf(f26,plain,
( ( $false
= ( y @ sK0 ) )
| ( y = sK1 )
| ( $false
= ( x @ sK0 ) )
| ( $true
= ( x = sK1 ) ) ),
inference(equality_proxy_clausification,[],[f25]) ).
thf(f27,plain,
( ( $false
= ( y @ sK0 ) )
| ( y = sK1 )
| ( $false
= ( x @ sK0 ) )
| ( x = sK1 ) ),
inference(equality_proxy_clausification,[],[f26]) ).
thf(f28,plain,
( ( $true
= ( ( x @ sK0 )
& ( y @ sK0 ) ) )
| ( $true
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f17]) ).
thf(f29,plain,
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) ) ) ) ),
inference(and_proxy_clausification,[],[f28]) ).
thf(f30,plain,
( ( $true
= ( x @ sK0 ) )
| ( $true
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) ) ) ) ),
inference(and_proxy_clausification,[],[f28]) ).
thf(f31,plain,
! [X1: a > $o] :
( ( $true
= ( x @ sK0 ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X1: a > $o] :
( ( $true
= ( x @ sK0 ) )
| ( $true
= ( ( ( x = X1 )
| ( y = X1 ) )
=> ( X1 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f33,plain,
! [X1: a > $o] :
( ( $true
= ( x @ sK0 ) )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) )
| ( $true
= ( X1 @ sK0 ) ) ),
inference(imp_proxy_clausification,[],[f32]) ).
thf(f35,plain,
! [X1: a > $o] :
( ( $true
= ( x @ sK0 ) )
| ( $false
= ( x = X1 ) )
| ( $true
= ( X1 @ sK0 ) ) ),
inference(or_proxy_clausification,[],[f33]) ).
thf(f36,plain,
! [X1: a > $o] :
( ( $true
= ( x @ sK0 ) )
| ( x != X1 )
| ( $true
= ( X1 @ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f35]) ).
thf(f38,plain,
! [X1: a > $o] :
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( ^ [Y0: a > $o] :
( ( ( x = Y0 )
| ( y = Y0 ) )
=> ( Y0 @ sK0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f29]) ).
thf(f39,plain,
! [X1: a > $o] :
( ( $true
= ( y @ sK0 ) )
| ( $true
= ( ( ( x = X1 )
| ( y = X1 ) )
=> ( X1 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f40,plain,
! [X1: a > $o] :
( ( $true
= ( y @ sK0 ) )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) )
| ( $true
= ( X1 @ sK0 ) ) ),
inference(imp_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X1: a > $o] :
( ( $true
= ( y @ sK0 ) )
| ( $false
= ( y = X1 ) )
| ( $true
= ( X1 @ sK0 ) ) ),
inference(or_proxy_clausification,[],[f40]) ).
thf(f44,plain,
! [X1: a > $o] :
( ( $true
= ( y @ sK0 ) )
| ( y != X1 )
| ( $true
= ( X1 @ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f41]) ).
thf(f46,definition,
( spl2_1
<=> ( x = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f48,plain,
( ( x = sK1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f50,definition,
( spl2_2
<=> ( $false
= ( x @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f52,plain,
( ( $false
= ( x @ sK0 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f54,definition,
( spl2_3
<=> ( y = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f56,plain,
( ( y = sK1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f58,definition,
( spl2_4
<=> ( $false
= ( y @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f59,plain,
( ( $false
!= ( y @ sK0 ) )
| spl2_4 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f60,plain,
( ( $false
= ( y @ sK0 ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f61,plain,
( spl2_1
| spl2_2
| spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f27,f58,f54,f50,f46]) ).
thf(f63,definition,
( spl2_5
<=> ( $false
= ( sK1 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f65,plain,
( ( $false
= ( sK1 @ sK0 ) )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f66,plain,
( spl2_2
| spl2_5
| spl2_4 ),
inference(avatar_split_clause,[],[f23,f58,f63,f50]) ).
thf(f68,definition,
( spl2_6
<=> ! [X1: a > $o] :
( ( x != X1 )
| ( $true
= ( X1 @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
thf(f69,plain,
( ! [X1: a > $o] :
( ( x != X1 )
| ( $true
= ( X1 @ sK0 ) ) )
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f71,definition,
( spl2_7
<=> ( $true
= ( x @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
thf(f73,plain,
( ( $true
= ( x @ sK0 ) )
| ~ spl2_7 ),
inference(avatar_component_clause,[],[f71]) ).
thf(f74,plain,
( spl2_6
| spl2_7 ),
inference(avatar_split_clause,[],[f36,f71,f68]) ).
thf(f76,definition,
( spl2_8
<=> ! [X1: a > $o] :
( ( y != X1 )
| ( $true
= ( X1 @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
thf(f77,plain,
( ! [X1: a > $o] :
( ( y != X1 )
| ( $true
= ( X1 @ sK0 ) ) )
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f80,definition,
( spl2_9
<=> ( $true
= ( y @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
thf(f82,plain,
( ( $true
= ( y @ sK0 ) )
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f84,plain,
( spl2_8
| spl2_9 ),
inference(avatar_split_clause,[],[f44,f80,f76]) ).
thf(f88,plain,
( ( $true
= ( x @ sK0 ) )
| ~ spl2_6 ),
inference(equality_resolution,[],[f69]) ).
thf(f91,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_6 ),
inference(forward_demodulation,[],[f88,f52]) ).
thf(f92,plain,
( $false
| ~ spl2_2
| ~ spl2_6 ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f93,plain,
( ~ spl2_2
| ~ spl2_6 ),
inference(avatar_contradiction_clause,[],[f92]) ).
thf(f100,plain,
( ( $true
= ( y @ sK0 ) )
| ~ spl2_8 ),
inference(equality_resolution,[],[f77]) ).
thf(f103,plain,
( ( $true = $false )
| ~ spl2_4
| ~ spl2_8 ),
inference(forward_demodulation,[],[f100,f60]) ).
thf(f104,plain,
( $false
| ~ spl2_4
| ~ spl2_8 ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f105,plain,
( ~ spl2_4
| ~ spl2_8 ),
inference(avatar_contradiction_clause,[],[f104]) ).
thf(f106,plain,
( ( $true = $false )
| ~ spl2_4
| ~ spl2_9 ),
inference(forward_demodulation,[],[f82,f60]) ).
thf(f107,plain,
( $false
| ~ spl2_4
| ~ spl2_9 ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f108,plain,
( ~ spl2_4
| ~ spl2_9 ),
inference(avatar_contradiction_clause,[],[f107]) ).
thf(f110,plain,
( ! [X1: a] :
( ( x @ X1 )
= ( sK1 @ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f48]) ).
thf(f112,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( x @ X1 ) ) )
| ~ spl2_1 ),
inference(iff_proxy_clausification,[],[f110]) ).
thf(f123,plain,
( ( $true = $false )
| ( $false
= ( x @ sK0 ) )
| ~ spl2_1
| ~ spl2_5 ),
inference(constrained_superposition,[],[f112,f65]) ).
thf(f130,plain,
( ( $false
= ( x @ sK0 ) )
| ~ spl2_1
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f157,plain,
( spl2_2
| ~ spl2_1
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f130,f63,f46,f50]) ).
thf(f158,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( y @ X1 ) )
| ~ spl2_3 ),
inference(argument_congruence,[],[f56]) ).
thf(f159,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( y @ X1 ) ) )
| ~ spl2_3 ),
inference(iff_proxy_clausification,[],[f158]) ).
thf(f165,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_7 ),
inference(constrained_superposition,[],[f52,f73]) ).
thf(f169,plain,
( $false
| ~ spl2_2
| ~ spl2_7 ),
inference(trivial_inequality_removal,[],[f165]) ).
thf(f170,plain,
( ~ spl2_2
| ~ spl2_7 ),
inference(avatar_contradiction_clause,[],[f169]) ).
thf(f204,plain,
( ( $true = $false )
| ( $false
= ( y @ sK0 ) )
| ~ spl2_3
| ~ spl2_5 ),
inference(constrained_superposition,[],[f159,f65]) ).
thf(f207,plain,
( ( $false
= ( y @ sK0 ) )
| ~ spl2_3
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f204]) ).
thf(f210,plain,
( $false
| ~ spl2_3
| spl2_4
| ~ spl2_5 ),
inference(forward_subsumption_resolution,[],[f207,f59]) ).
thf(f211,plain,
( ~ spl2_3
| spl2_4
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f210]) ).
cnf(s1,plain,
( spl2_1
| spl2_2
| spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f61]) ).
cnf(s2,plain,
( spl2_2
| spl2_4
| spl2_5 ),
inference(sat_conversion,[],[f66]) ).
cnf(s3,plain,
( spl2_6
| spl2_7 ),
inference(sat_conversion,[],[f74]) ).
cnf(s6,plain,
( spl2_8
| spl2_9 ),
inference(sat_conversion,[],[f84]) ).
cnf(s7,plain,
( ~ spl2_2
| ~ spl2_6 ),
inference(sat_conversion,[],[f93]) ).
cnf(s9,plain,
( ~ spl2_4
| ~ spl2_8 ),
inference(sat_conversion,[],[f105]) ).
cnf(s10,plain,
( ~ spl2_4
| ~ spl2_9 ),
inference(sat_conversion,[],[f108]) ).
cnf(s16,plain,
( ~ spl2_1
| spl2_2
| ~ spl2_5 ),
inference(sat_conversion,[],[f157]) ).
cnf(s19,plain,
( ~ spl2_2
| ~ spl2_7 ),
inference(sat_conversion,[],[f170]) ).
cnf(s24,plain,
( ~ spl2_3
| spl2_4
| ~ spl2_5 ),
inference(sat_conversion,[],[f211]) ).
cnf(s25,plain,
~ spl2_4,
inference(rat,[],[s6,s9,s10]) ).
cnf(s26,plain,
( spl2_2
| spl2_1 ),
inference(rat,[],[s24,s1,s2,s25]) ).
cnf(s27,plain,
~ spl2_2,
inference(rat,[],[s3,s7,s19]) ).
cnf(s28,plain,
spl2_5,
inference(rat,[],[s2,s25,s27]) ).
cnf(s29,plain,
spl2_1,
inference(rat,[],[s26,s27]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s16,s27,s29,s28]) ).
thf(f212,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV231^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n001.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 15:29:21 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.09/0.25 % (1382239)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (1382258)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2439330775:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.25 % (1382258) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1382239-1382258"...
% 0.09/0.25 % (1382254)% WARNING: option uhcvi not known.
% 0.09/0.25 % (1382258)...printing done.
% 0.09/0.25 % (1382258)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (1382258)------------------------------
% 0.09/0.25 % (1382258)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (1382258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (1382258)CaDiCaL version: 2.1.3
% 0.09/0.25 % (1382258)Termination reason: Refutation
% 0.09/0.25 % (1382258)Time elapsed: 0.004 s
% 0.09/0.25 % (1382258)Peak memory usage: 12 MB
% 0.09/0.25 % (1382258)Instructions burned: 9 (million)
% 0.09/0.25 % (1382239)Success in time 0.034 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------