%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU546^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 : 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:30:00 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 187 ( 73 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 182 ( 19 ~; 18 |; 16 &; 94 @)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 20 usr; 6 con; 0-4 aty)
% ( 7 !!; 4 ??; 0 @@+; 0 @@-)
% Number of variables : 64 ( 27 ^; 27 !; 10 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
exu: ( $i > $o ) > $o ).
thf(func_def_2,type,
exuI1: $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_7,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vAND: $o > $o > $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vIMP: $o > $o > $o ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
sK0: $i > $o ).
thf(func_def_16,type,
sK2: $i > ( $i > $o ) > $i ).
thf(func_def_17,type,
sK3: $i > $o ).
thf(func_def_19,type,
vNOT: $o > $o ).
thf(func_def_20,type,
sK5: ( $i > $o ) > $i ).
thf(func_def_21,type,
sK6: $i > $i ).
thf(func_def_22,type,
sK7: ( $i > $o ) > $i ).
thf(f1,axiom,
( exu
= ( ^ [X0: $i > $o] :
? [X1: $i] :
( ( X0 @ X1 )
& ! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 = X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exu) ).
thf(f3,conjecture,
( exuI1
=> ! [X0: $i > $o] :
( ? [X1: $i] :
! [X2: $i] :
( ( X2 = X1 )
<=> ( X0 @ X2 ) )
=> ( exu
@ ^ [X1: $i] : ( X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuI2) ).
thf(f4,negated_conjecture,
~ ( exuI1
=> ! [X0: $i > $o] :
( ? [X1: $i] :
! [X2: $i] :
( ( X2 = X1 )
<=> ( X0 @ X2 ) )
=> ( exu
@ ^ [X1: $i] : ( X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f7,plain,
( exu
= ( ^ [X0: $i > $o] :
? [X1: $i] :
( ( X0 @ X1 )
& ! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 = X2 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( exu
= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( exuI1
=> ! [X0: $i > $o] :
( ? [X1: $i] :
! [X2: $i] :
( ( X2 = X1 )
<=> ( X0 @ X2 ) )
=> ( exu
@ ^ [X3: $i] : ( X0 @ X3 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( exuI1 = $true )
=> ! [X0: $i > $o] :
( ? [X1: $i] :
! [X2: $i] :
( ( ( X0 @ X2 )
= $true )
<=> ( X1 = X2 ) )
=> ( ( exu
@ ^ [Y0: $i] : ( X0 @ Y0 ) )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f12,plain,
( ? [X0: $i > $o] :
( ( ( exu
@ ^ [Y0: $i] : ( X0 @ Y0 ) )
!= $true )
& ? [X1: $i] :
! [X2: $i] :
( ( ( X0 @ X2 )
= $true )
<=> ( X1 = X2 ) ) )
& ( exuI1 = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f13,plain,
( ? [X0: $i > $o] :
( ( ( exu
@ ^ [Y0: $i] : ( X0 @ Y0 ) )
!= $true )
& ? [X1: $i] :
! [X2: $i] :
( ( ( ( X0 @ X2 )
= $true )
| ( X1 != X2 ) )
& ( ( X1 = X2 )
| ( ( X0 @ X2 )
!= $true ) ) ) )
& ( exuI1 = $true ) ),
inference(nnf_transformation,[],[f12]) ).
thf(f14,plain,
( ( $true
!= ( exu
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) )
& ! [X2: $i] :
( ( ( $true
= ( sK0 @ X2 ) )
| ( sK1 != X2 ) )
& ( ( sK1 = X2 )
| ( $true
!= ( sK0 @ X2 ) ) ) )
& ( exuI1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f13]) ).
thf(f18,plain,
( exu
= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f20,plain,
! [X2: $i] :
( ( $true
!= ( sK0 @ X2 ) )
| ( sK1 = X2 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f21,plain,
! [X2: $i] :
( ( $true
= ( sK0 @ X2 ) )
| ( sK1 != X2 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f22,plain,
( $true
!= ( exu
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f30,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) )
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ),
inference(definition_unfolding,[],[f22,f18]) ).
thf(f36,plain,
( $true
= ( sK0 @ sK1 ) ),
inference(equality_resolution,[],[f21]) ).
thf(f47,plain,
( ( ?? @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
=> ( Y0 = Y1 ) ) )
& ( sK0 @ Y0 ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f48,plain,
! [X1: $i] :
( $false
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
=> ( Y0 = Y1 ) ) )
& ( sK0 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f47]) ).
thf(f49,plain,
! [X1: $i] :
( $false
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
=> ( X1 = Y0 ) ) )
& ( sK0 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f50,plain,
! [X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
=> ( X1 = Y0 ) ) ) )
| ( ( sK0 @ X1 )
= $false ) ),
inference(and_proxy_clausification,[],[f49]) ).
thf(f51,plain,
! [X1: $i] :
( ( ( sK0 @ X1 )
= $false )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
=> ( X1 = Y0 ) )
@ ( sK6 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f50]) ).
thf(f52,plain,
! [X1: $i] :
( ( $false
= ( ( sK0 @ ( sK6 @ X1 ) )
=> ( X1
= ( sK6 @ X1 ) ) ) )
| ( ( sK0 @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f51]) ).
thf(f53,plain,
! [X1: $i] :
( ( ( sK0 @ X1 )
= $false )
| ( $false
= ( X1
= ( sK6 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f52]) ).
thf(f54,plain,
! [X1: $i] :
( ( ( sK0 @ ( sK6 @ X1 ) )
= $true )
| ( ( sK0 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f52]) ).
thf(f55,plain,
! [X1: $i] :
( ( ( sK6 @ X1 )
!= X1 )
| ( ( sK0 @ X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f53]) ).
thf(f67,plain,
! [X0: $i] :
( ( $false
= ( sK0 @ X0 ) )
| ( ( sK6 @ X0 )
= sK1 )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f20,f54]) ).
thf(f68,plain,
! [X0: $i] :
( ( ( sK6 @ X0 )
= sK1 )
| ( $false
= ( sK0 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f67]) ).
thf(f70,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( $false
= ( sK0 @ X0 ) )
| ( $false
= ( sK0 @ X0 ) ) ),
inference(constrained_superposition,[],[f55,f68]) ).
thf(f72,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( $false
= ( sK0 @ X0 ) ) ),
inference(duplicate_literal_removal,[],[f70]) ).
thf(f74,plain,
( $false
= ( sK0 @ sK1 ) ),
inference(equality_resolution,[],[f72]) ).
thf(f76,plain,
$false = $true,
inference(forward_demodulation,[],[f74,f36]) ).
thf(f77,plain,
$false,
inference(trivial_inequality_removal,[],[f76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU546^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.07/0.19 % Computer : n006.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 13:49:10 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/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.20/0.28 % (748187)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (748192)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4005603201:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (748192) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-748187-748192"...
% 0.20/0.28 % (748192)...printing done.
% 0.20/0.28 % (748192)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (748192)------------------------------
% 0.20/0.28 % (748192)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (748192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (748192)CaDiCaL version: 2.1.3
% 0.20/0.28 % (748192)Termination reason: Refutation
% 0.20/0.28 % (748192)Time elapsed: 0.002 s
% 0.20/0.28 % (748192)Peak memory usage: 12 MB
% 0.20/0.28 % (748192)Instructions burned: 4 (million)
% 0.20/0.28 % (748187)Success in time 0.028 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------