%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU787^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 : n014.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:22 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 38 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 695 ( 186 equ; 0 cnn)
% Maximal formula atoms : 16 ( 18 avg)
% Number of connectives : 851 ( 95 ~; 91 |; 45 &; 562 @)
% ( 3 <=>; 55 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 14 con; 0-2 aty)
% Number of variables : 105 ( 0 ^; 83 !; 22 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
binunion: $i > $i > $i ).
thf(func_def_2,type,
kpair: $i > $i > $i ).
thf(func_def_3,type,
breln1: $i > $i > $o ).
thf(func_def_4,type,
breln1unionE: $o ).
thf(func_def_18,type,
sK10: $o ).
thf(func_def_19,type,
vNOT: $o > $o ).
thf(f1,axiom,
( breln1unionE
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
| ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionE) ).
thf(f2,conjecture,
( breln1unionE
=> ! [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 ) @ ( binunion @ X1 @ X2 ) )
=> ! [X5: $o] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
=> X5 )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
=> X5 )
=> X5 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionEcases) ).
thf(f3,negated_conjecture,
~ ( breln1unionE
=> ! [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 ) @ ( binunion @ X1 @ X2 ) )
=> ! [X5: $o] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
=> X5 )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
=> X5 )
=> X5 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ( breln1unionE
=> ! [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 ) @ ( binunion @ X0 @ X2 ) )
=> ! [X5: $o] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ X0 )
=> X5 )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
=> X5 )
=> X5 ) ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f5,plain,
~ ( ( breln1unionE = $true )
=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X1 @ X0 )
= $true )
=> ! [X2: $i] :
( ( ( breln1 @ X1 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
=> ! [X4: $i] :
( ( ( in @ X4 @ X1 )
= $true )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X0 @ X2 ) )
= $true )
=> ! [X5: $o] :
( ( ( ( in @ ( kpair @ X3 @ X4 ) @ X0 )
= $true )
=> ( $true = X5 ) )
=> ( ( ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
= $true )
=> ( $true = X5 ) )
=> ( $true = X5 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
( breln1unionE
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
| ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ! [X1: $i,X0: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
=> ! [X2: $i] :
( ( ( breln1 @ X0 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ! [X4: $i] :
( ( ( in @ X4 @ X0 )
= $true )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
= $true )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true ) ) ) ) ) ) )
<=> ( breln1unionE = $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ? [X4: $i] :
( ? [X5: $o] :
( ( $true != X5 )
& ( ( $true = X5 )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
!= $true ) )
& ( ( $true = X5 )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X0 )
!= $true ) ) )
& ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X0 @ X2 ) )
= $true )
& ( ( in @ X4 @ X1 )
= $true ) )
& ( ( in @ X3 @ X1 )
= $true ) )
& ( ( breln1 @ X1 @ X2 )
= $true ) )
& ( ( breln1 @ X1 @ X0 )
= $true ) )
& ( breln1unionE = $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ( ( breln1 @ X1 @ X0 )
= $true )
& ? [X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ? [X4: $i] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X0 @ X2 ) )
= $true )
& ? [X5: $o] :
( ( ( $true = X5 )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
!= $true ) )
& ( ( $true = X5 )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X0 )
!= $true ) )
& ( $true != X5 ) )
& ( ( in @ X4 @ X1 )
= $true ) ) )
& ( ( breln1 @ X1 @ X2 )
= $true ) ) )
& ( breln1unionE = $true ) ),
inference(flattening,[],[f8]) ).
thf(f10,plain,
( ! [X1: $i,X0: $i] :
( ! [X2: $i] :
( ! [X3: $i] :
( ! [X4: $i] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
!= $true )
| ( ( in @ X4 @ X0 )
!= $true ) )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( ( breln1 @ X0 @ X2 )
!= $true ) )
| ( ( breln1 @ X0 @ X1 )
!= $true ) )
<=> ( breln1unionE = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f11,plain,
( ( breln1unionE = $true )
<=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
!= $true )
| ! [X2: $i] :
( ! [X3: $i] :
( ! [X4: $i] :
( ( ( in @ X4 @ X0 )
!= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
!= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true ) )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( ( breln1 @ X0 @ X2 )
!= $true ) ) ) ),
inference(flattening,[],[f10]) ).
thf(f12,plain,
( ( ( breln1unionE = $true )
| ? [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
& ? [X2: $i] :
( ? [X3: $i] :
( ? [X4: $i] :
( ( ( in @ X4 @ X0 )
= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
!= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
!= $true ) )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( breln1 @ X0 @ X2 )
= $true ) ) ) )
& ( ! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
!= $true )
| ! [X2: $i] :
( ! [X3: $i] :
( ! [X4: $i] :
( ( ( in @ X4 @ X0 )
!= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
!= $true )
| ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true ) )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( ( breln1 @ X0 @ X2 )
!= $true ) ) )
| ( breln1unionE != $true ) ) ),
inference(nnf_transformation,[],[f11]) ).
thf(f13,plain,
( ( ( breln1unionE = $true )
| ? [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
& ? [X2: $i] :
( ? [X3: $i] :
( ? [X4: $i] :
( ( ( in @ X4 @ X0 )
= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ X2 )
!= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
!= $true ) )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( breln1 @ X0 @ X2 )
= $true ) ) ) )
& ( ! [X5: $i,X6: $i] :
( ( ( breln1 @ X5 @ X6 )
!= $true )
| ! [X7: $i] :
( ! [X8: $i] :
( ! [X9: $i] :
( ( ( in @ X9 @ X5 )
!= $true )
| ( $true
= ( in @ ( kpair @ X8 @ X9 ) @ X7 ) )
| ( $true
!= ( in @ ( kpair @ X8 @ X9 ) @ ( binunion @ X6 @ X7 ) ) )
| ( ( in @ ( kpair @ X8 @ X9 ) @ X6 )
= $true ) )
| ( $true
!= ( in @ X8 @ X5 ) ) )
| ( ( breln1 @ X5 @ X7 )
!= $true ) ) )
| ( breln1unionE != $true ) ) ),
inference(rectify,[],[f12]) ).
thf(f14,plain,
( ( ( breln1unionE = $true )
| ( ( ( breln1 @ sK0 @ sK1 )
= $true )
& ( $true
= ( in @ sK4 @ sK0 ) )
& ( ( in @ ( kpair @ sK3 @ sK4 ) @ sK2 )
!= $true )
& ( ( in @ ( kpair @ sK3 @ sK4 ) @ ( binunion @ sK1 @ sK2 ) )
= $true )
& ( ( in @ ( kpair @ sK3 @ sK4 ) @ sK1 )
!= $true )
& ( ( in @ sK3 @ sK0 )
= $true )
& ( ( breln1 @ sK0 @ sK2 )
= $true ) ) )
& ( ! [X5: $i,X6: $i] :
( ( ( breln1 @ X5 @ X6 )
!= $true )
| ! [X7: $i] :
( ! [X8: $i] :
( ! [X9: $i] :
( ( ( in @ X9 @ X5 )
!= $true )
| ( $true
= ( in @ ( kpair @ X8 @ X9 ) @ X7 ) )
| ( $true
!= ( in @ ( kpair @ X8 @ X9 ) @ ( binunion @ X6 @ X7 ) ) )
| ( ( in @ ( kpair @ X8 @ X9 ) @ X6 )
= $true ) )
| ( $true
!= ( in @ X8 @ X5 ) ) )
| ( ( breln1 @ X5 @ X7 )
!= $true ) ) )
| ( breln1unionE != $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)],[f13]) ).
thf(f15,plain,
( ( ( breln1 @ sK6 @ sK5 )
= $true )
& ( ( in @ sK8 @ sK6 )
= $true )
& ( ( in @ ( kpair @ sK8 @ sK9 ) @ ( binunion @ sK5 @ sK7 ) )
= $true )
& ( ( sK10 = $true )
| ( $true
!= ( in @ ( kpair @ sK8 @ sK9 ) @ sK7 ) ) )
& ( ( sK10 = $true )
| ( $true
!= ( in @ ( kpair @ sK8 @ sK9 ) @ sK5 ) ) )
& ( sK10 != $true )
& ( ( in @ sK9 @ sK6 )
= $true )
& ( ( breln1 @ sK6 @ sK7 )
= $true )
& ( breln1unionE = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9,sK10]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7),skolemize(X3,sK8),skolemize(X4,sK9),skolemize(X5,sK10)],[f9]) ).
thf(f16,plain,
! [X8: $i,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( ( breln1 @ X5 @ X6 )
!= $true )
| ( ( in @ X9 @ X5 )
!= $true )
| ( $true
= ( in @ ( kpair @ X8 @ X9 ) @ X7 ) )
| ( $true
!= ( in @ ( kpair @ X8 @ X9 ) @ ( binunion @ X6 @ X7 ) ) )
| ( ( in @ ( kpair @ X8 @ X9 ) @ X6 )
= $true )
| ( $true
!= ( in @ X8 @ X5 ) )
| ( ( breln1 @ X5 @ X7 )
!= $true )
| ( breln1unionE != $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f24,plain,
breln1unionE = $true,
inference(cnf_transformation,[],[f15]) ).
thf(f25,plain,
( ( breln1 @ sK6 @ sK7 )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f26,plain,
( ( in @ sK9 @ sK6 )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f27,plain,
sK10 != $true,
inference(cnf_transformation,[],[f15]) ).
thf(f28,plain,
( ( sK10 = $true )
| ( $true
!= ( in @ ( kpair @ sK8 @ sK9 ) @ sK5 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f29,plain,
( ( $true
!= ( in @ ( kpair @ sK8 @ sK9 ) @ sK7 ) )
| ( sK10 = $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f30,plain,
( ( in @ ( kpair @ sK8 @ sK9 ) @ ( binunion @ sK5 @ sK7 ) )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f31,plain,
( ( in @ sK8 @ sK6 )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f32,plain,
( ( breln1 @ sK6 @ sK5 )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f42,plain,
! [X8: $i,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( $true
= ( in @ ( kpair @ X8 @ X9 ) @ X7 ) )
| ( ( breln1 @ X5 @ X7 )
!= $true )
| ( ( breln1 @ X5 @ X6 )
!= $true )
| ( ( in @ X9 @ X5 )
!= $true )
| ( $true
!= ( in @ X8 @ X5 ) )
| ( $true
!= ( in @ ( kpair @ X8 @ X9 ) @ ( binunion @ X6 @ X7 ) ) )
| ( $true != $true )
| ( ( in @ ( kpair @ X8 @ X9 ) @ X6 )
= $true ) ),
inference(definition_unfolding,[],[f16,f24]) ).
thf(f43,plain,
! [X8: $i,X6: $i,X9: $i,X7: $i,X5: $i] :
( ( $true
!= ( in @ ( kpair @ X8 @ X9 ) @ ( binunion @ X6 @ X7 ) ) )
| ( ( breln1 @ X5 @ X7 )
!= $true )
| ( ( in @ X9 @ X5 )
!= $true )
| ( $true
= ( in @ ( kpair @ X8 @ X9 ) @ X7 ) )
| ( ( breln1 @ X5 @ X6 )
!= $true )
| ( ( in @ ( kpair @ X8 @ X9 ) @ X6 )
= $true )
| ( $true
!= ( in @ X8 @ X5 ) ) ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f44,plain,
( $true
!= ( in @ ( kpair @ sK8 @ sK9 ) @ sK5 ) ),
inference(forward_subsumption_resolution,[],[f28,f27]) ).
thf(f45,plain,
( $true
!= ( in @ ( kpair @ sK8 @ sK9 ) @ sK7 ) ),
inference(forward_subsumption_resolution,[],[f29,f27]) ).
thf(f46,plain,
! [X0: $i] :
( ( ( in @ sK9 @ X0 )
!= $true )
| ( $true
!= ( breln1 @ X0 @ sK5 ) )
| ( ( in @ sK8 @ X0 )
!= $true )
| ( $true != $true )
| ( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ sK5 ) )
| ( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ sK7 ) )
| ( ( breln1 @ X0 @ sK7 )
!= $true ) ),
inference(constrained_superposition,[],[f43,f30]) ).
thf(f47,plain,
! [X0: $i] :
( ( ( in @ sK8 @ X0 )
!= $true )
| ( ( in @ sK9 @ X0 )
!= $true )
| ( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ sK7 ) )
| ( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ sK5 ) )
| ( $true
!= ( breln1 @ X0 @ sK5 ) )
| ( ( breln1 @ X0 @ sK7 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f48,plain,
! [X0: $i] :
( ( ( in @ sK9 @ X0 )
!= $true )
| ( ( breln1 @ X0 @ sK7 )
!= $true )
| ( $true
!= ( breln1 @ X0 @ sK5 ) )
| ( $true
= ( in @ ( kpair @ sK8 @ sK9 ) @ sK5 ) )
| ( ( in @ sK8 @ X0 )
!= $true ) ),
inference(forward_subsumption_resolution,[],[f47,f45]) ).
thf(f49,plain,
! [X0: $i] :
( ( $true
!= ( breln1 @ X0 @ sK5 ) )
| ( ( in @ sK9 @ X0 )
!= $true )
| ( ( breln1 @ X0 @ sK7 )
!= $true )
| ( ( in @ sK8 @ X0 )
!= $true ) ),
inference(forward_subsumption_resolution,[],[f48,f44]) ).
thf(f50,plain,
( ( ( in @ sK9 @ sK6 )
!= $true )
| ( ( in @ sK8 @ sK6 )
!= $true )
| ( $true != $true )
| ( ( breln1 @ sK6 @ sK7 )
!= $true ) ),
inference(constrained_superposition,[],[f49,f32]) ).
thf(f51,plain,
( ( ( in @ sK9 @ sK6 )
!= $true )
| ( ( breln1 @ sK6 @ sK7 )
!= $true )
| ( ( in @ sK8 @ sK6 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f52,plain,
( ( ( in @ sK8 @ sK6 )
!= $true )
| ( ( breln1 @ sK6 @ sK7 )
!= $true ) ),
inference(forward_subsumption_resolution,[],[f51,f26]) ).
thf(f53,plain,
( ( breln1 @ sK6 @ sK7 )
!= $true ),
inference(forward_subsumption_resolution,[],[f52,f31]) ).
thf(f54,plain,
$false,
inference(forward_subsumption_resolution,[],[f53,f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU787^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.20 % Computer : n014.cluster.edu
% 0.12/0.20 % Model : x86_64 x86_64
% 0.12/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.20 % Memory : 8046.5625MB
% 0.12/0.20 % OS : Linux 6.8.0-71-generic
% 0.12/0.20 % CPULimit : 300
% 0.12/0.20 % WCLimit : 300
% 0.12/0.20 % DateTime : Tue Sep 29 14:28:45 UTC 2026
% 0.12/0.20 % CPUTime :
% 0.12/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.24 Running higher-order theorem proving
% 0.12/0.25 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.30 % (2744441)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.30 % (2744447)lrs+10_16_si=on:nwc=1.5:random_seed=1594115140:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.30 % (2744451)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=963430881:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.30 % (2744449)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=2846923974: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.30 % (2744448)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1740309111:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.30 % (2744451) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2744441-2744451"...
% 0.22/0.30 % (2744452)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.30 % (2744452)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.22/0.30 % (2744448)Refutation not found, incomplete strategy
% 0.22/0.30 % (2744448)------------------------------
% 0.22/0.30 % (2744448)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (2744448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (2744448)CaDiCaL version: 2.1.3
% 0.22/0.30 % (2744448)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (2744448)Time elapsed: 0.002 s
% 0.22/0.30 % (2744448)Peak memory usage: 12 MB
% 0.22/0.30 % (2744448)Instructions burned: 3 (million)
% 0.22/0.30 % (2744447) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2744441-2744447"...
% 0.22/0.30 % (2744451)...printing done.
% 0.22/0.30 % (2744448)------------------------------
% 0.22/0.30 % (2744448)------------------------------
% 0.22/0.30 % (2744451)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.30 % (2744451)------------------------------
% 0.22/0.30 % (2744451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (2744451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (2744451)CaDiCaL version: 2.1.3
% 0.22/0.30 % (2744451)Termination reason: Refutation
% 0.22/0.30 % (2744451)Time elapsed: 0.005 s
% 0.22/0.30 % (2744451)Peak memory usage: 12 MB
% 0.22/0.30 % (2744451)Instructions burned: 9 (million)
% 0.22/0.30 % (2744441)Success in time 0.041 s
% 0.22/0.30 % Vampire exiting
%------------------------------------------------------------------------------