%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET899+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:44:56 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 33 ( 14 ~; 10 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2))) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).
fof(f10,plain,
? [X0,X1,X2] :
( ~ in(X2,X0)
& ~ subset(X0,set_difference(X1,singleton(X2)))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ~ in(X2,X0)
& ~ subset(X0,set_difference(X1,singleton(X2)))
& subset(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1,X2] :
( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2)))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
! [X0,X1,X2] :
( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2)))
| ~ subset(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f16,plain,
( ~ in(sK4,sK2)
& ~ subset(sK2,set_difference(sK3,singleton(sK4)))
& subset(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f11]) ).
fof(f21,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X2,X0,X1] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f47,plain,
( in(sK4,sK2)
| ~ subset(sK2,sK3) ),
inference(resolution,[],[f24,f22]) ).
fof(f48,plain,
~ subset(sK2,sK3),
inference(forward_subsumption_resolution,[],[f47,f23]) ).
fof(f49,plain,
$false,
inference(forward_subsumption_resolution,[],[f48,f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET899+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n008.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 03:07:54 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.41 Running first-order model finding
% 0.11/0.41 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 % (1829695)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1829702)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=607012510:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (1829702) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1829695-1829702"...
% 0.11/0.45 % (1829702)...printing done.
% 0.11/0.45 % (1829702)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 % (1829702)------------------------------
% 0.11/0.45 % (1829702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1829702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1829702)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1829702)Termination reason: Refutation
% 0.11/0.45 % (1829702)Time elapsed: 0.001 s
% 0.11/0.45 % (1829702)Peak memory usage: 11 MB
% 0.11/0.45 % (1829702)Instructions burned: 1 (million)
% 0.11/0.45 % (1829695)Success in time 0.024 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------