%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET012-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:42:33 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.51s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 17 unt; 1 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 28 ~; 29 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ member(X0,X1)
| member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',membership_in_subsets) ).
fof(f3,axiom,
! [X0,X1] :
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).
fof(f4,axiom,
! [X0,X1] :
( ~ member(member_of_1_not_of_2(X0,X1),X1)
| subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
fof(f5,axiom,
! [X0,X1] :
( member(X0,complement(X1))
| member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_set_or_complement) ).
fof(f6,axiom,
! [X0,X1] :
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',not_member_of_set_and_complement) ).
fof(f13,axiom,
! [X0,X1] :
( ~ equal_sets(X0,X1)
| subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',set_equal_sets_are_subsets1) ).
fof(f15,axiom,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_sets(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
fof(f17,axiom,
! [X0,X1] :
( ~ equal_sets(X0,X1)
| equal_sets(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',symmetry_for_set_equal) ).
fof(f22,axiom,
equal_sets(complement(a),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_a_is_b) ).
fof(f23,axiom,
equal_sets(complement(b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_b_is_c) ).
fof(f24,negated_conjecture,
~ equal_sets(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_equals_c) ).
fof(f38,plain,
subset(complement(a),b),
inference(resolution,[],[f13,f22]) ).
fof(f39,plain,
subset(complement(b),c),
inference(resolution,[],[f13,f23]) ).
fof(f50,plain,
equal_sets(b,complement(a)),
inference(resolution,[],[f17,f22]) ).
fof(f51,plain,
equal_sets(c,complement(b)),
inference(resolution,[],[f17,f23]) ).
fof(f57,plain,
subset(b,complement(a)),
inference(resolution,[],[f50,f13]) ).
fof(f59,plain,
subset(c,complement(b)),
inference(resolution,[],[f51,f13]) ).
fof(f498,plain,
! [X0] :
( ~ member(X0,complement(a))
| member(X0,b) ),
inference(resolution,[],[f2,f38]) ).
fof(f499,plain,
! [X0] :
( ~ member(X0,complement(b))
| member(X0,c) ),
inference(resolution,[],[f2,f39]) ).
fof(f501,plain,
! [X0] :
( member(X0,complement(a))
| ~ member(X0,b) ),
inference(resolution,[],[f2,f57]) ).
fof(f502,plain,
! [X0] :
( member(X0,complement(b))
| ~ member(X0,c) ),
inference(resolution,[],[f2,f59]) ).
fof(f525,plain,
! [X0] :
( member(X0,b)
| member(X0,a) ),
inference(resolution,[],[f498,f5]) ).
fof(f540,plain,
! [X0] :
( member(X0,c)
| member(X0,b) ),
inference(resolution,[],[f499,f5]) ).
fof(f571,plain,
! [X0] :
( ~ member(X0,c)
| ~ member(X0,b) ),
inference(resolution,[],[f502,f6]) ).
fof(f695,plain,
! [X0] :
( ~ member(member_of_1_not_of_2(c,X0),b)
| subset(c,X0) ),
inference(resolution,[],[f571,f3]) ).
fof(f781,plain,
! [X0] :
( member(member_of_1_not_of_2(X0,c),b)
| subset(X0,c) ),
inference(resolution,[],[f540,f4]) ).
fof(f910,plain,
! [X0] :
( ~ member(X0,b)
| ~ member(X0,a) ),
inference(resolution,[],[f501,f6]) ).
fof(f986,plain,
! [X0] :
( ~ member(member_of_1_not_of_2(X0,c),a)
| subset(X0,c) ),
inference(resolution,[],[f781,f910]) ).
fof(f1036,plain,
! [X0] :
( member(member_of_1_not_of_2(c,X0),a)
| subset(c,X0) ),
inference(resolution,[],[f695,f525]) ).
fof(f1113,definition,
( spl0_44
<=> subset(a,c) ),
introduced(definition,[new_symbols(definition,[spl0_44])],[avatar_definition]) ).
fof(f1114,plain,
( subset(a,c)
| ~ spl0_44 ),
inference(avatar_component_clause,[],[f1113]) ).
fof(f1222,plain,
( subset(a,c)
| subset(a,c) ),
inference(resolution,[],[f986,f3]) ).
fof(f1224,plain,
subset(a,c),
inference(duplicate_literal_removal,[],[f1222]) ).
fof(f1228,plain,
spl0_44,
inference(avatar_split_clause,[],[f1224,f1113]) ).
fof(f1230,plain,
( ~ subset(c,a)
| equal_sets(a,c)
| ~ spl0_44 ),
inference(resolution,[],[f1114,f15]) ).
fof(f1232,plain,
( ~ subset(c,a)
| ~ spl0_44 ),
inference(forward_subsumption_resolution,[],[f1230,f24]) ).
fof(f1240,plain,
( subset(c,a)
| subset(c,a) ),
inference(resolution,[],[f1036,f4]) ).
fof(f1242,plain,
subset(c,a),
inference(duplicate_literal_removal,[],[f1240]) ).
fof(f1244,plain,
( $false
| ~ spl0_44 ),
inference(forward_subsumption_resolution,[],[f1242,f1232]) ).
fof(f1245,plain,
~ spl0_44,
inference(avatar_contradiction_clause,[],[f1244]) ).
cnf(s1081,plain,
spl0_44,
inference(sat_conversion,[],[f1228]) ).
cnf(s1092,plain,
~ spl0_44,
inference(sat_conversion,[],[f1245]) ).
cnf(s1094,plain,
$false,
inference(rat,[],[s1081,s1092]) ).
fof(f1246,plain,
$false,
inference(avatar_sat_refutation,[],[s1094]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET012-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n016.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 00:08:03 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.15/0.51 % (3135530)Will run a generic schedule for satisfiability detection.
% 0.15/0.51 % (3135540)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2557089574:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.51 % (3135536)% WARNING: option uhcvi not known.
% 0.15/0.51 % (3135537)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2749385030:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.51 % (3135535)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1055163426_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.51 % (3135536)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4252537489:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.51 % (3135539)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=483126472:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.51 % (3135538)dis+10_1_sil=32000:sp=arity:random_seed=2191363038:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.51 % (3135541)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=395662406:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.51 % TRYING [1]
% 0.15/0.51 % TRYING [2]
% 0.15/0.51 % TRYING [3]
% 0.15/0.51 % TRYING [4]
% 0.15/0.51 % TRYING [5]
% 0.15/0.51 % TRYING [6]
% 0.15/0.51 % (3135540)Instruction limit reached!
% 0.15/0.51 % (3135540)------------------------------
% 0.15/0.51 % (3135540)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (3135540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (3135540)CaDiCaL version: 2.1.3
% 0.15/0.51 % (3135540)Termination reason: Instruction limit
% 0.15/0.51 % (3135540)Termination phase: Saturation
% 0.15/0.51 % (3135540)Time elapsed: 0.043 s
% 0.15/0.51 % (3135540)Peak memory usage: 12 MB
% 0.15/0.51 % (3135540)Instructions burned: 132 (million)
% 0.15/0.51 % TRYING [7]
% 0.15/0.51 % (3135549)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3586729193:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.15/0.51 % TRYING [1]
% 0.15/0.51 % TRYING [2]
% 0.15/0.51 % TRYING [3]
% 0.15/0.51 % TRYING [4]
% 0.15/0.51 % (3135537) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3135530-3135537"...
% 0.15/0.51 % (3135537)...printing done.
% 0.15/0.51 % (3135537)Refutation found. Thanks to Tanya!
% 0.15/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.51 % (3135537)------------------------------
% 0.15/0.51 % (3135537)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (3135537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (3135537)CaDiCaL version: 2.1.3
% 0.15/0.51 % (3135537)Termination reason: Refutation
% 0.15/0.51 % (3135537)Time elapsed: 0.051 s
% 0.15/0.51 % (3135537)Peak memory usage: 12 MB
% 0.15/0.51 % (3135537)Instructions burned: 103 (million)
% 0.15/0.51 % (3135530)Success in time 0.084 s
% 0.15/0.51 % Vampire exiting
%------------------------------------------------------------------------------