%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET932+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:45:02 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 4 unt; 0 def)
% Number of atoms : 105 ( 9 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 117 ( 44 ~; 47 |; 18 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 63 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f8,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> subset(powerset(X0),powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t79_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> subset(powerset(X0),powerset(X1)) ),
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,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
? [X0,X1] :
( ~ subset(powerset(X0),powerset(X1))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f16,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(f17,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,[],[f16]) ).
fof(f18,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))],[f17]) ).
fof(f19,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(f20,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,[],[f19]) ).
fof(f21,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))],[f20]) ).
fof(f24,plain,
( ~ subset(powerset(sK4),powerset(sK5))
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f15]) ).
fof(f26,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f37,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
~ subset(powerset(sK4),powerset(sK5)),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f27]) ).
fof(f40,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( subset(sK1(powerset(X0),X1),X0)
| subset(powerset(X0),X1) ),
inference(resolution,[],[f31,f40]) ).
fof(f47,plain,
! [X0,X1] :
( ~ subset(sK1(X0,powerset(X1)),X1)
| subset(X0,powerset(X1)) ),
inference(resolution,[],[f32,f39]) ).
fof(f52,plain,
! [X0] :
( ~ subset(X0,sK4)
| subset(X0,sK5) ),
inference(resolution,[],[f36,f37]) ).
fof(f71,plain,
! [X0] :
( subset(sK1(powerset(sK4),X0),sK5)
| subset(powerset(sK4),X0) ),
inference(resolution,[],[f45,f52]) ).
fof(f75,plain,
( subset(powerset(sK4),powerset(sK5))
| subset(powerset(sK4),powerset(sK5)) ),
inference(resolution,[],[f47,f71]) ).
fof(f76,plain,
subset(powerset(sK4),powerset(sK5)),
inference(duplicate_literal_removal,[],[f75]) ).
fof(f78,plain,
$false,
inference(forward_subsumption_resolution,[],[f76,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET932+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n014.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:15:28 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.17/0.47 % (1402767)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (1402774)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1528941127:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (1402773)% WARNING: option uhcvi not known.
% 0.17/0.47 % (1402772)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3724688867_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (1402773)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1959407761:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (1402775)dis+10_1_sil=32000:sp=arity:random_seed=1045547602:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (1402776)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1552034831:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (1402777)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2726867578:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (1402778)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4092386673:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % (1402775) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1402767-1402775"...
% 0.17/0.47 % TRYING [4]
% 0.17/0.47 % (1402778) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1402767-1402778"...
% 0.17/0.47 % TRYING [5]
% 0.17/0.47 % (1402775)...printing done.
% 0.17/0.47 % (1402778)...printing done.
% 0.17/0.47 % (1402776) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1402767-1402776"...
% 0.17/0.47 % (1402775)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (1402775)------------------------------
% 0.17/0.47 % (1402775)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (1402775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (1402775)CaDiCaL version: 2.1.3
% 0.17/0.47 % (1402775)Termination reason: Refutation
% 0.17/0.47 % (1402775)Time elapsed: 0.003 s
% 0.17/0.47 % (1402775)Peak memory usage: 11 MB
% 0.17/0.47 % (1402775)Instructions burned: 3 (million)
% 0.17/0.47 % (1402767)Success in time 0.04 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------