%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU776^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 : n013.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:31:18 AM UTC 2026
% Result : Theorem 0.10s 0.27s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of formulae : 45 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 389 ( 80 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 691 ( 10 ~; 19 |; 15 &; 545 @)
% ( 0 <=>; 66 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 23 usr; 8 con; 0-4 aty)
% ( 36 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 157 ( 79 ^; 70 !; 8 ?; 157 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(func_def_2,type,
kpair: $i > $i > $i ).
thf(func_def_3,type,
cartprod: $i > $i > $i ).
thf(func_def_4,type,
breln: $i > $i > $i > $o ).
thf(func_def_6,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_7,type,
dpsetconstrI: $o ).
thf(func_def_8,type,
breln1: $i > $i > $o ).
thf(func_def_9,type,
breln1invset: $i > $i > $i ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_15,type,
vIMP: $o > $o > $o ).
thf(func_def_16,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
vNOT: $o > $o ).
thf(f2,axiom,
( dpsetconstrI
= ( ! [X0: $i,X2: $i > $i > $o,X3: $i,X1: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X2 @ X3 @ X4 )
=> ( in @ ( kpair @ X3 @ X4 )
@ ( dpsetconstr @ X0 @ X1
@ ^ [X5: $i,X6: $i] : ( X2 @ X5 @ X6 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrI) ).
thf(f4,axiom,
( ( ^ [X0: $i,X1: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( in @ ( kpair @ X3 @ X2 ) @ X1 ) ) )
= breln1invset ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invset) ).
thf(f5,conjecture,
( dpsetconstrI
=> ! [X1: $i,X0: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( in @ ( kpair @ X2 @ X3 ) @ X1 )
=> ( in @ ( kpair @ X3 @ X2 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invI) ).
thf(f6,negated_conjecture,
~ ( dpsetconstrI
=> ! [X1: $i,X0: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( in @ ( kpair @ X2 @ X3 ) @ X1 )
=> ( in @ ( kpair @ X3 @ X2 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( ( ^ [X0: $i,X1: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( in @ ( kpair @ X3 @ X2 ) @ X1 ) ) )
= breln1invset ),
inference(rectify,[],[f4]) ).
thf(f8,plain,
( breln1invset
= ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f10,plain,
( dpsetconstrI
= ( ! [X0: $i,X1: $i > $i > $o,X2: $i,X3: $i] :
( ( in @ X2 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X1 @ X2 @ X4 )
=> ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X0 @ X3
@ ^ [X5: $i,X6: $i] : ( X1 @ X5 @ X6 ) ) ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f11,plain,
( dpsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y1 @ Y3 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
=> ( ( Y2 @ Y1 @ Y4 )
=> ( in @ ( kpair @ Y1 @ Y4 )
@ ( dpsetconstr @ Y3 @ Y0
@ ^ [Y5: $i,Y6: $i] : ( Y2 @ Y5 @ Y6 ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( dpsetconstrI
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X1 @ X0 )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ ( kpair @ X2 @ X3 ) @ X0 )
=> ( in @ ( kpair @ X3 @ X2 ) @ ( breln1invset @ X1 @ X0 ) ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f13,plain,
~ ( ( dpsetconstrI = $true )
=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X1 @ X0 )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
=> ( ( ( in @ ( kpair @ X2 @ X3 ) @ X0 )
= $true )
=> ( ( in @ ( kpair @ X3 @ X2 ) @ ( breln1invset @ X1 @ X0 ) )
= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f15,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( in @ ( kpair @ X3 @ X2 ) @ ( breln1invset @ X1 @ X0 ) )
!= $true )
& ( ( in @ ( kpair @ X2 @ X3 ) @ X0 )
= $true )
& ( ( in @ X3 @ X1 )
= $true ) )
& ( ( in @ X2 @ X1 )
= $true ) )
& ( ( breln1 @ X1 @ X0 )
= $true ) )
& ( dpsetconstrI = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f16,plain,
( ( dpsetconstrI = $true )
& ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
& ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( in @ ( kpair @ X2 @ X3 ) @ X0 )
= $true )
& ( ( in @ ( kpair @ X3 @ X2 ) @ ( breln1invset @ X1 @ X0 ) )
!= $true ) ) )
& ( ( breln1 @ X1 @ X0 )
= $true ) ) ),
inference(flattening,[],[f15]) ).
thf(f17,plain,
( ( dpsetconstrI = $true )
& ( ( in @ sK2 @ sK1 )
= $true )
& ( ( in @ sK3 @ sK1 )
= $true )
& ( ( in @ ( kpair @ sK2 @ sK3 ) @ sK0 )
= $true )
& ( ( in @ ( kpair @ sK3 @ sK2 ) @ ( breln1invset @ sK1 @ sK0 ) )
!= $true )
& ( ( breln1 @ sK1 @ sK0 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f16]) ).
thf(f18,plain,
( dpsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y1 @ Y3 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
=> ( ( Y2 @ Y1 @ Y4 )
=> ( in @ ( kpair @ Y1 @ Y4 )
@ ( dpsetconstr @ Y3 @ Y0
@ ^ [Y5: $i,Y6: $i] : ( Y2 @ Y5 @ Y6 ) ) ) ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
( breln1invset
= ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f23,plain,
( ( in @ ( kpair @ sK3 @ sK2 ) @ ( breln1invset @ sK1 @ sK0 ) )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f24,plain,
( ( in @ ( kpair @ sK2 @ sK3 ) @ sK0 )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f25,plain,
( ( in @ sK3 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f26,plain,
( ( in @ sK2 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f27,plain,
dpsetconstrI = $true,
inference(cnf_transformation,[],[f17]) ).
thf(f31,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y1 @ Y3 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
=> ( ( Y2 @ Y1 @ Y4 )
=> ( in @ ( kpair @ Y1 @ Y4 )
@ ( dpsetconstr @ Y3 @ Y0
@ ^ [Y5: $i,Y6: $i] : ( Y2 @ Y5 @ Y6 ) ) ) ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f18,f27]) ).
thf(f32,plain,
( ( in @ ( kpair @ sK3 @ sK2 )
@ ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) )
@ sK1
@ sK0 ) )
!= $true ),
inference(definition_unfolding,[],[f23,f20]) ).
thf(f34,plain,
( ( in @ ( kpair @ sK3 @ sK2 )
@ ( dpsetconstr @ sK1 @ sK1
@ ^ [Y0: $i,Y1: $i] : ( in @ ( kpair @ Y1 @ Y0 ) @ sK0 ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f35,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y1 @ Y3 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
=> ( ( Y2 @ Y1 @ Y4 )
=> ( in @ ( kpair @ Y1 @ Y4 )
@ ( dpsetconstr @ Y3 @ Y0
@ ^ [Y5: $i,Y6: $i] : ( Y2 @ Y5 @ Y6 ) ) ) ) ) ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f36,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ X1 )
=> ( ( Y1 @ Y0 @ Y3 )
=> ( in @ ( kpair @ Y0 @ Y3 ) @ ( dpsetconstr @ Y2 @ X1 @ Y1 ) ) ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ X1 )
=> ( ( Y1 @ Y0 @ Y3 )
=> ( in @ ( kpair @ Y0 @ Y3 ) @ ( dpsetconstr @ Y2 @ X1 @ Y1 ) ) ) ) ) ) ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X1: $i] :
( ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X2 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ X1 )
=> ( ( Y0 @ X2 @ Y2 )
=> ( in @ ( kpair @ X2 @ Y2 ) @ ( dpsetconstr @ Y1 @ X1 @ Y0 ) ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i] :
( ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X2 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ X1 )
=> ( ( Y0 @ X2 @ Y2 )
=> ( in @ ( kpair @ X2 @ Y2 ) @ ( dpsetconstr @ Y1 @ X1 @ Y0 ) ) ) ) ) ) )
@ X3 )
= $true ),
inference(pi_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X2 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( ( X3 @ X2 @ Y1 )
=> ( in @ ( kpair @ X2 @ Y1 ) @ ( dpsetconstr @ Y0 @ X1 @ X3 ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f39]) ).
thf(f41,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i] :
( ( ^ [Y0: $i] :
( ( in @ X2 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( ( X3 @ X2 @ Y1 )
=> ( in @ ( kpair @ X2 @ Y1 ) @ ( dpsetconstr @ Y0 @ X1 @ X3 ) ) ) ) ) )
@ X4 )
= $true ),
inference(pi_proxy_clausification,[],[f40]) ).
thf(f42,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i] :
( ( ( in @ X2 @ X4 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( ( X3 @ X2 @ Y0 )
=> ( in @ ( kpair @ X2 @ Y0 ) @ ( dpsetconstr @ X4 @ X1 @ X3 ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f41]) ).
thf(f43,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i] :
( ( $false
= ( in @ X2 @ X4 ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( ( X3 @ X2 @ Y0 )
=> ( in @ ( kpair @ X2 @ Y0 ) @ ( dpsetconstr @ X4 @ X1 @ X3 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $false
= ( in @ X2 @ X4 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( ( X3 @ X2 @ Y0 )
=> ( in @ ( kpair @ X2 @ Y0 ) @ ( dpsetconstr @ X4 @ X1 @ X3 ) ) ) )
@ X5 ) ) ),
inference(pi_proxy_clausification,[],[f43]) ).
thf(f45,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $false
= ( in @ X2 @ X4 ) )
| ( ( ( in @ X5 @ X1 )
=> ( ( X3 @ X2 @ X5 )
=> ( in @ ( kpair @ X2 @ X5 ) @ ( dpsetconstr @ X4 @ X1 @ X3 ) ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i,X5: $i] :
( ( ( in @ X5 @ X1 )
= $false )
| ( ( ( X3 @ X2 @ X5 )
=> ( in @ ( kpair @ X2 @ X5 ) @ ( dpsetconstr @ X4 @ X1 @ X3 ) ) )
= $true )
| ( $false
= ( in @ X2 @ X4 ) ) ),
inference(imp_proxy_clausification,[],[f45]) ).
thf(f47,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i,X4: $i,X5: $i] :
( ( ( in @ ( kpair @ X2 @ X5 ) @ ( dpsetconstr @ X4 @ X1 @ X3 ) )
= $true )
| ( ( in @ X5 @ X1 )
= $false )
| ( $false
= ( in @ X2 @ X4 ) )
| ( $false
= ( X3 @ X2 @ X5 ) ) ),
inference(imp_proxy_clausification,[],[f46]) ).
thf(f49,plain,
( ( $false
= ( ^ [Y0: $i,Y1: $i] : ( in @ ( kpair @ Y1 @ Y0 ) @ sK0 )
@ sK3
@ sK2 ) )
| ( ( in @ sK2 @ sK1 )
= $false )
| ( $true != $true )
| ( $false
= ( in @ sK3 @ sK1 ) ) ),
inference(constrained_superposition,[],[f34,f47]) ).
thf(f54,plain,
( ( $false
= ( in @ sK3 @ sK1 ) )
| ( ( in @ sK2 @ sK1 )
= $false )
| ( $false
= ( ^ [Y0: $i,Y1: $i] : ( in @ ( kpair @ Y1 @ Y0 ) @ sK0 )
@ sK3
@ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f55,plain,
( ( $false
= ( in @ sK3 @ sK1 ) )
| ( ( in @ sK2 @ sK1 )
= $false )
| ( $false
= ( in @ ( kpair @ sK2 @ sK3 ) @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f54]) ).
thf(f56,plain,
( ( $false = $true )
| ( ( in @ sK2 @ sK1 )
= $false )
| ( $false
= ( in @ ( kpair @ sK2 @ sK3 ) @ sK0 ) ) ),
inference(forward_demodulation,[],[f55,f25]) ).
thf(f57,plain,
( ( $false
= ( in @ ( kpair @ sK2 @ sK3 ) @ sK0 ) )
| ( ( in @ sK2 @ sK1 )
= $false ) ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f58,plain,
( ( $false = $true )
| ( ( in @ sK2 @ sK1 )
= $false ) ),
inference(forward_demodulation,[],[f57,f24]) ).
thf(f59,plain,
( ( in @ sK2 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f61,plain,
$false = $true,
inference(constrained_superposition,[],[f26,f59]) ).
thf(f62,plain,
$false,
inference(trivial_inequality_removal,[],[f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU776^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.10/0.18 % Computer : n013.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 14:27:21 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.23 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.10/0.27 % (2194007)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.27 % (2194012)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1988056370:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.10/0.27 % (2194018)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.27 % (2194018)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.10/0.27 % (2194013)lrs+10_16_si=on:nwc=1.5:random_seed=389634977:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.10/0.27 % (2194014)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2254586774:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.10/0.27 % (2194017)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3044194182:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.10/0.27 % (2194016)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3358971091:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.10/0.27 % (2194015)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=4068887429: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.10/0.27 % (2194018)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=113600769:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.10/0.27 % (2194014)Instruction limit reached!
% 0.10/0.27 % (2194014)------------------------------
% 0.10/0.27 % (2194014)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.27 % (2194014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.27 % (2194014)CaDiCaL version: 2.1.3
% 0.10/0.27 % (2194014)Termination reason: Instruction limit
% 0.10/0.27 % (2194014)Termination phase: Saturation
% 0.10/0.27 % (2194014)Time elapsed: 0.002 s
% 0.10/0.27 % (2194014)Peak memory usage: 12 MB
% 0.10/0.27 % (2194014)Instructions burned: 3 (million)
% 0.10/0.27 % (2194013) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2194007-2194013"...
% 0.10/0.27 % (2194016) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2194007-2194016"...
% 0.10/0.27 % (2194013)...printing done.
% 0.10/0.27 % (2194015) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2194007-2194015"...
% 0.10/0.27 % (2194013)Refutation found. Thanks to Tanya!
% 0.10/0.27 % SZS status Theorem for theBenchmark
% 0.10/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28 % (2194013)------------------------------
% 0.22/0.28 % (2194013)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (2194013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (2194013)CaDiCaL version: 2.1.3
% 0.22/0.28 % (2194013)Termination reason: Refutation
% 0.22/0.28 % (2194013)Time elapsed: 0.006 s
% 0.22/0.28 % (2194013)Peak memory usage: 12 MB
% 0.22/0.28 % (2194013)Instructions burned: 8 (million)
% 0.22/0.28 % (2194007)Success in time 0.038 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------