%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU173+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:52:14 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 4 unt; 0 def)
% Number of atoms : 123 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 142 ( 52 ~; 52 |; 23 &)
% ( 8 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 64 !; 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] :
( ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) )
& ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f11,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l71_subset_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f19,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f23,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) )
& ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f25,plain,
? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f30,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(f31,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,[],[f30]) ).
fof(f32,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))],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ( ( ( element(X1,X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ element(X1,X0) ) )
| empty(X0) )
& ( ( ( element(X1,X0)
| ~ empty(X1) )
& ( empty(X1)
| ~ element(X1,X0) ) )
| ~ empty(X0) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f34,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,[],[f24]) ).
fof(f35,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,[],[f34]) ).
fof(f36,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))],[f35]) ).
fof(f38,plain,
( ~ element(sK3,powerset(sK4))
& ! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f25]) ).
fof(f45,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f32]) ).
fof(f51,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f53,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f54,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f58,plain,
! [X2] :
( ~ in(X2,sK3)
| in(X2,sK4) ),
inference(cnf_transformation,[],[f38]) ).
fof(f59,plain,
~ element(sK3,powerset(sK4)),
inference(cnf_transformation,[],[f38]) ).
fof(f68,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f70,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f45]) ).
fof(f441,plain,
! [X0,X1] :
( ~ in(X1,X0)
| element(X1,X0) ),
inference(forward_subsumption_resolution,[],[f51,f68]) ).
fof(f442,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(resolution,[],[f441,f70]) ).
fof(f450,plain,
~ subset(sK3,sK4),
inference(resolution,[],[f442,f59]) ).
fof(f467,plain,
! [X0] :
( in(sK1(sK3,X0),sK4)
| subset(sK3,X0) ),
inference(resolution,[],[f53,f58]) ).
fof(f503,plain,
( subset(sK3,sK4)
| subset(sK3,sK4) ),
inference(resolution,[],[f54,f467]) ).
fof(f504,plain,
subset(sK3,sK4),
inference(duplicate_literal_removal,[],[f503]) ).
fof(f506,plain,
$false,
inference(forward_subsumption_resolution,[],[f504,f450]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU173+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:56:01 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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.12/0.46 % (2243960)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (2243967)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3063052519:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46 % (2243966)% WARNING: option uhcvi not known.
% 0.12/0.46 % (2243967) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2243960-2243967"...
% 0.12/0.46 % (2243967)...printing done.
% 0.12/0.46 % (2243965)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=178232737_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46 % (2243966)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3728518296:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46 % (2243968)dis+10_1_sil=32000:sp=arity:random_seed=4134651775:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46 % (2243969)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3543250250:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46 % (2243967)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (2243967)------------------------------
% 0.12/0.46 % (2243967)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (2243967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (2243967)CaDiCaL version: 2.1.3
% 0.12/0.46 % (2243967)Termination reason: Refutation
% 0.12/0.46 % (2243967)Time elapsed: 0.005 s
% 0.12/0.46 % (2243967)Peak memory usage: 12 MB
% 0.12/0.46 % (2243967)Instructions burned: 10 (million)
% 0.12/0.46 % (2243960)Success in time 0.034 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------