%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET753^4 : 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 : n019.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:49 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 60 ( 35 unt; 0 typ; 2 def)
% Number of atoms : 358 ( 101 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 415 ( 32 ~; 32 |; 48 &; 269 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 51 ( 51 >; 0 *; 0 +; 0 <<)
% Number of symbols : 47 ( 42 usr; 8 con; 0-4 aty)
% ( 4 !!; 20 ??; 0 @@+; 0 @@-)
% Number of variables : 114 ( 0 sgn 31 !; 5 ?; 114 :)
% 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,
fun_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(func_def_16,type,
fun_composition: ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_17,type,
fun_inv_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(func_def_18,type,
fun_injective: ( $i > $i ) > $o ).
thf(func_def_19,type,
fun_surjective: ( $i > $i ) > $o ).
thf(func_def_20,type,
fun_bijective: ( $i > $i ) > $o ).
thf(func_def_21,type,
fun_decreasing: ( $i > $i ) > ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
fun_increasing: ( $i > $i ) > ( $i > $i > $o ) > $o ).
thf(func_def_23,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_25,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_28,type,
vOR: $o > $o > $o ).
thf(func_def_29,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_30,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_31,type,
vAND: $o > $o > $o ).
thf(func_def_32,type,
vNOT: $o > $o ).
thf(func_def_33,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_34,type,
vIMP: $o > $o > $o ).
thf(func_def_35,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_36,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
sK0: $i > $o ).
thf(func_def_38,type,
sK1: $i > $o ).
thf(func_def_39,type,
sK2: $i > $i ).
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(f12,axiom,
( subset
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',subset) ).
thf(f15,axiom,
( fun_image
= ( ^ [X0: $i > $i,X1: $i > $o,X2: $i] :
? [X3: $i] :
( ( X2
= ( X0 @ X3 ) )
& ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^1.ax',fun_image) ).
thf(f23,conjecture,
! [X0: $i > $o,X1: $i > $o,X2: $i > $i] : ( subset @ ( fun_image @ X2 @ ( intersection @ X0 @ X1 ) ) @ ( intersection @ ( fun_image @ X2 @ X0 ) @ ( fun_image @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f24,negated_conjecture,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $i] : ( subset @ ( fun_image @ X2 @ ( intersection @ X0 @ X1 ) ) @ ( intersection @ ( fun_image @ X2 @ X0 ) @ ( fun_image @ X2 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
thf(f34,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f35,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f34]) ).
thf(f41,plain,
( subset
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f42,plain,
( subset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f41]) ).
thf(f47,plain,
( fun_image
= ( ^ [X0: $i > $i,X1: $i > $o,X2: $i] :
? [X3: $i] :
( ( X2
= ( X0 @ X3 ) )
& ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f15]) ).
thf(f48,plain,
( fun_image
= ( ^ [Y0: $i > $i,Y1: $i > $o,Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y2 ) ) ) ) ),
inference(fool_elimination,[],[f47]) ).
thf(f60,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $i] : ( subset @ ( fun_image @ X2 @ ( intersection @ X0 @ X1 ) ) @ ( intersection @ ( fun_image @ X2 @ X0 ) @ ( fun_image @ X2 @ X1 ) ) ),
inference(rectify,[],[f24]) ).
thf(f61,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $i] :
( ( subset @ ( fun_image @ X2 @ ( intersection @ X0 @ X1 ) ) @ ( intersection @ ( fun_image @ X2 @ X0 ) @ ( fun_image @ X2 @ X1 ) ) )
= $true ),
inference(fool_elimination,[],[f60]) ).
thf(f62,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $i] :
( ( subset @ ( fun_image @ X2 @ ( intersection @ X0 @ X1 ) ) @ ( intersection @ ( fun_image @ X2 @ X0 ) @ ( fun_image @ X2 @ X1 ) ) )
!= $true ),
inference(ennf_transformation,[],[f61]) ).
thf(f63,plain,
( $true
!= ( subset @ ( fun_image @ sK2 @ ( intersection @ sK0 @ sK1 ) ) @ ( intersection @ ( fun_image @ sK2 @ sK0 ) @ ( fun_image @ sK2 @ sK1 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f62]) ).
thf(f71,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f75,plain,
( subset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f78,plain,
( fun_image
= ( ^ [Y0: $i > $i,Y1: $i > $o,Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f86,plain,
( $true
!= ( subset @ ( fun_image @ sK2 @ ( intersection @ sK0 @ sK1 ) ) @ ( intersection @ ( fun_image @ sK2 @ sK0 ) @ ( fun_image @ sK2 @ sK1 ) ) ) ),
inference(cnf_transformation,[],[f63]) ).
thf(f91,plain,
( $true
!= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) )
@ ( ^ [Y0: $i > $i,Y1: $i > $o,Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y2 ) ) )
@ sK2
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $i,Y1: $i > $o,Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y2 ) ) )
@ sK2
@ sK0 )
@ ( ^ [Y0: $i > $i,Y1: $i > $o,Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y2 ) ) )
@ sK2
@ sK1 ) ) ) ),
inference(definition_unfolding,[],[f86,f75,f78,f71,f71,f78,f78]) ).
thf(f92,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
& ( sK1 @ Y1 )
& ( ( sK2 @ Y1 )
= Y0 ) ) )
=> ( ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
& ( ( sK2 @ Y1 )
= Y0 ) ) )
& ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK1 @ Y1 )
& ( ( sK2 @ Y1 )
= Y0 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f91]) ).
thf(f93,plain,
( $false
= ( ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
& ( sK1 @ Y1 )
& ( ( sK2 @ Y1 )
= Y0 ) ) )
=> ( ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
& ( ( sK2 @ Y1 )
= Y0 ) ) )
& ( ?? @ $i
@ ^ [Y1: $i] :
( ( sK1 @ Y1 )
& ( ( sK2 @ Y1 )
= Y0 ) ) ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f92]) ).
thf(f94,plain,
( $false
= ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) )
=> ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) )
& ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f93]) ).
thf(f95,plain,
( $false
= ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) )
& ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f94]) ).
thf(f96,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) ) ),
inference(imp_proxy_clausification,[],[f94]) ).
thf(f97,plain,
( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f96]) ).
thf(f98,plain,
( $true
= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 )
& ( ( sK2 @ sK4 )
= sK3 ) ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
( $true
= ( ( sK2 @ sK4 )
= sK3 ) ),
inference(and_proxy_clausification,[],[f98]) ).
thf(f100,plain,
( $true
= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) ),
inference(and_proxy_clausification,[],[f98]) ).
thf(f101,plain,
( $true
= ( sK1 @ sK4 ) ),
inference(and_proxy_clausification,[],[f100]) ).
thf(f102,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(and_proxy_clausification,[],[f100]) ).
thf(f103,plain,
( sK3
= ( sK2 @ sK4 ) ),
inference(equality_proxy_clausification,[],[f99]) ).
thf(f104,plain,
( ( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) ) )
| ( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) ) ) ),
inference(and_proxy_clausification,[],[f95]) ).
thf(f105,plain,
! [X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) )
@ X1 ) )
| ( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) ) ) ) ),
inference(pi_proxy_clausification,[],[f104]) ).
thf(f106,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) )
@ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= sK3 ) )
@ X2 ) ) ),
inference(pi_proxy_clausification,[],[f105]) ).
thf(f107,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( sK1 @ X1 )
& ( ( sK2 @ X1 )
= sK3 ) ) )
| ( $false
= ( ( sK0 @ X2 )
& ( ( sK2 @ X2 )
= sK3 ) ) ) ),
inference(beta-eta_normalization,[],[f106]) ).
thf(f108,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( sK2 @ X1 )
= sK3 ) )
| ( $false
= ( ( sK0 @ X2 )
& ( ( sK2 @ X2 )
= sK3 ) ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(and_proxy_clausification,[],[f107]) ).
thf(f109,plain,
! [X2: $i,X1: $i] :
( ( sK3
!= ( sK2 @ X1 ) )
| ( $false
= ( ( sK0 @ X2 )
& ( ( sK2 @ X2 )
= sK3 ) ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f108]) ).
thf(f110,plain,
! [X2: $i,X1: $i] :
( ( sK3
!= ( sK2 @ X1 ) )
| ( $false
= ( ( sK2 @ X2 )
= sK3 ) )
| ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X2 ) ) ),
inference(and_proxy_clausification,[],[f109]) ).
thf(f111,plain,
! [X2: $i,X1: $i] :
( ( sK3
!= ( sK2 @ X1 ) )
| ( sK3
!= ( sK2 @ X2 ) )
| ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X2 ) ) ),
inference(equality_proxy_clausification,[],[f110]) ).
thf(f113,definition,
( spl5_1
<=> ! [X2: $i] :
( ( sK3
!= ( sK2 @ X2 ) )
| ( $false
= ( sK0 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
thf(f114,plain,
( ! [X2: $i] :
( ( sK3
!= ( sK2 @ X2 ) )
| ( $false
= ( sK0 @ X2 ) ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f113]) ).
thf(f116,definition,
( spl5_2
<=> ! [X1: $i] :
( ( sK3
!= ( sK2 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
thf(f117,plain,
( ! [X1: $i] :
( ( sK3
!= ( sK2 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f116]) ).
thf(f118,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f111,f116,f113]) ).
thf(f126,plain,
( ( sK3 != sK3 )
| ( $false
= ( sK1 @ sK4 ) )
| ~ spl5_2 ),
inference(constrained_superposition,[],[f117,f103]) ).
thf(f127,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f126]) ).
thf(f128,plain,
( ( $false = $true )
| ~ spl5_2 ),
inference(constrained_superposition,[],[f127,f101]) ).
thf(f134,plain,
( $false
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f128]) ).
thf(f135,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f134]) ).
thf(f136,plain,
( ( sK3 != sK3 )
| ( $false
= ( sK0 @ sK4 ) )
| ~ spl5_1 ),
inference(constrained_superposition,[],[f114,f103]) ).
thf(f137,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f136]) ).
thf(f138,plain,
( ( $false = $true )
| ~ spl5_1 ),
inference(constrained_superposition,[],[f137,f102]) ).
thf(f144,plain,
( $false
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f145,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f144]) ).
cnf(s1,plain,
( spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f118]) ).
cnf(s3,plain,
~ spl5_2,
inference(sat_conversion,[],[f135]) ).
cnf(s5,plain,
~ spl5_1,
inference(sat_conversion,[],[f145]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s3,s5]) ).
thf(f146,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET753^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n019.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:41:03 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/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.07/0.25 % (780621)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (780629)dis+10_1_sil=32000:sp=arity:random_seed=1382639981:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.25 % (780629) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-780621-780629"...
% 0.07/0.25 % (780627)% WARNING: option uhcvi not known.
% 0.07/0.25 % (780629)...printing done.
% 0.07/0.25 % (780629)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (780629)------------------------------
% 0.07/0.25 % (780629)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (780629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (780629)CaDiCaL version: 2.1.3
% 0.07/0.26 % (780629)Termination reason: Refutation
% 0.07/0.26 % (780629)Time elapsed: 0.004 s
% 0.07/0.26 % (780629)Peak memory usage: 12 MB
% 0.07/0.26 % (780629)Instructions burned: 10 (million)
% 0.07/0.26 % (780621)Success in time 0.036 s
% 0.07/0.26 % Vampire exiting
%------------------------------------------------------------------------------