%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU780^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 : n006.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:19 AM UTC 2026
% Result : Theorem 0.23s 0.29s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 40 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 443 ( 99 equ; 0 cnn)
% Maximal formula atoms : 9 ( 11 avg)
% Number of connectives : 689 ( 38 ~; 28 |; 55 &; 532 @)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 35 ( 31 usr; 14 con; 0-4 aty)
% ( 0 !!; 7 ??; 0 @@+; 0 @@-)
% Number of variables : 170 ( 65 ^; 79 !; 26 ?; 170 :)
% 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,
dpsetconstrER: $o ).
thf(func_def_8,type,
breln1: $i > $i > $o ).
thf(func_def_9,type,
breln1compset: $i > $i > $i > $i ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_17,type,
vAND: $o > $o > $o ).
thf(func_def_18,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
sK3: $i > $i > $o ).
thf(func_def_31,type,
vNOT: $o > $o ).
thf(f2,axiom,
( dpsetconstrER
= ( ! [X1: $i,X2: $i > $i > $o,X0: $i,X4: $i,X3: $i] :
( ( in @ ( kpair @ X3 @ X4 )
@ ( dpsetconstr @ X0 @ X1
@ ^ [X5: $i,X6: $i] : ( X2 @ X5 @ X6 ) ) )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dpsetconstrER) ).
thf(f4,axiom,
( breln1compset
= ( ^ [X0: $i,X1: $i,X2: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X3: $i,X4: $i] :
? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ X5 @ X0 )
& ( in @ ( kpair @ X3 @ X5 ) @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compset) ).
thf(f5,conjecture,
( dpsetconstrER
=> ! [X1: $i,X0: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ ( breln1compset @ X0 @ X1 @ X2 ) )
=> ? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ ( kpair @ X3 @ X5 ) @ X1 )
& ( in @ X5 @ X0 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compE) ).
thf(f6,negated_conjecture,
~ ( dpsetconstrER
=> ! [X1: $i,X0: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ ( breln1compset @ X0 @ X1 @ X2 ) )
=> ? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ ( kpair @ X3 @ X5 ) @ X1 )
& ( in @ X5 @ X0 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( dpsetconstrER
= ( ! [X0: $i,X1: $i > $i > $o,X2: $i,X3: $i,X4: $i] :
( ( in @ ( kpair @ X4 @ X3 )
@ ( dpsetconstr @ X2 @ X0
@ ^ [X5: $i,X6: $i] : ( X1 @ X5 @ X6 ) ) )
=> ( X1 @ X4 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( ! [X3: $i,X2: $i,X1: $i > $i > $o,X0: $i,X4: $i] :
( ( $true
= ( in @ ( kpair @ X4 @ X3 )
@ ( dpsetconstr @ X2 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X1 @ Y0 @ Y1 ) ) ) )
=> ( $true
= ( X1 @ X4 @ X3 ) ) )
<=> ( dpsetconstrER = $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f11,plain,
( breln1compset
= ( ^ [X0: $i,X1: $i,X2: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X3: $i,X4: $i] :
? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ X5 @ X0 )
& ( in @ ( kpair @ X3 @ X5 ) @ X1 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f12,plain,
( breln1compset
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y3: $i,Y4: $i] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( in @ ( kpair @ Y3 @ Y5 ) @ Y1 )
& ( in @ Y5 @ Y0 )
& ( in @ ( kpair @ Y5 @ Y4 ) @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
~ ( dpsetconstrER
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X1 @ X0 )
=> ! [X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ ( breln1compset @ X1 @ X0 @ X2 ) )
=> ? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ ( kpair @ X3 @ X5 ) @ X0 )
& ( in @ X5 @ X1 ) ) ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f14,plain,
~ ( ( dpsetconstrER = $true )
=> ! [X1: $i,X0: $i] :
( ( $true
= ( breln1 @ X1 @ X0 ) )
=> ! [X2: $i] :
( ( $true
= ( breln1 @ X1 @ X2 ) )
=> ! [X3: $i] :
( ( $true
= ( in @ X3 @ X1 ) )
=> ! [X4: $i] :
( ( $true
= ( in @ X4 @ X1 ) )
=> ( ( $true
= ( in @ ( kpair @ X3 @ X4 ) @ ( breln1compset @ X1 @ X0 @ X2 ) ) )
=> ? [X5: $i] :
( ( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
= $true )
& ( $true
= ( in @ X5 @ X1 ) )
& ( $true
= ( in @ ( kpair @ X3 @ X5 ) @ X0 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
( ( dpsetconstrER = $true )
<=> ! [X3: $i,X0: $i,X2: $i,X1: $i > $i > $o,X4: $i] :
( ( $true
= ( X1 @ X4 @ X3 ) )
| ( $true
!= ( in @ ( kpair @ X4 @ X3 )
@ ( dpsetconstr @ X2 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X1 @ Y0 @ Y1 ) ) ) ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f16,plain,
( ? [X1: $i,X0: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ? [X4: $i] :
( ! [X5: $i] :
( ( $true
!= ( in @ X5 @ X1 ) )
| ( $true
!= ( in @ ( kpair @ X3 @ X5 ) @ X0 ) )
| ( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
!= $true ) )
& ( $true
= ( in @ ( kpair @ X3 @ X4 ) @ ( breln1compset @ X1 @ X0 @ X2 ) ) )
& ( $true
= ( in @ X4 @ X1 ) ) )
& ( $true
= ( in @ X3 @ X1 ) ) )
& ( $true
= ( breln1 @ X1 @ X2 ) ) )
& ( $true
= ( breln1 @ X1 @ X0 ) ) )
& ( dpsetconstrER = $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f17,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( $true
= ( breln1 @ X1 @ X2 ) )
& ? [X3: $i] :
( ? [X4: $i] :
( ( $true
= ( in @ ( kpair @ X3 @ X4 ) @ ( breln1compset @ X1 @ X0 @ X2 ) ) )
& ( $true
= ( in @ X4 @ X1 ) )
& ! [X5: $i] :
( ( $true
!= ( in @ X5 @ X1 ) )
| ( $true
!= ( in @ ( kpair @ X3 @ X5 ) @ X0 ) )
| ( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
!= $true ) ) )
& ( $true
= ( in @ X3 @ X1 ) ) ) )
& ( $true
= ( breln1 @ X1 @ X0 ) ) )
& ( dpsetconstrER = $true ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
( ( ( dpsetconstrER = $true )
| ? [X3: $i,X0: $i,X2: $i,X1: $i > $i > $o,X4: $i] :
( ( $true
!= ( X1 @ X4 @ X3 ) )
& ( $true
= ( in @ ( kpair @ X4 @ X3 )
@ ( dpsetconstr @ X2 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X1 @ Y0 @ Y1 ) ) ) ) ) )
& ( ! [X3: $i,X0: $i,X2: $i,X1: $i > $i > $o,X4: $i] :
( ( $true
= ( X1 @ X4 @ X3 ) )
| ( $true
!= ( in @ ( kpair @ X4 @ X3 )
@ ( dpsetconstr @ X2 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X1 @ Y0 @ Y1 ) ) ) ) )
| ( dpsetconstrER != $true ) ) ),
inference(nnf_transformation,[],[f15]) ).
thf(f19,plain,
( ( ( dpsetconstrER = $true )
| ? [X0: $i,X1: $i,X2: $i,X3: $i > $i > $o,X4: $i] :
( ( ( X3 @ X4 @ X0 )
!= $true )
& ( $true
= ( in @ ( kpair @ X4 @ X0 )
@ ( dpsetconstr @ X2 @ X1
@ ^ [Y0: $i,Y1: $i] : ( X3 @ Y0 @ Y1 ) ) ) ) ) )
& ( ! [X5: $i,X6: $i,X7: $i,X8: $i > $i > $o,X9: $i] :
( ( ( X8 @ X9 @ X5 )
= $true )
| ( $true
!= ( in @ ( kpair @ X9 @ X5 )
@ ( dpsetconstr @ X7 @ X6
@ ^ [Y0: $i,Y1: $i] : ( X8 @ Y0 @ Y1 ) ) ) ) )
| ( dpsetconstrER != $true ) ) ),
inference(rectify,[],[f18]) ).
thf(f20,plain,
( ( ( dpsetconstrER = $true )
| ( ( $true
!= ( sK3 @ sK4 @ sK0 ) )
& ( $true
= ( in @ ( kpair @ sK4 @ sK0 )
@ ( dpsetconstr @ sK2 @ sK1
@ ^ [Y0: $i,Y1: $i] : ( sK3 @ Y0 @ Y1 ) ) ) ) ) )
& ( ! [X5: $i,X6: $i,X7: $i,X8: $i > $i > $o,X9: $i] :
( ( ( X8 @ X9 @ X5 )
= $true )
| ( $true
!= ( in @ ( kpair @ X9 @ X5 )
@ ( dpsetconstr @ X7 @ X6
@ ^ [Y0: $i,Y1: $i] : ( X8 @ Y0 @ Y1 ) ) ) ) )
| ( dpsetconstrER != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f19]) ).
thf(f21,plain,
( ( $true
= ( breln1 @ sK6 @ sK7 ) )
& ( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ ( breln1compset @ sK6 @ sK5 @ sK7 ) ) )
& ( $true
= ( in @ sK9 @ sK6 ) )
& ! [X5: $i] :
( ( $true
!= ( in @ X5 @ sK6 ) )
| ( ( in @ ( kpair @ sK8 @ X5 ) @ sK5 )
!= $true )
| ( $true
!= ( in @ ( kpair @ X5 @ sK9 ) @ sK7 ) ) )
& ( $true
= ( in @ sK8 @ sK6 ) )
& ( $true
= ( breln1 @ sK6 @ sK5 ) )
& ( dpsetconstrER = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7),skolemize(X3,sK8),skolemize(X4,sK9)],[f17]) ).
thf(f24,plain,
! [X8: $i > $i > $o,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( ( X8 @ X9 @ X5 )
= $true )
| ( $true
!= ( in @ ( kpair @ X9 @ X5 )
@ ( dpsetconstr @ X7 @ X6
@ ^ [Y0: $i,Y1: $i] : ( X8 @ Y0 @ Y1 ) ) ) )
| ( dpsetconstrER != $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f27,plain,
( breln1compset
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y3: $i,Y4: $i] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( in @ ( kpair @ Y3 @ Y5 ) @ Y1 )
& ( in @ Y5 @ Y0 )
& ( in @ ( kpair @ Y5 @ Y4 ) @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f28,plain,
dpsetconstrER = $true,
inference(cnf_transformation,[],[f21]) ).
thf(f31,plain,
! [X5: $i] :
( ( $true
!= ( in @ ( kpair @ X5 @ sK9 ) @ sK7 ) )
| ( ( in @ ( kpair @ sK8 @ X5 ) @ sK5 )
!= $true )
| ( $true
!= ( in @ X5 @ sK6 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f33,plain,
( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ ( breln1compset @ sK6 @ sK5 @ sK7 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f40,plain,
! [X8: $i > $i > $o,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( ( X8 @ X9 @ X5 )
= $true )
| ( $true
!= ( in @ ( kpair @ X9 @ X5 )
@ ( dpsetconstr @ X7 @ X6
@ ^ [Y0: $i,Y1: $i] : ( X8 @ Y0 @ Y1 ) ) ) )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f24,f28]) ).
thf(f42,plain,
( $true
= ( in @ ( kpair @ sK8 @ sK9 )
@ ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y3: $i,Y4: $i] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( in @ ( kpair @ Y3 @ Y5 ) @ Y1 )
& ( in @ Y5 @ Y0 )
& ( in @ ( kpair @ Y5 @ Y4 ) @ Y2 ) ) ) )
@ sK6
@ sK5
@ sK7 ) ) ),
inference(definition_unfolding,[],[f33,f27]) ).
thf(f45,plain,
( $true
= ( in @ ( kpair @ sK8 @ sK9 )
@ ( dpsetconstr @ sK6 @ sK6
@ ^ [Y0: $i,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ ( kpair @ Y0 @ Y2 ) @ sK5 )
& ( in @ Y2 @ sK6 )
& ( in @ ( kpair @ Y2 @ Y1 ) @ sK7 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f47,plain,
! [X8: $i > $i > $o,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( $true
!= ( in @ ( kpair @ X9 @ X5 )
@ ( dpsetconstr @ X7 @ X6
@ ^ [Y0: $i,Y1: $i] : ( X8 @ Y0 @ Y1 ) ) ) )
| ( ( X8 @ X9 @ X5 )
= $true ) ),
inference(trivial_inequality_removal,[],[f40]) ).
thf(f48,plain,
! [X8: $i > $i > $o,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( $true
!= ( in @ ( kpair @ X9 @ X5 ) @ ( dpsetconstr @ X7 @ X6 @ X8 ) ) )
| ( ( X8 @ X9 @ X5 )
= $true ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f49,plain,
( ( $true != $true )
| ( ( ^ [Y0: $i,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ ( kpair @ Y0 @ Y2 ) @ sK5 )
& ( in @ Y2 @ sK6 )
& ( in @ ( kpair @ Y2 @ Y1 ) @ sK7 ) ) )
@ sK8
@ sK9 )
= $true ) ),
inference(constrained_superposition,[],[f48,f45]) ).
thf(f50,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ ( kpair @ Y0 @ Y2 ) @ sK5 )
& ( in @ Y2 @ sK6 )
& ( in @ ( kpair @ Y2 @ Y1 ) @ sK7 ) ) )
@ sK8
@ sK9 )
= $true ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f51,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ ( kpair @ sK8 @ Y0 ) @ sK5 )
& ( in @ Y0 @ sK6 )
& ( in @ ( kpair @ Y0 @ sK9 ) @ sK7 ) ) ) ),
inference(beta-eta_normalization,[],[f50]) ).
thf(f52,plain,
( $true
= ( ^ [Y0: $i] :
( ( in @ ( kpair @ sK8 @ Y0 ) @ sK5 )
& ( in @ Y0 @ sK6 )
& ( in @ ( kpair @ Y0 @ sK9 ) @ sK7 ) )
@ sK10 ) ),
inference(sigma_proxy_clausification,[],[f51]) ).
thf(f53,plain,
( $true
= ( ( in @ ( kpair @ sK8 @ sK10 ) @ sK5 )
& ( in @ sK10 @ sK6 )
& ( in @ ( kpair @ sK10 @ sK9 ) @ sK7 ) ) ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f54,plain,
( $true
= ( in @ ( kpair @ sK10 @ sK9 ) @ sK7 ) ),
inference(and_proxy_clausification,[],[f53]) ).
thf(f55,plain,
( $true
= ( ( in @ ( kpair @ sK8 @ sK10 ) @ sK5 )
& ( in @ sK10 @ sK6 ) ) ),
inference(and_proxy_clausification,[],[f53]) ).
thf(f56,plain,
( ( in @ sK10 @ sK6 )
= $true ),
inference(and_proxy_clausification,[],[f55]) ).
thf(f57,plain,
( $true
= ( in @ ( kpair @ sK8 @ sK10 ) @ sK5 ) ),
inference(and_proxy_clausification,[],[f55]) ).
thf(f58,plain,
( ( $true != $true )
| ( $true
!= ( in @ ( kpair @ sK8 @ sK10 ) @ sK5 ) )
| ( ( in @ sK10 @ sK6 )
!= $true ) ),
inference(constrained_superposition,[],[f31,f54]) ).
thf(f59,plain,
( ( $true
!= ( in @ ( kpair @ sK8 @ sK10 ) @ sK5 ) )
| ( ( in @ sK10 @ sK6 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f60,plain,
( ( in @ sK10 @ sK6 )
!= $true ),
inference(forward_subsumption_resolution,[],[f59,f57]) ).
thf(f61,plain,
$false,
inference(forward_subsumption_resolution,[],[f60,f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU780^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:27:55 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/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.29 % (801910)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.29 % (801931)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2110098883:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.23/0.29 % (801933)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.29 % (801933)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.29 % (801927)lrs+10_16_si=on:nwc=1.5:random_seed=3624490498:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.23/0.29 % (801926)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2127245840:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.23/0.29 % (801930)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=1147626984: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.29 % (801929)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=392272343:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.23/0.29 % (801932)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1168378423:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.29 % (801933)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=196243007:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.23/0.29 % (801931)Instruction limit reached!
% 0.23/0.29 % (801931)------------------------------
% 0.23/0.29 % (801931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.29 % (801931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.29 % (801931)CaDiCaL version: 2.1.3
% 0.23/0.29 % (801931)Termination reason: Instruction limit
% 0.23/0.29 % (801931)Termination phase: Saturation
% 0.23/0.29 % (801931)Time elapsed: 0.008 s
% 0.23/0.29 % (801931)Peak memory usage: 12 MB
% 0.23/0.29 % (801931)Instructions burned: 26 (million)
% 0.23/0.29 % (801929)Instruction limit reached!
% 0.23/0.29 % (801929)------------------------------
% 0.23/0.29 % (801929)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.29 % (801929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.29 % (801929)CaDiCaL version: 2.1.3
% 0.23/0.29 % (801929)Termination reason: Instruction limit
% 0.23/0.29 % (801929)Termination phase: Saturation
% 0.23/0.29 % (801929)Time elapsed: 0.002 s
% 0.23/0.29 % (801929)Peak memory usage: 11 MB
% 0.23/0.29 % (801929)Instructions burned: 3 (million)
% 0.23/0.29 % (801926) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-801910-801926"...
% 0.23/0.29 % (801927) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-801910-801927"...
% 0.23/0.29 % (801932) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-801910-801932"...
% 0.23/0.29 % (801926)...printing done.
% 0.23/0.29 % (801927)...printing done.
% 0.23/0.29 % (801926)Refutation found. Thanks to Tanya!
% 0.23/0.29 % SZS status Theorem for theBenchmark
% 0.23/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.30 % (801926)------------------------------
% 0.23/0.30 % (801926)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.30 % (801926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.30 % (801926)CaDiCaL version: 2.1.3
% 0.23/0.30 % (801926)Termination reason: Refutation
% 0.23/0.30 % (801926)Time elapsed: 0.006 s
% 0.23/0.30 % (801926)Peak memory usage: 12 MB
% 0.23/0.30 % (801926)Instructions burned: 9 (million)
% 0.23/0.30 % (801910)Success in time 0.04 s
% 0.23/0.30 % Vampire exiting
%------------------------------------------------------------------------------