%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU631^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:32:45 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 36 unt; 0 typ; 0 def)
% Number of atoms : 393 ( 87 equ; 0 cnn)
% Maximal formula atoms : 5 ( 8 avg)
% Number of connectives : 660 ( 24 ~; 15 |; 39 &; 529 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 26 usr; 11 con; 0-4 aty)
% ( 15 !!; 19 ??; 0 @@+; 0 @@-)
% Number of variables : 136 ( 78 ^; 43 !; 15 ?; 136 :)
% 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,
powerset: $i > $i ).
thf(func_def_4,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_5,type,
dsetconstrER: $o ).
thf(func_def_7,type,
binunion: $i > $i > $i ).
thf(func_def_8,type,
kpair: $i > $i > $i ).
thf(func_def_9,type,
cartprod: $i > $i > $i ).
thf(func_def_10,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_11,type,
vIMP: $o > $o > $o ).
thf(func_def_12,type,
db2:
!>[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,
db1:
!>[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,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
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,
( cartprod
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ X0 @ X1 ) ) )
@ ^ [X2: $i] :
? [X3: $i] :
( ? [X4: $i] :
( ( X2
= ( kpair @ X3 @ X4 ) )
& ( in @ X4 @ X1 ) )
& ( in @ X3 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprod) ).
thf(f4,conjecture,
( dsetconstrER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( cartprod @ X0 @ X1 ) )
=> ? [X3: $i] :
( ? [X4: $i] :
( ( X2
= ( kpair @ X3 @ X4 ) )
& ( in @ X4 @ X1 ) )
& ( in @ X3 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodmempair1) ).
thf(f5,negated_conjecture,
~ ( dsetconstrER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( cartprod @ X0 @ X1 ) )
=> ? [X3: $i] :
( ? [X4: $i] :
( ( X2
= ( kpair @ X3 @ X4 ) )
& ( in @ X4 @ X1 ) )
& ( in @ X3 @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f9,plain,
( cartprod
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ X0 @ X1 ) ) )
@ ^ [X2: $i] :
? [X3: $i] :
( ? [X4: $i] :
( ( X2
= ( kpair @ X3 @ X4 ) )
& ( in @ X4 @ X1 ) )
& ( in @ X3 @ X0 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f10,plain,
( cartprod
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ Y0 @ Y1 ) ) )
@ ^ [Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
& ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y1 )
& ( ( kpair @ Y3 @ Y4 )
= Y2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
~ ( dsetconstrER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( cartprod @ X0 @ X1 ) )
=> ? [X3: $i] :
( ? [X4: $i] :
( ( X2
= ( kpair @ X3 @ X4 ) )
& ( in @ X4 @ X1 ) )
& ( in @ X3 @ X0 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f12,plain,
~ ( ( dsetconstrER = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( cartprod @ X0 @ X1 ) )
= $true )
=> ? [X3: $i] :
( ? [X4: $i] :
( ( ( kpair @ X3 @ X4 )
= X2 )
& ( ( in @ X4 @ X1 )
= $true ) )
& ( ( in @ X3 @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ! [X4: $i] :
( ( ( kpair @ X3 @ X4 )
!= X2 )
| ( ( in @ X4 @ X1 )
!= $true ) )
| ( ( in @ X3 @ X0 )
!= $true ) )
& ( ( in @ X2 @ ( cartprod @ X0 @ X1 ) )
= $true ) )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f14,plain,
( ! [X3: $i] :
( ! [X4: $i] :
( ( ( kpair @ X3 @ X4 )
!= sK2 )
| ( $true
!= ( in @ X4 @ sK1 ) ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) )
& ( $true
= ( in @ sK2 @ ( cartprod @ sK0 @ sK1 ) ) )
& ( dsetconstrER = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f13]) ).
thf(f15,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f16,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
( cartprod
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ Y0 @ Y1 ) ) )
@ ^ [Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
& ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y1 )
& ( ( kpair @ Y3 @ Y4 )
= Y2 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f18,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f14]) ).
thf(f19,plain,
( $true
= ( in @ sK2 @ ( cartprod @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f20,plain,
! [X3: $i,X4: $i] :
( ( ( kpair @ X3 @ X4 )
!= sK2 )
| ( $true
!= ( in @ X4 @ sK1 ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f23,plain,
( cartprod
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ Y0 @ Y1 ) ) )
@ ^ [Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
& ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y1 )
& ( ( ^ [Y5: $i,Y6: $i] : ( setadjoin @ ( setadjoin @ Y5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y5 @ ( setadjoin @ Y6 @ emptyset ) ) @ emptyset ) )
@ Y3
@ Y4 )
= Y2 ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f17,f16]) ).
thf(f24,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f18]) ).
thf(f25,plain,
! [X3: $i,X4: $i] :
( ( sK2
!= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X3
@ X4 ) )
| ( $true
!= ( in @ X4 @ sK1 ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) ),
inference(definition_unfolding,[],[f20,f16]) ).
thf(f26,plain,
( $true
= ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ Y0 @ Y1 ) ) )
@ ^ [Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
& ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y1 )
& ( ( ^ [Y5: $i,Y6: $i] : ( setadjoin @ ( setadjoin @ Y5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y5 @ ( setadjoin @ Y6 @ emptyset ) ) @ emptyset ) )
@ Y3
@ Y4 )
= Y2 ) ) ) ) ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f19,f23]) ).
thf(f27,plain,
( $true
= ( in @ sK2
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) )
@ ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= Y0 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
! [X3: $i,X4: $i] :
( ( sK2
!= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) )
| ( $true
!= ( in @ X4 @ sK1 ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f29,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f30,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f33,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f35,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f34]) ).
thf(f50,plain,
( ( $true = $false )
| ( $true
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= Y0 ) ) ) ) )
@ sK2 ) ) ),
inference(constrained_superposition,[],[f35,f27]) ).
thf(f51,plain,
( $true
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= Y0 ) ) ) ) )
@ sK2 ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f52,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
= sK2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f51]) ).
thf(f53,plain,
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
= sK2 ) ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f52]) ).
thf(f54,plain,
( $true
= ( ( in @ sK3 @ sK0 )
& ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= sK2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f54]) ).
thf(f56,plain,
( $true
= ( in @ sK3 @ sK0 ) ),
inference(and_proxy_clausification,[],[f54]) ).
thf(f57,plain,
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= sK2 ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f55]) ).
thf(f58,plain,
( $true
= ( ( in @ sK4 @ sK1 )
& ( ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK4 @ emptyset ) ) @ emptyset ) )
= sK2 ) ) ),
inference(beta-eta_normalization,[],[f57]) ).
thf(f59,plain,
( $true
= ( ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK4 @ emptyset ) ) @ emptyset ) )
= sK2 ) ),
inference(and_proxy_clausification,[],[f58]) ).
thf(f60,plain,
( $true
= ( in @ sK4 @ sK1 ) ),
inference(and_proxy_clausification,[],[f58]) ).
thf(f61,plain,
( sK2
= ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK4 @ emptyset ) ) @ emptyset ) ) ),
inference(equality_proxy_clausification,[],[f59]) ).
thf(f74,plain,
( ( sK2 != sK2 )
| ( $true
!= ( in @ sK4 @ sK1 ) )
| ( $true
!= ( in @ sK3 @ sK0 ) ) ),
inference(constrained_superposition,[],[f28,f61]) ).
thf(f75,plain,
( ( $true
!= ( in @ sK4 @ sK1 ) )
| ( $true
!= ( in @ sK3 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f76,plain,
( $true
!= ( in @ sK3 @ sK0 ) ),
inference(forward_subsumption_resolution,[],[f75,f60]) ).
thf(f90,plain,
$false,
inference(forward_subsumption_resolution,[],[f76,f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU631^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n019.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 13:59:33 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.24 % (813601)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (813607)% WARNING: option uhcvi not known.
% 0.08/0.24 % (813607)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=155679445:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.24 % (813607)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.24 % (813607)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.24 % (813607) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-813601-813607"...
% 0.08/0.24 % (813607)...printing done.
% 0.08/0.24 % (813607)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (813607)------------------------------
% 0.08/0.24 % (813607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (813607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (813607)CaDiCaL version: 2.1.3
% 0.08/0.24 % (813607)Termination reason: Refutation
% 0.08/0.24 % (813607)Time elapsed: 0.004 s
% 0.08/0.24 % (813607)Peak memory usage: 12 MB
% 0.08/0.24 % (813607)Instructions burned: 10 (million)
% 0.08/0.24 % (813601)Success in time 0.031 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------