%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU626^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:30:23 AM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 73 ( 25 unt; 0 typ; 8 def)
% Number of atoms : 565 ( 126 equ; 0 cnn)
% Maximal formula atoms : 8 ( 7 avg)
% Number of connectives : 633 ( 85 ~; 74 |; 31 &; 406 @)
% ( 12 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 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 : 30 ( 27 usr; 23 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 76 !; 24 ?; 100 :)
% 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,
powerset: $i > $i ).
thf(func_def_4,type,
subset: $i > $i > $o ).
thf(func_def_5,type,
powersetI1: $o ).
thf(func_def_7,type,
binunion: $i > $i > $i ).
thf(func_def_8,type,
upairsubunion: $o ).
thf(f1,axiom,
( powersetI1
= ( ! [X1: $i,X0: $i] :
( ( subset @ X1 @ X0 )
=> ( in @ X1 @ ( powerset @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI1) ).
thf(f2,axiom,
( upairsubunion
= ( ! [X1: $i,X2: $i,X0: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( subset @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsubunion) ).
thf(f3,conjecture,
( powersetI1
=> ( upairsubunion
=> ! [X2: $i,X1: $i,X0: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairinpowunion) ).
thf(f4,negated_conjecture,
~ ( powersetI1
=> ( upairsubunion
=> ! [X2: $i,X1: $i,X0: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( powersetI1
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( in @ X0 @ ( powerset @ X1 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( ! [X0: $i,X1: $i] :
( ( $true
= ( subset @ X0 @ X1 ) )
=> ( ( in @ X0 @ ( powerset @ X1 ) )
= $true ) )
<=> ( powersetI1 = $true ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( upairsubunion
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X2 @ X0 ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( ( upairsubunion = $true )
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( in @ X1 @ X2 ) )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X2 @ X0 ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( powersetI1
=> ( upairsubunion
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ ( setadjoin @ X0 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X2 @ X1 ) ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( powersetI1 = $true )
=> ( ( upairsubunion = $true )
=> ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
=> ( $true
= ( in @ ( setadjoin @ X0 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X2 @ X1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ X2 )
= $true )
& ? [X3: $i] :
( ( $true
!= ( in @ ( setadjoin @ X0 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X2 @ X1 ) ) ) )
& ( ( in @ X3 @ X1 )
= $true ) ) )
& ( upairsubunion = $true )
& ( powersetI1 = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ( upairsubunion = $true )
& ? [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ X2 )
= $true )
& ? [X3: $i] :
( ( $true
!= ( in @ ( setadjoin @ X0 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X2 @ X1 ) ) ) )
& ( ( in @ X3 @ X1 )
= $true ) ) )
& ( powersetI1 = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( powersetI1 = $true )
<=> ! [X1: $i,X0: $i] :
( ( $true
!= ( subset @ X0 @ X1 ) )
| ( ( in @ X0 @ ( powerset @ X1 ) )
= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f14,plain,
( ( upairsubunion = $true )
<=> ! [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ( ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X2 @ X0 ) )
= $true )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( $true
!= ( in @ X1 @ X2 ) ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f15,plain,
( ( upairsubunion = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
& ? [X3: $i] :
( ( ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) )
!= $true )
& ( ( in @ X3 @ X1 )
= $true ) ) )
& ( powersetI1 = $true ) ),
inference(rectify,[],[f12]) ).
thf(f16,plain,
( ( upairsubunion = $true )
& ( ( in @ sK2 @ sK0 )
= $true )
& ( ( in @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) )
!= $true )
& ( $true
= ( in @ sK3 @ sK1 ) )
& ( powersetI1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f15]) ).
thf(f17,plain,
( ( ( powersetI1 = $true )
| ? [X1: $i,X0: $i] :
( ( $true
= ( subset @ X0 @ X1 ) )
& ( ( in @ X0 @ ( powerset @ X1 ) )
!= $true ) ) )
& ( ! [X1: $i,X0: $i] :
( ( $true
!= ( subset @ X0 @ X1 ) )
| ( ( in @ X0 @ ( powerset @ X1 ) )
= $true ) )
| ( powersetI1 != $true ) ) ),
inference(nnf_transformation,[],[f13]) ).
thf(f18,plain,
( ( ( powersetI1 = $true )
| ? [X0: $i,X1: $i] :
( ( ( subset @ X1 @ X0 )
= $true )
& ( ( in @ X1 @ ( powerset @ X0 ) )
!= $true ) ) )
& ( ! [X2: $i,X3: $i] :
( ( ( subset @ X3 @ X2 )
!= $true )
| ( $true
= ( in @ X3 @ ( powerset @ X2 ) ) ) )
| ( powersetI1 != $true ) ) ),
inference(rectify,[],[f17]) ).
thf(f19,plain,
( ( ( powersetI1 = $true )
| ( ( $true
= ( subset @ sK5 @ sK4 ) )
& ( ( in @ sK5 @ ( powerset @ sK4 ) )
!= $true ) ) )
& ( ! [X2: $i,X3: $i] :
( ( ( subset @ X3 @ X2 )
!= $true )
| ( $true
= ( in @ X3 @ ( powerset @ X2 ) ) ) )
| ( powersetI1 != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f18]) ).
thf(f20,plain,
( ( ( upairsubunion = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X2 @ X0 ) )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( $true
= ( in @ X1 @ X2 ) ) ) )
& ( ! [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ( ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X2 @ X0 ) )
= $true )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( $true
!= ( in @ X1 @ X2 ) ) )
| ( upairsubunion != $true ) ) ),
inference(nnf_transformation,[],[f14]) ).
thf(f21,plain,
( ( ( upairsubunion = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X2 @ X0 ) )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( $true
= ( in @ X1 @ X2 ) ) ) )
& ( ! [X4: $i,X5: $i,X6: $i] :
( ! [X7: $i] :
( ( $true
= ( subset @ ( setadjoin @ X5 @ ( setadjoin @ X7 @ emptyset ) ) @ ( binunion @ X6 @ X4 ) ) )
| ( $true
!= ( in @ X7 @ X4 ) ) )
| ( $true
!= ( in @ X5 @ X6 ) ) )
| ( upairsubunion != $true ) ) ),
inference(rectify,[],[f20]) ).
thf(f22,plain,
( ( ( upairsubunion = $true )
| ( ( ( subset @ ( setadjoin @ sK7 @ ( setadjoin @ sK9 @ emptyset ) ) @ ( binunion @ sK8 @ sK6 ) )
!= $true )
& ( $true
= ( in @ sK9 @ sK6 ) )
& ( ( in @ sK7 @ sK8 )
= $true ) ) )
& ( ! [X4: $i,X5: $i,X6: $i] :
( ! [X7: $i] :
( ( $true
= ( subset @ ( setadjoin @ X5 @ ( setadjoin @ X7 @ emptyset ) ) @ ( binunion @ X6 @ X4 ) ) )
| ( $true
!= ( in @ X7 @ X4 ) ) )
| ( $true
!= ( in @ X5 @ X6 ) ) )
| ( upairsubunion != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9)],[f21]) ).
thf(f23,plain,
powersetI1 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f24,plain,
( $true
= ( in @ sK3 @ sK1 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f25,plain,
( ( in @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) )
!= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f26,plain,
( ( in @ sK2 @ sK0 )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f27,plain,
upairsubunion = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f28,plain,
! [X2: $i,X3: $i] :
( ( $true
= ( in @ X3 @ ( powerset @ X2 ) ) )
| ( powersetI1 != $true )
| ( ( subset @ X3 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f31,plain,
! [X6: $i,X7: $i,X4: $i,X5: $i] :
( ( $true
!= ( in @ X5 @ X6 ) )
| ( upairsubunion != $true )
| ( $true
!= ( in @ X7 @ X4 ) )
| ( $true
= ( subset @ ( setadjoin @ X5 @ ( setadjoin @ X7 @ emptyset ) ) @ ( binunion @ X6 @ X4 ) ) ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f37,definition,
( spl10_1
<=> ( powersetI1 = $true ) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
thf(f46,definition,
( spl10_3
<=> ( ( in @ sK2 @ sK0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
thf(f48,plain,
( ( ( in @ sK2 @ sK0 )
= $true )
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f49,plain,
spl10_3,
inference(avatar_split_clause,[],[f26,f46]) ).
thf(f55,definition,
( spl10_5
<=> ( upairsubunion = $true ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
thf(f60,definition,
( spl10_6
<=> ( ( in @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
thf(f62,plain,
( ( ( in @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) )
!= $true )
| spl10_6 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f63,plain,
~ spl10_6,
inference(avatar_split_clause,[],[f25,f60]) ).
thf(f64,plain,
spl10_5,
inference(avatar_split_clause,[],[f27,f55]) ).
thf(f65,plain,
spl10_1,
inference(avatar_split_clause,[],[f23,f37]) ).
thf(f67,definition,
( spl10_7
<=> ( $true
= ( in @ sK3 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
thf(f69,plain,
( ( $true
= ( in @ sK3 @ sK1 ) )
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f67]) ).
thf(f70,plain,
spl10_7,
inference(avatar_split_clause,[],[f24,f67]) ).
thf(f72,definition,
( spl10_8
<=> ! [X2: $i,X3: $i] :
( ( $true
= ( in @ X3 @ ( powerset @ X2 ) ) )
| ( ( subset @ X3 @ X2 )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
thf(f73,plain,
( ! [X2: $i,X3: $i] :
( ( $true
= ( in @ X3 @ ( powerset @ X2 ) ) )
| ( ( subset @ X3 @ X2 )
!= $true ) )
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f72]) ).
thf(f74,plain,
( spl10_8
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f28,f37,f72]) ).
thf(f76,definition,
( spl10_9
<=> ! [X5: $i,X4: $i,X7: $i,X6: $i] :
( ( $true
!= ( in @ X5 @ X6 ) )
| ( $true
= ( subset @ ( setadjoin @ X5 @ ( setadjoin @ X7 @ emptyset ) ) @ ( binunion @ X6 @ X4 ) ) )
| ( $true
!= ( in @ X7 @ X4 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
thf(f77,plain,
( ! [X6: $i,X7: $i,X4: $i,X5: $i] :
( ( $true
= ( subset @ ( setadjoin @ X5 @ ( setadjoin @ X7 @ emptyset ) ) @ ( binunion @ X6 @ X4 ) ) )
| ( $true
!= ( in @ X7 @ X4 ) )
| ( $true
!= ( in @ X5 @ X6 ) ) )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f78,plain,
( ~ spl10_5
| spl10_9 ),
inference(avatar_split_clause,[],[f31,f76,f55]) ).
thf(f96,plain,
( ( $true != $true )
| ( $true
!= ( subset @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( binunion @ sK0 @ sK1 ) ) )
| spl10_6
| ~ spl10_8 ),
inference(superposition,[],[f62,f73]) ).
thf(f97,plain,
( ( $true
!= ( subset @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( binunion @ sK0 @ sK1 ) ) )
| spl10_6
| ~ spl10_8 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f99,definition,
( spl10_13
<=> ( $true
= ( subset @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( binunion @ sK0 @ sK1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
thf(f101,plain,
( ( $true
!= ( subset @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( binunion @ sK0 @ sK1 ) ) )
| spl10_13 ),
inference(avatar_component_clause,[],[f99]) ).
thf(f102,plain,
( ~ spl10_13
| spl10_6
| ~ spl10_8 ),
inference(avatar_split_clause,[],[f97,f72,f60,f99]) ).
thf(f103,plain,
( ( $true != $true )
| ( ( in @ sK2 @ sK0 )
!= $true )
| ( $true
!= ( in @ sK3 @ sK1 ) )
| ~ spl10_9
| spl10_13 ),
inference(superposition,[],[f101,f77]) ).
thf(f104,plain,
( ( $true
!= ( in @ sK3 @ sK1 ) )
| ( ( in @ sK2 @ sK0 )
!= $true )
| ~ spl10_9
| spl10_13 ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f105,plain,
( ( ( in @ sK2 @ sK0 )
!= $true )
| ~ spl10_7
| ~ spl10_9
| spl10_13 ),
inference(forward_subsumption_resolution,[],[f104,f69]) ).
thf(f106,plain,
( $false
| ~ spl10_3
| ~ spl10_7
| ~ spl10_9
| spl10_13 ),
inference(forward_subsumption_resolution,[],[f105,f48]) ).
thf(f107,plain,
( ~ spl10_3
| ~ spl10_7
| ~ spl10_9
| spl10_13 ),
inference(avatar_contradiction_clause,[],[f106]) ).
cnf(s2,plain,
spl10_3,
inference(sat_conversion,[],[f49]) ).
cnf(s4,plain,
~ spl10_6,
inference(sat_conversion,[],[f63]) ).
cnf(s5,plain,
spl10_5,
inference(sat_conversion,[],[f64]) ).
cnf(s6,plain,
spl10_1,
inference(sat_conversion,[],[f65]) ).
cnf(s7,plain,
spl10_7,
inference(sat_conversion,[],[f70]) ).
cnf(s8,plain,
( ~ spl10_1
| spl10_8 ),
inference(sat_conversion,[],[f74]) ).
cnf(s9,plain,
( ~ spl10_5
| spl10_9 ),
inference(sat_conversion,[],[f78]) ).
cnf(s13,plain,
( spl10_6
| ~ spl10_8
| ~ spl10_13 ),
inference(sat_conversion,[],[f102]) ).
cnf(s14,plain,
( ~ spl10_3
| ~ spl10_7
| ~ spl10_9
| spl10_13 ),
inference(sat_conversion,[],[f107]) ).
cnf(s15,plain,
spl10_8,
inference(rat,[],[s8,s6]) ).
cnf(s16,plain,
spl10_9,
inference(rat,[],[s9,s5]) ).
cnf(s17,plain,
~ spl10_13,
inference(rat,[],[s13,s15,s4]) ).
cnf(s18,plain,
~ spl10_3,
inference(rat,[],[s14,s16,s7,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s2,s18]) ).
thf(f108,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU626^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:59:15 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.28 % (4044205)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.28 % (4044213)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2906516743:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.28 % (4044213) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4044205-4044213"...
% 0.22/0.28 % (4044213)...printing done.
% 0.22/0.28 % (4044213)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Theorem for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28 % (4044213)------------------------------
% 0.22/0.28 % (4044213)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (4044213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (4044213)CaDiCaL version: 2.1.3
% 0.22/0.28 % (4044213)Termination reason: Refutation
% 0.22/0.28 % (4044213)Time elapsed: 0.003 s
% 0.22/0.28 % (4044213)Peak memory usage: 13 MB
% 0.22/0.28 % (4044213)Instructions burned: 7 (million)
% 0.22/0.28 % (4044205)Success in time 0.035 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------