%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU516^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:16 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 205 ( 72 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 245 ( 11 ~; 25 |; 9 &; 175 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 7 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 66 ( 18 ^; 42 !; 6 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
setadjoin: $i > $i > $i ).
thf(func_def_2,type,
setadjoinAx: $o ).
thf(func_def_4,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_5,type,
vIFF: $o > $o > $o ).
thf(func_def_6,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vOR: $o > $o > $o ).
thf(func_def_10,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vNOT: $o > $o ).
thf(f1,axiom,
( setadjoinAx
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
<=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinAx) ).
thf(f2,conjecture,
( setadjoinAx
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinOr) ).
thf(f3,negated_conjecture,
~ ( setadjoinAx
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( setadjoinAx
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
<=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( setadjoinAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( setadjoinAx
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( setadjoinAx = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true )
=> ( ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( X0 != X2 )
& ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true ) )
& ( setadjoinAx = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( X0 != X2 )
& ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true ) )
& ( setadjoinAx = $true ) ),
inference(flattening,[],[f8]) ).
thf(f10,plain,
( ( $true
!= ( in @ sK2 @ sK1 ) )
& ( sK0 != sK2 )
& ( $true
= ( in @ sK2 @ ( setadjoin @ sK0 @ sK1 ) ) )
& ( setadjoinAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f9]) ).
thf(f11,plain,
( setadjoinAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f12,plain,
setadjoinAx = $true,
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
( $true
= ( in @ sK2 @ ( setadjoin @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f14,plain,
sK0 != sK2,
inference(cnf_transformation,[],[f10]) ).
thf(f15,plain,
( $true
!= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f18,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f11,f12]) ).
thf(f19,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f18]) ).
thf(f20,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
= ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
= ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f20]) ).
thf(f22,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
= ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
= ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f24,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ),
inference(iff_proxy_clausification,[],[f24]) ).
thf(f27,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $true
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(iff_proxy_clausification,[],[f25]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X2 ) )
| ( $true
= ( X3 = X1 ) ) ),
inference(or_proxy_clausification,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X2 ) )
| ( X1 = X3 ) ),
inference(equality_proxy_clausification,[],[f28]) ).
thf(f48,plain,
( ( $true = $false )
| ( $true
= ( in @ sK2 @ sK1 ) )
| ( sK0 = sK2 ) ),
inference(constrained_superposition,[],[f13,f29]) ).
thf(f50,plain,
( ( $true
= ( in @ sK2 @ sK1 ) )
| ( sK0 = sK2 ) ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f53,plain,
sK0 = sK2,
inference(forward_subsumption_resolution,[],[f50,f15]) ).
thf(f55,plain,
$false,
inference(forward_subsumption_resolution,[],[f53,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU516^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n005.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:47:31 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.27 % (1691551)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1691563)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1404420000:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (1691563)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1691563) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1691551-1691563"...
% 0.20/0.27 % (1691563)...printing done.
% 0.20/0.27 % (1691563)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1691563)------------------------------
% 0.20/0.27 % (1691563)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1691563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1691563)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1691563)Termination reason: Refutation
% 0.20/0.27 % (1691563)Time elapsed: 0.002 s
% 0.20/0.27 % (1691563)Peak memory usage: 12 MB
% 0.20/0.27 % (1691563)Instructions burned: 4 (million)
% 0.20/0.27 % (1691551)Success in time 0.031 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------