%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU528^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 : 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:32:19 AM UTC 2026
% Result : Theorem 0.08s 0.23s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 135 ( 44 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 145 ( 17 ~; 3 |; 4 &; 94 @)
% ( 0 <=>; 19 =>; 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 : 18 ( 14 usr; 7 con; 0-4 aty)
% ( 8 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 36 ( 10 ^; 24 !; 2 ?; 36 :)
% 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,
uniqinunit: $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $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,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
vNOT: $o > $o ).
thf(f1,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(f2,conjecture,
( uniqinunit
=> ! [X0: $i,X1: $i] :
( ( X0 != X1 )
=> ~ ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinsingleton) ).
thf(f3,negated_conjecture,
~ ( uniqinunit
=> ! [X0: $i,X1: $i] :
( ( X0 != X1 )
=> ~ ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( uniqinunit
=> ! [X0: $i,X1: $i] :
( ( X0 != X1 )
=> ~ ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( uniqinunit = $true )
=> ! [X0: $i,X1: $i] :
( ( X0 != X1 )
=> ( ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) )
!= $true ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ( ( uniqinunit = $true )
=> ! [X0: $i,X1: $i] :
( ( X0 != X1 )
=> ( ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) )
!= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( setadjoin @ X0 @ emptyset ) )
= $true )
& ( X0 != X1 ) )
& ( uniqinunit = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f10,plain,
( ( $true
= ( in @ sK1 @ ( setadjoin @ sK0 @ emptyset ) ) )
& ( sK0 != sK1 )
& ( uniqinunit = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f9]) ).
thf(f11,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f12,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f10]) ).
thf(f14,plain,
( $true
= ( in @ sK1 @ ( setadjoin @ sK0 @ emptyset ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f17,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f11,f12]) ).
thf(f18,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f17]) ).
thf(f19,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f18]) ).
thf(f20,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f19]) ).
thf(f21,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f20]) ).
thf(f22,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f22]) ).
thf(f25,plain,
( ( $true = $false )
| ( sK0 = sK1 ) ),
inference(constrained_superposition,[],[f14,f23]) ).
thf(f26,plain,
sK0 = sK1,
inference(trivial_inequality_removal,[],[f25]) ).
thf(f28,plain,
$false,
inference(forward_subsumption_resolution,[],[f26,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU528^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 : n006.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:48:10 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.19 Running first-order model finding
% 0.08/0.19 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.23 % (744798)Will run a generic schedule for satisfiability detection.
% 0.08/0.23 % (744808)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=737266684:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.23 % (744808) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-744798-744808"...
% 0.08/0.23 % (744808)...printing done.
% 0.08/0.23 % (744808)Refutation found. Thanks to Tanya!
% 0.08/0.23 % SZS status Theorem for theBenchmark
% 0.08/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.23 % (744808)------------------------------
% 0.08/0.23 % (744808)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.23 % (744808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.23 % (744808)CaDiCaL version: 2.1.3
% 0.08/0.23 % (744808)Termination reason: Refutation
% 0.08/0.23 % (744808)Time elapsed: 0.001 s
% 0.08/0.23 % (744808)Peak memory usage: 12 MB
% 0.08/0.23 % (744808)Instructions burned: 2 (million)
% 0.08/0.23 % (744798)Success in time 0.029 s
% 0.08/0.23 % Vampire exiting
%------------------------------------------------------------------------------