%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU501^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 : n009.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:12 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 85 ( 20 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 64 ( 12 ~; 0 |; 4 &; 37 @)
% ( 0 <=>; 8 =>; 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 : 14 ( 10 usr; 7 con; 0-4 aty)
% ( 3 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 19 ( 4 ^; 13 !; 2 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
emptysetAx: $o ).
thf(func_def_4,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_5,type,
vNOT: $o > $o ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
sK1: $o ).
thf(f1,axiom,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetAx) ).
thf(f2,conjecture,
( emptysetAx
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE) ).
thf(f3,negated_conjecture,
~ ( emptysetAx
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( emptysetAx
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( emptysetAx
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( emptysetAx = $true )
=> ! [X0: $i] :
( ( ( in @ X0 @ emptyset )
= $true )
=> ! [X1: $o] : ( $true = X1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ? [X0: $i] :
( ? [X1: $o] : ( $true != X1 )
& ( ( in @ X0 @ emptyset )
= $true ) )
& ( emptysetAx = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f9,plain,
( ( $true != sK1 )
& ( $true
= ( in @ sK0 @ emptyset ) )
& ( emptysetAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f8]) ).
thf(f10,plain,
( emptysetAx
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f11,plain,
emptysetAx = $true,
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( $true
= ( in @ sK0 @ emptyset ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) )
= $true ),
inference(definition_unfolding,[],[f10,f11]) ).
thf(f17,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f16]) ).
thf(f18,plain,
! [X1: $i] :
( $true
= ( ~ ( in @ X1 @ emptyset ) ) ),
inference(beta-eta_normalization,[],[f17]) ).
thf(f19,plain,
! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) ),
inference(not_proxy_clausification,[],[f18]) ).
thf(f21,plain,
$true = $false,
inference(constrained_superposition,[],[f12,f19]) ).
thf(f22,plain,
$false,
inference(trivial_inequality_removal,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU501^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n009.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 13:46:46 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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 % (4014076)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (4014086)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2257074959:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (4014086) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4014076-4014086"...
% 0.19/0.27 % (4014086)...printing done.
% 0.19/0.27 % (4014086)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 % (4014086)------------------------------
% 0.19/0.27 % (4014086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (4014086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (4014086)CaDiCaL version: 2.1.3
% 0.19/0.27 % (4014086)Termination reason: Refutation
% 0.19/0.27 % (4014086)Time elapsed: 0.001 s
% 0.19/0.27 % (4014086)Peak memory usage: 12 MB
% 0.19/0.27 % (4014086)Instructions burned: 1 (million)
% 0.19/0.27 % (4014076)Success in time 0.032 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------