%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU641^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:48 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 25 unt; 0 typ; 0 def)
% Number of atoms : 192 ( 62 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 208 ( 7 ~; 3 |; 9 &; 152 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 15 usr; 8 con; 0-4 aty)
% ( 16 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 56 ( 20 ^; 32 !; 4 ?; 56 :)
% 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,
setadjoinIL: $o ).
thf(func_def_5,type,
uniqinunit: $o ).
thf(func_def_6,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
vIMP: $o > $o > $o ).
thf(func_def_11,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(f1,axiom,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f2,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(f3,conjecture,
( setadjoinIL
=> ( uniqinunit
=> ! [X0: $i,X1: $i] :
( ( ( setadjoin @ X0 @ emptyset )
= ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletonsuniq) ).
thf(f4,negated_conjecture,
~ ( setadjoinIL
=> ( uniqinunit
=> ! [X0: $i,X1: $i] :
( ( ( setadjoin @ X0 @ emptyset )
= ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( setadjoinIL
=> ( uniqinunit
=> ! [X0: $i,X1: $i] :
( ( ( setadjoin @ X0 @ emptyset )
= ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( setadjoinIL = $true )
=> ( ( uniqinunit = $true )
=> ! [X0: $i,X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X0 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i] :
( ( X0 != X1 )
& ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X0 @ emptyset ) ) )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i] :
( ( X0 != X1 )
& ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X0 @ emptyset ) ) )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( sK0 != sK1 )
& ( ( setadjoin @ sK1 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) )
& ( uniqinunit = $true )
& ( setadjoinIL = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
thf(f14,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( ( setadjoin @ sK1 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f14,f16]) ).
thf(f23,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f31,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X2: $i,X1: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f34,plain,
( $true
= ( in @ sK1 @ ( setadjoin @ sK0 @ emptyset ) ) ),
inference(constrained_superposition,[],[f33,f18]) ).
thf(f37,plain,
( ( $true = $false )
| ( sK0 = sK1 ) ),
inference(constrained_superposition,[],[f29,f34]) ).
thf(f38,plain,
sK0 = sK1,
inference(trivial_inequality_removal,[],[f37]) ).
thf(f40,plain,
$false,
inference(forward_subsumption_resolution,[],[f38,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU641^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.09/0.19 % Computer : n019.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 14:01:33 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.19/0.27 % (815973)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (815982)% WARNING: option uhcvi not known.
% 0.19/0.27 % (815982)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1957116183:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (815982)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (815982)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.27 % (815982) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-815973-815982"...
% 0.19/0.27 % (815982)...printing done.
% 0.19/0.27 % (815982)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (815982)------------------------------
% 0.19/0.27 % (815982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (815982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (815982)CaDiCaL version: 2.1.3
% 0.19/0.27 % (815982)Termination reason: Refutation
% 0.19/0.27 % (815982)Time elapsed: 0.002 s
% 0.19/0.27 % (815982)Peak memory usage: 12 MB
% 0.19/0.27 % (815982)Instructions burned: 3 (million)
% 0.19/0.27 % (815973)Success in time 0.032 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------