%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET135-6 : 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 : n017.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:43:14 PM UTC 2026
% Result : Unsatisfiable 1.07s 0.58s
% Output : Refutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 21
% Syntax : Number of formulae : 86 ( 18 unt; 5 def)
% Number of atoms : 187 ( 24 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 184 ( 83 ~; 96 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subclass(X0,X1)
| member(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f2,axiom,
! [X0,X1] :
( member(not_subclass_element(X0,X1),X0)
| subclass(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( ~ member(not_subclass_element(X0,X1),X1)
| subclass(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
fof(f7,axiom,
! [X0,X1] :
( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f21,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
fof(f22,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f25,axiom,
! [X0,X1] :
( member(X0,complement(X1))
| ~ member(X0,universal_class)
| member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
fof(f26,axiom,
! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
fof(f67,axiom,
! [X0] :
( X0 = null_class
| member(regular(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
fof(f68,plain,
! [X0] :
( member(regular(X0),X0)
| null_class = X0 ),
inference(reorient_equations,[],[f67]) ).
fof(f101,axiom,
! [X0,X1] : union(singleton(X0),X1) = set_builder(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).
fof(f102,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_3_to_member_of_triple_1) ).
fof(f103,negated_conjecture,
set_builder(x,set_builder(u,set_builder(z,null_class))) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_3_to_member_of_triple_2) ).
fof(f104,plain,
null_class = set_builder(x,set_builder(u,set_builder(z,null_class))),
inference(reorient_equations,[],[f103]) ).
fof(f110,plain,
! [X0,X1] : set_builder(X0,X1) = complement(intersection(complement(unordered_pair(X0,X0)),complement(X1))),
inference(definition_unfolding,[],[f101,f26,f12]) ).
fof(f154,plain,
null_class = complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),
inference(definition_unfolding,[],[f104,f110,f110,f110]) ).
fof(f181,plain,
! [X0] :
( ~ member(regular(complement(X0)),X0)
| complement(X0) = null_class ),
inference(resolution,[],[f68,f24]) ).
fof(f206,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| member(regular(X0),X1)
| null_class = X0 ),
inference(resolution,[],[f1,f68]) ).
fof(f316,plain,
! [X0] :
( ~ subclass(universal_class,X0)
| universal_class = X0 ),
inference(resolution,[],[f7,f4]) ).
fof(f608,plain,
! [X0] :
( member(X0,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))
| ~ member(X0,universal_class)
| member(X0,null_class) ),
inference(superposition,[],[f25,f154]) ).
fof(f638,plain,
! [X0] :
( ~ member(X0,universal_class)
| member(X0,null_class)
| member(X0,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))) ),
inference(resolution,[],[f608,f22]) ).
fof(f639,plain,
! [X0] :
( member(X0,complement(unordered_pair(x,x)))
| member(X0,null_class)
| ~ member(X0,universal_class) ),
inference(resolution,[],[f608,f21]) ).
fof(f642,plain,
! [X0] :
( ~ member(X0,unordered_pair(x,x))
| ~ member(X0,universal_class)
| member(X0,null_class) ),
inference(resolution,[],[f639,f24]) ).
fof(f648,plain,
( ~ member(regular(unordered_pair(x,x)),universal_class)
| member(regular(unordered_pair(x,x)),null_class)
| null_class = unordered_pair(x,x) ),
inference(resolution,[],[f642,f68]) ).
fof(f655,definition,
( spl0_43
<=> null_class = unordered_pair(x,x) ),
introduced(definition,[new_symbols(definition,[spl0_43])],[avatar_definition]) ).
fof(f656,plain,
( null_class != unordered_pair(x,x)
| spl0_43 ),
inference(avatar_component_clause,[],[f655]) ).
fof(f657,plain,
( null_class = unordered_pair(x,x)
| ~ spl0_43 ),
inference(avatar_component_clause,[],[f655]) ).
fof(f659,definition,
( spl0_44
<=> member(regular(unordered_pair(x,x)),null_class) ),
introduced(definition,[new_symbols(definition,[spl0_44])],[avatar_definition]) ).
fof(f661,plain,
( member(regular(unordered_pair(x,x)),null_class)
| ~ spl0_44 ),
inference(avatar_component_clause,[],[f659]) ).
fof(f663,definition,
( spl0_45
<=> member(regular(unordered_pair(x,x)),universal_class) ),
introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).
fof(f665,plain,
( ~ member(regular(unordered_pair(x,x)),universal_class)
| spl0_45 ),
inference(avatar_component_clause,[],[f663]) ).
fof(f666,plain,
( spl0_43
| spl0_44
| ~ spl0_45 ),
inference(avatar_split_clause,[],[f648,f663,f659,f655]) ).
fof(f690,plain,
( ! [X0] :
( member(X0,complement(null_class))
| member(X0,null_class)
| ~ member(X0,universal_class) )
| ~ spl0_43 ),
inference(superposition,[],[f639,f657]) ).
fof(f781,plain,
( ! [X0] :
( ~ member(not_subclass_element(X0,complement(null_class)),universal_class)
| member(not_subclass_element(X0,complement(null_class)),null_class)
| subclass(X0,complement(null_class)) )
| ~ spl0_43 ),
inference(resolution,[],[f690,f3]) ).
fof(f794,plain,
( member(not_subclass_element(universal_class,complement(null_class)),null_class)
| subclass(universal_class,complement(null_class))
| subclass(universal_class,complement(null_class))
| ~ spl0_43 ),
inference(resolution,[],[f781,f2]) ).
fof(f795,plain,
( member(not_subclass_element(universal_class,complement(null_class)),null_class)
| subclass(universal_class,complement(null_class))
| ~ spl0_43 ),
inference(duplicate_literal_removal,[],[f794]) ).
fof(f797,definition,
( spl0_52
<=> subclass(universal_class,complement(null_class)) ),
introduced(definition,[new_symbols(definition,[spl0_52])],[avatar_definition]) ).
fof(f798,plain,
( ~ subclass(universal_class,complement(null_class))
| spl0_52 ),
inference(avatar_component_clause,[],[f797]) ).
fof(f799,plain,
( subclass(universal_class,complement(null_class))
| ~ spl0_52 ),
inference(avatar_component_clause,[],[f797]) ).
fof(f801,definition,
( spl0_53
<=> member(not_subclass_element(universal_class,complement(null_class)),null_class) ),
introduced(definition,[new_symbols(definition,[spl0_53])],[avatar_definition]) ).
fof(f803,plain,
( member(not_subclass_element(universal_class,complement(null_class)),null_class)
| ~ spl0_53 ),
inference(avatar_component_clause,[],[f801]) ).
fof(f804,plain,
( spl0_52
| spl0_53
| ~ spl0_43 ),
inference(avatar_split_clause,[],[f795,f655,f801,f797]) ).
fof(f806,plain,
( universal_class = complement(null_class)
| ~ spl0_52 ),
inference(resolution,[],[f799,f316]) ).
fof(f835,plain,
( ! [X0] :
( ~ member(X0,null_class)
| ~ member(X0,universal_class) )
| ~ spl0_52 ),
inference(superposition,[],[f24,f806]) ).
fof(f977,plain,
( ! [X0] :
( ~ member(X0,universal_class)
| member(X0,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))) )
| ~ spl0_52 ),
inference(forward_subsumption_resolution,[],[f638,f835]) ).
fof(f978,plain,
( ! [X0] :
( member(X0,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),universal_class)))))))
| ~ member(X0,universal_class) )
| ~ spl0_52 ),
inference(forward_demodulation,[],[f977,f806]) ).
fof(f987,plain,
( ! [X0] :
( ~ member(X0,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),universal_class))))))
| ~ member(X0,universal_class) )
| ~ spl0_52 ),
inference(resolution,[],[f978,f24]) ).
fof(f1009,plain,
( ! [X0] :
( ~ member(X0,universal_class)
| ~ member(X0,universal_class)
| member(X0,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),universal_class))))) )
| ~ spl0_52 ),
inference(resolution,[],[f987,f25]) ).
fof(f1014,plain,
( ! [X0] :
( member(X0,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),universal_class)))))
| ~ member(X0,universal_class) )
| ~ spl0_52 ),
inference(duplicate_literal_removal,[],[f1009]) ).
fof(f1132,plain,
! [X0] :
( member(regular(X0),universal_class)
| null_class = X0 ),
inference(resolution,[],[f206,f4]) ).
fof(f1187,plain,
( null_class = complement(universal_class)
| null_class = complement(universal_class) ),
inference(resolution,[],[f1132,f181]) ).
fof(f1189,plain,
null_class = complement(universal_class),
inference(duplicate_literal_removal,[],[f1187]) ).
fof(f1242,plain,
( ! [X0] :
( member(X0,complement(unordered_pair(u,u)))
| ~ member(X0,universal_class) )
| ~ spl0_52 ),
inference(resolution,[],[f1014,f21]) ).
fof(f1250,plain,
( ! [X0] :
( ~ member(X0,unordered_pair(u,u))
| ~ member(X0,universal_class) )
| ~ spl0_52 ),
inference(resolution,[],[f1242,f24]) ).
fof(f1280,plain,
( ~ member(u,universal_class)
| ~ member(u,universal_class)
| ~ spl0_52 ),
inference(resolution,[],[f1250,f9]) ).
fof(f1287,plain,
( ~ member(u,universal_class)
| ~ spl0_52 ),
inference(duplicate_literal_removal,[],[f1280]) ).
fof(f1293,plain,
( $false
| ~ spl0_52 ),
inference(forward_subsumption_resolution,[],[f1287,f102]) ).
fof(f1294,plain,
~ spl0_52,
inference(avatar_contradiction_clause,[],[f1293]) ).
fof(f1315,plain,
! [X0] :
( ~ member(X0,null_class)
| ~ member(X0,universal_class) ),
inference(superposition,[],[f24,f1189]) ).
fof(f1324,plain,
( ~ member(not_subclass_element(universal_class,complement(null_class)),universal_class)
| ~ spl0_53 ),
inference(resolution,[],[f1315,f803]) ).
fof(f1329,plain,
( subclass(universal_class,complement(null_class))
| ~ spl0_53 ),
inference(resolution,[],[f1324,f2]) ).
fof(f1330,plain,
( $false
| spl0_52
| ~ spl0_53 ),
inference(forward_subsumption_resolution,[],[f1329,f798]) ).
fof(f1331,plain,
( spl0_52
| ~ spl0_53 ),
inference(avatar_contradiction_clause,[],[f1330]) ).
fof(f1346,plain,
( ~ member(regular(unordered_pair(x,x)),universal_class)
| ~ spl0_44 ),
inference(resolution,[],[f661,f1315]) ).
fof(f1350,plain,
( null_class = unordered_pair(x,x)
| ~ spl0_44 ),
inference(resolution,[],[f1346,f1132]) ).
fof(f1351,plain,
( $false
| spl0_43
| ~ spl0_44 ),
inference(forward_subsumption_resolution,[],[f1350,f656]) ).
fof(f1352,plain,
( spl0_43
| ~ spl0_44 ),
inference(avatar_contradiction_clause,[],[f1351]) ).
fof(f1359,plain,
( null_class = unordered_pair(x,x)
| spl0_45 ),
inference(resolution,[],[f665,f1132]) ).
fof(f1360,plain,
( $false
| spl0_43
| spl0_45 ),
inference(forward_subsumption_resolution,[],[f1359,f656]) ).
fof(f1361,plain,
( spl0_43
| spl0_45 ),
inference(avatar_contradiction_clause,[],[f1360]) ).
cnf(s32,plain,
( spl0_43
| spl0_44
| ~ spl0_45 ),
inference(sat_conversion,[],[f666]) ).
cnf(s40,plain,
( ~ spl0_43
| spl0_52
| spl0_53 ),
inference(sat_conversion,[],[f804]) ).
cnf(s57,plain,
~ spl0_52,
inference(sat_conversion,[],[f1294]) ).
cnf(s58,plain,
( spl0_52
| ~ spl0_53 ),
inference(sat_conversion,[],[f1331]) ).
cnf(s60,plain,
( spl0_43
| ~ spl0_44 ),
inference(sat_conversion,[],[f1352]) ).
cnf(s61,plain,
( spl0_43
| spl0_45 ),
inference(sat_conversion,[],[f1361]) ).
cnf(s62,plain,
~ spl0_53,
inference(rat,[],[s58,s57]) ).
cnf(s63,plain,
~ spl0_43,
inference(rat,[],[s40,s62,s57]) ).
cnf(s64,plain,
spl0_45,
inference(rat,[],[s61,s63]) ).
cnf(s65,plain,
~ spl0_44,
inference(rat,[],[s60,s63]) ).
cnf(s66,plain,
$false,
inference(rat,[],[s32,s64,s65,s63]) ).
fof(f1362,plain,
$false,
inference(avatar_sat_refutation,[],[s66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET135-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 00:47:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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
% 1.07/0.58 % (3119050)Will run a generic schedule for satisfiability detection.
% 1.07/0.58 % (3119058)dis+10_1_sil=32000:sp=arity:random_seed=3123583856:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.07/0.58 % (3119056)% WARNING: option uhcvi not known.
% 1.07/0.58 % (3119055)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=767230083_2999 on theBenchmark for (2999ds/0Mi)
% 1.07/0.58 % (3119057)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4084216591:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.07/0.58 % (3119059)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2674372760:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.07/0.58 % (3119060)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2558661053:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.07/0.58 % (3119061)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2329904769:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.07/0.58 % (3119056)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3108772320:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.07/0.58 % (3119058)Instruction limit reached!
% 1.07/0.58 % (3119058)------------------------------
% 1.07/0.58 % (3119058)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.07/0.58 % (3119058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.58 % (3119058)CaDiCaL version: 2.1.3
% 1.07/0.58 % (3119058)Termination reason: Instruction limit
% 1.07/0.58 % (3119058)Termination phase: Saturation
% 1.07/0.58 % (3119058)Time elapsed: 0.039 s
% 1.07/0.58 % (3119058)Peak memory usage: 12 MB
% 1.07/0.58 % (3119058)Instructions burned: 107 (million)
% 1.07/0.58 % (3119069)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3295400380:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.07/0.58 % (3119059)Instruction limit reached!
% 1.07/0.58 % (3119059)------------------------------
% 1.07/0.58 % (3119059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.07/0.58 % (3119059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.58 % (3119059)CaDiCaL version: 2.1.3
% 1.07/0.58 % (3119059)Termination reason: Instruction limit
% 1.07/0.58 % (3119059)Termination phase: Saturation
% 1.07/0.58 % (3119059)Time elapsed: 0.070 s
% 1.07/0.58 % (3119059)Peak memory usage: 12 MB
% 1.07/0.58 % (3119059)Instructions burned: 117 (million)
% 1.07/0.58 % (3119060)Instruction limit reached!
% 1.07/0.58 % (3119060)------------------------------
% 1.07/0.58 % (3119060)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.07/0.58 % (3119060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.58 % (3119060)CaDiCaL version: 2.1.3
% 1.07/0.58 % (3119060)Termination reason: Instruction limit
% 1.07/0.58 % (3119060)Termination phase: Saturation
% 1.07/0.58 % (3119060)Time elapsed: 0.082 s
% 1.07/0.58 % (3119060)Peak memory usage: 13 MB
% 1.07/0.58 % (3119060)Instructions burned: 132 (million)
% 1.07/0.58 % (3119071)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2362134106:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.07/0.58 % (3119072)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=4126123572:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.07/0.58 % (3119061)Instruction limit reached!
% 1.07/0.58 % (3119061)------------------------------
% 1.07/0.58 % (3119061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.07/0.58 % (3119061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.58 % (3119061)CaDiCaL version: 2.1.3
% 1.07/0.58 % (3119061)Termination reason: Instruction limit
% 1.07/0.58 % (3119061)Termination phase: Saturation
% 1.07/0.58 % (3119061)Time elapsed: 0.111 s
% 1.07/0.58 % (3119061)Peak memory usage: 14 MB
% 1.07/0.58 % (3119061)Instructions burned: 160 (million)
% 1.07/0.58 % (3119075)ott-21_1_sil=16000:fs=off:random_seed=1774575359:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.07/0.58 % (3119072) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3119050-3119072"...
% 1.07/0.58 % (3119072)...printing done.
% 1.07/0.58 % (3119072)Refutation found. Thanks to Tanya!
% 1.07/0.58 % SZS status Unsatisfiable for theBenchmark
% 1.07/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.07/0.58 % (3119072)------------------------------
% 1.07/0.58 % (3119072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.07/0.58 % (3119072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.58 % (3119072)CaDiCaL version: 2.1.3
% 1.07/0.58 % (3119072)Termination reason: Refutation
% 1.07/0.58 % (3119072)Time elapsed: 0.032 s
% 1.07/0.58 % (3119072)Peak memory usage: 13 MB
% 1.07/0.58 % (3119072)Instructions burned: 44 (million)
% 1.07/0.58 % (3119050)Success in time 0.17 s
% 1.07/0.58 % Vampire exiting
%------------------------------------------------------------------------------