%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET947+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 : n018.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:45:04 PM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 82 ( 9 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 91 ( 35 ~; 35 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 43 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f4,axiom,
! [X0,X1] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(f8,conjecture,
! [X0] : subset(X0,powerset(union(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0] : subset(X0,powerset(union(X0))),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
? [X0] : ~ subset(X0,powerset(union(X0))),
inference(ennf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f16,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f19]) ).
fof(f23,plain,
~ subset(sK4,powerset(union(sK4))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X0,sK4)],[f14]) ).
fof(f26,plain,
! [X3,X0,X1] :
( ~ subset(X3,X0)
| in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f30,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f32,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(X0,union(X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f36,plain,
~ subset(sK4,powerset(union(sK4))),
inference(cnf_transformation,[],[f23]) ).
fof(f37,plain,
in(sK1(sK4,powerset(union(sK4))),sK4),
inference(resolution,[],[f30,f36]) ).
fof(f38,plain,
subset(sK1(sK4,powerset(union(sK4))),union(sK4)),
inference(resolution,[],[f37,f32]) ).
fof(f46,plain,
! [X0] :
( powerset(union(sK4)) != X0
| in(sK1(sK4,powerset(union(sK4))),X0) ),
inference(resolution,[],[f26,f38]) ).
fof(f52,plain,
in(sK1(sK4,powerset(union(sK4))),powerset(union(sK4))),
inference(equality_resolution,[],[f46]) ).
fof(f54,plain,
subset(sK4,powerset(union(sK4))),
inference(resolution,[],[f52,f31]) ).
fof(f58,plain,
$false,
inference(forward_subsumption_resolution,[],[f54,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET947+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.38 % Computer : n018.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Sep 28 03:18:10 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.16/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.16/0.48 % (2963893)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (2963900)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3078811485:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.16/0.48 % (2963898)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2251326484_3000 on theBenchmark for (3000ds/0Mi)
% 0.16/0.48 % (2963903)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3280482778:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.16/0.48 % (2963902)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=136944246:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.16/0.48 % (2963901)dis+10_1_sil=32000:sp=arity:random_seed=1121198033:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.16/0.48 % (2963904)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2013494826:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.16/0.48 % TRYING [1]
% 0.16/0.48 % TRYING [2]
% 0.16/0.48 % (2963903) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2963893-2963903"...
% 0.16/0.48 % TRYING [3]
% 0.16/0.48 % (2963902) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2963893-2963902"...
% 0.16/0.48 % TRYING [4]
% 0.16/0.48 % (2963904) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2963893-2963904"...
% 0.16/0.48 % (2963901) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2963893-2963901"...
% 0.16/0.48 % (2963903)...printing done.
% 0.16/0.48 % (2963902)...printing done.
% 0.16/0.48 % (2963903)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (2963903)------------------------------
% 0.16/0.48 % (2963903)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (2963903)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (2963903)CaDiCaL version: 2.1.3
% 0.16/0.48 % (2963903)Termination reason: Refutation
% 0.16/0.48 % (2963903)Time elapsed: 0.003 s
% 0.16/0.48 % (2963903)Peak memory usage: 11 MB
% 0.16/0.48 % (2963903)Instructions burned: 2 (million)
% 0.16/0.48 % (2963893)Success in time 0.038 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------