%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU294+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:52:45 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 14 ~; 9 |; 8 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f40,conjecture,
! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f44,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f44]) ).
fof(f72,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f80,plain,
? [X0,X1] :
( ~ finite(X0)
& subset(X0,X1)
& finite(X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f81,plain,
? [X0,X1] :
( ~ finite(X0)
& subset(X0,X1)
& finite(X1) ),
inference(flattening,[],[f80]) ).
fof(f85,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f111,plain,
( ~ finite(sK19)
& subset(sK19,sK20)
& finite(sK20) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X1,sK20)],[f81]) ).
fof(f124,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f195,plain,
finite(sK20),
inference(cnf_transformation,[],[f111]) ).
fof(f196,plain,
subset(sK19,sK20),
inference(cnf_transformation,[],[f111]) ).
fof(f197,plain,
~ finite(sK19),
inference(cnf_transformation,[],[f111]) ).
fof(f200,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f310,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(resolution,[],[f124,f200]) ).
fof(f418,plain,
( ~ finite(sK20)
| finite(sK19) ),
inference(resolution,[],[f310,f196]) ).
fof(f420,plain,
finite(sK19),
inference(forward_subsumption_resolution,[],[f418,f195]) ).
fof(f421,plain,
$false,
inference(forward_subsumption_resolution,[],[f420,f197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU294+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 04:32:16 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.45 % (1432155)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1432163)dis+10_1_sil=32000:sp=arity:random_seed=3906685364:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (1432163) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1432155-1432163"...
% 0.11/0.45 % (1432163)...printing done.
% 0.11/0.45 % (1432163)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1432163)------------------------------
% 0.11/0.45 % (1432163)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1432163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1432163)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1432163)Termination reason: Refutation
% 0.11/0.45 % (1432163)Time elapsed: 0.003 s
% 0.11/0.45 % (1432163)Peak memory usage: 12 MB
% 0.11/0.45 % (1432163)Instructions burned: 7 (million)
% 0.11/0.45 % (1432155)Success in time 0.032 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------