%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU171+2 : 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 : 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.53s 0.52s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 13 unt; 2 def)
% Number of atoms : 95 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 91 ( 37 ~; 23 |; 11 &)
% ( 8 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 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(f10,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(f17,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f18,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,X1) = set_difference(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f95,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/sandbox/benchmark/theBenchmark.p',t50_subset_1) ).
fof(f96,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)],[f95]) ).
fof(f101,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f126,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) )
& ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f128,plain,
! [X0,X1] :
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f18]) ).
fof(f166,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,[],[f96]) ).
fof(f167,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,[],[f166]) ).
fof(f171,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f101]) ).
fof(f201,plain,
! [X0,X1] :
( ~ element(X1,X0)
| in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f244,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f245,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| set_difference(X0,X1) = subset_complement(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
fof(f337,plain,
element(sK27,sK25),
inference(cnf_transformation,[],[f167]) ).
fof(f338,plain,
~ in(sK27,sK26),
inference(cnf_transformation,[],[f167]) ).
fof(f339,plain,
~ in(sK27,subset_complement(sK25,sK26)),
inference(cnf_transformation,[],[f167]) ).
fof(f340,plain,
element(sK26,powerset(sK25)),
inference(cnf_transformation,[],[f167]) ).
fof(f341,plain,
empty_set != sK25,
inference(cnf_transformation,[],[f167]) ).
fof(f347,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f171]) ).
fof(f447,plain,
! [X3,X0,X1] :
( in(X3,set_difference(X0,X1))
| ~ in(X3,X0)
| in(X3,X1) ),
inference(equality_resolution,[],[f244]) ).
fof(f622,plain,
( in(sK27,sK25)
| empty(sK25) ),
inference(resolution,[],[f201,f337]) ).
fof(f624,definition,
( spl30_1
<=> empty(sK25) ),
introduced(definition,[new_symbols(definition,[spl30_1])],[avatar_definition]) ).
fof(f626,plain,
( empty(sK25)
| ~ spl30_1 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f628,definition,
( spl30_2
<=> in(sK27,sK25) ),
introduced(definition,[new_symbols(definition,[spl30_2])],[avatar_definition]) ).
fof(f630,plain,
( in(sK27,sK25)
| ~ spl30_2 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f631,plain,
( spl30_1
| spl30_2 ),
inference(avatar_split_clause,[],[f622,f628,f624]) ).
fof(f1123,plain,
subset_complement(sK25,sK26) = set_difference(sK25,sK26),
inference(resolution,[],[f245,f340]) ).
fof(f1157,plain,
( empty_set = sK25
| ~ spl30_1 ),
inference(resolution,[],[f626,f347]) ).
fof(f1158,plain,
( $false
| ~ spl30_1 ),
inference(forward_subsumption_resolution,[],[f1157,f341]) ).
fof(f1159,plain,
~ spl30_1,
inference(avatar_contradiction_clause,[],[f1158]) ).
fof(f2120,plain,
~ in(sK27,set_difference(sK25,sK26)),
inference(superposition,[],[f339,f1123]) ).
fof(f2137,plain,
( ~ in(sK27,sK25)
| in(sK27,sK26) ),
inference(resolution,[],[f2120,f447]) ).
fof(f2139,plain,
( in(sK27,sK26)
| ~ spl30_2 ),
inference(forward_subsumption_resolution,[],[f2137,f630]) ).
fof(f2140,plain,
( $false
| ~ spl30_2 ),
inference(forward_subsumption_resolution,[],[f2139,f338]) ).
fof(f2141,plain,
~ spl30_2,
inference(avatar_contradiction_clause,[],[f2140]) ).
cnf(s1,plain,
( spl30_1
| spl30_2 ),
inference(sat_conversion,[],[f631]) ).
cnf(s8,plain,
~ spl30_1,
inference(sat_conversion,[],[f1159]) ).
cnf(s20,plain,
~ spl30_2,
inference(sat_conversion,[],[f2141]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s1,s20,s8]) ).
fof(f2142,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU171+2 : 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 : n001.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:58:32 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41 Running first-order model finding
% 0.16/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.53/0.52 % (1855)Will run a generic schedule for satisfiability detection.
% 0.53/0.52 % (1863)dis+10_1_sil=32000:sp=arity:random_seed=31790414:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.53/0.52 % (1861)% WARNING: option uhcvi not known.
% 0.53/0.52 % (1864)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2843125984:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.53/0.52 % (1860)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3378354464_2999 on theBenchmark for (2999ds/0Mi)
% 0.53/0.52 % (1861)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1129343693:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.53/0.52 % (1862)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=85887579:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.53/0.52 % (1865)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2159840560:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.53/0.52 % (1866)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1098089853:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.53/0.52 % TRYING [1]
% 0.53/0.52 % TRYING [2]
% 0.53/0.52 % TRYING [3]
% 0.53/0.52 % (1863)Instruction limit reached!
% 0.53/0.52 % (1863)------------------------------
% 0.53/0.52 % (1863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.53/0.52 % (1863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.53/0.52 % (1863)CaDiCaL version: 2.1.3
% 0.53/0.52 % (1863)Termination reason: Instruction limit
% 0.53/0.52 % (1863)Termination phase: Saturation
% 0.53/0.52 % (1863)Time elapsed: 0.037 s
% 0.53/0.52 % (1863)Peak memory usage: 12 MB
% 0.53/0.52 % (1863)Instructions burned: 103 (million)
% 0.53/0.52 % TRYING [4]
% 0.53/0.52 % (1874)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1915823046:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.53/0.52 % TRYING [1]
% 0.53/0.52 % TRYING [2]
% 0.53/0.52 % TRYING [3]
% 0.53/0.52 % (1861) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1855-1861"...
% 0.53/0.52 % (1861)...printing done.
% 0.53/0.52 % (1861)Refutation found. Thanks to Tanya!
% 0.53/0.52 % SZS status Theorem for theBenchmark
% 0.53/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.52 % (1861)------------------------------
% 0.53/0.52 % (1861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.53/0.52 % (1861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.53/0.52 % (1861)CaDiCaL version: 2.1.3
% 0.53/0.52 % (1861)Termination reason: Refutation
% 0.53/0.52 % (1861)Time elapsed: 0.061 s
% 0.53/0.52 % (1861)Peak memory usage: 13 MB
% 0.53/0.52 % (1861)Instructions burned: 90 (million)
% 0.53/0.52 % (1855)Success in time 0.098 s
% 0.53/0.52 % Vampire exiting
%------------------------------------------------------------------------------