%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET136-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 : n008.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.37s 0.67s
% Output : Refutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 21
% Syntax : Number of formulae : 97 ( 20 unt; 5 def)
% Number of atoms : 213 ( 26 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 216 ( 100 ~; 111 |; 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 : 64 ( 0 sgn 64 !; 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_4_to_member_of_triple_1) ).
fof(f103,negated_conjecture,
set_builder(x,set_builder(y,set_builder(u,null_class))) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_4_to_member_of_triple_2) ).
fof(f104,plain,
null_class = set_builder(x,set_builder(y,set_builder(u,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(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class))))))))),
inference(definition_unfolding,[],[f104,f110,f110,f110]) ).
fof(f159,plain,
! [X0] :
( ~ member(X0,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class)))))))))
| ~ member(X0,null_class) ),
inference(superposition,[],[f24,f154]) ).
fof(f172,plain,
! [X0] :
( ~ member(regular(complement(X0)),X0)
| complement(X0) = null_class ),
inference(resolution,[],[f68,f24]) ).
fof(f188,plain,
! [X0,X1] :
( member(regular(intersection(X0,X1)),X0)
| intersection(X0,X1) = null_class ),
inference(resolution,[],[f21,f68]) ).
fof(f197,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| member(regular(X0),X1)
| null_class = X0 ),
inference(resolution,[],[f1,f68]) ).
fof(f326,plain,
! [X0] :
( ~ subclass(universal_class,X0)
| universal_class = X0 ),
inference(resolution,[],[f7,f4]) ).
fof(f626,plain,
! [X0] :
( member(X0,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class)))))))))
| ~ member(X0,universal_class)
| member(X0,null_class) ),
inference(superposition,[],[f25,f154]) ).
fof(f655,plain,
! [X0] :
( ~ member(X0,universal_class)
| member(X0,null_class)
| member(X0,complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class)))))))) ),
inference(resolution,[],[f626,f22]) ).
fof(f656,plain,
! [X0] :
( member(X0,complement(unordered_pair(x,x)))
| member(X0,null_class)
| ~ member(X0,universal_class) ),
inference(resolution,[],[f626,f21]) ).
fof(f664,plain,
! [X0] :
( ~ member(X0,unordered_pair(x,x))
| ~ member(X0,universal_class)
| member(X0,null_class) ),
inference(resolution,[],[f656,f24]) ).
fof(f666,plain,
! [X0] :
( member(not_subclass_element(X0,complement(unordered_pair(x,x))),null_class)
| ~ member(not_subclass_element(X0,complement(unordered_pair(x,x))),universal_class)
| subclass(X0,complement(unordered_pair(x,x))) ),
inference(resolution,[],[f656,f3]) ).
fof(f763,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,[],[f664,f68]) ).
fof(f768,definition,
( spl0_48
<=> null_class = unordered_pair(x,x) ),
introduced(definition,[new_symbols(definition,[spl0_48])],[avatar_definition]) ).
fof(f769,plain,
( null_class != unordered_pair(x,x)
| spl0_48 ),
inference(avatar_component_clause,[],[f768]) ).
fof(f770,plain,
( null_class = unordered_pair(x,x)
| ~ spl0_48 ),
inference(avatar_component_clause,[],[f768]) ).
fof(f772,definition,
( spl0_49
<=> member(regular(unordered_pair(x,x)),null_class) ),
introduced(definition,[new_symbols(definition,[spl0_49])],[avatar_definition]) ).
fof(f774,plain,
( member(regular(unordered_pair(x,x)),null_class)
| ~ spl0_49 ),
inference(avatar_component_clause,[],[f772]) ).
fof(f776,definition,
( spl0_50
<=> member(regular(unordered_pair(x,x)),universal_class) ),
introduced(definition,[new_symbols(definition,[spl0_50])],[avatar_definition]) ).
fof(f777,plain,
( member(regular(unordered_pair(x,x)),universal_class)
| ~ spl0_50 ),
inference(avatar_component_clause,[],[f776]) ).
fof(f778,plain,
( ~ member(regular(unordered_pair(x,x)),universal_class)
| spl0_50 ),
inference(avatar_component_clause,[],[f776]) ).
fof(f779,plain,
( spl0_48
| spl0_49
| ~ spl0_50 ),
inference(avatar_split_clause,[],[f763,f776,f772,f768]) ).
fof(f918,plain,
( ! [X0] :
( member(not_subclass_element(X0,complement(null_class)),null_class)
| ~ member(not_subclass_element(X0,complement(unordered_pair(x,x))),universal_class)
| subclass(X0,complement(unordered_pair(x,x))) )
| ~ spl0_48 ),
inference(forward_demodulation,[],[f666,f770]) ).
fof(f919,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(unordered_pair(x,x))) )
| ~ spl0_48 ),
inference(forward_demodulation,[],[f918,f770]) ).
fof(f920,plain,
( ! [X0] :
( ~ member(not_subclass_element(X0,complement(null_class)),universal_class)
| subclass(X0,complement(null_class))
| member(not_subclass_element(X0,complement(null_class)),null_class) )
| ~ spl0_48 ),
inference(forward_demodulation,[],[f919,f770]) ).
fof(f921,plain,
( subclass(universal_class,complement(null_class))
| member(not_subclass_element(universal_class,complement(null_class)),null_class)
| subclass(universal_class,complement(null_class))
| ~ spl0_48 ),
inference(resolution,[],[f920,f2]) ).
fof(f922,plain,
( subclass(universal_class,complement(null_class))
| member(not_subclass_element(universal_class,complement(null_class)),null_class)
| ~ spl0_48 ),
inference(duplicate_literal_removal,[],[f921]) ).
fof(f924,definition,
( spl0_56
<=> member(not_subclass_element(universal_class,complement(null_class)),null_class) ),
introduced(definition,[new_symbols(definition,[spl0_56])],[avatar_definition]) ).
fof(f926,plain,
( member(not_subclass_element(universal_class,complement(null_class)),null_class)
| ~ spl0_56 ),
inference(avatar_component_clause,[],[f924]) ).
fof(f928,definition,
( spl0_57
<=> subclass(universal_class,complement(null_class)) ),
introduced(definition,[new_symbols(definition,[spl0_57])],[avatar_definition]) ).
fof(f929,plain,
( ~ subclass(universal_class,complement(null_class))
| spl0_57 ),
inference(avatar_component_clause,[],[f928]) ).
fof(f930,plain,
( subclass(universal_class,complement(null_class))
| ~ spl0_57 ),
inference(avatar_component_clause,[],[f928]) ).
fof(f931,plain,
( spl0_56
| spl0_57
| ~ spl0_48 ),
inference(avatar_split_clause,[],[f922,f768,f928,f924]) ).
fof(f951,plain,
( universal_class = complement(null_class)
| ~ spl0_57 ),
inference(resolution,[],[f930,f326]) ).
fof(f1097,plain,
! [X0] :
( member(regular(X0),universal_class)
| null_class = X0 ),
inference(resolution,[],[f197,f4]) ).
fof(f1159,plain,
( null_class = complement(universal_class)
| null_class = complement(universal_class) ),
inference(resolution,[],[f1097,f172]) ).
fof(f1161,plain,
null_class = complement(universal_class),
inference(duplicate_literal_removal,[],[f1159]) ).
fof(f2072,plain,
! [X0] :
( ~ member(X0,null_class)
| ~ member(X0,universal_class) ),
inference(superposition,[],[f24,f1161]) ).
fof(f2085,plain,
! [X0] :
( ~ member(regular(intersection(null_class,X0)),universal_class)
| null_class = intersection(null_class,X0) ),
inference(resolution,[],[f2072,f188]) ).
fof(f2087,plain,
! [X0] : null_class = intersection(null_class,X0),
inference(forward_subsumption_resolution,[],[f2085,f1097]) ).
fof(f2090,plain,
! [X0,X1] :
( ~ member(X0,null_class)
| member(X0,X1) ),
inference(superposition,[],[f22,f2087]) ).
fof(f2127,plain,
( null_class = unordered_pair(x,x)
| spl0_50 ),
inference(resolution,[],[f778,f1097]) ).
fof(f2128,plain,
( $false
| spl0_48
| spl0_50 ),
inference(forward_subsumption_resolution,[],[f2127,f769]) ).
fof(f2129,plain,
( spl0_48
| spl0_50 ),
inference(avatar_contradiction_clause,[],[f2128]) ).
fof(f2272,plain,
( ~ member(regular(unordered_pair(x,x)),universal_class)
| ~ spl0_49 ),
inference(resolution,[],[f2072,f774]) ).
fof(f2279,plain,
( $false
| ~ spl0_49
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f2272,f777]) ).
fof(f2280,plain,
( ~ spl0_49
| ~ spl0_50 ),
inference(avatar_contradiction_clause,[],[f2279]) ).
fof(f2553,plain,
( ~ member(not_subclass_element(universal_class,complement(null_class)),universal_class)
| ~ spl0_56 ),
inference(resolution,[],[f926,f2072]) ).
fof(f2555,plain,
( subclass(universal_class,complement(null_class))
| ~ spl0_56 ),
inference(resolution,[],[f2553,f2]) ).
fof(f2556,plain,
( $false
| ~ spl0_56
| spl0_57 ),
inference(forward_subsumption_resolution,[],[f2555,f929]) ).
fof(f2557,plain,
( ~ spl0_56
| spl0_57 ),
inference(avatar_contradiction_clause,[],[f2556]) ).
fof(f2598,plain,
! [X0] : ~ member(X0,null_class),
inference(forward_subsumption_resolution,[],[f159,f2090]) ).
fof(f3045,plain,
! [X0] :
( ~ member(X0,universal_class)
| member(X0,complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class)))))))) ),
inference(forward_subsumption_resolution,[],[f655,f2598]) ).
fof(f3046,plain,
( ! [X0] :
( member(X0,complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),universal_class)))))))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(forward_demodulation,[],[f3045,f951]) ).
fof(f3047,plain,
( ! [X0] :
( ~ member(X0,complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),universal_class))))))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(resolution,[],[f3046,f24]) ).
fof(f3685,plain,
( ! [X0] :
( ~ member(X0,universal_class)
| member(X0,intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),universal_class)))))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(resolution,[],[f25,f3047]) ).
fof(f3699,plain,
( ! [X0] :
( member(X0,intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),universal_class)))))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(duplicate_literal_removal,[],[f3685]) ).
fof(f3868,plain,
( ! [X0] :
( member(X0,complement(complement(intersection(complement(unordered_pair(u,u)),universal_class))))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(resolution,[],[f3699,f22]) ).
fof(f4062,plain,
( ! [X0] :
( ~ member(X0,complement(intersection(complement(unordered_pair(u,u)),universal_class)))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(resolution,[],[f3868,f24]) ).
fof(f4078,plain,
( ! [X0] :
( ~ member(X0,universal_class)
| ~ member(X0,universal_class)
| member(X0,intersection(complement(unordered_pair(u,u)),universal_class)) )
| ~ spl0_57 ),
inference(resolution,[],[f4062,f25]) ).
fof(f4084,plain,
( ! [X0] :
( member(X0,intersection(complement(unordered_pair(u,u)),universal_class))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(duplicate_literal_removal,[],[f4078]) ).
fof(f4244,plain,
( ! [X0] :
( member(X0,complement(unordered_pair(u,u)))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(resolution,[],[f4084,f21]) ).
fof(f4254,plain,
( ! [X0] :
( ~ member(X0,unordered_pair(u,u))
| ~ member(X0,universal_class) )
| ~ spl0_57 ),
inference(resolution,[],[f4244,f24]) ).
fof(f4270,plain,
( ~ member(u,universal_class)
| ~ member(u,universal_class)
| ~ spl0_57 ),
inference(resolution,[],[f4254,f9]) ).
fof(f4278,plain,
( ~ member(u,universal_class)
| ~ spl0_57 ),
inference(duplicate_literal_removal,[],[f4270]) ).
fof(f4285,plain,
( $false
| ~ spl0_57 ),
inference(forward_subsumption_resolution,[],[f4278,f102]) ).
fof(f4286,plain,
~ spl0_57,
inference(avatar_contradiction_clause,[],[f4285]) ).
cnf(s39,plain,
( spl0_48
| spl0_49
| ~ spl0_50 ),
inference(sat_conversion,[],[f779]) ).
cnf(s47,plain,
( ~ spl0_48
| spl0_56
| spl0_57 ),
inference(sat_conversion,[],[f931]) ).
cnf(s80,plain,
( spl0_48
| spl0_50 ),
inference(sat_conversion,[],[f2129]) ).
cnf(s106,plain,
( ~ spl0_49
| ~ spl0_50 ),
inference(sat_conversion,[],[f2280]) ).
cnf(s153,plain,
( ~ spl0_56
| spl0_57 ),
inference(sat_conversion,[],[f2557]) ).
cnf(s228,plain,
~ spl0_57,
inference(sat_conversion,[],[f4286]) ).
cnf(s232,plain,
~ spl0_56,
inference(rat,[],[s153,s228]) ).
cnf(s235,plain,
~ spl0_48,
inference(rat,[],[s47,s228,s232]) ).
cnf(s236,plain,
spl0_50,
inference(rat,[],[s80,s235]) ).
cnf(s237,plain,
~ spl0_49,
inference(rat,[],[s106,s236]) ).
cnf(s238,plain,
$false,
inference(rat,[],[s39,s236,s237,s235]) ).
fof(f4287,plain,
$false,
inference(avatar_sat_refutation,[],[s238]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET136-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.11/0.38 % Computer : n008.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:53:10 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 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
% 1.37/0.67 % (1767855)Will run a generic schedule for satisfiability detection.
% 1.37/0.67 % (1767863)dis+10_1_sil=32000:sp=arity:random_seed=3641317112:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.37/0.67 % (1767861)% WARNING: option uhcvi not known.
% 1.37/0.67 % (1767860)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3374554891_2999 on theBenchmark for (2999ds/0Mi)
% 1.37/0.67 % (1767861)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1767087953:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.37/0.67 % (1767862)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3403183708:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.37/0.67 % (1767864)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=75008055:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.37/0.67 % (1767865)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2944308990:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.37/0.67 % (1767866)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1723610682:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.37/0.67 % (1767863)Instruction limit reached!
% 1.37/0.67 % (1767863)------------------------------
% 1.37/0.67 % (1767863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.67 % (1767863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.67 % (1767863)CaDiCaL version: 2.1.3
% 1.37/0.67 % (1767863)Termination reason: Instruction limit
% 1.37/0.67 % (1767863)Termination phase: Saturation
% 1.37/0.67 % (1767863)Time elapsed: 0.037 s
% 1.37/0.67 % (1767863)Peak memory usage: 12 MB
% 1.37/0.67 % (1767863)Instructions burned: 104 (million)
% 1.37/0.67 % (1767874)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3393118166:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.37/0.67 % (1767864)Instruction limit reached!
% 1.37/0.67 % (1767864)------------------------------
% 1.37/0.67 % (1767864)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.67 % (1767864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.67 % (1767864)CaDiCaL version: 2.1.3
% 1.37/0.67 % (1767864)Termination reason: Instruction limit
% 1.37/0.67 % (1767864)Termination phase: Saturation
% 1.37/0.67 % (1767864)Time elapsed: 0.069 s
% 1.37/0.67 % (1767864)Peak memory usage: 12 MB
% 1.37/0.67 % (1767864)Instructions burned: 117 (million)
% 1.37/0.67 % (1767865)Instruction limit reached!
% 1.37/0.67 % (1767865)------------------------------
% 1.37/0.67 % (1767865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.67 % (1767865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.67 % (1767865)CaDiCaL version: 2.1.3
% 1.37/0.67 % (1767865)Termination reason: Instruction limit
% 1.37/0.67 % (1767865)Termination phase: Saturation
% 1.37/0.67 % (1767865)Time elapsed: 0.084 s
% 1.37/0.67 % (1767865)Peak memory usage: 13 MB
% 1.37/0.67 % (1767865)Instructions burned: 139 (million)
% 1.37/0.67 % (1767876)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=174482185:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.37/0.67 % (1767877)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=884485025:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.37/0.67 % (1767866)Instruction limit reached!
% 1.37/0.67 % (1767866)------------------------------
% 1.37/0.67 % (1767866)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.67 % (1767866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.67 % (1767866)CaDiCaL version: 2.1.3
% 1.37/0.67 % (1767866)Termination reason: Instruction limit
% 1.37/0.67 % (1767866)Termination phase: Saturation
% 1.37/0.67 % (1767866)Time elapsed: 0.106 s
% 1.37/0.67 % (1767866)Peak memory usage: 13 MB
% 1.37/0.67 % (1767866)Instructions burned: 159 (million)
% 1.37/0.67 % (1767880)ott-21_1_sil=16000:fs=off:random_seed=1639197350:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.37/0.67 % TRYING [1]
% 1.37/0.67 % TRYING [2]
% 1.37/0.67 % TRYING [3]
% 1.37/0.67 % (1767876)Instruction limit reached!
% 1.37/0.67 % (1767876)------------------------------
% 1.37/0.67 % (1767876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.67 % (1767876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.67 % (1767876)CaDiCaL version: 2.1.3
% 1.37/0.67 % (1767876)Termination reason: Instruction limit
% 1.37/0.67 % (1767876)Termination phase: Saturation
% 1.37/0.67 % (1767876)Time elapsed: 0.086 s
% 1.37/0.67 % (1767876)Peak memory usage: 13 MB
% 1.37/0.67 % (1767876)Instructions burned: 131 (million)
% 1.37/0.67 % TRYING [1]
% 1.37/0.67 % TRYING [2]
% 1.37/0.67 % (1767882)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=531455234:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.37/0.67 % (1767877) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1767855-1767877"...
% 1.37/0.67 % (1767877)...printing done.
% 1.37/0.67 % (1767877)Refutation found. Thanks to Tanya!
% 1.37/0.67 % SZS status Unsatisfiable for theBenchmark
% 1.37/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 1.37/0.67 % (1767877)------------------------------
% 1.37/0.67 % (1767877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.67 % (1767877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.67 % (1767877)CaDiCaL version: 2.1.3
% 1.37/0.67 % (1767877)Termination reason: Refutation
% 1.37/0.67 % (1767877)Time elapsed: 0.101 s
% 1.37/0.67 % (1767877)Peak memory usage: 14 MB
% 1.37/0.67 % (1767877)Instructions burned: 147 (million)
% 1.37/0.67 % (1767855)Success in time 0.247 s
% 1.37/0.67 % Vampire exiting
%------------------------------------------------------------------------------