%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU171+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 : n001.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.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 13 unt; 1 def)
% Number of atoms : 91 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 85 ( 33 ~; 22 |; 11 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) )
& ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,X1) = set_difference(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f20,conjecture,
! [X0] :
( X0 != empty_set
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t50_subset_1) ).
fof(f21,negated_conjecture,
~ ! [X0] :
( X0 != empty_set
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f22,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f26,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) )
& ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0,X1] :
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f31,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& X0 != empty_set ),
inference(ennf_transformation,[],[f21]) ).
fof(f32,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& X0 != empty_set ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( ~ element(X1,X0)
| in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f47,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| set_difference(X0,X1) = subset_complement(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f61,plain,
element(sK8,sK6),
inference(cnf_transformation,[],[f32]) ).
fof(f62,plain,
~ in(sK8,sK7),
inference(cnf_transformation,[],[f32]) ).
fof(f63,plain,
~ in(sK8,subset_complement(sK6,sK7)),
inference(cnf_transformation,[],[f32]) ).
fof(f64,plain,
element(sK7,powerset(sK6)),
inference(cnf_transformation,[],[f32]) ).
fof(f65,plain,
empty_set != sK6,
inference(cnf_transformation,[],[f32]) ).
fof(f66,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f33]) ).
fof(f69,plain,
! [X3,X0,X1] :
( in(X3,set_difference(X0,X1))
| ~ in(X3,X0)
| in(X3,X1) ),
inference(equality_resolution,[],[f46]) ).
fof(f93,definition,
( spl9_1
<=> empty(sK6) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f94,plain,
( empty(sK6)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f95,plain,
( ~ empty(sK6)
| spl9_1 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f123,plain,
( in(sK8,sK6)
| empty(sK6) ),
inference(resolution,[],[f38,f61]) ).
fof(f124,plain,
( in(sK8,sK6)
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f123,f95]) ).
fof(f146,plain,
subset_complement(sK6,sK7) = set_difference(sK6,sK7),
inference(resolution,[],[f47,f64]) ).
fof(f150,plain,
~ in(sK8,set_difference(sK6,sK7)),
inference(superposition,[],[f63,f146]) ).
fof(f166,plain,
( ~ in(sK8,sK6)
| in(sK8,sK7) ),
inference(resolution,[],[f69,f150]) ).
fof(f173,plain,
( in(sK8,sK7)
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f166,f124]) ).
fof(f174,plain,
( $false
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f173,f62]) ).
fof(f175,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f174]) ).
fof(f180,plain,
( empty_set = sK6
| ~ spl9_1 ),
inference(resolution,[],[f94,f66]) ).
fof(f181,plain,
( $false
| ~ spl9_1 ),
inference(forward_subsumption_resolution,[],[f180,f65]) ).
fof(f182,plain,
~ spl9_1,
inference(avatar_contradiction_clause,[],[f181]) ).
cnf(s2,plain,
spl9_1,
inference(sat_conversion,[],[f175]) ).
cnf(s3,plain,
~ spl9_1,
inference(sat_conversion,[],[f182]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s2,s3]) ).
fof(f183,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU171+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.38 % Computer : n001.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:58:33 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 % (2092)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (2099)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1117730785:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (2098)% WARNING: option uhcvi not known.
% 0.11/0.45 % (2097)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2940265730_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (2098)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1933204612:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (2102)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1109024838:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (2103)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=902948963:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (2101)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=441131311:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % (2101) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2092-2101"...
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % (2101)...printing done.
% 0.11/0.45 % (2098) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2092-2098"...
% 0.11/0.45 % (2101)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 % (2101)------------------------------
% 0.11/0.45 % (2101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (2101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (2101)CaDiCaL version: 2.1.3
% 0.11/0.45 % (2101)Termination reason: Refutation
% 0.11/0.45 % (2101)Time elapsed: 0.005 s
% 0.11/0.45 % (2101)Peak memory usage: 12 MB
% 0.11/0.45 % (2101)Instructions burned: 5 (million)
% 0.11/0.45 % (2092)Success in time 0.031 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------