%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU514^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 : n012.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:15 AM UTC 2026
% Result : Theorem 0.09s 0.17s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 168 ( 54 equ; 0 cnn)
% Maximal formula atoms : 3 ( 6 avg)
% Number of connectives : 215 ( 7 ~; 16 |; 4 &; 163 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 60 ( 18 ^; 39 !; 3 ?; 60 :)
% 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 @ X1 )
=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIR) ).
thf(f3,negated_conjecture,
~ ( setadjoinAx
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ),
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 @ X1 )
=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( setadjoinAx = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X1 )
= $true ) )
& ( setadjoinAx = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f9,plain,
( ( $true
!= ( in @ sK2 @ ( setadjoin @ sK0 @ sK1 ) ) )
& ( $true
= ( in @ sK2 @ sK1 ) )
& ( setadjoinAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f8]) ).
thf(f10,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(f11,plain,
setadjoinAx = $true,
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( $true
= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( $true
!= ( in @ sK2 @ ( setadjoin @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f10,f11]) ).
thf(f17,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,[],[f16]) ).
thf(f18,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
= ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f17]) ).
thf(f19,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,[],[f18]) ).
thf(f20,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
= ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,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,[],[f20]) ).
thf(f22,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ),
inference(iff_proxy_clausification,[],[f22]) ).
thf(f24,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $false
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(iff_proxy_clausification,[],[f23]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $false
= ( in @ X1 @ X2 ) ) ),
inference(or_proxy_clausification,[],[f24]) ).
thf(f33,plain,
( ( $true != $true )
| ( ( in @ sK2 @ sK1 )
= $false ) ),
inference(constrained_superposition,[],[f13,f28]) ).
thf(f34,plain,
( ( in @ sK2 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f36,plain,
$true = $false,
inference(constrained_superposition,[],[f12,f34]) ).
thf(f37,plain,
$false,
inference(trivial_inequality_removal,[],[f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU514^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:47:04 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.12 Running first-order model finding
% 0.09/0.12 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.09/0.17 % (126116)Will run a generic schedule for satisfiability detection.
% 0.09/0.17 % (126133)% WARNING: option uhcvi not known.
% 0.09/0.17 % (126136)dis+10_1_sil=32000:sp=arity:random_seed=2038836324:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.17 % (126134)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1056465528:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.17 % (126132)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3516234572_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.17 % (126133)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2728445299:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.17 % (126137)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2315592817:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.17 % (126138)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2442666498:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.17 % (126133)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.17 % (126139)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3247344300:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.17 % (126137)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.17 % Exception at run slice level
% 0.09/0.17 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.17 % (126133)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.09/0.17 % (126139) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-126116-126139"...
% 0.09/0.17 % (126134) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-126116-126134"...
% 0.09/0.17 % (126137) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-126116-126137"...
% 0.09/0.17 % (126136) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-126116-126136"...
% 0.09/0.17 % (126138) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-126116-126138"...
% 0.09/0.17 % (126133) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-126116-126133"...
% 0.09/0.17 % (126139)...printing done.
% 0.09/0.17 % (126134)...printing done.
% 0.09/0.17 % (126137)...printing done.
% 0.09/0.17 % (126136)...printing done.
% 0.09/0.17 % (126138)...printing done.
% 0.09/0.17 % (126133)...printing done.
% 0.09/0.17 % (126139)Refutation found. Thanks to Tanya!
% 0.09/0.17 % SZS status Theorem for theBenchmark
% 0.09/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.17 % (126139)------------------------------
% 0.09/0.17 % (126139)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (126139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (126139)CaDiCaL version: 2.1.3
% 0.09/0.17 % (126139)Termination reason: Refutation
% 0.09/0.17 % (126139)Time elapsed: 0.001 s
% 0.09/0.17 % (126139)Peak memory usage: 12 MB
% 0.09/0.17 % (126139)Instructions burned: 3 (million)
% 0.09/0.17 % (126116)Success in time 0.038 s
% 0.09/0.17 % Vampire exiting
%------------------------------------------------------------------------------