%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU501_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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 : Tue Sep 29 12:53:29 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 4 equ)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 29 ( 13 ~; 2 |; 4 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 26 ( 21 fml; 5 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 5 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 16 ( 14 !; 2 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
sK1: $o ).
tff(f1,axiom,
( emptysetAx
= ( ! [X0: $i] : ~ in(X0,emptyset) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetAx) ).
tff(f2,conjecture,
( emptysetAx
=> ! [X0: $i] :
( in(X0,emptyset)
=> ! [X1: $o] : (X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE) ).
tff(f3,negated_conjecture,
~ ( emptysetAx
=> ! [X0: $i] :
( in(X0,emptyset)
=> ! [X1: $o] : (X1) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
tff(f4,plain,
( emptysetAx
<=> ! [X0: $i] : ~ in(X0,emptyset) ),
inference(fool_elimination,[],[f1]) ).
tff(f5,plain,
~ ( emptysetAx
=> ! [X0: $i] :
( in(X0,emptyset)
=> ! [X1: $o] : (X1) ) ),
inference(rectify,[],[f3]) ).
tff(f6,plain,
~ ( emptysetAx
=> ! [X0: $i] :
( in(X0,emptyset)
=> ! [X1: $o] : ( $true = (X1) ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f7,plain,
( emptysetAx
=> ! [X0: $i] : ~ in(X0,emptyset) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
tff(f8,plain,
( ! [X0: $i] : ~ in(X0,emptyset)
| ~ emptysetAx ),
inference(ennf_transformation,[],[f7]) ).
tff(f9,plain,
( ? [X0: $i] :
( ? [X1: $o] : ( $true != (X1) )
& in(X0,emptyset) )
& emptysetAx ),
inference(ennf_transformation,[],[f6]) ).
tff(f10,plain,
( ( $true != sK1 )
& in(sK0,emptyset)
& emptysetAx ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f9]) ).
tff(f11,plain,
! [X0: $i] :
( ~ in(X0,emptyset)
| ~ emptysetAx ),
inference(cnf_transformation,[],[f8]) ).
tff(f12,plain,
emptysetAx,
inference(cnf_transformation,[],[f10]) ).
tff(f13,plain,
in(sK0,emptyset),
inference(cnf_transformation,[],[f10]) ).
tff(f17,plain,
! [X0: $i] : ~ in(X0,emptyset),
inference(forward_subsumption_resolution,[],[f11,f12]) ).
tff(f18,plain,
$false,
inference(resolution,[],[f17,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU501_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 05:44:16 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.11/0.46 % (2325951)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (2325961)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3830299309:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46 % (2325961) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2325951-2325961"...
% 0.11/0.46 % (2325961)...printing done.
% 0.11/0.46 % (2325961)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (2325961)------------------------------
% 0.11/0.46 % (2325961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (2325961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (2325961)CaDiCaL version: 2.1.3
% 0.11/0.46 % (2325961)Termination reason: Refutation
% 0.11/0.46 % (2325961)Time elapsed: 0.001 s
% 0.11/0.46 % (2325961)Peak memory usage: 11 MB
% 0.11/0.46 % (2325951)Success in time 0.031 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------