%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU642^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:32:48 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 69 ( 40 unt; 0 typ; 2 def)
% Number of atoms : 453 ( 130 equ; 0 cnn)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 546 ( 21 ~; 38 |; 15 &; 399 @)
% ( 2 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 22 usr; 13 con; 0-4 aty)
% ( 31 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 110 ( 0 sgn 66 !; 6 ?; 110 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
setadjoin: $i > $i > $i ).
thf(func_def_3,type,
setadjoinIL: $o ).
thf(func_def_5,type,
uniqinunit: $o ).
thf(func_def_6,type,
upairset2E: $o ).
thf(func_def_7,type,
singletonsuniq: $o ).
thf(func_def_8,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vOR: $o > $o > $o ).
thf(func_def_21,type,
vNOT: $o > $o ).
thf(f1,axiom,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f2,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(f3,axiom,
( upairset2E
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X1 )
| ( X2 = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairset2E) ).
thf(f5,conjecture,
( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1) ).
thf(f6,negated_conjecture,
~ ( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( upairset2E
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X1 )
| ( X2 = X0 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
( upairset2E
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f14,plain,
~ ( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f15,plain,
~ ( ( setadjoinIL = $true )
=> ( ( uniqinunit = $true )
=> ( ( upairset2E = $true )
=> ( ( singletonsuniq = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $true )
=> ( X0 = X2 ) ) ) ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f16,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X2 )
& ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $true ) )
& ( singletonsuniq = $true )
& ( upairset2E = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f17,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X2 )
& ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $true ) )
& ( singletonsuniq = $true )
& ( upairset2E = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
( ( sK0 != sK2 )
& ( $true
= ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) )
& ( singletonsuniq = $true )
& ( upairset2E = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17]) ).
thf(f19,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f20,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f21,plain,
( upairset2E
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f23,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f18]) ).
thf(f24,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f18]) ).
thf(f25,plain,
upairset2E = $true,
inference(cnf_transformation,[],[f18]) ).
thf(f27,plain,
( $true
= ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f28,plain,
sK0 != sK2,
inference(cnf_transformation,[],[f18]) ).
thf(f31,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f19,f23]) ).
thf(f32,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f20,f24]) ).
thf(f33,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f21,f25]) ).
thf(f42,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f33]) ).
thf(f43,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) )
=> ( ( Y1 = X1 )
| ( Y0 = X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) )
=> ( ( Y1 = X1 )
| ( Y0 = X1 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f43]) ).
thf(f45,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( Y0 = X1 )
| ( X2 = X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( Y0 = X1 )
| ( X2 = X1 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f45]) ).
thf(f47,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( X3 = X1 )
| ( X2 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f48,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $true
= ( ( X3 = X1 )
| ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f47]) ).
thf(f49,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $true
= ( X2 = X1 ) )
| ( $true
= ( X3 = X1 ) ) ),
inference(or_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( X1 = X2 )
| ( $true
= ( X3 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f49]) ).
thf(f51,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(equality_proxy_clausification,[],[f50]) ).
thf(f52,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f53,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f54,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f53]) ).
thf(f55,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f54]) ).
thf(f56,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f56]) ).
thf(f58,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f59,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f58]) ).
thf(f60,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f59]) ).
thf(f61,plain,
! [X2: $i,X1: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f60]) ).
thf(f139,plain,
( ( $true = $false )
| ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) )
| ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ) ),
inference(constrained_superposition,[],[f51,f27]) ).
thf(f140,plain,
( ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) )
| ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f139]) ).
thf(f157,definition,
( spl3_7
<=> ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).
thf(f159,plain,
( ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) )
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f157]) ).
thf(f161,definition,
( spl3_8
<=> ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) ) ),
introduced(definition,[new_symbols(definition,[spl3_8])],[avatar_definition]) ).
thf(f163,plain,
( ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) )
| ~ spl3_8 ),
inference(avatar_component_clause,[],[f161]) ).
thf(f164,plain,
( spl3_7
| spl3_8 ),
inference(avatar_split_clause,[],[f140,f161,f157]) ).
thf(f165,plain,
( ( $true
= ( in @ sK2 @ ( setadjoin @ sK0 @ emptyset ) ) )
| ~ spl3_7 ),
inference(constrained_superposition,[],[f61,f159]) ).
thf(f171,plain,
( ( $true = $false )
| ( sK0 = sK2 )
| ~ spl3_7 ),
inference(constrained_superposition,[],[f165,f57]) ).
thf(f174,plain,
( ( sK0 = sK2 )
| ~ spl3_7 ),
inference(trivial_inequality_removal,[],[f171]) ).
thf(f177,plain,
( $false
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f174,f28]) ).
thf(f178,plain,
~ spl3_7,
inference(avatar_contradiction_clause,[],[f177]) ).
thf(f179,plain,
( ( $true
= ( in @ sK0 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ~ spl3_8 ),
inference(constrained_superposition,[],[f61,f163]) ).
thf(f182,plain,
( ( $true = $false )
| ( sK0 = sK2 )
| ~ spl3_8 ),
inference(constrained_superposition,[],[f179,f57]) ).
thf(f185,plain,
( ( sK0 = sK2 )
| ~ spl3_8 ),
inference(trivial_inequality_removal,[],[f182]) ).
thf(f188,plain,
( $false
| ~ spl3_8 ),
inference(forward_subsumption_resolution,[],[f185,f28]) ).
thf(f189,plain,
~ spl3_8,
inference(avatar_contradiction_clause,[],[f188]) ).
cnf(s49,plain,
( spl3_7
| spl3_8 ),
inference(sat_conversion,[],[f164]) ).
cnf(s59,plain,
~ spl3_7,
inference(sat_conversion,[],[f178]) ).
cnf(s69,plain,
~ spl3_8,
inference(sat_conversion,[],[f189]) ).
cnf(s70,plain,
$false,
inference(rat,[],[s49,s69,s59]) ).
thf(f190,plain,
$false,
inference(avatar_sat_refutation,[],[s70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU642^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n019.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 14:02:03 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.09/0.26 % (817499)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (817506)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2728288085:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (817505)% WARNING: option uhcvi not known.
% 0.09/0.26 % (817506) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-817499-817506"...
% 0.09/0.26 % (817506)...printing done.
% 0.09/0.26 % (817506)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (817506)------------------------------
% 0.09/0.26 % (817506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (817506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (817506)CaDiCaL version: 2.1.3
% 0.09/0.26 % (817506)Termination reason: Refutation
% 0.09/0.26 % (817506)Time elapsed: 0.005 s
% 0.09/0.26 % (817506)Peak memory usage: 13 MB
% 0.09/0.26 % (817506)Instructions burned: 13 (million)
% 0.09/0.26 % (817499)Success in time 0.037 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------