%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU657^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 : n020.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:33 AM UTC 2026
% Result : Theorem 0.23s 0.30s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 372 ( 103 equ; 0 cnn)
% Maximal formula atoms : 4 ( 7 avg)
% Number of connectives : 565 ( 27 ~; 16 |; 34 &; 463 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 30 ( 26 usr; 13 con; 0-4 aty)
% ( 0 !!; 11 ??; 0 @@+; 0 @@-)
% Number of variables : 90 ( 34 ^; 42 !; 14 ?; 90 :)
% 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,
setunion: $i > $i ).
thf(func_def_4,type,
iskpair: $i > $o ).
thf(func_def_6,type,
kpair: $i > $i > $i ).
thf(func_def_7,type,
kfst: $i > $i ).
thf(func_def_8,type,
kfstpairEq: $o ).
thf(func_def_9,type,
ksnd: $i > $i ).
thf(func_def_10,type,
ksndpairEq: $o ).
thf(func_def_11,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_12,type,
vAND: $o > $o > $o ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(f1,axiom,
( iskpair
= ( ^ [X0: $i] :
? [X1: $i] :
( ? [X2: $i] :
( ( in @ X2 @ ( setunion @ X0 ) )
& ( X0
= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
& ( in @ X1 @ ( setunion @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iskpair) ).
thf(f2,axiom,
( kpair
= ( ^ [X0: $i,X1: $i] : ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpair) ).
thf(f3,axiom,
( kfstpairEq
= ( ! [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X0 @ X1 ) )
= X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstpairEq) ).
thf(f4,axiom,
( ksndpairEq
= ( ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ksndpairEq) ).
thf(f5,conjecture,
( kfstpairEq
=> ( ksndpairEq
=> ! [X0: $i] :
( ( iskpair @ X0 )
=> ( ( kpair @ ( kfst @ X0 ) @ ( ksnd @ X0 ) )
= X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairsurjEq) ).
thf(f6,negated_conjecture,
~ ( kfstpairEq
=> ( ksndpairEq
=> ! [X0: $i] :
( ( iskpair @ X0 )
=> ( ( kpair @ ( kfst @ X0 ) @ ( ksnd @ X0 ) )
= X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( iskpair
= ( ^ [X0: $i] :
? [X1: $i] :
( ? [X2: $i] :
( ( in @ X2 @ ( setunion @ X0 ) )
& ( X0
= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
& ( in @ X1 @ ( setunion @ X0 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( iskpair
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setunion @ Y0 ) )
& ( ?? @ $i
@ ^ [Y2: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= Y0 )
& ( in @ Y2 @ ( setunion @ Y0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( kfstpairEq
=> ( ksndpairEq
=> ! [X0: $i] :
( ( iskpair @ X0 )
=> ( ( kpair @ ( kfst @ X0 ) @ ( ksnd @ X0 ) )
= X0 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f10,plain,
~ ( ( kfstpairEq = $true )
=> ( ( ksndpairEq = $true )
=> ! [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
=> ( ( kpair @ ( kfst @ X0 ) @ ( ksnd @ X0 ) )
= X0 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( kfstpairEq
= ( ! [X0: $i,X1: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
= X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
( ( kfstpairEq = $true )
<=> ! [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
= X1 ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( ( ksndpairEq = $true )
<=> ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f14,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f15,plain,
( ? [X0: $i] :
( ( ( kpair @ ( kfst @ X0 ) @ ( ksnd @ X0 ) )
!= X0 )
& ( ( iskpair @ X0 )
= $true ) )
& ( ksndpairEq = $true )
& ( kfstpairEq = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f16,plain,
( ( ksndpairEq = $true )
& ( kfstpairEq = $true )
& ? [X0: $i] :
( ( ( kpair @ ( kfst @ X0 ) @ ( ksnd @ X0 ) )
!= X0 )
& ( ( iskpair @ X0 )
= $true ) ) ),
inference(flattening,[],[f15]) ).
thf(f17,plain,
( ( ksndpairEq = $true )
& ( kfstpairEq = $true )
& ( sK0
!= ( kpair @ ( kfst @ sK0 ) @ ( ksnd @ sK0 ) ) )
& ( ( iskpair @ sK0 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f16]) ).
thf(f18,plain,
( ( ( ksndpairEq = $true )
| ? [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
!= X1 ) )
& ( ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 )
| ( ksndpairEq != $true ) ) ),
inference(nnf_transformation,[],[f13]) ).
thf(f19,plain,
( ( ( ksndpairEq = $true )
| ? [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
!= X1 ) )
& ( ! [X2: $i,X3: $i] :
( ( ksnd @ ( kpair @ X2 @ X3 ) )
= X3 )
| ( ksndpairEq != $true ) ) ),
inference(rectify,[],[f18]) ).
thf(f20,plain,
( ( ( ksndpairEq = $true )
| ( ( ksnd @ ( kpair @ sK1 @ sK2 ) )
!= sK2 ) )
& ( ! [X2: $i,X3: $i] :
( ( ksnd @ ( kpair @ X2 @ X3 ) )
= X3 )
| ( ksndpairEq != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f19]) ).
thf(f21,plain,
( ( ( kfstpairEq = $true )
| ? [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
!= X1 ) )
& ( ! [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
= X1 )
| ( kfstpairEq != $true ) ) ),
inference(nnf_transformation,[],[f12]) ).
thf(f22,plain,
( ( ( kfstpairEq = $true )
| ? [X0: $i,X1: $i] :
( ( kfst @ ( kpair @ X0 @ X1 ) )
!= X0 ) )
& ( ! [X2: $i,X3: $i] :
( ( kfst @ ( kpair @ X2 @ X3 ) )
= X2 )
| ( kfstpairEq != $true ) ) ),
inference(rectify,[],[f21]) ).
thf(f23,plain,
( ( ( kfstpairEq = $true )
| ( sK3
!= ( kfst @ ( kpair @ sK3 @ sK4 ) ) ) )
& ( ! [X2: $i,X3: $i] :
( ( kfst @ ( kpair @ X2 @ X3 ) )
= X2 )
| ( kfstpairEq != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f22]) ).
thf(f24,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f25,plain,
( iskpair
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setunion @ Y0 ) )
& ( ?? @ $i
@ ^ [Y2: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= Y0 )
& ( in @ Y2 @ ( setunion @ Y0 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f26,plain,
( ( iskpair @ sK0 )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f27,plain,
( sK0
!= ( kpair @ ( kfst @ sK0 ) @ ( ksnd @ sK0 ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f28,plain,
kfstpairEq = $true,
inference(cnf_transformation,[],[f17]) ).
thf(f29,plain,
ksndpairEq = $true,
inference(cnf_transformation,[],[f17]) ).
thf(f30,plain,
! [X2: $i,X3: $i] :
( ( ( ksnd @ ( kpair @ X2 @ X3 ) )
= X3 )
| ( ksndpairEq != $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f32,plain,
! [X2: $i,X3: $i] :
( ( ( kfst @ ( kpair @ X2 @ X3 ) )
= X2 )
| ( kfstpairEq != $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f36,plain,
( sK0
!= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ ( kfst @ sK0 )
@ ( ksnd @ sK0 ) ) ),
inference(definition_unfolding,[],[f27,f24]) ).
thf(f37,plain,
( ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setunion @ Y0 ) )
& ( ?? @ $i
@ ^ [Y2: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= Y0 )
& ( in @ Y2 @ ( setunion @ Y0 ) ) ) ) ) )
@ sK0 )
= $true ),
inference(definition_unfolding,[],[f26,f25]) ).
thf(f39,plain,
! [X2: $i,X3: $i] :
( ( $true != $true )
| ( ( ksnd
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X2
@ X3 ) )
= X3 ) ),
inference(definition_unfolding,[],[f30,f24,f29]) ).
thf(f41,plain,
! [X2: $i,X3: $i] :
( ( $true != $true )
| ( ( kfst
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X2
@ X3 ) )
= X2 ) ),
inference(definition_unfolding,[],[f32,f24,f28]) ).
thf(f42,plain,
! [X2: $i,X3: $i] :
( ( ksnd
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X2
@ X3 ) )
= X3 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f43,plain,
! [X2: $i,X3: $i] :
( ( ksnd @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
= X3 ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
! [X2: $i,X3: $i] :
( ( kfst
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X2
@ X3 ) )
= X2 ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f45,plain,
! [X2: $i,X3: $i] :
( ( kfst @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
= X2 ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
( ( setadjoin @ ( setadjoin @ ( kfst @ sK0 ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( kfst @ sK0 ) @ ( setadjoin @ ( ksnd @ sK0 ) @ emptyset ) ) @ emptyset ) )
!= sK0 ),
inference(beta-eta_normalization,[],[f36]) ).
thf(f47,plain,
( ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setunion @ sK0 ) )
& ( ?? @ $i
@ ^ [Y1: $i] :
( ( ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
= sK0 )
& ( in @ Y1 @ ( setunion @ sK0 ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f48,plain,
( ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setunion @ sK0 ) )
& ( ?? @ $i
@ ^ [Y1: $i] :
( ( ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
= sK0 )
& ( in @ Y1 @ ( setunion @ sK0 ) ) ) ) )
@ sK5 )
= $true ),
inference(sigma_proxy_clausification,[],[f47]) ).
thf(f49,plain,
( ( ( in @ sK5 @ ( setunion @ sK0 ) )
& ( ?? @ $i
@ ^ [Y0: $i] :
( ( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= sK0 )
& ( in @ Y0 @ ( setunion @ sK0 ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f50,plain,
( ( ?? @ $i
@ ^ [Y0: $i] :
( ( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= sK0 )
& ( in @ Y0 @ ( setunion @ sK0 ) ) ) )
= $true ),
inference(and_proxy_clausification,[],[f49]) ).
thf(f52,plain,
( ( ^ [Y0: $i] :
( ( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= sK0 )
& ( in @ Y0 @ ( setunion @ sK0 ) ) )
@ sK6 )
= $true ),
inference(sigma_proxy_clausification,[],[f50]) ).
thf(f53,plain,
( ( ( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ sK6 @ emptyset ) ) @ emptyset ) )
= sK0 )
& ( in @ sK6 @ ( setunion @ sK0 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f55,plain,
( ( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ sK6 @ emptyset ) ) @ emptyset ) )
= sK0 )
= $true ),
inference(and_proxy_clausification,[],[f53]) ).
thf(f56,plain,
( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ sK6 @ emptyset ) ) @ emptyset ) )
= sK0 ),
inference(equality_proxy_clausification,[],[f55]) ).
thf(f58,plain,
( sK6
= ( ksnd @ sK0 ) ),
inference(constrained_superposition,[],[f43,f56]) ).
thf(f60,plain,
( ( kfst @ sK0 )
= sK5 ),
inference(constrained_superposition,[],[f45,f56]) ).
thf(f62,plain,
( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ ( ksnd @ sK0 ) @ emptyset ) ) @ emptyset ) )
!= sK0 ),
inference(constrained_superposition,[],[f46,f60]) ).
thf(f63,plain,
( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ sK6 @ emptyset ) ) @ emptyset ) )
!= sK0 ),
inference(forward_demodulation,[],[f62,f58]) ).
thf(f65,plain,
$false,
inference(forward_subsumption_resolution,[],[f63,f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU657^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.09/0.19 % Computer : n020.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:03:49 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.23/0.30 % (1104523)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.30 % (1104531)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=2292742151: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.23/0.30 % (1104534)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.30 % (1104534)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.30 % (1104533)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=873304238:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.30 % (1104530)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1937618117:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.23/0.30 % (1104528)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3565957999:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.23/0.30 % (1104529)lrs+10_16_si=on:nwc=1.5:random_seed=365711256:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.23/0.30 % (1104532)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3058512790:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.23/0.30 % (1104534)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=200129148:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.23/0.30 % (1104530)Refutation not found, incomplete strategy
% 0.23/0.30 % (1104530)------------------------------
% 0.23/0.30 % (1104530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.30 % (1104530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.30 % (1104530)CaDiCaL version: 2.1.3
% 0.23/0.30 % (1104530)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.30 % (1104530)Time elapsed: 0.002 s
% 0.23/0.30 % (1104530)Peak memory usage: 12 MB
% 0.23/0.30 % (1104530)Instructions burned: 3 (million)
% 0.23/0.30 % (1104530)------------------------------
% 0.23/0.30 % (1104530)------------------------------
% 0.23/0.30 % (1104528) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1104523-1104528"...
% 0.23/0.30 % (1104533) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1104523-1104533"...
% 0.23/0.30 % (1104529) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1104523-1104529"...
% 0.23/0.30 % (1104532) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1104523-1104532"...
% 0.23/0.30 % (1104528)...printing done.
% 0.23/0.30 % (1104533)...printing done.
% 0.23/0.30 % (1104534) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1104523-1104534"...
% 0.23/0.30 % (1104529)...printing done.
% 0.23/0.30 % (1104528)Refutation found. Thanks to Tanya!
% 0.23/0.30 % SZS status Theorem for theBenchmark
% 0.23/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.31 % (1104528)------------------------------
% 0.23/0.31 % (1104528)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (1104528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (1104528)CaDiCaL version: 2.1.3
% 0.23/0.31 % (1104528)Termination reason: Refutation
% 0.23/0.31 % (1104528)Time elapsed: 0.006 s
% 0.23/0.31 % (1104528)Peak memory usage: 12 MB
% 0.23/0.31 % (1104528)Instructions burned: 8 (million)
% 0.23/0.31 % (1104523)Success in time 0.052 s
% 0.23/0.31 % Vampire exiting
%------------------------------------------------------------------------------