%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET691+4 : TPTP v9.3.1. Released v2.2.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:44:26 PM UTC 2026
% Result : Theorem 0.22s 0.46s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 6 unt; 2 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 33 |; 1 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f6,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(f12,conjecture,
! [X0] :
( subset(X0,empty_set)
<=> equal_set(X0,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI16) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( subset(X0,empty_set)
<=> equal_set(X0,empty_set) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
? [X0] :
( subset(X0,empty_set)
<~> equal_set(X0,empty_set) ),
inference(ennf_transformation,[],[f13]) ).
fof(f18,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f31,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f6]) ).
fof(f46,plain,
( equal_set(sK3,empty_set)
| subset(sK3,empty_set) ),
inference(cnf_transformation,[],[f16]) ).
fof(f47,plain,
( ~ equal_set(sK3,empty_set)
| ~ subset(sK3,empty_set) ),
inference(cnf_transformation,[],[f16]) ).
fof(f52,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f54,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1)
| subset(X1,X0) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f55,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f59,plain,
( equal_set(sK3,empty_set)
| subset(sK3,empty_set) ),
inference(consistent_polarity_flipping,[],[f47]) ).
fof(f60,plain,
( ~ equal_set(sK3,empty_set)
| ~ subset(sK3,empty_set) ),
inference(consistent_polarity_flipping,[],[f46]) ).
fof(f62,definition,
( spl4_1
<=> subset(sK3,empty_set) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f63,plain,
( subset(sK3,empty_set)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f64,plain,
( ~ subset(sK3,empty_set)
| spl4_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f66,definition,
( spl4_2
<=> equal_set(sK3,empty_set) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f67,plain,
( equal_set(sK3,empty_set)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f69,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f60,f66,f62]) ).
fof(f70,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f59,f66,f62]) ).
fof(f94,plain,
( subset(sK3,empty_set)
| subset(empty_set,sK3)
| ~ spl4_2 ),
inference(resolution,[],[f54,f67]) ).
fof(f95,plain,
( subset(empty_set,sK3)
| spl4_1
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f94,f64]) ).
fof(f118,plain,
( member(sK0(empty_set,sK3),empty_set)
| spl4_1
| ~ spl4_2 ),
inference(resolution,[],[f95,f52]) ).
fof(f122,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f118,f31]) ).
fof(f123,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f122]) ).
fof(f127,plain,
( equal_set(sK3,empty_set)
| ~ spl4_1 ),
inference(resolution,[],[f63,f55]) ).
fof(f128,plain,
( spl4_2
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f127,f62,f66]) ).
cnf(s1,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f69]) ).
cnf(s2,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f70]) ).
cnf(s3,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f123]) ).
cnf(s4,plain,
( ~ spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f128]) ).
cnf(s5,plain,
spl4_1,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
spl4_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s6,s5]) ).
fof(f129,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET691+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.37 % Computer : n001.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 02:39:47 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 Running first-order model finding
% 0.13/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.22/0.46 % (4162338)Will run a generic schedule for satisfiability detection.
% 0.22/0.46 % (4162343)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3642918329_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.46 % TRYING [1]
% 0.22/0.46 % TRYING [2]
% 0.22/0.46 % TRYING [3]
% 0.22/0.46 % TRYING [4]
% 0.22/0.46 % (4162344)% WARNING: option uhcvi not known.
% 0.22/0.46 % TRYING [5]
% 0.22/0.46 % (4162344)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1151815130:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.46 % (4162345)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=954525117:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.46 % (4162346)dis+10_1_sil=32000:sp=arity:random_seed=995426169:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.46 % (4162347)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=939188946:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.46 % (4162348)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=772698482:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.46 % (4162349)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=638014792:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.46 % (4162347) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4162338-4162347"...
% 0.22/0.46 % TRYING [6]
% 0.22/0.46 % (4162344) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4162338-4162344"...
% 0.22/0.46 % (4162348) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4162338-4162348"...
% 0.22/0.46 % (4162349) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4162338-4162349"...
% 0.22/0.46 % (4162346) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4162338-4162346"...
% 0.22/0.46 % (4162347)...printing done.
% 0.22/0.46 % (4162344)...printing done.
% 0.22/0.46 % (4162348)...printing done.
% 0.22/0.46 % (4162349)...printing done.
% 0.22/0.46 % (4162346)...printing done.
% 0.22/0.46 % (4162344)Refutation found. Thanks to Tanya!
% 0.22/0.46 % SZS status Theorem for theBenchmark
% 0.22/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.46 % (4162344)------------------------------
% 0.22/0.46 % (4162344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.46 % (4162344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.46 % (4162344)CaDiCaL version: 2.1.3
% 0.22/0.46 % (4162344)Termination reason: Refutation
% 0.22/0.46 % (4162344)Time elapsed: 0.004 s
% 0.22/0.46 % (4162344)Peak memory usage: 12 MB
% 0.22/0.46 % (4162344)Instructions burned: 4 (million)
% 0.22/0.46 % (4162338)Success in time 0.04 s
% 0.22/0.46 % Vampire exiting
%------------------------------------------------------------------------------