%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU799^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 : n013.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:33:27 AM UTC 2026
% Result : Theorem 0.24s 0.30s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 162 ( 34 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 268 ( 6 ~; 2 |; 4 &; 222 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 17 usr; 7 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 75 ( 39 ^; 33 !; 3 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrEL: $o ).
thf(func_def_4,type,
funcSet: $i > $i > $i ).
thf(func_def_5,type,
injective: $i > $i > $i > $o ).
thf(func_def_6,type,
injFuncSet: $i > $i > $i ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vIMP: $o > $o > $o ).
thf(func_def_9,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrEL
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrEL) ).
thf(f2,axiom,
( injFuncSet
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( funcSet @ X0 @ X1 )
@ ^ [X2: $i] : ( injective @ X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',injFuncSet) ).
thf(f3,conjecture,
( dsetconstrEL
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( injFuncSet @ X0 @ X1 ) )
=> ( in @ X2 @ ( funcSet @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',injFuncSetFuncIn) ).
thf(f4,negated_conjecture,
~ ( dsetconstrEL
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( injFuncSet @ X0 @ X1 ) )
=> ( in @ X2 @ ( funcSet @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( dsetconstrEL
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( injFuncSet
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( funcSet @ X0 @ X1 )
@ ^ [X2: $i] : ( injective @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( injFuncSet
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] : ( injective @ Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( dsetconstrEL
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( injFuncSet @ X0 @ X1 ) )
=> ( in @ X2 @ ( funcSet @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( dsetconstrEL = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( injFuncSet @ X0 @ X1 ) )
= $true )
=> ( ( in @ X2 @ ( funcSet @ X0 @ X1 ) )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( funcSet @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ ( injFuncSet @ X0 @ X1 ) )
= $true ) )
& ( dsetconstrEL = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ( $true
!= ( in @ sK2 @ ( funcSet @ sK0 @ sK1 ) ) )
& ( $true
= ( in @ sK2 @ ( injFuncSet @ sK0 @ sK1 ) ) )
& ( dsetconstrEL = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f11]) ).
thf(f13,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f14,plain,
( injFuncSet
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] : ( injective @ Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
dsetconstrEL = $true,
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
( $true
= ( in @ sK2 @ ( injFuncSet @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f17,plain,
( $true
!= ( in @ sK2 @ ( funcSet @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f20,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f13,f15]) ).
thf(f21,plain,
( $true
= ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] : ( injective @ Y0 @ Y1 @ Y2 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f16,f14]) ).
thf(f22,plain,
( $true
= ( in @ sK2 @ ( dsetconstr @ ( funcSet @ sK0 @ sK1 ) @ ( injective @ sK0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f20]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( in @ X1 @ Y1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( in @ X1 @ Y1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( in @ X1 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( in @ X1 @ Y0 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( in @ X1 @ X3 ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f31,plain,
( ( $true = $false )
| ( $true
= ( in @ sK2 @ ( funcSet @ sK0 @ sK1 ) ) ) ),
inference(constrained_superposition,[],[f29,f22]) ).
thf(f32,plain,
( $true
= ( in @ sK2 @ ( funcSet @ sK0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f34,plain,
$false,
inference(forward_subsumption_resolution,[],[f32,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU799^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.11/0.22 % Computer : n013.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 14:31:22 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.25 Running first-order model finding
% 0.11/0.25 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.24/0.30 % (2200896)Will run a generic schedule for satisfiability detection.
% 0.24/0.30 % (2200902)% WARNING: option uhcvi not known.
% 0.24/0.30 % (2200902)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2511704022:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.24/0.30 % (2200903)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3015504758:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.30 % (2200905)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=607366773:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.30 % (2200902)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.24/0.30 % (2200905)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.24/0.30 % (2200902)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.24/0.30 % (2200905) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2200896-2200905"...
% 0.24/0.30 % (2200902) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2200896-2200902"...
% 0.24/0.30 % (2200903) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2200896-2200903"...
% 0.24/0.30 % (2200905)...printing done.
% 0.24/0.30 % (2200902)...printing done.
% 0.24/0.30 % (2200905)Refutation found. Thanks to Tanya!
% 0.24/0.30 % SZS status Theorem for theBenchmark
% 0.24/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.30 % (2200905)------------------------------
% 0.24/0.30 % (2200905)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.30 % (2200905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.30 % (2200905)CaDiCaL version: 2.1.3
% 0.24/0.30 % (2200905)Termination reason: Refutation
% 0.24/0.30 % (2200905)Time elapsed: 0.003 s
% 0.24/0.30 % (2200905)Peak memory usage: 12 MB
% 0.24/0.30 % (2200905)Instructions burned: 4 (million)
% 0.24/0.30 % (2200896)Success in time 0.039 s
% 0.24/0.30 % Vampire exiting
%------------------------------------------------------------------------------