%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU642^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:29 AM UTC 2026
% Result : Theorem 0.23s 0.28s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 65 ( 18 unt; 0 typ; 2 def)
% Number of atoms : 549 ( 165 equ; 0 cnn)
% Maximal formula atoms : 10 ( 8 avg)
% Number of connectives : 564 ( 67 ~; 67 |; 38 &; 358 @)
% ( 8 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 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 : 24 ( 21 usr; 19 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn 83 !; 23 ?; 106 :)
% 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_22,type,
vNOT: $o > $o ).
thf(f1,axiom,
! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= setadjoinIL ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f2,axiom,
! [X1: $i,X0: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) )
= uniqinunit ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
thf(f3,axiom,
! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X0 )
| ( X2 = X1 ) ) )
= upairset2E ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairset2E) ).
thf(f5,conjecture,
( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X2: $i,X0: $i,X1: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL1) ).
thf(f6,negated_conjecture,
~ ( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X2: $i,X0: $i,X1: $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,
! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) )
=> ( X0 = X1 ) )
= uniqinunit ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( ! [X0: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
=> ( X0 = X1 ) )
<=> ( uniqinunit = $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X1 ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f10,plain,
~ ( ( setadjoinIL = $true )
=> ( ( uniqinunit = $true )
=> ( ( upairset2E = $true )
=> ( ( singletonsuniq = $true )
=> ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
= $true )
=> ( X0 = X1 ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f12,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) )
=> ( ( X1 = X2 )
| ( X0 = X1 ) ) )
= upairset2E ),
inference(rectify,[],[f3]) ).
thf(f13,plain,
( ( upairset2E = $true )
<=> ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) )
= $true )
=> ( ( X0 = X1 )
| ( X1 = X2 ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= setadjoinIL ),
inference(rectify,[],[f1]) ).
thf(f15,plain,
( ! [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= $true )
<=> ( setadjoinIL = $true ) ),
inference(fool_elimination,[],[f14]) ).
thf(f16,plain,
( ? [X1: $i,X2: $i,X0: $i] :
( ( X0 != X1 )
& ( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
= $true ) )
& ( singletonsuniq = $true )
& ( upairset2E = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f17,plain,
( ? [X1: $i,X2: $i,X0: $i] :
( ( X0 != X1 )
& ( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
= $true ) )
& ( upairset2E = $true )
& ( singletonsuniq = $true )
& ( setadjoinIL = $true )
& ( uniqinunit = $true ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
( ( upairset2E = $true )
<=> ! [X1: $i,X2: $i,X0: $i] :
( ( X0 = X1 )
| ( X1 = X2 )
| ( ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) )
!= $true ) ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f19,plain,
( ! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) )
!= $true )
| ( X0 = X1 )
| ( X1 = X2 ) )
<=> ( upairset2E = $true ) ),
inference(flattening,[],[f18]) ).
thf(f21,plain,
( ! [X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 ) )
<=> ( uniqinunit = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f22,plain,
( ( ! [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= $true )
| ( setadjoinIL != $true ) )
& ( ( setadjoinIL = $true )
| ? [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
!= $true ) ) ),
inference(nnf_transformation,[],[f15]) ).
thf(f23,plain,
( ( ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X1 @ X0 ) )
= $true )
| ( setadjoinIL != $true ) )
& ( ( setadjoinIL = $true )
| ? [X2: $i,X3: $i] :
( ( in @ X3 @ ( setadjoin @ X3 @ X2 ) )
!= $true ) ) ),
inference(rectify,[],[f22]) ).
thf(f24,plain,
( ( ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X1 @ X0 ) )
= $true )
| ( setadjoinIL != $true ) )
& ( ( setadjoinIL = $true )
| ( ( in @ sK1 @ ( setadjoin @ sK1 @ sK0 ) )
!= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f23]) ).
thf(f25,plain,
( ( ! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) )
!= $true )
| ( X0 = X1 )
| ( X1 = X2 ) )
| ( upairset2E != $true ) )
& ( ( upairset2E = $true )
| ? [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) )
= $true )
& ( X0 != X1 )
& ( X1 != X2 ) ) ) ),
inference(nnf_transformation,[],[f19]) ).
thf(f26,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true )
| ( X0 = X1 )
| ( X0 = X2 ) )
| ( upairset2E != $true ) )
& ( ( upairset2E = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( $true
= ( in @ X3 @ ( setadjoin @ X5 @ ( setadjoin @ X4 @ emptyset ) ) ) )
& ( X3 != X4 )
& ( X3 != X5 ) ) ) ),
inference(rectify,[],[f25]) ).
thf(f27,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true )
| ( X0 = X1 )
| ( X0 = X2 ) )
| ( upairset2E != $true ) )
& ( ( upairset2E = $true )
| ( ( ( in @ sK2 @ ( setadjoin @ sK4 @ ( setadjoin @ sK3 @ emptyset ) ) )
= $true )
& ( sK2 != sK3 )
& ( sK2 != sK4 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X3,sK2),skolemize(X4,sK3),skolemize(X5,sK4)],[f26]) ).
thf(f28,plain,
( ( ! [X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 ) )
| ( uniqinunit != $true ) )
& ( ( uniqinunit = $true )
| ? [X0: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
& ( X0 != X1 ) ) ) ),
inference(nnf_transformation,[],[f21]) ).
thf(f29,plain,
( ( ! [X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 ) )
| ( uniqinunit != $true ) )
& ( ( uniqinunit = $true )
| ? [X2: $i,X3: $i] :
( ( $true
= ( in @ X3 @ ( setadjoin @ X2 @ emptyset ) ) )
& ( X2 != X3 ) ) ) ),
inference(rectify,[],[f28]) ).
thf(f30,plain,
( ( ! [X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 ) )
| ( uniqinunit != $true ) )
& ( ( uniqinunit = $true )
| ( ( $true
= ( in @ sK6 @ ( setadjoin @ sK5 @ emptyset ) ) )
& ( sK6 != sK5 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X2,sK5),skolemize(X3,sK6)],[f29]) ).
thf(f31,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 ) )
& ( upairset2E = $true )
& ( singletonsuniq = $true )
& ( setadjoinIL = $true )
& ( uniqinunit = $true ) ),
inference(rectify,[],[f17]) ).
thf(f32,plain,
( ( sK9 != sK7 )
& ( ( in @ ( setadjoin @ sK9 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK7 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK7 @ ( setadjoin @ sK8 @ emptyset ) ) @ emptyset ) ) )
= $true )
& ( upairset2E = $true )
& ( singletonsuniq = $true )
& ( setadjoinIL = $true )
& ( uniqinunit = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X0,sK7),skolemize(X1,sK8),skolemize(X2,sK9)],[f31]) ).
thf(f37,plain,
! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( setadjoin @ X1 @ X0 ) )
= $true )
| ( setadjoinIL != $true ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f41,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true )
| ( X0 = X1 )
| ( X0 = X2 )
| ( upairset2E != $true ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f44,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 )
| ( uniqinunit != $true ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f45,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f32]) ).
thf(f46,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f32]) ).
thf(f48,plain,
upairset2E = $true,
inference(cnf_transformation,[],[f32]) ).
thf(f49,plain,
( ( in @ ( setadjoin @ sK9 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK7 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK7 @ ( setadjoin @ sK8 @ emptyset ) ) @ emptyset ) ) )
= $true ),
inference(cnf_transformation,[],[f32]) ).
thf(f50,plain,
sK9 != sK7,
inference(cnf_transformation,[],[f32]) ).
thf(f56,plain,
! [X0: $i,X1: $i] :
( ( $true != $true )
| ( ( in @ X1 @ ( setadjoin @ X1 @ X0 ) )
= $true ) ),
inference(definition_unfolding,[],[f37,f46]) ).
thf(f58,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true != $true )
| ( X0 = X1 )
| ( X0 = X2 )
| ( ( in @ X0 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true ) ),
inference(definition_unfolding,[],[f41,f48]) ).
thf(f62,plain,
! [X0: $i,X1: $i] :
( ( $true != $true )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 ) ),
inference(definition_unfolding,[],[f44,f45]) ).
thf(f69,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f62]) ).
thf(f70,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true )
| ( X0 = X2 )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f71,plain,
! [X0: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X1 @ X0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f84,plain,
( ( $true != $true )
| ( ( setadjoin @ sK7 @ ( setadjoin @ sK8 @ emptyset ) )
= ( setadjoin @ sK9 @ emptyset ) )
| ( ( setadjoin @ sK7 @ emptyset )
= ( setadjoin @ sK9 @ emptyset ) ) ),
inference(constrained_superposition,[],[f70,f49]) ).
thf(f85,plain,
( ( ( setadjoin @ sK7 @ ( setadjoin @ sK8 @ emptyset ) )
= ( setadjoin @ sK9 @ emptyset ) )
| ( ( setadjoin @ sK7 @ emptyset )
= ( setadjoin @ sK9 @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f84]) ).
thf(f87,definition,
( spl12_1
<=> ( ( setadjoin @ sK7 @ ( setadjoin @ sK8 @ emptyset ) )
= ( setadjoin @ sK9 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
thf(f88,plain,
( ( ( setadjoin @ sK7 @ ( setadjoin @ sK8 @ emptyset ) )
= ( setadjoin @ sK9 @ emptyset ) )
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f87]) ).
thf(f90,definition,
( spl12_2
<=> ( ( setadjoin @ sK7 @ emptyset )
= ( setadjoin @ sK9 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
thf(f91,plain,
( ( ( setadjoin @ sK7 @ emptyset )
= ( setadjoin @ sK9 @ emptyset ) )
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f90]) ).
thf(f92,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f85,f90,f87]) ).
thf(f94,plain,
( ( ( in @ sK9 @ ( setadjoin @ sK7 @ emptyset ) )
= $true )
| ~ spl12_2 ),
inference(constrained_superposition,[],[f71,f91]) ).
thf(f99,plain,
( ( sK9 = sK7 )
| ( $true != $true )
| ~ spl12_2 ),
inference(constrained_superposition,[],[f69,f94]) ).
thf(f100,plain,
( ( sK9 = sK7 )
| ~ spl12_2 ),
inference(trivial_inequality_removal,[],[f99]) ).
thf(f101,plain,
( $false
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f100,f50]) ).
thf(f102,plain,
~ spl12_2,
inference(avatar_contradiction_clause,[],[f101]) ).
thf(f108,plain,
( ( $true
= ( in @ sK7 @ ( setadjoin @ sK9 @ emptyset ) ) )
| ~ spl12_1 ),
inference(constrained_superposition,[],[f71,f88]) ).
thf(f112,plain,
( ( $true != $true )
| ( sK9 = sK7 )
| ~ spl12_1 ),
inference(constrained_superposition,[],[f69,f108]) ).
thf(f115,plain,
( ( sK9 = sK7 )
| ~ spl12_1 ),
inference(trivial_inequality_removal,[],[f112]) ).
thf(f120,plain,
( $false
| ~ spl12_1 ),
inference(forward_subsumption_resolution,[],[f115,f50]) ).
thf(f121,plain,
~ spl12_1,
inference(avatar_contradiction_clause,[],[f120]) ).
cnf(s1,plain,
( spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f92]) ).
cnf(s2,plain,
~ spl12_2,
inference(sat_conversion,[],[f102]) ).
cnf(s5,plain,
~ spl12_1,
inference(sat_conversion,[],[f121]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s2,s5]) ).
thf(f122,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU642^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n018.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:04:11 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.28 % (123550)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.28 % (123560)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3774724544:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.28 % (123560) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-123550-123560"...
% 0.23/0.28 % (123561)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.23/0.28 % (123561)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.23/0.28 % (123560)...printing done.
% 0.23/0.28 % (123560)Refutation found. Thanks to Tanya!
% 0.23/0.28 % SZS status Theorem for theBenchmark
% 0.23/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.29 % (123560)------------------------------
% 0.23/0.29 % (123560)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.29 % (123560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.29 % (123560)CaDiCaL version: 2.1.3
% 0.23/0.29 % (123560)Termination reason: Refutation
% 0.23/0.29 % (123560)Time elapsed: 0.004 s
% 0.23/0.29 % (123560)Peak memory usage: 13 MB
% 0.23/0.29 % (123560)Instructions burned: 9 (million)
% 0.23/0.29 % (123550)Success in time 0.034 s
% 0.23/0.29 % Vampire exiting
%------------------------------------------------------------------------------